New Multipath Node-Disjoint Routing Based on AODV Protocol

Today, node-disjoint routing becomes inessential technique in communication of packets among various nodes in networks. Meanwhile AODV (Ad Hoc On-demand Multipath Distance Vector) creates single-path route between a pair of source and destination nodes. Some researches has done so far to make multipath node-disjoint routing based on AODV protocol. But however their overhead and end-to-end delay are relatively high, while the detail of their code is not available too. This paper proposes a new approach of multipath node-disjoint routing based on AODV protocol. Then the algorithm of analytical model is presented. The extensive results of this algorithm will be presented in the next paper.




References:
[1] RFC3561: Ad hoc On-Demand Distance Vector (AODV) Routing.
[2] Mahesh K. Marina and Samir R. Das, "On-demand Multiple Distance
Vector Routing in Ad Hoc Networks", Proceedings of the International
Conference for Network Protocol, 2001.
[3] Sung-Ju Lee and Mario Gerla, "AODV-BR: Backup Routing in Ad hoc
Networks", Wireless Communications and Networking Conference,
2000.
[4] Zheniqiang Ye, Strikanth V. Krishnamurthy and Satish K.
Tripathi, "A Framework for Reliable Routing in Mobile Ad Hoc
Networks", IEEE INFOCOM, 2003.
[5] M.T.Toussaint, " Multipath Routing in Mobile Ad Hoc Networks", TUDelft/
TNO Traineeship Report.
[6] Chang-Woo Ahn, Sang-Hwa Chung, Tae-Hun Kim, Su-Young Kang,
"A Node-Disjoint Multipath Routing Protocol Based on AODV in
Mobile Ad-hoc Networks", International Conference on Information
Technology, IEEE, 2010.
[7] Wenjing Yang, Xinyu Yang, Guozheng Liu, Wei Yu, "An Interference
Avoidance Multipath Routing Protocol based on Greedy Forwarding in
MANETs", IEEE, 2010.