Density-Based Anycast: A Robust Routing Strategy for Wireless Ad Hoc Networks

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.

[1]  Tracy Camp,et al.  A survey of mobility models for ad hoc network research , 2002, Wirel. Commun. Mob. Comput..

[2]  Ted Hardie,et al.  Distributing Authoritative Name Servers via Shared Unicast Addresses , 2002, RFC.

[3]  Gary Scott Malkin,et al.  RIP Version 2 , 1998, RFC.

[4]  Stephen E. Deering,et al.  IP Version 6 Addressing Architecture , 1995, RFC.

[5]  Anindya Basu,et al.  Routing using potentials: a dynamic traffic-aware routing algorithm , 2003, SIGCOMM '03.

[6]  Paolo Santi,et al.  The Node Distribution of the Random Waypoint Mobility Model for Wireless Ad Hoc Networks , 2003, IEEE Trans. Mob. Comput..

[7]  John Moy,et al.  OSPF Version 2 , 1998, RFC.

[8]  Robert Morris,et al.  Link-level measurements from an 802.11b mesh network , 2004, SIGCOMM 2004.

[9]  Charles E. Perkins,et al.  Ad hoc On-Demand Distance Vector (AODV) Routing , 2001, RFC.

[10]  Bernhard Plattner,et al.  Density-Based vs. Proximity-Based Anycast Routing for Mobile Networks , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[11]  Vincent Park,et al.  Temporally-Ordered Routing Algorithm (TORA) Version 1 Functional Specification , 2001 .

[12]  Dino Farinacci,et al.  Anycast Rendevous Point (RP) mechanism using Protocol Independent Multicast (PIM) and Multicast Source Discovery Protocol (MSDP) , 2003, RFC.

[13]  Joseph P. Macker,et al.  Anycast Routing for Mobile Services , 1999 .

[14]  Joseph P. Macker,et al.  Anycast routing for mobile networking , 1999, MILCOM 1999. IEEE Military Communications. Conference Proceedings (Cat. No.99CH36341).

[15]  Scott Shenker,et al.  Internet indirection infrastructure , 2002, SIGCOMM 2002.

[16]  Paul Francis,et al.  Towards a global IP anycast service , 2005, SIGCOMM '05.

[17]  Weijia Jia,et al.  An AODV-based anycast protocol in mobile ad hoc network , 2003, 14th IEEE Proceedings on Personal, Indoor and Mobile Radio Communications, 2003. PIMRC 2003..

[18]  John Wroclawski,et al.  A framework for scalable global IP-anycast (GIA) , 2000, CCRV.

[19]  Weijia Jia,et al.  A-DSR: A DSR-based anycast protocol for IPv6 flow in mobile ad hoc networks , 2003, 2003 IEEE 58th Vehicular Technology Conference. VTC 2003-Fall (IEEE Cat. No.03CH37484).

[20]  Qun Li,et al.  Distributed algorithms for guiding navigation across a sensor network , 2003, MobiCom '03.

[21]  Leandros Tassiulas,et al.  Network layer support for service discovery in mobile ad hoc networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[22]  Tracy Camp,et al.  Stationary distributions for the random waypoint mobility model , 2004, IEEE Transactions on Mobile Computing.

[23]  David A. Maltz,et al.  Dynamic Source Routing in Ad Hoc Wireless Networks , 1994, Mobidata.

[24]  Ahmed Helmy,et al.  RUGGED: RoUting on finGerprint Gradients in sEnsor Networks , 2004, The IEEE/ACS International Conference on Pervasive Services.

[25]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[26]  Leandros Tassiulas,et al.  Packetostatics: deployment of massively dense sensor networks as an electrostatics problem , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[27]  C. Intanagonwiwat,et al.  The Sink-based Anycast Routing Protocol for Ad Hoc Wireless Sensor Networks , 1999 .

[28]  Craig Partridge,et al.  Host Anycasting Service , 1993, RFC.