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 Destinationsequenced Distance Vector (DSDV) which is known as proactive routing algorithm based on routingtable, due to continuously updating routing tables, it consumes large portion of network capacity. Anotheris Ad hoc on Demand Distance Vector (AODV) is known as reactive algorithm. In this algorithm, whenpath breaks, it needs a new route discovery, this cause a route discovery latency, therefore these arenot suitable for real time communication. With the inspiration by Swarm Intelligence (SI), we borrowedidea from ant colony and Ant Colony Optimization framework and proposed an Enhanced hybrid routingalgorithm which can improve the performance in MANET. The hybrid quality of the algorithm makes itsuitable for the entire environment in comparison with reactive and proactive protocols. The introducedrouting algorithm is highly adaptive, efficient and scalable. The main aim of this algorithm to reduce theend-to-end delay in the context of pause time and mobility on packet received. We refer to this algorithmas the "Ant Colony based Multi Agent Routing Algorithm (ACMRA).