An ant-based distributed routing algorithm for ad-hoc networks

The paper describes a novel ant-based distributed route algorithm (ADRA) for ad-hoc networks. The ants move across the network between randomly chosen pairs of nodes; as they move they deposit simulated pheromones as a function of their distance from their source node, the quality of the link, the congestion encountered on their journey, the current pheromones the nodes possess and the velocity at which the nodes move. Of course, the node changes the pheromones by itself according to the quality of the link, and ages the link by pheromones evaporating. An ant selects its path at each intermediate node according to the distribution of simulated pheromones at each node. In order to accelerate the convergence rate of the congestion problem and the shortcut problem, we give the parameters different weight values to update the probability routing table. The performance of the algorithm is measured by the packet loss ratio, control overhead as well as end-to-end packet delay. The results of using the improved ant-based control protocols are compared with those achieved by using fixed shortest-path routes previously proposed for use in ad-hoc networks. The ADRA system is shown to result in fewer call failures than the other methods, while exhibiting many attractive features of distributed control.