A new adaptive routing approach based on Ant Colony Optimization (ACO) for Ad hoc Wireless Networks

Abstract

The goal ofthis work is to design a new adaptive routing technique for ad hoc wireless networks. This paper proposed the basic deign of the algorithm that works based on the principle of Ant Colony Optimization (A CO). This is a probabilistic adaptive technique that changes its routes with the change of nenvork topology over the period oftime by learning its environment. It identifies appropriate paths with the feedback of previously travelled packets and maintains routing table accordingly. A selfmade simulator implemented on C++ is used to evaluate performance of this algorithm on the basis of diverse adaptive issues such as Change of Probability, Growth of Pheromone Intensity, Randomness of the Selection and Packet sending rate through different paths.

Efficient Pheromone adjustment techniques in ACO for Ad Hoc Wireless network

“…Evaporation is done in a uniform manner on all edges. This technique seems to be more effective in avoiding the generation of dominant path[9] [10][11].The similarity between Social insects like ants and routing in AWN using agents makes ACO an efficient approach for routing in AWN. The paper attempts to analyze ACO based routing algorithm that have been developed for AWN.…”