An ad-hoc network is the cooperative engagement of a c ollection of mobile nodes without the required intervention of any centralized a c cess point or existing infrastructure. In this paper we present Ad-hoc O n D emand Distance V ector Routing AODV, a novel algorithm for the operation of such ad-hoc networks. Each Mobile Host operates as a specialized r outer, and routes are obtained a s n e eded i.e., on-demand with little or no reliance o n p eriodic advertisements. Our new routing algorithm is quite suitable for a dynamic selfstarting network, as required by users wishing to utilize ad-hoc networks. AODV p r ovides loop-free r outes 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 On-Demand Distance Vector (AODV) REF does not work well in the presence of unidirectional links.
Ad-hoc on-demand distance vector routing
Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications
Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications
Computer Science