Open Access Open Access  Restricted Access Subscription or Fee Access

Multipath Ant Routing Algorithm in Mobile Ad Hoc Networks

Dr.M. Sivajothi


Mobile Ad hoc Networks (MANETs) are networks that consist entirely of mobile nodes, placed together in an ad hoc manner. All nodes have routing capabilities, and forward data packets for other nodes. Nodes can enter or leave the network at any time, and may be mobile, so that the network topology changes frequently. There are lots of challenges in these networks which makes routing task hard. These challenges arise from the dynamic and unplanned nature of these networks, from the unreliability of wireless communication, from the limited resources available in terms of bandwidth, processing capacity, etc., and from the possibly large scale of these networks. Due to these different challenges, new algorithms are needed at all layers of the network protocol stack. We try to cover these challenges by using ideas from artificial intelligence namely Ant Colony Optimization (ACO) and Multipath Routing. ACO algorithms tend to provide properties such as adaptivity and robustness, which are needed to deal with the challenges present in MANETs. Multipath routing provides multiple stable paths for routing data sets, which bring efficiency for MANETs. So we present Multipath Ant Routing (MAR) algorithm which combines ideas from ACO routing and Multipath routing. The algorithm has hybrid architecture, combining both reactive and proactive mechanisms. In simulation results, we show that for a wide range of different environments and performance metrics, MAR can outperform.


Ad Hoc Networks, Ant Colony Optimization, MANETs, Routing Protocol

Full Text:



E. M. Royer and C.-K. Toh. A review of current routing protocols for ad hoc mobile wireless networks. IEEE Personal Communications, 1999.

I. F. Akyildiz, X. Wang, and W. Wang. Wireless mesh networks: a survey. Computer Networks Journal, 47:445{487, March 2005.

I. F. Akyildiz, S. Weilian, Y. Sankarasubramaniam, and E. Cayirci. A survey on sensor networks. IEEE Communications Magazine, 40(8):102-116, August 2002.

Frederick Ducatelle , .Adaptive Routing in Ad Hoc Wireless Multi-hop Networks., (Phd Thesis, Universitμa della Svizzera italiana, 2006- 2007).

M. Dorigo and T. StÄutzle. Ant Colony Optimization. MIT Press, Cambridge, MA, 2004.

Das, S.K., Mukherjee, A., Bandyopadhyay, S., Paul, K., Saha, D.: Improving Quality-of-Service in Ad hoc Wireless Networks with Adaptive Multi-path Routing. IEEE Global Telecommunications Conference (2000).

M. Dorigo, G. Di Caro, and L. M. Gambardella. Ant algorithms for distributed discrete optimization. Artificial Life, 5(2):137-172, 1999.

T. Clausen, P. Jacquet, A. Laouiti, P. Muhlethaler, A. Qayyum, and L. Viennot. Optimized link state routing protocol. In Proceedings of IEEE INMIC, 2001.

C. E. Perkins and E. M. Royer. Ad-hoc on-demand distance vector routing. In Proc. of the 2nd IEEE Workshop on Mobile Computing Systems and Applications, 1999.

G. Di Caro, F. Ducatelle, and L. M. Gambardella. AntHocNet: an adaptive nature-inspired algorithm for routing in mobile ad hoc networks. European Transactions on Telecommunications (ETT), 16(5), 2005.

I. D. Chakeres and E. M. Belding-Royer. The utility of hello messages for determining link connectivity. In Proceedings of the 5th International Symposium on Wireless Personal Multimedia communications (WPMC), Honolulu, HI, USA, October 2002.


  • There are currently no refbacks.

Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.