next up previous index
Next: Temporally Ordered Routing Algorithm Up: Mobile Ad Hoc Routing Previous: Mobile Ad Hoc Routing   Index

Ad hoc On-demand Distance Vector Routing

Ad hoc On-demand Distance Vector Routing (AODV) is an on-demand version of the table-driven Dynamic Destination-Sequenced Distance-Vector (DSDV) protocol [1]. To find a route to the destination, the source broadcasts a route request packet. This broadcast message propagates through the network until it reaches an intermediate node that has recent route information about the destination or until it reaches the destination. When intermediate nodes forwards the route request packet it records in its own tables which node the route request came from. This information is used to form the reply path for the route reply packet as AODV uses only symmetric links. As the route reply packet traverses back to the source, the nodes along the reverse path enter the routing information into their tables. When ever a link failure occurs, the source is notified and a route discovery can be requested again if needed.



2001-07-02