Proceedings Article10.1109/ICNP.2001.992756
On-demand multipath distance vector routing in ad hoc networks
Mahesh K. Marina,Samir R. Das +1 more
- 01 Nov 2001
- pp 14-23
1.6K
TL;DR: Performance comparison of AOMDV with AODV 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%.
read more
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%.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Congestion Adaptive Routing in Mobile Ad Hoc Networks
Duc A. Tran,Harish Raghavendra +1 more
TL;DR: It is argued that routing should not only be aware of, but also be adaptive to, network congestion, and proposed a routing protocol (CRP) with such properties is proposed.
188
Performance comparison of trust-based reactive routing protocols
TL;DR: It is demonstrated that the performance of the three trust-based reactive routing protocols varies significantly even under similar attack, traffic, and mobility conditions, making them suitable for application in a particular extemporized environment.
178
Trust-based on-demand multipath routing in mobile ad hoc networks
TL;DR: A trust-based reactive multipath routing protocol, ad hoc on-demand trusted-path distance vector (AOTDV), is proposed for MANETs and the results show that AotDV improves packet delivery ratio and mitigates the impairment from black hole, grey hole and modification attacks.
177
Evolution and future directions of the ad hoc on-demand distance-vector routing protocol
Elizabeth M. Belding-Royer,Charles E. Perkins +1 more
- 01 Jul 2003
TL;DR: The current state of AODV is described, including its base functionality as well as optional features that improve performance and add capabilities, and some direction for the continued evolution is offered by presenting areas that can be targeted for future enhancements.
•Posted Content
Wireless Network Design for Control Systems: A Survey
TL;DR: In this article, the authors make an exhaustive review of the literature on wireless network design and optimization for wireless networked control systems (WNCS) and discuss the critical interactive variables including sampling period, message delay, message dropout and network energy consumption.
164
References
Ad hoc On-Demand Distance Vector (AODV) Routing
Charles E. Perkins,Elizabeth M. Belding-Royer,Samir R. Das +2 more
- 01 Jul 2003
TL;DR: A logging instrument contains a pulsed neutron source and a pair of radiation detectors spaced along the length of the instrument to provide an indication of formation porosity which is substantially independent of the formation salinity.
Ad-hoc on-demand distance vector routing
C.E. Perkins,E.M. Royer +1 more
- 25 Feb 1999
TL;DR: An ad-hoc network is the cooperative engagement of a collection of mobile nodes without the required intervention of any centralized access point or existing infrastructure and the proposed routing algorithm is quite suitable for a dynamic self starting network, as required by users wishing to utilize ad- hoc networks.
Dynamic Source Routing in Ad Hoc Wireless Networks
David B. Johnson,David A. Maltz +1 more
- 01 Jan 1996
TL;DR: This paper presents a protocol for routing in ad hoc networks that uses dynamic source routing that adapts quickly to routing changes when host movement is frequent, yet requires little or no overhead during periods in which hosts move less frequently.
Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
Charles E. Perkins,Pravin Bhagwat +1 more
- 01 Oct 1994
TL;DR: The modifications address some of the previous objections to the use of Bellman-Ford, related to the poor looping properties of such algorithms in the face of broken links and the resulting time dependent nature of the interconnection topology describing the links between the Mobile hosts.
A performance comparison of multi-hop wireless ad hoc network routing protocols
J. Broch,David A. Maltz,David B. Johnson,Yih-Chun Hu,Jorjeta G. Jetcheva +4 more
- 25 Oct 1998
TL;DR: The results of a derailed packet-levelsimulationcomparing fourmulti-hopwirelessad hoc networkroutingprotocols, which cover a range of designchoices: DSDV,TORA, DSR and AODV are presented.