A Hybrid Multi-Agent Routing Algorithm Based on Ant Colony Optimization for MANET

There are many routing algorithms are presented for Mobile Ad hoc Network such as Destination sequenced Distance Vector (DSDV) which is known as proactive routing algorithm based on routing table, due to continuously updating routing tables, it consumes large portion of network capacity. Another is Ad hoc on Demand Distance Vector (AODV) is known as reactive algorithm. In this algorithm, when path breaks, it needs a new route discovery, this cause a route discovery latency, therefore these are not suitable for real time communication. With the inspiration by Swarm Intelligence (SI), we borrowed idea from ant colony and Ant Colony Optimization framework and proposed an Enhanced hybrid routing algorithm which can improve the performance in MANET. The hybrid quality of the algorithm makes it suitable for the entire environment in comparison with reactive and proactive protocols. The introduced routing algorithm is highly adaptive, efficient and scalable. The main aim of this algorithm to reduce the end-to-end delay in the context of pause time and mobility on packet received. We refer to this algorithm as the “Ant Colony based Multi Agent Routing Algorithm (ACMRA).