Abstract
In ant-based routing protocols, the routing exponent controls how ants hop from node to node to discover routes based on pheromone values. It has been shown that stable multi-route solutions for small routing exponent values are dynamically connected to stable single-route solutions for large routing exponent values. These stable single-route solutions correspond to paths that have the smallest hop count. In this paper, we leverage this idea to improve the performance of ant-based routing protocols by dynamically adjusting the routing exponent. The results are validated via simulation. © 2011 Springer-Verlag.
Cite
CITATION STYLE
Fang, R., Huang, Z., Rossi, L. F., & Shen, C. C. (2011). Dynamic routing exponent strategies for ant-based protocols. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6625 LNCS, pp. 21–30). https://doi.org/10.1007/978-3-642-20520-0_3
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
