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.
On Ant Routing Algorithms in Ad-hoc Networks.
ROSATI, LAURA;REALI, Gianluca
2006
Abstract
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.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
