Abstract
An ad-hoc network is the cooperative engagement of acollection of mobile nodes without the required intervention of any centralizedaccess point or existing infrastructure. In this paper we present Ad-hoc On Demand DistanceVector Routing (AODV), a novel algorithm for the operation of such ad-hoc networks. Each Mobile Host operates as a specialized router, and routes are obtained as needed (i.e., on-demand) with little or no reliance on periodic advertisements. Our new routing algorithm is quite suitable for a dynamic selfstarting network, as required by users wishing to utilize ad-hoc networks. AODVprovides loop-freeroutes even while repairing broken links. Because the protocol does not require global periodic routing advertisements, the demand on the overall bandwidth available to the mobile nodes is substantially less than in those protocols that do necessitate such advertisements. Nevertheless we can still maintain most of the advantages of basic distance-vector routing mechanisms. We show that our algorithm scales to large populations of mobile nodes wishing to form ad-hoc networks. We also include an evaluation methodology and simulation results to verify the operation of our algorithm.
Keywords
Computer scienceComputer networkOptimized Link State Routing ProtocolAd hoc On-Demand Distance Vector RoutingDestination-Sequenced Distance Vector routingWireless Routing ProtocolDynamic Source RoutingDistance-vector routing protocolWireless ad hoc networkAd hoc wireless distribution serviceDistributed computingAdaptive quality of service multi-hop routingMobile ad hoc networkLink-state routing protocolRouting protocolRouting (electronic design automation)TelecommunicationsWireless
Affiliated Institutions
Related Publications
A routing protocol for packet radio networks
Abstract : The authors present a new distance-vector routing protocol for a packet radio network. The new distributed routing protocol, Wireless Routing Protocol (WRP), works on...
Routing in ad-hoc networks using minimum connected dominating sets
We impose a virtual backbone structure on the ad-hoc network, in order to support unicast, multicast, and fault-tolerant routing within the ad-hoc network. This virtual backbone...
A highly adaptive distributed routing algorithm for mobile wireless networks
We present a new distributed routing protocol for mobile, multihop, wireless networks. The protocol is one of a family of protocols which we term “link reversal” algorithms. The...
Power-aware routing in mobile ad hoc networks
b this paper we present a case for using new power-aware metn.cs for determining routes in wireless ad hoc networks. We present five ~erent metriw based on battery power consump...
Adaptive clustering for mobile wireless networks
This paper describes a self-organizing, multihop, mobile radio network which relies on a code-division access scheme for multimedia support. In the proposed network architecture...
Publication Info
- Year
- 1999
- Type
- article
- Citations
- 10266
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
10266
OpenAlex
Cite This
Charles E. Perkins,
E.M. Royer
(1999).
Ad-hoc on-demand distance vector routing.
.
https://doi.org/10.1109/mcsa.1999.749281
Identifiers
- DOI
- 10.1109/mcsa.1999.749281