Maximally Collision-Avoided Node-Disjoint Multipath Routing in Ad Hoc Networks
Ming Liu, Cheng Wang, Junli Yang, Xiaorong Huang · 2006
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