Efficient routing in packet-radio networks using link-state information

Author

Garcia-Luna-Aceves, J.J. ; Spohn, Marcelo

Author_Institution

Dept. of Comput. Eng., California Univ., Santa Cruz, CA, USA

fYear

1999

fDate

1999

Firstpage

1308

Abstract

We present the source-tree adaptive routing (STAR) protocol, which we show through simulation experiments to be far more efficient than the dynamic source routing (DSR) protocol, which has been shown to be one of the best performing on-demand routing protocols. A router in STAR communicates to its neighbors the parameters of its source routing tree, which consists of each link that the router needs to reach every destination. To conserve transmission bandwidth and energy, a router transmits changes to its source routing tree only when the router detects new destinations, the possibility of looping, or the possibility of node failures or network partitions

Keywords

packet radio networks; protocols; telecommunication network routing; STAR protocol; ad hoc networks; dynamic source routing protocol; efficient routing; energy conservation; link-state information; network partitions; node failures; on-demand routing protocol; packet radio networks; simulation experiments; source routing tree; source-tree adaptive routing protocol; transmission bandwidth conservation; Ad hoc networks; Bandwidth; Computational modeling; Computer simulation; Integrated circuit interconnections; Intelligent networks; Interference; Network topology; Routing protocols; Spread spectrum communication;

fLanguage

English

Publisher

ieee

Conference_Titel

Wireless Communications and Networking Conference, 1999. WCNC. 1999 IEEE

Conference_Location

New Orleans, LA

ISSN

1525-3511

Print_ISBN

0-7803-5668-3

Type

conf

DOI

10.1109/WCNC.1999.796949

Filename

796949