Minimum Spanning Tree Algorithm For Wireless Sensor Networks Based On LEACH Protocol

Wireless Sensor Networks(WSNs)is consist of a number of sensor nodes randomly distributed in the monitoring area.The sensor nodes communicate with each other in direct transmission or other node-assisted means,so as to transmit the collected information to the sink located outside the monitoring area.Due to that the energy of node is limited and it cannot charge in time,the system network will crash when the energy of the node is exhausted.Therefore,it is an important problem for WSNs to save the energy of sensor network nodes,make the best use of the energy of nodes,and extend the life of network.This paper mainly studies the combination of WSNs clustering routing protocol and minimum spanning tree algorithm,and the load balancing ability of clustering routing protocol in the combination algorithm,as well as the ability of the improved algorithm to reduce the energy cost of nodes.1.Firstly,the WSNs is divided into several clusters in LEACH protocol.Considering that the number of nodes in the larger sub-region is large,and some nodes are far away from the cluster head,more energy will be wasted if the member nodes directly communicate with the cluster head,so a spanning tree is formed in each sub-region of the network.Since the cluster head node is far from the sink node,the amount of data transmitted is large,and the energy consumption of the single hop to the sink node is too high,a spanning tree is formed between the cluster head nodes.Considering the difference of data acquisition rate and data acquisition quantity,the weight of tree was optimized.The proposed algorithm is effective in reducing the energy consumption of nodes and increasing the lifetime of the network,compared with the network model with single hop in clusters and multiple hop between clusters.2.Based on LEACH protocol,the paper improves the clustering routing protocol in WSN and improves the load balancing capability of WSNs by combining the minimum spanning tree algorithm,in addition,it can increase the service lifetime of network.For the problem of arbitrary cluster head selection,the influence of energy on the selection stage of cluster heads is considered,and the residual energy of nodes is introduced into the threshold probability of cluster head selection as a weight parameter,so that the nodes with high energy are more likely to be selected as cluster heads.To solve the problem of cluster inhomogeneity in LEACH protocol,the optimal node interval in the cluster is set.The number of nodes in clusters smaller than the lower limit of the optimal interval sends a merger invitation to the neighbor clusters,then merge with the neighbor cluster after receiving a positive reply,so as to make the clusters relatively uniform and achieve the purpose of load balancing.Finally,the minimum spanning tree was generated for the cluster-head node,and the weight of the tree was optimized considering the difference in residual energy caused by the different data volume and acquisition rate of the cluster head,as well as the distance between the cluster head and the sink.It is proved by simulation results that compared with the clustering tree based on LEACH,the proposed improved algorithm improves the load balancing ability of WSN and further prolonging the life cycle of network.