Similar Node-Disjoint Multi-paths Routing in Wireless Ad hoc Networks
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.
Similarity Node-Disjoint MulttPaths Routing Ad hoc Networking Mobile Networking
Wuping XU Puliu YAN Delin XIA
School of Electronics Information, Wuhan University, 430072 Wuhan Hubei P.R.China;School of Computer School of Electronics Information, Wuhan University, 430072 Wuhan Hubei P.R.China
国际会议
武汉
英文
731-734
2005-09-23（万方平台首次上网日期，不代表论文的发表时间）