An Adaptive Distance Vector Routing Algorithm for Mobile, Ad Hoc Networks
Rajendra V. Boppana, Satyadeva P. Konduru
University of Texas at San Antonio
and
Nexsi Corp.
Proceedings of the Twentieth Annual Joint Conference of the IEEE Computer and communications Societies
Paper:
Abstract
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.
Comment
An Adaptive Distance Vector Routing Algorithm for Mobile, Ad Hoc Networks (ADV)
BibTeX
@INPROCEEDINGS(Bop2001,
TITLE = {An adaptive distance vector routing algorithm for mobile, ad hoc networks},
AUTHOR = {Rajendra V. Boppana and Satyadeva Konduru},
BOOKTITLE= {Proceedings of the Twentieth Annual Joint Conference of the IEEE Computer and communications Societies,
YEAR = {2001},
PAGES = {1753-1762},
MONTH = {Oct},
ORGANIZATION = {ACM},
PUBLISHER = {ACM},
URL = {citeseer.ist.psu.edu/boppana01adaptive.html},
FILE = {jetcheva01adaptive.pdf}
)
