Similar node-disjoint multi-paths routing in wireless ad hoc networks
Wuping Xu, Puliu Yan, Xia Delin · 2005
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.