USING ANT AGENTS TO COMBINE REACTIVE AND PROACTIVE STRATEGIES FOR ROUTING IN MOBILE AD-HOC NETWORKS

This paper describes AntHocNet, an algorithm for routing in mobile ad-hoc networks based on ideas from the ant colony optimisation framework. In AntHocNet a source node reactively sets up a path to a destination node at the start of each communication session. During the course of the session, the source node uses ant agents to proactively search for alternatives and improvements of the original path. This allows to adapt to changes in the network, and to construct a mesh of alternative paths between source and destination. The proactive behaviour is supported by a lightweight information bootstrapping process. Paths are represented in the form of distance-vector routing tables called pheromone tables. An entry of a pheromone table contains the estimated goodness of going over a certain neighbour to reach a certain destination. Data are routed stochastically over the different paths of the mesh according to these goodness estimates. In an extensive set of simulation tests, we compare AntHocNet to AODV, a reactive algorithm which is an important reference in this research area. We show that AntHocNet can outperform AODV for different evaluation criteria in a wide range of different scenarios. AntHocNet is also shown to scale well with respect to the number of nodes.