ARA – The Ant-Colony Based Routing Algorithm for MANETs ∗ {{category ARA}}
{{paper ant/Ants.pdf}}
∗InternationalWorkshop on Ad Hoc Networking (IWAHN 2002), Vancouver, British Columbia, Canada, August 18-21, 2002 {{category 2002}}
Mesut G¨unes,, Udo Sorges, Imed Bouazizi {{category "Mesut G¨unes,"}} {{category Udo Sorges}} {{category Imed Bouazizi}}
{mesut, udo, imed }@i4.informatik.rwth-aachen.de
Department of Computer Science, Informatik 4 Aachen University of Technology Aachen, Germany
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: Ad-hoc network, MANET, Routing {{category MANET}} {{category Ant Routing}} {{category on-demand}} {{category reactive}} {{category 蓄積型}}
+[1] E. Bonabeau, M. Dorigo, and G. Theraulaz. Swarm intelligence: from natural to artificial intelligence|Swarm intelligence from natural to artificial intelligence. Oxford University Press, 1999. ISBN 0-19-513158-4. +[2] J. Broch, D. A. Maltz, D. B. Johnson, Y.-C. Hu, and J. Jetcheva. A performance comparison of multihop wireless ad hoc network routing protocols. Proceedings of the Fourth Annual ACM/IEEE International Conference on Mobile Computing and Networking (MobiCom’98), pages 85–97, 1998. +[3] M. Dorigo and G. Di Caro. The ant colony optimization meta-heuristic. In D. Corne, M. Dorigo, and F. Glover, editors, New Ideas in Optimization, pages 11–32. McGraw-Hill, London, 1999. +[4] C. E. P. (Editor). Ad Hoc Networking. Addison-Wesley, 2001. ISBN 0-201-30976-9. +[5] K. Fall and K. Varadhan. The ns Manual, Nov 2000. +[6] D. B. Johnson, D. A. Maltz, Y.-C. Hu, and J. G. Jetcheva. The dynamic source routing protocol for mobile ad hoc networks. IETF Internet draft, draft-ietf-manet-dsr-04.txt, November 2000. +[7] J. P. Macker and M. S. Corson. Mobile ad hoc networking and the IETF. Mobile Computing and Communications Review, 2(1):9–14, 1998. +[8] C. E. Perkins and P. Bhagvat. Hihgly dynamic destinationsequenced distnace-vector routing (dsdv) for mobile computers. Computer Communications Rev., pages 234–244, October 1994. +[9] C. E. Perkins, E. M. Royer, and S. R. Das. Ad hoc ondemand distance vector (aodv) routing. IETF Internet draft, draft-ietf-manet-aodv-07.txt, November 2000. +[10] C.-K. Toh. Ad hoc mobile wireless networks: protocols and systems. Prentice Hall, 2002. ISBN: 0-13-007817-4.