Performance Evaluation of ADV with AODV for Mobile Ad-hoc Networks

Adaptive distance vector routing algorithm (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 especially in high mobility cases by giving significantly higher (50% or more) peak throughput´s and lower packet delays. Furthermore, ADV uses fewer routing and control overhead packets than that of AODV 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.