Link-Diversity Routing: A Robust Routing Paradigm for Mobile Ad Hoc Networks

We present link-diversity routing, a routing paradigm that achieves high path resilience in mobile ad hoc networks. Link-diversity routing chooses each hop of a packet's route, so that the choice reflects the amount of outgoing links towards the destination at the intermediate hops. This choice maximizes the opportunities to make progress at every hop in the presence of unpredictable link failures caused by mobility or fading effects. As a result, link diversity routing takes paths which are less prone to fail due to individual link failures than traditional routing. We develop a loop-free and distributed link-diversity routing algorithm. The algorithm is based on an analogy from the heat theory which consists of routing packets along the steepest gradient of a temperature field. We perform simulations of our algorithm with a DSDV-based implementation. Our simulations show that link-diversity routing increases the end-to-end packet delivery ratio to a factor of up to four without any additional protocol overhead compared to the traditional minimum hop- count based DSDV.

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

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

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

[4]  E. F. Nogotov.  Applications of Numerical Heat Transfer , 1979 .

[5]  Chai-Keong Toh,et al.  Associativity-Based Routing for Ad Hoc Mobile Networks , 1997, Wirel. Pers. Commun..

[6]  Peter Larsson.  Selection diversity forwarding in a multihop packet radio network with fading channel and capture , 2001, MOCO.

[7]  Robert Tappan Morris,et al.  a high-throughput path metric for multi-hop wireless routing , 2003, MobiCom '03.

[8]  Dimitri P. Bertsekas,et al.  Data Networks , 1986 .

[9]  Satish K. Tripathi,et al.  Signal stability-based adaptive routing (SSA) for ad hoc mobile networks , 1997, IEEE Wirel. Commun..

[10]  Jean-Yves Le Boudec,et al.  Perfect simulation and stationarity of a class of mobility models , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[11]  Deborah Estrin,et al.  Highly-resilient, energy-efficient multipath routing in wireless sensor networks , 2001, MOCO.

[12]  M. Gerla,et al.  GloMoSim: a library for parallel simulation of large-scale wireless networks , 1998, Proceedings. Twelfth Workshop on Parallel and Distributed Simulation PADS '98 (Cat. No.98TB100233).

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

[14]  Martin May,et al.  HEAT: Scalable Routing in Wireless Mesh Networks Using Temperature Fields , 2007, 2007 IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks.

[15]  Zygmunt J. Haas,et al.  The performance of query control schemes for the zone routing protocol , 1998, SIGCOMM '98.

[16]  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..

[17]  Bernhard Plattner,et al.  Service discovery in mobile ad hoc networks: a field theoretic approach , 2005, Sixth IEEE International Symposium on a World of Wireless Mobile and Multimedia Networks.

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

[19]  J. Broch,et al.  Dynamic source routing in ad hoc wireless networks , 1998 .

[20]  Charles E. Perkins,et al.  Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers , 1994, SIGCOMM.

[21]  Edward W. Knightly,et al.  Opportunistic traffic scheduling over multiple network paths , 2004, IEEE INFOCOM 2004.

[22]  Zygmunt J. Haas,et al.  The performance of query control schemes for the zone routing protocol , 2001, TNET.

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

[24]  Deborah Estrin,et al.  Directed diffusion: a scalable and robust communication paradigm for sensor networks , 2000, MobiCom '00.

[25]  Samir Ranjan Das,et al.  Exploiting path diversity in the link layer in wireless ad hoc networks , 2005, Sixth IEEE International Symposium on a World of Wireless Mobile and Multimedia Networks.

[26]  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.

[27]  Sysi-Aho Marko,et al.  The Finite Difference Method in Partial Differential Equations , 2001 .

[28]  Jatinder Pal Singh,et al.  Route-lifetime assessment based routing (RABR) protocol for mobile ad-hoc networks , 2000, 2000 IEEE International Conference on Communications. ICC 2000. Global Convergence Through Communications. Conference Record.

[29]  Zygmunt J. Haas,et al.  Analysis of multipath Routing-Part I: the effect on the packet delivery ratio , 2004, IEEE Transactions on Wireless Communications.

[30]  Gregory A. Hansen,et al.  The Optimized Link State Routing Protocol , 2003 .

[31]  Charles E. Perkins,et al.  Ad-hoc on-demand distance vector routing , 1999, Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications.

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

[33]  Robert Tappan Morris,et al.  ExOR: opportunistic multi-hop routing for wireless networks , 2005, SIGCOMM '05.

[34]  Chai-Keong Toh,et al.  ABAM: on-demand associativity-based multicast routing for ad hoc mobile networks , 2000, Vehicular Technology Conference Fall 2000. IEEE VTS Fall VTC2000. 52nd Vehicular Technology Conference (Cat. No.00CH37152).