A distributed tokens-based distance-vector routing algorithm for mobile ad-hoc networks

Author

Lei, Wang ; Ya-ping, Lin ; Zhi-ping, Chen

Author_Institution

Coll. of Comput. & Commun., Hunan Univ., Changsha, China

fYear

2003

fDate

20-23 Oct. 2003

Firstpage

474

Lastpage

477

Abstract

A mobile ad-hoc network is a multi-hop wireless network in which mobile hosts communicate over a shared, scarce wireless channel. In this paper, an innovative distance vector routing algorithm TDVRA based on tokens for mobile ad-hoc networks is proposed, which is proved to be loop-free and of no problem of counting-to-infinity existed in those traditional distance-vector routing algorithms such as RIP and BF. Furthermore, compared with the algorithm DSDV, the new algorithm TDVRA can overcome the drawback of routing fluctuations existed in DSDV and can spread the bad news as quickly as the good news.

Keywords

ad hoc networks; algorithm theory; mobile communication; mobile computing; routing protocols; counting-to-infinity; distance vector; distributed routing algorithm; mobile ad-hoc networks; mobile hosts; multihop wireless network; routing fluctuations; routing tokens; shared wireless channel; tokens-based distance-vector routing algorithm; Ad hoc networks; Clustering algorithms; Computer networks; Educational institutions; Electronic mail; Fluctuations; Mobile ad hoc networks; Mobile communication; Mobile computing; Routing;

fLanguage

English

Publisher

ieee

Conference_Titel

Computer Networks and Mobile Computing, 2003. ICCNMC 2003. 2003 International Conference on

Print_ISBN

0-7695-2033-2

Type

conf

DOI

10.1109/ICCNMC.2003.1243094

Filename

1243094