By Topic

Maximally Collision-Avoided Node-Disjoint Multipath Routing in 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
$31 $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

4 Author(s)
Ming Liu ; Digital Eng. Res. Center, Huazhong Univ. of Sci. & Technol., Wuhan ; Cheng Wang ; Junli Yang ; Xiaorong Huang

Multipath routing allows two network nodes to exchange messages over multiple paths. However, due to the wireless multicast advantage (WMA), there exists serious collision among multiple paths. Thus, data transfer rate of most multipath routing, even if it is node-disjoint, is not so high as its anticipation. This paper proposes a node-disjoint multipath routing based on correlation factor (NDCF) algorithm for ad hoc networks. To avoid collision maximally, this algorithm defines correlation factor to weigh the collision probability among node-disjoint multipaths when transmitting data simultaneously, then finds the node-disjoint multipath, whose collision probability is minimum. Our preliminary simulation results show that NDCF algorithm can significantly reduce end-to-end delay and improve packet delivery ratio

Published in:

Communications, Circuits and Systems Proceedings, 2006 International Conference on  (Volume:3 )

Date of Conference:

25-28 June 2006