Ad hoc on-demand multipath distance vector routing

We develop an on-demand, multipath distance vector routing protocol for mobile ad hoc networks. Specifically, we propose multipath extensions to a well-studied single path routing protocol known as ad hoc on-demand distance vector (AODV). The resulting protocol is referred to as ad hoc on-demand multipath distance vector (AOMDV). The protocol guarantees loop freedom and disjointness of alternate paths. Performance comparison of AOMDV with AODV using ns-2 simulations shows that AOMDV is able to effectively cope with mobility-induced route failures. In particular, it reduces the packet loss by up to 40% and achieves a remarkable improvement in the end-to-end delay (often more than a factor of two). AOMDV also reduces routing overhead by about 30% by reducing the frequency of route discovery operations. Copyright © 2006 John Wiley & Sons, Ltd.

[1]  Yih-Chun Hu,et al.  Implicit source routes for on-demand ad hoc network routing , 2001, MobiHoc '01.

[2]  Charles E. Perkins,et al.  Performance comparison of two on-demand routing protocols for ad hoc networks , 2001, IEEE Wirel. Commun..

[3]  Panagiotis Papadimitratos,et al.  Path set selection in mobile ad hoc networks , 2002, MobiHoc '02.

[4]  Zygmunt J. Haas,et al.  On the impact of alternate path routing for load balancing in mobile ad hoc networks , 2000, 2000 First Annual Workshop on Mobile and Ad Hoc Networking and Computing. MobiHOC (Cat. No.00EX444).

[5]  Stephen B. Wicker,et al.  On the behavior of communication links of a node in a multi-hop mobile environment , 2004, MobiHoc '04.

[6]  David A. Maltz,et al.  A performance comparison of multi-hop wireless ad hoc network routing protocols , 1998, MobiCom '98.

[7]  Dhananjay S. Phatak,et al.  Preemptive routing in Ad Hoc networks , 2001, MobiCom '01.

[8]  Nachum Shacham,et al.  A distributed algorithm for finding shortest pairs of disjoint paths , 1989, IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies.

[9]  Samir R. Das,et al.  Routing in Mobile Ad Hoc Networks , 2005 .

[10]  Anthony Ephremides,et al.  A distributed routing algorithm for mobile wireless networks , 1995, Wirel. Networks.

[11]  Deepinder P. Sidhu,et al.  Finding disjoint paths in networks , 1991, Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication.

[12]  Yih-Chun Hu,et al.  Caching strategies in on-demand routing protocols for wireless ad hoc networks , 2000, MobiCom '00.

[13]  Somprakash Bandyopadhyay,et al.  A network-aware MAC and routing protocol for effective load balancing in ad hoc wireless networks with directional antenna , 2003, MobiHoc '03.

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

[15]  J. J. Garcia-Lunes-Aceves.  Loop-free routing using diffusing computations , 1993 .

[16]  M. S. Corson,et al.  A highly adaptive distributed routing algorithm for mobile wireless networks , 1997, Proceedings of INFOCOM '97.

[17]  Satish K. Tripathi,et al.  A framework for reliable routing 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).

[18]  Charles E. Perkins,et al.  A new approach to on-demand loop-free routing in ad hoc networks , 2003, PODC '03.

[19]  Zygmunt J. Haas,et al.  Multipath routing in the presence of frequent topological changes , 2001, IEEE Commun. Mag..

[20]  J. J. Garcia-Luna-Aceves,et al.  An efficient routing protocol for wireless networks , 1996, Mob. Networks Appl..

[21]  Mahesh K. Marina,et al.  On-demand multipath distance vector routing in ad hoc networks , 2001, Proceedings Ninth International Conference on Network Protocols. ICNP 2001.

[22]  Dimitri P. Bertsekas,et al.  Distributed Algorithms for Generating Loop-Free Routes in Networks with Frequently Changing Topology , 1981, IEEE Trans. Commun..

[23]  Samir Ranjan Das,et al.  Performance of Multipath Routing for On-Demand Protocols in Mobile Ad Hoc Networks , 2001, Mob. Networks Appl..

[24]  J. J. Garcia-Luna-Aceves,et al.  A new approach to on-demand loop-free multipath routing , 1999, Proceedings Eight International Conference on Computer Communications and Networks (Cat. No.99EX370).

[25]  Mahesh K. Marina,et al.  Performance of route caching strategies in Dynamic Source Routing , 2001, Proceedings 21st International Conference on Distributed Computing Systems Workshops.

[26]  Charles E. Perkins,et al.  Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for mobile computers , 1994, SIGCOMM.

[27]  David B. Johnson,et al.  The Dynamic Source Routing Protocol for Mobile Ad Hoc Networks , 2003 .

[28]  J. Jubin,et al.  The DARPA packet radio network protocols , 1987, Proceedings of the IEEE.

[29]  Sung-Ju Lee,et al.  AODV-BR: backup routing in ad hoc networks , 2000, 2000 IEEE Wireless Communications and Networking Conference. Conference Record (Cat. No.00TH8540).

[30]  Mahesh K. Marina,et al.  Routing performance in the presence of unidirectional links in multihop wireless networks , 2002, MobiHoc '02.

[31]  Nj Piscataway,et al.  Wireless LAN medium access control (MAC) and physical layer (PHY) specifications , 1996 .

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

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

[34]  Winston Khoon Guan Seah,et al.  Cooperative packet caching and shortest multipath routing 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).

[35]  S. Ramanathan,et al.  A survey of routing techniques for mobile communications networks , 1996, Mob. Networks Appl..