Collision-Constrained Minimum Energy Node-Disjoint Multipath Routing in Ad Hoc Networks
Ming Liu, Zhiyan Xu, Junli Yang, Juan Ye · 2006
Multipath routing can reduce routing update, increase bandwidth and improve data transfer rate of ad hoc networks. However, there exists serious collision among multiple paths. Energy minimum and collision avoidance are incompatible, and limited battery capacity presents major challenges for collision avoidance. In order to find a tradeoff between them when transmitting data simultaneously, this paper proposes a collision-constrained minimum energy node-disjoint multipath routing algorithm (ECCA) for ad hoc networks. The ECCA defines correlation factor to weigh the collision probability among node-disjoint multipath, then calculates an upper limit for correlation factor according to service requirement, finally finds a minimum energy node-disjoint multipath routing to satisfy the limit. Our preliminary simulation results show that ECCA can significantly reduce the packet loss rate and energy consumed, but not prolong routing time