An Improved Algorithm Of Wireless Sensor Network Routing Protocol Based On The Protocol LEACH

The development of wireless sensor networks was constrained by the bottleneck of energy. In general, improving network routing protocol is an important aspects to improve wireless sensor networks. More specifically, methods are focused on improving the ability of sensor nodes to calculate and survive, thus to reduce the energy consumption, and finally extend the lifetime of the entire network.There are already a lot of scholars engaged in related research works, they proposed lots of related protocol algorithms, and made some progress. LEACH algorithm does the clustering in every round, and select cluster heads in the whole network. In this paper, we proposed an improved routing algorithm based on LEACH routing protocol. First, the improved algorithm proposed do the clustering for only once. Then, in the rest of time, we chose new cluster heads within the small cluster that clustered in the first time. This reduced the energy consumption of the nodes effectively. Second, when choosing cluster heads within the scope of cluster, the improved algorithm proposed in this paper took into account the residual energy of nodes, node density and the distance between common nodes and sink nodes.Main works in this paper are as follows:(1) We cluster networks into groups with cluster algorithm. We used the Iterative Self-Organizing Data Analysis Techniques Algorithm(ISODATA) to do the cluster. After clustering, the nodes in the wireless sensor network were separated into several clusters with different area. For each node, the cluster it belongs to will never change in the rest of time, thus to reduce the energy and time consumption of cluster process in every round as the traditional LEACH algorithm. Besides, this reduced the energy consumption of the nodes for waiting and receiving the broadcast from cluster heads.(2) We consider various factors when choosing cluster heads. When choosing cluster heads within the scope of cluster, the improved algorithm proposed in this paper took into account the residual energy of nodes, node density and the distance between common nodes and sink nodes. This cluster head selection strategy is more effective than the traditional one. All of these improvement measures effectively reduced the nonessential energy consumption of nodes when transfer information between each other and finally extend the lifetime of the entire network.(3) With the help of MATLAB software, we do several controlled experiment to compare the performance of the traditional LEACH algorithm with the best cluster head rate and the improved algorithm we proposed.We proposed an improved routing algorithm based on LEACH routing protocol. Improved points of this study can be summarized as follows:(1) The improved algorithm proposed in this paper do the clustering for only once. In the rest of time, we chose new cluster heads within the scope of cluster that clustered in the first time.(2) We proposed an combination of factors including residual energy of nodes, node density, the distance between common nodes and sink nodes when choosing a cluster head, thus to choose better cluster heads.Experiments show that the improved algorithm proposed in this paper significantly improved the lifetime of sensor network than the traditional LEACH algorithm. The algorithm provides a valuable basis for the research of wireless sensor networks and contribute to the deeply research in the future.