Research On Intelligent Cluster Routing Algorithm For Wireless Sensor Network

Wireless sensor network is widely used in the field of military, environment, medical, industry, household etc. It has so broad application prospect that was highly emphasized by research scholars at home and abroad. Because of the limit of node energy, data processing ability, and communication capacity, designing a routing protocol which can reduce energy consumption, prolong life circle is becoming the research hot in wireless sensor net work. In this paper, the existing classical cluster routing protocol in WSN were furtherly compared and analized. Then based on those routing protocol designing concept, an efficient algoritm was proposed, which ant colony algorithm and Dijkstra algoritm were applied to solve the uneven distribution of cluster head, and the imbalance of energy comsumption.ACALEACH—an ant colony algorithm based cluster routing algorithm for wireless sensor network was proposed. Firstly, During the choosing of cluster head, Not only the remained energy of node, but also the distance between the two cluster head were taken into account, which can better balance the distribution of cluster head. Secondly, the ant colony algorithm was emplied into routing mechanism to find the optimal path, which makes cluster head far from the base station transmit informations along with the optimal path, and thus the energy overhead can be effectively reduced. Simulation result indicates that the new algorithm effectively balance the network energy consumption and prolong the network life cycle compared with LEACH and DADC.DEUC—a Dijkstra algorithm based cluster routing protocol for wireless sensor network was proposed. At first, according to the distance between candidate cluster head and SINK, net was divided into some clusters in different sizes, and then the cluster head in each clusters was chosen out based on the residual energy. Secondly, multi-hop routing and the Dijkstra algorithm were taken to figure out the shortest path from each cluster head to SINK, which makes the cluster head far from base station can transmit the information along the shortest path. The simulation result shows that the algorithm have advantages in prolonging lifecycle over LEACH and EEUC by 35% and 25% respectively.