Multicast operation of the ad-hoc on-demand distance vector routing protocol
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
A Routing Protocol for Anycast Messages
IEEE Transactions on Parallel and Distributed Systems
AMRoute: ad hoc multicast routing protocol
Mobile Networks and Applications
URSA: ubiquitous and robust access control for mobile ad hoc networks
IEEE/ACM Transactions on Networking (TON)
Secure and efficient key management in mobile ad hoc networks
Journal of Network and Computer Applications
Ad Hoc Networking
Integrated routing algorithms for anycast messages
IEEE Communications Magazine
A survey of anycast in IPv6 networks
IEEE Communications Magazine
IEEE Network: The Magazine of Global Internetworking
Analysis and design of a k-Anycast communication model in IPv6
Computer Communications
An efficient anycast scheme for discovering K services in mobile ad-hoc networks
Proceedings of the 5th ACM symposium on Performance evaluation of wireless ad hoc, sensor, and ubiquitous networks
A distributed k-anycast routing protocol based on mobile agents
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
Energy efficient k-anycast routing in multi-sink wireless networks with guaranteed delivery
ADHOC-NOW'12 Proceedings of the 11th international conference on Ad-hoc, Mobile, and Wireless Networks
ANFIS and agent based bandwidth and delay aware anycast routing in mobile ad hoc networks
Journal of Network and Computer Applications
| Hi-index | 0.00 |
Anycast is a communication paradigm that was first introduced to the suit of routing protocols in IPv6 networks. In anycast, a packet is intended to be delivered to one of the nearest group hosts. k-anycast, however, is proposed to deliver a packet to any threshold k members of a set of hosts. In this paper, we propose three k-anycast routing schemes for mobile ad hoc networks. Our research work is motivated by the distributed key management services using threshold cryptography in mobile ad hoc networks in which the certification authority's functionality is distributed to any k servers. However, security is not the main focus of this paper. Our goal is to reduce the routing control messages and network delay to reach any k servers. The first scheme is called controlled flooding. The increase of flooding radius is based on the number of responses instead of increasing radius linearly or exponentially. The second scheme, called component-based scheme I, is to form multiple components such that each component has at least k members. We can treat each component as a virtual server as in anycast, thus, we simplify the k-anycast routing problem into an anycast routing problem. For the highly dynamic network environment, we introduce the third scheme, called component-based scheme II, in which the membership a component maintains is relaxed to be less than k. The performances of the proposed schemes are evaluated through simulations.