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

The goal of this 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 (ACO). This is a probabilistic adaptive technique that changes its routes with the change of network topology over the period of time by learning its environment. It identifies appropriate paths with the feedback of previously travelled packets and maintains routing table accordingly. A self-made 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.