loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2002 International Conference on Parallel Processing Workshops (ICPPW'02)
ARA — The Ant-Colony Based Routing Algorithm for MANETs
Vancouver, B.C., Canada
August 18-August 21
ISBN: 0-7695-1680-7
Mesut Gü;neş, Aachen University of Technology
Udo Sorges, Aachen University of Technology
Imed Bouazizi, Aachen University of Technology

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).

Index Terms:
Keywords: Ad-hoc network, MANET, Routing
Citation:
Mesut Gü;neş, Udo Sorges, Imed Bouazizi, "ARA — The Ant-Colony Based Routing Algorithm for MANETs," icppw, pp.79, 2002 International Conference on Parallel Processing Workshops (ICPPW'02), 2002
Usage of this product signifies your acceptance of the Terms of Use.