An ant-routing algorithm for wireless sensor networks

Abstract

A wireless sensor network (WSN) has resource constraints, which include a limited amount of energy, short communication range, low bandwidth, and limited processing and storage in each node. In this paper, an ant-routing algorithm is presented for wireless sensor networks. In the algorithm, ants are guided to choose different paths by adjusting heuristic factor. Mean-while, the weights are dynamically coordinated in the probability function. The evaporation coefficient of pheromone is improved by utilizing the idea of simulated annealing algorithm. In order to prevent local optimization, it introduces a reward and punishment mechanism into the pheromone update process. The simulation results show that the algorithm is better than the other current typical routing algorithms. © 2011 Springer-Verlag Berlin Heidelberg.