Dynamic routing exponent strategies for ant-based protocols

  • Authors:
  • Rui Fang;Zequn Huang;Louis F. Rossi;Chien-Chung Shen

  • Affiliations:
  • Mathematical Sciences, University of Delaware, Newark, DE;Computer and Information Sciences, University of Delaware, Newark, DE;Mathematical Sciences, University of Delaware, Newark, DE;Computer and Information Sciences, University of Delaware, Newark, DE

  • Venue:
  • EvoApplications'11 Proceedings of the 2011 international conference on Applications of evolutionary computation - Volume Part II
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

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.