An adaptive distance vector routing algorithm for mobile, ad hoc networks

Author

Boppana, Rajendra V. ; Konduru, Satyadeva P.

Author_Institution

Div. of Comput. Sci., Texas Univ., San Antonio, TX, USA

Volume

3

fYear

2001

fDate

2001

Firstpage

1753

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

Keywords

land mobile radio; packet radio networks; protocols; radio networks; telecommunication network routing; MANET; adaptive distance vector routing algorithm; control overhead packets; mobile ad hoc networks; network load; network mobility conditions; on-demand characteristics; on-demand routing; packet delays; peak throughputs; proactive routing; routing overhead packets; routing protocols design; routing updates frequency; routing updates size; simulations; Ad hoc networks; Algorithm design and analysis; Computer science; Delay; Frequency; Mobile ad hoc networks; Portable computers; Routing protocols; Throughput; Wireless communication;

fLanguage

English

Publisher

ieee

Conference_Titel

INFOCOM 2001. Twentieth Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings. IEEE

Conference_Location

Anchorage, AK

ISSN

0743-166X

Print_ISBN

0-7803-7016-3

Type

conf

DOI

10.1109/INFCOM.2001.916673

Filename

916673