We present a new routing algorithm called adaptive distance vector (ADV) for mobile, ad hoc networks (MANETs). ADV is a distance vector routing algorithm that exhibits some on-demand characteristics by varying the frequency and the size of the routing updates in response to the network load and mobility conditions. Using simulations we show that ADV outperforms AODV and DSR especially in high mobility cases by giving significantly higher (50% or more) peak throughputs and lower packet delays. Furthermore, ADV uses fewer routing and control overhead packets than that of AODV and DSR, especially at moderate to high loads. Our results indicate the benefits of combining both proactive and on-demand routing techniques in designing suitable routing protocols for MANETs.

The ad hoc on-demand distance vector (AODV) is an on-demand routing protocol designed specifically for mobile, ad hoc networks. But the packet latencies with AODV can be very high, >100 ms on average, especially when the network load is low and node mobility is high. To mitigate this effect, we have enhanced AODV with a proactive technique, which lets receiver nodes broadcast periodic 'beacons' throughout the network to keep routing entries in other nodes current. Using simulations we show that beacons reduce the packet latencies by a factor of 2-3. The routing packets transmitted are also reduced as the beacons obviate the need for some route discovery processes.