Optimized ant based routing protocol for MANET
Ashima Rout, Srinivas Sethi, Debajyoti Mishra · 2011
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.