By Topic

Routing in Mobile Ad-hoc Networks: the Virtual Distance Vector Protocol

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)
Andrea Robba ; Information Engineering Department, University of Pisa, and ISTI-CNR, Pisa, Italy. E-mail: ; Piero Maestrini

A novel routing protocol for wireless mobile ad hoc networks, named virtual distance vector (VDV), is presented. This protocol augments AODV with a virtual overlay, unrelated to the actual network topology, which accounts for routes kept proactively by mobile nodes acting as scouts toward the nodes in the respective subsets of peers. This provides routes from any source to any destination node, along which data packets can be routed without the need of preliminary route discovery. The intended goal of VDV was to reduce the average end-to-end delivery time of data packets. VDV has been evaluated against AODV by running extensive simulation under OPNET Modeler. Simulation confirmed the expected advantage of VDV, which increases with increasing node mobility and average route length. The confidence intervals of reported data showed that VDV fits better the dynamic nature of the network.

Published in:

2007 IEEE International Conference on Mobile Adhoc and Sensor Systems

Date of Conference:

8-11 Oct. 2007