Ad-hoc on-demand distance vector routing

  title={Ad-hoc on-demand distance vector routing},
  author={Charles E. Perkins and Elizabeth M. Belding-Royer},
  journal={Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications},
  • C. Perkins, E. Belding-Royer
  • Published 25 February 1999
  • Computer Science
  • Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications
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. [] Key Result We also include an evaluation methodology and simulation results to verify the operation of our algorithm.

Figures and Tables from this paper

Ad_Hoc on Demand Distance Vector Routing using MANET
Ad_hoc On Demand Distance Vector Routing (AODV), a novel algorithm for the operation of such ad-hoc networks, which does not require global periodic routing advertisements and provides loop free routes even while repairing broken links.
Optimizing Routing Protocols for Ad Hoc Network
  • Saurabh Rastogi
  • Computer Science
    2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems
  • 2006
This paper evaluates some of the existing routing protocols such as dynamic source routing (DSR), ad hoc on-demand distance vector routing (AODV), destination-sequenced distance-vector (DSDV) and proposed a new protocol that uses the concept of virtual node and the power feature of a mobile node.
Performance of the Ad-hoc On-Demand Distance Vector Routing Protocol
This paper presents the performance and scalability of the AODV protocol both in small and large networks.
Multicast operation of the ad-hoc on-demand distance vector routing protocol
Ad-hoc On-Demand Distance Vector Routing is extended to offer novel multicast capabilities which follow naturally from the way AODV establishes unicast routes.
A New Approach to On-demand Routing Protocols in Mobile Ad hoc Networks
A new purely on-demand protocol, depending on Axismapping technique, to select the nodes that will forward a message in the network, reducing the overhead and the effect of flooding technique in finding the destination, and increasing the robustness of the path from a source to a destination.
Study and Design of New Reactive Routing Protocol Advance AODV for Mobile Ad hoc Networks
This paper worked to solve the problem of intermediate route building in Ad hoc on demand distance vector routing protocol (AODV) and proposed scheme that enhances the performance of AODV protocol and presented the overview of Ad hoc network routing protocols.
Accumulating Path Information in AODV for Ad-Hoc Network
  • R. Thakur, S. Sharma, S. Sahu
  • Computer Science
    2011 International Conference on Computational Intelligence and Communication Networks
  • 2011
An ad-hoc network is the cooperative engagement of collection of mobile nodes without the required intervention of any centralized access point or exiting infrastructure. The need for an efficient
A Review of Ad hoc on demand distance vector routing and proposed AR-AODV
An attempt has been made to thoroughly study all AODVs and a new AODV is proposed called AR-AODV, which is a reactive routing protocol designed for ad hoc mobile devices.
A Mobile Ad-Hoc Routing Algorithm with Comparative Study of Earlier Proposed Algorithms
This paper examines two routing protocols for mobile ad-hoc networks—the Destination Sequenced Distance Vector, the table-driven protocol and the Ad-Hoc On- Demand Distance Vector routing (AODV), an on-demand protocol and proposes an algorithm that facilitates efficient routing of the packet and failure recovery mechanism.
Node-Disjoint On-demand Multipath Routing with Route Utilization in Ad-Hoc Networks
The paper presents the nodedisjoint multipath routing protocol that allows the establishment of multiple paths between the unique source and destination and thus improving end-to-end delay, routing overhead and packet delivery ratio.


Routing Over Multi-Hop Wireless Network of Mobile Computers
Modifications to the basic Bellman-Ford routing mechanisms are investigated, as specified by the Routing Information Protocol, making it suitable for a dynamic and self-starting network mechanism as is required by users wishing to utilize ad-hoc networks.
Dynamic Source Routing in Ad Hoc Wireless Networks
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.
Routing in ad-hoc networks using minimum connected dominating sets
  • B. Das, V. Bharghavan
  • Computer Science
    Proceedings of ICC'97 - International Conference on Communications
  • 1997
This paper uses an approximation to the minimum connected dominating set (MCDS) of the ad-hoc network topology as the virtual backbone, and maintains local copies of the global topology of the network, along with shortest paths between all pairs of nodes.
A distributed routing algorithm for mobile wireless networks
A loop-free, distributed routing protocol for mobile packet radio networks intended for use in networks where the rate of topological change is not so fast as to make “flooding” the only possible routing method, but not so slow to make one of the existing protocols for a nearly-static topology applicable.
A performance comparison of the temporally-ordered routing algorithm and ideal link-state routing
  • V. Park, M. S. Corson
  • Computer Science
    Proceedings Third IEEE Symposium on Computers and Communications. ISCC'98. (Cat. No.98EX166)
  • 1998
For a given available bandwidth-as either the size of network increases or the rate of network topological change increases, the performance of TORA eventually exceeds that of ILS.
A performance comparison of multi-hop wireless ad hoc network routing protocols
The results of a derailed packet-levelsimulationcomparing fourmulti-hopwirelessad hoc networkroutingprotocols, which cover a range of designchoices: DSDV,TORA, DSR and AODV are presented.
Multicluster, mobile, multimedia radio network
A multi-cluster, multi-hop packet radio network architecture for wireless adaptive mobile information systems is presented. The proposed network supports multimedia traffic and relies on both time
Adaptive Mobile Multimedia Networks
Two layers of key importance in multimedia wireless network design are focused on, namely compression algorithms and adaptivity in the voice/video applications layer, and network algorithms at the wireless subnet layer.
The DARPA packet radio network protocols
The algorithms are described and illustrated how the PRNET provides highly reliable network transport and datagram service, by dynamically determining optimal routes, effectively controlling congestion, and fairly allocating the channel in the face of changing link conditions, mobility, and varying traffic loads.
Architectural considerations for mobile mesh networking
The problem of routing and resource reservation in mobile mesh networks is described and architectural recommendations necessary for Internet protocols to operate effectively in these environments are presented.