Mobile Computing Systems and Applications, IEEE Workshop on (1999)
New Orleans, Louisiana
Feb. 25, 1999 to Feb. 26, 1999
Charles E. Perkins , Sun Microsystems Laboratories
Elizabeth M. Royer , University of California at Santa Barbara
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. In this paper we present Ad-hoc On Demand Distance Vector 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 self-starting network, as required by users wishing to utilize ad-hoc networks. AODV provides loop-free routes 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.
Ad-hoc Networking, Distance Vector Routing, Dynamic Routing, Mobile Networking, Wireless Networks
E. M. Royer and C. E. Perkins, "Ad-hoc On-Demand Distance Vector Routing," Mobile Computing Systems and Applications, IEEE Workshop on(WMCSA), New Orleans, Louisiana, 1999, pp. 90.