Computation of Pheromone Values in AntNet Algorithm

Full Text (PDF, 1064KB), PP.47-54

Views: 0 Downloads: 0


Anuj K. Gupta 1,* Harsh Sadawarti 1 A.K. Verma 2

1. Dept. of Computer Science & Engineering, RIMT Institute of Engineering & Technology, Punjab, India

2. Dept. of Computer Science & Engineering, Thapar University, Punjab, India

* Corresponding author.


Received: 19 Nov. 2011 / Revised: 5 Mar. 2012 / Accepted: 11 May 2012 / Published: 8 Aug. 2012

Index Terms

Swarm Intelligence, ants, ant colony optimization, AntNet algorithm


In this paper, we discuss the basic routing technique of ants and study the change in pheromone values at each node. Also the optimal paths can then be computed based on the shortest cumulative pheromone count between source and destination nodes. AntNet is a distributed multi-agent system inspired by the stigmergy model of communication observed in ant colonies. The ants or control packets collect information about the network conditions and are used to update and maintain the routing tables. Ants based routing is gaining more popularity because of its adaptive and dynamic nature. A number of Swarm Intelligence based, more specially Ant Colony Optimization (ACO) based routing algorithms are proposed by researchers. A version of ant routing protocol called AntNet has been implemented to work within the network simulator ns-2. Routing tables and Pheromone tables have been computed for each node in the network. On the basis of these tables we have tried to compute the shortest and most optimal path between source node and destination node.

Cite This Paper

Anuj K. Gupta, Harsh Sadawarti, Anil K. Verma, "Computation of Pheromone Values in AntNet Algorithm", International Journal of Computer Network and Information Security(IJCNIS), vol.4, no.9, pp.47-54, 2012. DOI:10.5815/ijcnis.2012.09.06


[1]Di Caro, G., Dorigo, M, "Antnet: Distributed stigmergetic control communications networks. Journal of Artificial Intelligence Research pp 317-365, 1998.
[2]Dorigo M & Gambardella L, "Ant colony system: A Cooperative learning approach to the traveling salesman problem", IEEE Transaction on Evolutionary Computation, Vol. 1, N1, pp53-66
[3]M. Heissenbilttel, T. Braun, "Ants-Based Routing in Large Scale Mobile Ad-Hoc Networks".
[4]Mesut Gunes, Udo Sorges, Imed Bouazizi, "ARA-The Ant-Colony Based Routing Algorithm for MANETs" International workshop on Ad Hoc Networking (WAHN 2002) vancouver, Canada, August 18-21, 2002.
[5]Schoonderwoerd R , Holland O Bruten J, "Ant like agents for load balancing in Telecommunication Networks", Hewlelt-Packard Laboratories, Bristol-England, 1997
[6]The NS Manual , VINT Project (Editors: Kevin Fall and Kannan Vardhan)
[7]M. Dorigo and T. Stützle. The Ant Colony Optimization.
[8]Metaheuristic: Algorithms, Applications and Advances. In F. Glover and G. Kochenberger, (Eds.), Handbook ofMetaheuristics, Kluwer Academic Publishers, pages 251-285, 2003.
[9]Singh Rajeshwar, D K Singh, Lalan Kumar (2010). "Ants Pheromone for Quality of Service Provisioning In Mobile Adhoc Networks". Int. J.Elect. Eng. Res., 2(1): 101–109.
[10]ns-2, Network simulator,
[11]C.E Perkins, E.M. Royer, and S. Das, ―Ad hoc On-demand Distance Vector (AODV), RFC 3561, July 2003.
[12]J. Baras and H. Mehta 2003. A Probabilistic Emergent Routing Algorithm for Mobile Ad hoc Networks (PERA).
[13]S. Murthy, C. Siva Ram and B.S. Manoj, ―Ad Hoc Wireless Networks: Architectures and Protocols, Prentice Hall.
[14]G. di Caro and M. Dorigo, AntNet: distributed stigmergetic control for communications network, Journal of Artificial Intelligence Research (JAIR), Vol. 9, Pag. 317-365, 1998.
[15]Anuj K. Gupta, Anil K. Verma, Harsh Sadawarti, "Analysis of various Swarm-based & Ant-based Algorithms", Proceedings of International Conference on Advances in Computing and Artificial Intelligence (ACAI 2011) July 2011, pp – 39-43. Available online in ACM DL:
[16]V. Laxmi, Lavina Jain, M.S. Gaur, "International Conference on Wireless Communication and Sensor Networks, WSCN 2006".
[17]S.S. Dhillon, P. Van Mieghem, "Performance analysis of the AntNet algorithm", Elsevier Computer Networks 51 (2007) 2104–2125.
[18]Firat Tekiner, Z. Ghassemlooy , S. Alkhayatt, "Investigation of AntNet routing algorithm by employing multiple ant colonies for packet switched networks to overcome the stagnation problem", Optical Communications Research Group, 2004.
[19]Anuj K. Gupta, Harsh Sadawarti, Anil K. Verma, "MANET routing protocols based on Ant Colony Optimization", International Journal of Modeling & Optimization (IJMO), ISSN: 2010-3697, vol. 2, no. 1, pp. 42-49, February 2012.