Cache based ant colony routing algorithm for mobile ad hoc networks

Authors:
S. Sathish;K. Thangavel;V. Vaidehi
Affiliations:
Periyar University, Salem, India;Periyar University, Salem, India;Periyar University, Salem, India
Venue:
Proceedings of the 1st International Conference on Wireless Technologies for Humanitarian Relief
Year:
2011

Citing 4
Cited 0

Ant-based load balancing in telecommunications networks

Adaptive Behavior
Scalability study of the ad hoc on-demand distance vector routing protocol

International Journal of Network Management
Ant colony optimization theory: a survey

Theoretical Computer Science
Mobile ad hoc networking and the IETF

ACM SIGMOBILE Mobile Computing and Communications Review

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.