A Routing Algorithm Based on Ant-Colony in Wireless Sensor Networks

High efficient routing is an important issue in the limited energy resource wireless sensor networks. Introducing Ant-colony algorithm, this paper proposes the wireless sensor network routing algorithm based on the LEACH. During the construction of sensor network clusters, only the nodes whose residual energy is higher than the average energy can be chosen as the cluster heads to avoid the node premature death due to the energy consumption. The method of repeated division is used to divide the clusters in sensor networks so that the numbers of the nodes in each cluster are balanced. The ant-colony algorithm is adopted to realize and maintain the routing between the cluster heads and sink. The analysis and the simulation show that the proposed routing protocol can reduce the energy consumption, balance the energy consumption between nodes, and prolong the lifetime of networks.