ACO-based routing algorithm for wireless sensor networks (ARAWSN)

How to get high efficient data routing for the limited energy resource networks is an important problem in the study of the wireless sensor networks. Appling the Ant Colony Optimization Algorithm (ACO) on the routing of wireless sensor networks, we proposed an ACO-based routing algorithm for wireless sensor networks called ARAWSN. The algorithm utilized the self-organization, self-adaptability and dynamic optimization capabilities of the Ant Colony to build and maintain the optimal network path. It adopted the conception of Stigmergy to minimize the flow number of the control information and achieve high efficient data transitions for the network. In our experiment, the average time delay using the ACO-based routing algorithm is comparative to that of Directed Diffusion (DD) algorithm but has notable effect in the energy cost of routing compared to DD algorithm. In addition , this algorithm also has good dependability and high adaptability. And it can also achieve congestion control and energy balance for wireless sensor networks if needed.