Mobile Ad hoc network consists of a set of mobile nodes. It is a dynamic network which does not have fixed topology. This network doesnot have any infrastructure or central administration, hence it is called infrastructure-less network. The change in topology makes the route fromsource to destination as dynamic fixed and changes with respect to time. The nature of network requires the algorithm to perform route discovery,maintain route and detect failure along the path between two nodes [1]. This paper presents the ant colony optimization technique to improve theperformance of routing algorithm. ACO finds route between nodes in mobile ad-hoc network. The algorithm is on-demand source initiated routingalgorithm. ACO is a probabilistic technique for solving computational problems which can be reduced to finding good paths through graphs. Thisalgorithm is a member of ant colony algorithms family, in swarm intelligence methods, and it constitutes some metaheuristic optimizations. Thealgorithm is adaptive, scalable and favors load balancing. The improvements suggested in this paper are handling of loss ants and resourcereservation.Keywords- ACO, Ad hoc networks, MANET, Swarm intelligence.
Enhanced Ant Colony Based Algorithm for Routing in Mobile Ad Hoc Network
2017-01-13
doi:10.26483/ijarcs.v4i6.1700
International Journal of Advanced Research in Computer Science; Vol 4, No 6 (2013): SPECIAL ISSUE II, MAY 2013 ; 0976-5697 ; 10.26483/ijarcs.v4i6
Article (Journal)
Electronic Resource
English
An enhanced routing algorithm using ant colony optimization and VANET infrastructure
DOAJ | 2019
|Ant Colony Routing algorithm for freeway networks
Online Contents | 2013
|A Multicast Routing Algorithm Based on Ant Colony System
British Library Online Contents | 2006
|