Sciweavers

Share
WMCSA
1999
IEEE

Ad-hoc On-Demand Distance Vector Routing

9 years 16 days ago
Ad-hoc On-Demand Distance Vector Routing
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 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 mechani...
Charles E. Perkins, Elizabeth M. Belding-Royer
Added 04 Aug 2010
Updated 04 Aug 2010
Type Conference
Year 1999
Where WMCSA
Authors Charles E. Perkins, Elizabeth M. Belding-Royer
Comments (0)
books