@inproceedings{Guenes+:2003c,
  title = {Ant-Routing-Algorithm ({ARA}) For Mobile Multi-Hop Ad-Hoc Networks -- New Features And Results},
  author = {Mesut G{\"u}nes and Martin K\"ahmer and Imed Bouazizi},
  booktitle = {Proceedings of the 2nd Mediterranean Workshop on Ad-Hoc Networks (Med-Hoc-Net'2003)},
  year = {2003},
  address = {Mahdia, Tunesia},
  editor = {Abdelfettah Belghith and Sami Tabbane and Naouel Ben Ali and Achraf Gazdar},
  month = {25-27, June},
  pages = {9--20},
  abstract = {A mobile ad-hoc network (MANET) is a collection of mobile nodes which communicate over radio. These networks have an important advantage, they do not require any existing infrastructure or central administration. Therefore, mobile ad-hoc networks are suitable for temporary communication links. This flexibility, however, comes at a price: communication is difficult to organize due to frequent topology changes. Ant algorithms are a class of swarm intelligence and try to map the solution capability of ant colonies to mathematical and engineering problems. The Ant-Colony-Based Routing Algorithm (ARA) is based on ant algorithms. The main properties of the algorithm are high adaptive, efficiency. In this paper we present some extensions to the basic idea and show through simulation results the performance gain and compare it with AODV and DSR.},
  owner = {guenes},
  timestamp = {2007.08.23},
  type = {Routing},
}