On-demand multipath distance vector routing in ad hoc networks
Top Cited Papers
- 25 August 2005
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
We develop an on-demand multipath distance vector 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 computes multiple loop-free and link-disjoint paths. Loop-freedom is guaranteed by using a notion of "advertised hopcount". Link-disjointness of multiple paths is achieved by using a particular property of flooding. Performance comparison of AOMDV with AODV using ns-2 simulations shows that AOMDV is able to achieve a remarkable improvement in the end-to-end delay-often more than a factor of two, and is also able to reduce routing overheads by about 20%.Keywords
This publication has 27 references indexed in Scilit:
- Dynamic Source Routing in Ad Hoc Wireless NetworksPublished by Springer Nature ,2007
- Performance comparison of two on-demand routing protocols for ad hoc networksIEEE Wireless Communications, 2001
- The broadcast storm problem in a mobile ad hoc networkPublished by Association for Computing Machinery (ACM) ,1999
- Analysis of multi-path routingIEEE/ACM Transactions on Networking, 1999
- A digital fountain approach to reliable distribution of bulk dataACM SIGCOMM Computer Communication Review, 1998
- Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computersACM SIGCOMM Computer Communication Review, 1994
- Development of WaveLAN®, an ISM Band Wireless LANAT&T Technical Journal, 1993
- Distributed algorithms for computing shortest pairs of disjoint pathsIEEE Transactions on Information Theory, 1993
- Finding disjoint paths in networksPublished by Association for Computing Machinery (ACM) ,1991
- Distributed Algorithms for Generating Loop-Free Routes in Networks with Frequently Changing TopologyIEEE Transactions on Communications, 1981