By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Nagaraju, A. ; Kamala Inst. of Technol. & Sci., Singapur, India ; Krishna, C.R.

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.

Published in:

Networks and Communications, 2009. NETCOM '09. First International Conference on

Date of Conference:

27-29 Dec. 2009