2nd International ICST Conference on Autonomic Computing and Communication Systems

Research Article

QoS-aware Ant Routing with Colored Pheromones in Wireless Mesh Networks

Download70 downloads
  • @INPROCEEDINGS{10.4108/ICST.AUTONOMICS2008.4676,
        author={Martina Umlauft and Wilfried Elmenreich},
        title={QoS-aware Ant Routing with Colored Pheromones in Wireless Mesh Networks},
        proceedings={2nd International ICST Conference on Autonomic Computing and Communication Systems},
        publisher={ICST},
        proceedings_a={AUTONOMICS},
        year={2010},
        month={5},
        keywords={Self-organizing networking ant routing bio-inspiration QoS},
        doi={10.4108/ICST.AUTONOMICS2008.4676}
    }
    
  • Martina Umlauft
    Wilfried Elmenreich
    Year: 2010
    QoS-aware Ant Routing with Colored Pheromones in Wireless Mesh Networks
    AUTONOMICS
    ICST
    DOI: 10.4108/ICST.AUTONOMICS2008.4676
Martina Umlauft1,*, Wilfried Elmenreich2,*
  • 1: Institute of Software Technology and Interactive Systems, Business Informatics Group, Vienna University of Technology, Vienna, Austria.
  • 2: Lakeside Labs, Mobile Systems Group, Institute of Networked and Embedded Systems, University of Klagenfurt, Klagenfurt, Austria.
*Contact email: umlauft@big.tuwien.ac.at, wilfried.elmenreich@uni-klu.ac.at

Abstract

Inspired by the collective foraging behavior of specific ant species, ant-based routing algorithms are able to find optimal or near optimal packet routes for Wireless Mesh Networks. Ant-based algorithms work by deploying artificial pheromone at the network paths, which is then used for future routing decisions. Using this approach, the routing can be optimized according to different criteria like packet delay, delay jitter, or maximum bandwidth. For a typical mesh network, we assume to have different classes of traffic posing different requirements on the quality of service of the communication. Therefore, we propose a concept for ant routing with colored pheromones (CPANT), where a color corresponds to a particular class of traffic. Thus, the network will treat the packets of an application according to the specific application requirements packet delay, delay jitter, and bandwidth. We show that this approach can outperform ant routing approaches that are not aware of different traffic classes when the specific traffic requirements are taken into account.