Computation of Pheromone Values in 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.

[1]  Marco Dorigo,et al.  AntNet: Distributed Stigmergetic Control for Communications Networks , 1998, J. Artif. Intell. Res..

[2]  Piet Van Mieghem,et al.  Responsible Editor: A. Kshemkalyani , 2006 .

[3]  Yaakov Bar-Shalom,et al.  Applications and advances , 1992 .

[4]  F. Tekinera,et al.  Investigation of antnet routing algorithm by employing multiple ant colonies for packet switched networks to overcome the stagnation problem , 2004 .

[5]  Torsten Braun,et al.  Ants-Based Routing in Large Scale Mobile Ad-Hoc Networks , 2003, KiVS Kurzbeiträge.

[6]  Luca Maria Gambardella,et al.  Ant colony system: a cooperative learning approach to the traveling salesman problem , 1997, IEEE Trans. Evol. Comput..

[7]  Imed Bouazizi,et al.  ARA-the ant-colony based routing algorithm for MANETs , 2002, Proceedings. International Conference on Parallel Processing Workshop.

[8]  Charles E. Perkins,et al.  Ad hoc On-Demand Distance Vector (AODV) Routing , 2001, RFC.

[9]  Thomas Stützle,et al.  The Ant Colony Optimization Metaheuristic: Algorithms, Applications, and Advances , 2003 .

[10]  Anuj K. Gupta,et al.  Analysis of various swarm-based & ant-based algorithms , 2011, ACAI '11.

[11]  Janet Bruten,et al.  Ant-like agents for load balancing in telecommunications networks , 1997, AGENTS '97.

[12]  Zabih Ghassemlooy,et al.  Investigation of antnet routing algorithm by employing multiple ant colonies for packet switched networks to overcome the stagnation problem , 2004 .

[13]  C. Siva Ram Murthy,et al.  Ad Hoc Wireless Networks: Architectures and Protocols , 2004 .

[14]  Anuj K. Gupta,et al.  MANET Routing Protocols Based on Ant Colony Optimization , 2012 .

[15]  John S. Baras,et al.  A Probabilistic Emergent Routing Algorithm for Mobile Ad Hoc Networks , 2003 .