Ad-hoc on-demand distance vector routing

In this paper we present Ad-hoc On Demand Distance Vector Routing AODV, a novel algorithm for the operation of such ad-hoc networks

C.E. Perkins


Scholarcy highlights

  • Laptop computers continue to show improvements in convenience, mobility, memory capacity, and availability of disk storage
  • We have simulated AODV using an event-driven, packet-level simulator called PARSEC 1, which was developed at UCLA as the successor to Maisie 2
  • The main objective of our simulations is to show that on-demand route establishment with AODV is both quick and accurate
  • Our rst objective was to show that AODV can nd routes quickly and accurately
  • AODV avoids problems with previous proposals notably DSDV and has the following features: Nodes store only the routes that are needed Need for broadcast is minimized Reduces memory requirements and needless duplications Quick response to link breakage in active routes Loop-free routes maintained by use of destination sequence numbers Scalable to large populations of nodes
  • Within the limits imposed by worst-case route establishment latency as determined by the network diameter, AODV is an excellent choice for ad-hoc network establishment
  • We look forward to further development of the protocol for quality of service, intermediate route rebuilding, and various interconnection topologies with xed networks and the Internet

Need more features? Save interactive summary cards to your Scholarcy Library.