ARA - The Ant-Colony Based Routing Algorithm for MANETs
ICPPW '02 Proceedings of the 2002 International Conference on Parallel Processing Workshops
A bio-inspired architecture for division of labour in SANETs
Proceedings of the 1st international conference on Bio inspired models of network, information and computing systems
AntNet: distributed stigmergetic control for communications networks
Journal of Artificial Intelligence Research
Ant colony optimization for routing and load-balancing: survey and new directions
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Probability routing algorithm for mobile ad hoc networks' resources management
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
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.