Research On Routing For Wireless Sensor Networks Based On Ant Colony Optimization Strategy

With the rapid development of wireless communication, sensors, computers, and other series oftechniques, the application of wireless sensor network (Wireless Sensor Network, WSN) has becamemore and more universal. Such as MAC layer protocol, the network routing protocols which werematurer could not be directly used for wireless sensor network. As the wireless sensor network wascharacterized by limited energy, poor working conditions, volatile network topology and data correlation,an appropriate routing algorithm needed to be developed, which could balance the impact of theperformance made by the various adverse factors. Thus wireless sensor routing design had become acurrent research hot spot.In this paper, some classic routing protocols for wireless sensor network were analyzed, someclustering algorithms and ant colony algorithms were researched. Then on the basis of analyzing somelack of clustering algorithm in routing protocol, a clustering algorithm based on the ant colony clusteringalgorithm was put forward. The improved ant clustering algorithm was used to accomplish unequalclustering. The speed of convergence could be accelerate by the pheromones feedback mechanism of antcolony. Then this cluster head was selected according to the energy consumption and the distance to theclustering center. Meanwhile, a path utility function was designed, which took into account both theresidual energy of each node on the transmission path and the total energy consumption. Throughcalculating the function, a cluster head with more residual energy was selected as the next hop, forming amulti-hop routing to the sink node. The simulation results showed that, compared with LEACH andclustering algorithm based on improved particle swarm clustering, the algorithm could reduce the energyconsumptions of the cluster head node which was far away from sink node, balance routing energy costsand prolong the network survival period.According to the lack of the higher communication cost of LEACH algorithm and the faster energyconsumption of the EEUC algorithm in cluster head, a clustering routing algorithm based on ant colonyoptimization was proposed. Through the way of broadcast timing, a cluster head was selected, then tocomplete unequal clustering. In the broadcast time, the node’s residual energy was considered to balanceenergy consumptions of nodes. For inter-cluster routing, the optimal path evaluation was added to the ant colony algorithm. It was utilized to guarantee the search of communication path among cluster headswhich came up to the mark of reducing the energy consumption to the most degree, so as to prolong thenetwork lifetime cycle. The simulation results show that, compared with the traditional LEACHalgorithm and EEUC algorithm, the algorithm could effectively solve the hot-spot problem, find theoptimal path, balance the network energy consumption and prolong the network life cycle.