Ad Hoc On-Demand Distance Vector Routing
Ad hoc On-Demand Distance Vector (AODV) Routing is a routing protocol for mobile ad hoc networks (MANETs) and other wireless ad-hoc networks. It is jointly developed in Nokia Research Center, University of California, Santa Barbara and University of Cincinnati by C. Perkins, E. Belding-Royer and S. Das.
It is a reactive routing protocol, meaning that it establishes a route to a destination only on demand. In contrast, the most common routing protocols of the Internet are proactive, meaning they find routing paths independently of the usage of the paths. AODV is, as the name indicates, a distance-vector routing protocol. AODV avoids the counting-to-infinity problem of other distance-vector protocols by using sequence numbers on route updates, a technique pioneered by DSDV. AODV is capable of both unicast and multicast routing.
For other alternatives see the Ad hoc routing protocols list.
Read more about Ad Hoc On-Demand Distance Vector Routing: Workings, Advantages and Disadvantages
Famous quotes containing the word distance:
“It is the simplest relation of phenomena, and describes the commonest sensations with more truth than science does, and the latter at a distance slowly mimics its style and methods.”
—Henry David Thoreau (1817–1862)