Optimized ant based routing protocol for MANET

The basic routing problem in MANET deals with methods to transport a packet across a network from source node to destination node. In this paper, we introduce a new ant based routing protocol to optimize the route discovery and maximize the efficiency of routing in terms of packet delivery ratio (PDR) using the blocking expanding ring search (Blocking-ERS), third party route reply, local route repair and n-hop local ring techniques. These techniques control the overhead and minimize the end-to-end delay with improvement of PDR. The Optimized-Ant routing protocol is based on ad hoc on-demand distance vector (AODV) and inspired by the ant-colony optimization (ACO) used to solve complex optimization problems and utilizes a collection of mobile agents as "ants" to perform optimal routing activities. Exhaustive simulations are carried out and it is observed that, Optimized-Ant performs better than AODV.

[1]  Ida Pu,et al.  Blocking Expanding Ring Search Algorithm for Efficient Energy Consumption in Mobile Ad Hoc Networks , 2006 .

[2]  Puneet Agarwal,et al.  Time to Live (TTL) Processing in MPLS Networks (Updates RFC 3032) , 2003 .

[3]  Bidyut Gupta,et al.  A Modified Shared-tree Multicast Routing Protocol in Ad Hoc Network , 2005, J. Comput. Inf. Technol..

[4]  Charles E. Perkins,et al.  Ad hoc On-Demand Distance Vector (AODV) Routing , 2001, RFC.

[5]  Charles E. Perkins,et al.  Scalability study of the ad hoc on‐demand distance vector routing protocol , 2003, Int. J. Netw. Manag..

[6]  Imed Bouazizi,et al.  ARA-the ant-colony based routing algorithm for MANETs , 2002, Proceedings. International Conference on Parallel Processing Workshop.

[7]  ZHANGLi-xia,et al.  A reliable multicast framework for light-weight sessions and application level framing , 1995 .

[8]  Eryk Dutkiewicz,et al.  A review of routing protocols for mobile ad hoc networks , 2004, Ad Hoc Networks.

[9]  J. Deneubourg,et al.  Trails and U-turns in the Selection of a Path by the Ant Lasius niger , 1992 .

[10]  Marco Dorigo,et al.  Ant Colonies for Adaptive Routing in Packet-Switched Communications Networks , 1998, PPSN.

[11]  Mahmoud Naghibzadeh,et al.  Helping ants for adaptive network routing , 2006, J. Frankl. Inst..

[12]  Piet Van Mieghem,et al.  Responsible Editor: A. Kshemkalyani , 2006 .

[13]  Luca Maria Gambardella,et al.  Ant colony system: a cooperative learning approach to the traveling salesman problem , 1997, IEEE Trans. Evol. Comput..

[14]  Ida Pu,et al.  Energy Efficient Expanding Ring Search , 2007, First Asia International Conference on Modelling & Simulation (AMS'07).

[15]  Charles E. Perkins,et al.  Ad-hoc on-demand distance vector routing , 1999, Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications.

[16]  Sungyoung Lee,et al.  A Performance Comparison of Swarm Intelligence Inspired Routing Algorithms for MANETs , 2009, ICCSA.

[17]  LeeSung-Ju,et al.  Scalability study of the ad hoc on-demand distance vector routing protocol , 2003 .