Please use this identifier to cite or link to this item:
|Title:||Ant based probabilistic routing with pheromone and antipheromone mechanisms||Authors:||Sandalidis, Harilaos G.
Mavromoustakis, Constandinos X.
|Keywords:||Adaptive routing;Ant system;Probabilistic routing;Pheromone and antipheromone principles||Issue Date:||2004||Publisher:||John Wiley & Sons, Ltd||Source:||International Journal of Communication Systems. Volume 17 Issue 1, Pages 55 - 62||Abstract:||Using the idea of probabilistic routing, calls in an ant based decentralized scheme are not routed according to the largest probabilities in the pheromone tables but randomly according to these probabilities. This principle can be particularly helpful in order to further minimize possible node congestion problems. An additional incorporation of the antipheromone mechanism in the operation of artificial ants helps in better biasing the network. This paper examines the behaviour of such a routing scheme using a proper set of suitable metrics.||URI:||http://ktisis.cut.ac.cy/handle/10488/1066
|DOI:||10.1002/dac.630||Rights:||© 2004 John Wiley & Sons, Ltd.||Type:||Article|
|Appears in Collections:||Άρθρα/Articles|
Show full item record
WEB OF SCIENCETM
checked on Nov 18, 2017
Page view(s) 5030
checked on Nov 24, 2017
This item is licensed under a Creative Commons License