By Topic

Similar node-disjoint multi-paths routing in wireless 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)
Wuping Xu ; Sch. of Electron. Inf., Wuhan Univ., China ; Puliu Yan ; Delin Xia

A similar node-disjoint multi-paths routing (SNDMR) algorithm is proposed to overcome the shortcomings of on-demand node-disjoint multi-path routing (NDMR). SNDMR has two novel aspects compared to NDMR. Firstly, based on similarity principle, it eliminates long paths from candidate routes, and avoids the disadvantageous effect to the performance of networks. Secondly, it adopts proactive path maintenance. On the one hand, it can keep communication unblocked with any delay in mobile wireless networks. On the other hand, it can find better paths when the majority of active paths become unreachable or loading increases dramatically. Simulation results show that SNDMR achieves lower delay dithering as well as higher packet delivery ratio.

Published in:

Proceedings. 2005 International Conference on Wireless Communications, Networking and Mobile Computing, 2005.  (Volume:2 )

Date of Conference:

23-26 Sept. 2005