Research On Cluster Head Election And Optimization Algorithm Based On LEACH Protocol

With the rapid development of the Internet of things,WSN(Wireless Sensor Networks)technology has entered people's lives,wireless technology has also been rapid development,and gradually change people's life.WSN technology is based on embedded technology,wireless communication technology and sensor technology,it consists of many low-cost,low power consumption,short communication distance of the minisensor,form a network through wireless communication.Most of the sensor nodes in the WSN are deployed in extremely harsh environments,and due to their own computing speed is slow,small memory,limited energy and other factors of great constraints.So how to reduce the energy consumption of the network,to extend the survival time of WSN has become a huge test of the technology.This thesis further studies WSN routing protocol,in which LEACH routing protocol is the theoretical basis of this thesis.LEACH routing protocol is a classical hierarchical routing protocol,it is based on the cluster head rotation mechanism bring more consume energy evenly distributed to the whole sensor network.By analyzing the working principle of LEACH routing protocol,it was found that due to the randomness of cluster head selection,the whole sensor network can not get the optimal cluster number,and can not determine the optimal position of the cluster head,this may lead to some areas of the cluster head more concentrated,some areas without cluster head,which causes the distance between some non cluster head node and the cluster head node is too large,Then the node in the data transmission phase is bound to consume a lot of energy.And LEACH routing protocol does not consider the node's residual energy in the election stage of cluster head,such it is possible to select nodes with lower energy as cluster head nodes,thus affecting the life of the whole network.This thesis according to the energy consumption characteristics of LEACH routing protocol,improving it based on LEACH routing protocol.Firstly,calculated by the optimal number of cluster heads in the whole wireless sensor network,then the whole area is divided into two equal areas from the central line according to the position of the base station.Where the area closer to the base station is defined as S1 and the other area is defined as S2.And then according to the number of optimal cluster head assign cluster head to S1 and S2,ensure that the number of cluster heads of S1 is much larger than that of S2.S1 and S2 according to the number of clusters of the average division of the respective regions,to ensure that each region has a cluster head,through such way non-uniform clustering.Secondly,the energy factor and the nodal scale factor are introduced in the algorithm.Through the energy factor to ensure that sensor nodes have the larger residual energy and higher than the network average residual energy have a greater probability to become cluster head;At the same time,it can ensure that the sensor nodes of distributed in the relatively dense regions have more probability to be cluster head.Finally,the data is transmitted by multi-hop,using binomial trees method calculated by the transmission path.This can effectively avoid the "void spots" problem.The end of the thesis,the simulation experiment of the LEACH algorithm and the simulation experiment of the improved algorithm are carried out by using the simulation software,analyzing the experimental results,verify the effectiveness of the improved algorithm.And simulate the topological graph of network of the LEACH algorithm and the improved algorithm.