• DocumentCode
    2343545
  • Title

    ARA-the ant-colony based routing algorithm for MANETs

  • Author

    Günes, Mesut ; Sorges, Udo ; Bouazizi, Imed

  • Author_Institution
    Dept. of Comput. Sci., Aachen Univ. of Technol., Germany
  • fYear
    2002
  • fDate
    2002
  • Firstpage
    79
  • Lastpage
    85
  • 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).
  • Keywords
    mobile radio; protocols; telecommunication network routing; ant colony based meta heuristic; ant colony based routing algorithm; communication end points; engineering problems; mathematical problems; mobile multi-hop ad-hoc networks; mobile nodes; on-demand routing algorithm; radio; swarm intelligence; temporary communication links; Ad hoc networks; Ant colony optimization; Computer science; Mobile ad hoc networks; Mobile communication; Mobile computing; Particle swarm optimization; Routing protocols; Spread spectrum communication; Wireless communication;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Parallel Processing Workshops, 2002. Proceedings. International Conference on
  • ISSN
    1530-2016
  • Print_ISBN
    0-7695-1680-7
  • Type

    conf

  • DOI
    10.1109/ICPPW.2002.1039715
  • Filename
    1039715