By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Wang Lei ; Coll. of Comput. & Commun., Hunan Univ., Changsha, China ; Lin Ya-ping ; Chen Zhi-ping

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.

Published in:

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

Date of Conference:

20-23 Oct. 2003