Research On Energy-efficient Clustering Routing Algorithm For Wireless Sensor Network

Wireless sensor network(WSN) is a kind of complicated network which consists of a number of sensor nodes in the form of self-organization and multiple hopping. As the underlying hardware of wireless sensor network, energy consumption exists in the process of signal perception, collection and transmission. Due to the limitation of node energy, effective energy-saving measures should be taken to prolong the network life cycle. Routing algorithm is an important energy saving technology in WSN, which has been closely watched. In the network, clustering routing algorithm has outstanding advantage with its efficient node management system. In this paper, the clustering routing algorithm is introduced, and two kinds of energy-efficient clustering routing algorithm are put forward for the purpose of energy efficiency and energy consumption balancing. The main contents are as follows:(1)Aiming at the typical clustering routing algorithms, the LEACH, HEED, EECS, EEUC algorithm are analyzed. Through the discussion of the election of cluster head, cluster structure formation, data transmission, their advantages, disadvantages and applicability are pointed out.(2)In view of the existing problems of typical LEACH algorithm: large freedom degree of cluster head, unbalanced spatial distribution, large cost of frequently restructuring cluster, putting forward a kind of energy-efficient clustering routing algorithm based on KFCM called ESCAK. The algorithm introduced KFCM clustering algorithm to cluster the nodes, which turned the whole network into similar size, relatively homogeneous clusters. Then the high quality cluster heads were chosen by the factors such as geometric center, node energy. The simulation results show that the ESCAK algorithm is superior in balanced energy consumption, network overhead and the death time of nodes, compared to the LEACH algorithm.(3)With regard to the limitations of sensor node position and energy in the system of solid wine cellar temperature measuring based on WSN, which lead to unbalanced energy consumption causing the nodes a premature death, putting forward a kind of uneven clustering algorithm based on differential evolution algorithm called UCDE. UCDE algorithm cuts the each "round" frequently selected cluster mechanism of the traditional clustering routing algorithm, taking the node coverage as the objective function of the differential evolution algorithm to select fixed number of cluster head all at once based on the stability of the system. Besides, the cluster heads are divided by gradient stage, and jumping mechanism is utilized between the clusters with strong pertinence as well as the energy difference matching strategy, resulting in the reasonable allocation of cluster head nodes and the initial energy of nodes, which extend the life of the network. The simulation results show that the UCDE algorithm has advantages in aspects such as optimizing cluster structure, balancing the node energy consumption.