Cache based ant colony routing algorithm for mobile ad hoc networks

Mobile adhoc networks are formed dynamically without any infrastructure and each node is responsible for routing information among them. Ant colony optimization (ACO) algorithms are used to find an optimized solution for various problems. The change in topology makes the route from source to destination as dynamic fixed and changes with respect to time. The nature of network requires the optimized algorithm to perform route discovery, maintain route and detect failure along the path between two nodes. This paper proposes a cache based ant colony routing for mobile ad hoc networks for building highly adaptive and on-demand source initiated routing algorithm.