Weighted spanning tree clustering routing algorithm based on LEACH

Since wireless sensor networks have limited energy, the key issue is how to study the network by reducing the energy consumption and prolonging the network life cycle. Therefore, this paper presents the weighted spanning tree algorithm on the basis of LEACH (WST-LEACH). Firstly, the selection of cluster heads are not only completely random, but also giving comprehensive consideration of the remaining energy, the distribution density of nodes and the distance from cluster heads to the base station; Secondly, it establishes a Weighted Spanning Tree through all the cluster heads, the calculation of the weight value in the weighted spanning tree contains factors such as remaining energy of the cluster head, distribution of surrounding nodes, and the distance to the other cluster heads, then the data is sent to the base station along this tree after being integrated. It optimizes the data transmission path and reduces the energy consumption. Simulation results show that WST-LEACH reduces the energy consumption, has higher efficiency and can extend the network lifetime as well.