Research Of Wireless Sensor Networks Head Election And Communication Path Algorithm Based On LEACH

Wireless sensor network is an emerging interdisciplinary research field, which has the characteristics of easy deployment, high reliability and scalability. WSN is widely applied to many fields. However, restricted to the structure and application environment of wireless sensor network, the node uses the micro battery as the power supply energy. As we all knows, the battery energy is limited and once exhausted cannot be added. Therefore, it is very meaningful to enhance the efficiency of energy, computing power and prolong the network lifetime for wireless sensor networks.At present, there are many experts and scholars engaged in related research work. They put forward a number of related algorithms and has made some progress. In this paper, we study and analyze the classical hierarchical routing algorithm LEACH. Against the disproportionate of cluster head number and distribution, the directly transmitting mode of cluster, the edge node death fast problem, the paper proposed a new routing algorithm based on LEACH 。The main work of this paper is as follows:(1) The wireless sensor network routing protocol are summarized. The existing wireless sensor routing algorithm is classified according to the network topology structure. Though the comparison of their respective strengths and weaknesses, the exploration of advantages which LEACH has, the statement of network model and energy model, and the analysis of its working principle, the paper makes preparation for improving algorithm.(2) Select a better cluster head node. Firstly, the iterative self-organizing data analysis algorithm (ISODATA) is used to cluster the nodes of wireless sensor networks, which can obtain a more reasonable clustering structure. Then in the cluster head election process, thinking about the residual energy of nodes, the position of the node, and the distance between the node and the base station, select a more reasonable cluster head node.(3) Select a reasonable transmission path. In data communication, comprehensive considering the distance between the cluster head node and the remain energy of the cluster head node, the shortest path routing table is calculated. Then according to the shortest path routing table, the cluster head nodes uses multi hop transmission data to transmit data.(4) Test and analysis the experiment through MATLAB simulation software. This paper makes a comparative analysis from four aspects:the network lifetime, the receiving data of the base station, the energy consumption of the whole network, the distribution of cluster head and the balance of the death node.Experimental results show that, the improved algorithm in this paper can effectively reduce the energy required for cluster head election, rationalize the distribution and number of cluster heads, effectively extend the life cycle of the entire network, and the energy consumption of the whole network nodes more uniform, which provides reference for the further research of WSN.