Ant colony optimization based enhanced dynamic source routing algorithm for mobile Ad-hoc network

摘要

Due to the dynamic nature of the Mobile Ad-hoc Network (MANET), routing in MANET becomes challenging especially when certain QoS requirements (like high data packet delivery ratio, low end to end delay, low routing overhead, and low energy consumption) are to be satisfied. Though a number of routing protocols have been proposed aiming to fulfill some of these QoS requirements but none of them can support all these requirements at the same time. In this paper, we propose an enhanced version of the well-known Dynamic Source Routing (DSR) scheme based on the Ant Colony Optimization (ACO) algorithm, which can produce a high data packet delivery ratio in low end to end delay with low routing overhead and low energy consumption. In our scheme, when a node needs to send a packet to another node, like DSR, it first checks the cache for existing routes. When no routes are known, the sender node locally broadcasts the Route Request control packets (called the Req.Ant packets) to find out the routes. This is similar to the biological ants initially spreading out in all directions from their colony in search of food. Now, the ants, after finding the food source, come back to the colony and deposit pheromone on their way so that other ants get informed about the paths. Similarly, in our routing scheme, the Req.Ant packets propagate through the network according to our novel route discovery scheme and gathers information of the route (i.e. total length of the route, congestion along the route and end to end path reliability of the route), till it reaches the destination node. When the destination node receives a Req.Ant packet, it sends back Rep.Ant (Route Reply control packet) which consists the route information of the corresponding Req.Ant to the source node through the same route. On receiving such Rep.Ant packets from different routes, the source node comes to know about those routes. Under the ant colony framework, the best route is selected by the pheromone level of the route. Similarly, here we calculate the pheromone level of a route based on the number of hops in the route, the congestion along the route and end to end path reliability of the route. The route with the highest pheromone count will be selected for data packet delivery. We also propose a novel pheromone decay technique for route maintenance. The simulation results show that our ACO based Enhanced DSR (E-Ant-DSR) outperforms the original DSR and other ACO based routing algorithms. (C) 2014 Published by Elsevier Inc.