Computation of Pheromone Values in AntNet Algorithm | Zendy

Anuj Gupta | Zendy; Harsh Sadawarti | Zendy; Anil Kumar Verma | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Computation of Pheromone Values in AntNet Algorithm

Author(s) -

Anuj Gupta,

Harsh Sadawarti,

Anil Kumar Verma

Publication year - 2012

Publication title -

international journal of computer network and information security

Language(s) - English

Resource type - Journals

eISSN - 2074-9104

pISSN - 2074-9090

DOI - 10.5815/ijcnis.2012.09.06

Subject(s) - computer science , node (physics) , swarm intelligence , ant colony , shortest path problem , routing table , routing (electronic design automation) , network packet , ant colony optimization algorithms , stigmergy , distributed computing , routing protocol , computer network , artificial intelligence , algorithm , theoretical computer science , particle swarm optimization , graph , structural engineering , engineering

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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research