The quickly switching routing algorithm based on multi-path in mobile Ad Hoc networks

Abstract

This paper proposes a new on-demand multi-alternate-path algorithm, called quickly switching routing algorithm (QSRA). It switches failure routing to an alternate path as quickly as the network can. Like a nervure shape, algorithm QSRA shapes disjoint-alternate-path structure, but is not limited to. It also contains another structure that every primary node has several links to alternate paths. This structure has two advantages, the first one is that primary nodes can select one alternate path immediately when primary routing is failure without going back to source node to re-discover a new routing or choose an alternate path; the second is that it guarantees primary nodes can select another alternate path as quickly as possible once one of alternate paths fails. Strongpoint of algorithm QSRA is reducing frequency of routing re-discovering. Besides, the structure occupies fewer resources than other routing algorithms due to its distributed structure. Simulation shows that QSRA has higher packets received ratio and lower control packet overhead and lower end-to-end delay.

Keywords

mobile Ad Hoc networks / routing / multi-path routing

References

[1] KIM S K, NOH W J, and AN S S. Multi-path Ad Hoc routing considering path redundancy [A]. Proceedings of the Eighth IEEE International Symposium on Computers and Communication [C]. Antalya: Turkey, 2003.

[2] LI X F, CUTHBERT L. On-demand node-disjoint multipath routing in wireless Ad Hoc networks [A]. Proceedings of the 29th Annual IEEE International Conference on Local Computer Networks [C]. Tampa: USA, 2004.

[3] Nasipuri S, Castaneda R. Performance of multi-path routing for on-demand porotocols in mobile Ad Hoc networks [J]. Mobile Networks and Applications, 2001, 6: 339-349

[4] HAENGGI M. Routing in Ad Hoc networks—a wireless perspective [A]. Proc of the First International Conference on broadband Networks, [C]. [S. 1.], 2004.

[5] Yu X T, Bi G G, Wang X J, Zhang Z C. An improvement to Ad Hoc on-demand routing protocol [J]. Hinese Journal of Computers, 2004, 27(6): 838-844

[6] Guo X F, Chen Y Q, Chen G H. An aggregated multipath routing scheme for Ad Hoc networks [J]. Journal of Software, 2004, 15(4): 594-603

[7] LEUNG R, LIU J L, POON D. CHAN Ah-Lot C, LI Baochun. MP-DSR: A QoS-awae multi-path dynamic source routing protocol for wireless Ad-Hoc networks [A]. Proceedings of the 26th Annual IEEE Conference on Local Computer Networks[C]. Tampa. USA 2001.

[8] Chen Y Q, Guo X F, Zeng Q K, Chen G H. AMR: A multi-path routing algorithm based on maximum flow in Ad Hoc networkds [J]. Acta Electrinica Sinica, 2004, 8: 1297-1301 (in Chinese)

[9] Bajaj, et al. GloMoSim: A scalable network simulation environment, Technical Report 990027 [R]. 1999, Los Angeles: UCLA Computer Science Department

[10] JOHNSON D J, MALTZ D A, HU Y C. The dynamics. source routing protocol for mobile Ad Hoc networks, (DSR) [A]. Inernet Draft work in progress [C]. [S.l.] 2003.