Directed diffusion: a scalable and robust communication paradigm for sensor networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
A framework for scalable global IP-anycast (GIA)
Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
Internet indirection infrastructure
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Routing using potentials: a dynamic traffic-aware routing algorithm
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Distributed algorithms for guiding navigation across a sensor network
Proceedings of the 9th annual international conference on Mobile computing and networking
The Node Distribution of the Random Waypoint Mobility Model for Wireless Ad Hoc Networks
IEEE Transactions on Mobile Computing
Link-level measurements from an 802.11b mesh network
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
RUGGED: RoUting on finGerprint Gradients in sEnsor Networks
ICPS '04 Proceedings of the The IEEE/ACS International Conference on Pervasive Services
Towards a global IP anycast service
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
Stationary Distributions for the Random Waypoint Mobility Model
IEEE Transactions on Mobile Computing
Service discovery in mobile ad hoc networks: A field theoretic approach
Pervasive and Mobile Computing
Energy-efficient data redistribution in sensor networks
ACM Transactions on Sensor Networks (TOSN)
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 |
Existing anycast routing protocols solely route packets to the closest group member. In this paper, we introduce density-based anycast routing, a new anycast routing paradigm particularly suitable for wireless ad hoc networks. Instead of routing packets merely on proximity information to the closest member, density-based anycast routing considers the number of available anycast group members for its routing decision. We present a unified model based on potential fields that allows for instantiation of pure proximity-based, pure density-based, as well as hybrid routing strategies. We implement anycast using this model and simulate the performance of the different approaches for mobile as well as static ad hoc networks with frequent link failures. Our results show that the best performance lies in a tradeoff between proximity and density. In this combined routing strategy, the packet delivery ratio is considerably higher and the path length remains almost as low than with traditional shortest-path anycast routing.