WLC02-3: On Ant Routing Algorithms in Ad-hoc Networks

This paper shows a novel approach for routing datagrams in ad-hoc networks, called distributed ant routing (DAR). This approach belongs to the class of routing algorithms inspired by the behavior of the ant colonies in locating food and storing food. The algorithm aims at minimizing complexity in the nodes and this is achieved at the expenses of the optimality of the derived solution. The work also describes an analytical approach to the problem: The validity of the heuristic approach, ant routing, is supported by mathematical proofs and the same methods helps in the selection of the algorithm parameters. Simulation results are presented at the end to confirm the mathematical calculations.

[1]  J. Deneubourg,et al.  Self-organized shortcuts in the Argentine ant , 1989, Naturwissenschaften.

[2]  Charles E. Perkins,et al.  Ad-hoc on-demand distance vector routing , 1999, Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications.

[3]  Charles E. Perkins,et al.  Ad hoc On-Demand Distance Vector (AODV) Routing , 2001, RFC.

[4]  J. Deneubourg,et al.  Trails and U-turns in the Selection of a Path by the Ant Lasius niger , 1992 .

[5]  Luca Maria Gambardella,et al.  Ant Algorithms for Discrete Optimization , 1999, Artificial Life.

[6]  F. Oppacher,et al.  Connection Management by Ants : An Application of Mobile Agents in Network Management , 1998 .

[7]  Matteo Berioli,et al.  Routing Techniques for Ad-hoc Space Networks , 2005 .

[8]  Matteo Berioli,et al.  Ant Routing Algorithms for Irregular Satellite Constellations , 2005 .

[9]  Tarek Saadawi,et al.  Ant routing algorithm for mobile ad-hoc networks (ARAMA) , 2003, Conference Proceedings of the 2003 IEEE International Performance, Computing, and Communications Conference, 2003..

[10]  Matteo Berioli,et al.  Ant Routing Concepts for Dynamic Meshed Satellite Constellations , 2004 .