DocumentCode
427309
Title
Adaptive gossip-based routing algorithm
Author
Shi, Zhongmin ; Shen, Hong
Author_Institution
Sch. of Comput. Sci., Simon Fraser Univ., Burnaby, BC, Canada
fYear
2004
fDate
2004
Firstpage
323
Lastpage
324
Abstract
In this paper we investigate an up-to-date gossip-based ad hoc routing algorithm (AODV+G) [Z. J. Haas, et al., 2002] implemented in ad hoc on-demand distance vector routing (AODV) and discuss its weakness with respect to overall network routing performance. An enhanced approach, adaptive gossip-based ad hoc routing (AGAR), is introduced, simulated and compared with AODV+G. We expect that AGAR would outperform more significantly in larger scaled networks.
Keywords
ad hoc networks; telecommunication network routing; gossip-based ad hoc routing algorithm; network routing performance; on-demand distance vector routing; Ad hoc networks; Broadcasting; Computer networks; Degradation; Delay effects; Floods; Routing protocols; Telecommunication traffic; Throughput; Traffic control;
fLanguage
English
Publisher
ieee
Conference_Titel
Performance, Computing, and Communications, 2004 IEEE International Conference on
Print_ISBN
0-7803-8396-6
Type
conf
DOI
10.1109/PCCC.2004.1395018
Filename
1395018
Link To Document