Ad-hoc On-Demand Distance Vector Routing

Ad-hoc On-Demand Distance Vector Routing (1997)

by Charles E. Perkins , Elizabeth M. Royer

Venue:	IN PROCEEDINGS OF THE 2ND IEEE WORKSHOP ON MOBILE COMPUTING SYSTEMS AND APPLICATIONS
Citations:	1718 - 13 self

Datum	Value	Source
TITLE	Ad-hoc On-Demand Distance Vector Routing	SVM HeaderParse 0.1
AUTHOR NAME	Charles E. Perkins	SVM HeaderParse 0.1
AUTHOR ADDR	; Menlo Park, CA 94025	SVM HeaderParse 0.1
ABSTRACT	An ad-hoc network is the cooperative engagement of acollection 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 onperiodic advertisements. Our new routing algorithm is quite suitable for a dynamic selfstarting 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.	SVM HeaderParse 0.1
CITATIONS	22 found	ParsCit 1.0