ARA - The Ant-Colony Based Routing Algorithm for MANETs

Mesut Güneş, Udo Sorges, Imed Bouazizi

Proceedings of the 2002 ICPP Workshop on Ad Hoc Networks (IWAHN 2002), (Stephan Olariu Ed.), Vol. 00, Routing, pp. 79-85, Los Alamitos, CA, USA: IEEE Computer Society, August 2002

2007

Text

@inproceedings{Guenes+:2002c, author = {Mesut G\"unes and Udo Sorges and Imed Bouazizi}, title = {{ARA - The Ant-Colony Based Routing Algorithm for MANETs}}, booktitle = {Proceedings of the 2002 ICPP Workshop on Ad Hoc Networks (IWAHN 2002)}, year = {2002}, editor = {Stephan Olariu}, volume = {00}, pages = {79-85}, address = {Los Alamitos, CA, USA}, month = {August}, publisher = {IEEE Computer Society}, abstract = {A mobile ad-hoc network (MANET) is a collection of mobile nodes which communicate over radio. These kind of networks are very flexible, thus they do not require any existing infrastructure or central administration. Therefore, mobile ad-hoc networks are suitable for temporary communication links. The biggest challenge in this kind of networks is to find a path between the communication end points, what is aggravated through the node mobility. In this paper we present a new on-demand routing algorithm for mobile, multi-hop ad-hoc networks. The protocol is based on swarm intelligence and especially on the ant colony based meta heuristic. These approaches try to map the solution capability of swarms to mathematical and engineering problems. The introduced routing protocol is highly adaptive, efficient and scalable. The main goal in the design of the protocol was to reduce the overhead for routing. We refer to the protocol as the Ant-Colony-Based Routing Algorithm (ARA).}, doi = {http://doi.ieeecomputersociety.org/10.1109/ICPPW.2002.1039715}, owner = {guenes}, timestamp = {2007.08.23}, type = {Routing} }