Application of an Improved Ant Colony Optimization on Routing in Mobile Ad Hoc Network

Routing in Mobile Ad Hoc Network (MANETS) is the task of directing data packets from a source node to a given destination. Due to the mobility of the network elements and the lack of central control, routing algorithms should be robust and adaptive and work in a decentralized and self-organizing way. In this paper, we present an improved ant colony optimization (ACO) and we use it to solve the problem in routing of Mobile Ad Hoc Network. We improved the performance of the ACO by using individual variation strategy and use the improved algorithm to obtain these characters to solve the problems of the routing. Simulation results show that the improved algorithm can get better performance over a wide range of different scenarios and for a number of different evaluation measures.