Research And Improvement Of Wireless Sensor Networks Clustering Routing Algorithm Based On LEACH

Wireless sensor networks is a new science, which integrates computer technology, modern communication, microelectronics, embedded systems, distributed information processing and so on.WSNs is constitute of a large number of micro sensor nodes, which own sensing, computing and communicating capability.Those nodes turn into a network via the self-organization theory, and cooperate with each other to complete a variety of information transmitted tasks.WSNs doesn’t need fixed infrastructure, however it connects objective world with the Internet. WSNs has been widely used in many fields, such as military defense, health care and smart home. With the rapid development of science and technology, it will be bound to become one of the most influential technology of the21st century.Compared with the traditional network, wireless sensor networks is a resource-constrained network. The nodes’ computing ability, storage capacity and energy are very limited. Once the node runs out of energy, and doesn’t obtain replenished timely, which will directly affect the running of the entire network. The research shows that the node energy mainly consumes in the communication module, and then selecting the appropriate path to transfer data becomes particularly important, so the design of energy-efficient routing algorithm has a very important practical value. Due to its unique advantages and great commercial value, Wireless sensor networks receives more and more attention, and the study of the wireless sensor network has become the focus of academic research. The routing algorithm’s theoretical research and practical applications is one of the hot spots.This paper introduces WSNs and its architecture in detail, and describes the unique advantages of WSNs and its routing algorithm classification at first. Next the paper presents some classic routing algorithm, and does a more deep study on LEACH algorithm. According to the shortages of the LEACH algorithm, the paper does corresponding improvements:the number of cluster head, the distribute of cluster head.It introduces the concept of the optimal number of cluster head, proves that the number of cluster head in a WSNs is not random,and solves the improper number of cluster head in LEACH algorithm.In the division of the area, it uses the classical K-means algorithm to avoid that the cluster head is in charge of the larger coverage area or the coverage areas overlap.During selecting the cluster head it considers the distribution and the energy status of the nodes, solving the uneven distribution of cluster head. Finally, it changes the way of communication between the cluster head and the Sink node in LEACH algorithm, replacing the single-hop with the multi-hop.We use MATLAB to simulate the improved algorithm, compared to the LEACH and LEACH-C algorithm in the performance of the WSNs, such as the number of the cluster head, the distribution of the cluster head, residual energy.The results show that the improved algorithm’s energy consumption is more evenly, and the death time of the nodes is later, and the stability of the network is improved. In short, the improved algorithm makes the network’s performance has been greatly improved.