An efficient anycasting scheme in ad-hoc wireless networks

When searching for resources on networks, the system often depends on the broadcast or multicast mechanism to acquire the information, which usually results in large overhead. It is a serious problem in ad-hoc wireless networks, where the bandwidth is limited and each node moves arbitrarily and acts not only as a host but also as a router. This work proposes an efficient anycasting scheme in ad-hoc wireless networks. The scheme can be used to reduce the request messages, decrease the overhead of response received from duplicate packets, and balance the load of ad-hoc wireless networks. Furthermore, our scheme can support any K services and attain the backup or fault tolerance purpose.