Research On WSN Cluster Head Election Strategy And Routing Algorithm Based On The LEACH Protocol

The wireless sensor network is made up of a large number of micro sensor nodes, which collect a variety of data for the area that the network cover through mutual cooperation and collect the information that users need from all kinds of environments or detective objects. It links the ysical world, digital virtual world and human society closely together with a new calculation theory called "ubiquitous computing". Wireless sensor network, as a frontier area of research has made some development but still in the stage of development and has great development potential.In order to achieve the existing and potential applications of wireless sensor, the fine and icient communication protocols are necessary, but because of the limited feature of the sensor ode, they make the communication protocols face huge challenges in terms of power consumptions. In view of this, the paper makes research about how to solve the problem of power consumption, improve the network life based on wireless sensor network routing protocols. The following gives the main works of the paper:First of all, the paper introduces some basic concepts about the sensor network and describes the characteristics of the wireless sensor network and the sensor nodes deeply. It summarizes the difference of the wireless sensor network and the ordinary sensor network, some typical applications and potential value of wireless sensor.Secondly, the paper introduces communication protocols of the wireless sensor network in detail, mainly makes an introduction about wireless sensor network routing protocols, which includes the characteristics, contrivable requirements and classification of WSN routing protocols. It also makes a comparative analysis for planar routing protocol and clustering routing protocol, overviews and analyses for several typical clustering routing protocols at the same time and makes a detailed analysis on the advantages and disadvantages of various protocols.Then, a new optimization algorithm according to the number of cluster heads called LEACH-ONC is proposed when the paper makes comprehensive analysis about LEACH algorithm according to the research status of the current clustering routing algorithm. The algorithm, which is on the basis of LEACH, from the perspective of network minimal energy consumption, making use of the network life to predict model, firstly predicts the dead time of the network nodes, then brings network convergence which is defined in the paper into the optimal algorithm, infers the number of the optimal cluster heads at last. The fact that the number of cluster heads change with the number of nodes in the network ensures the number of cluster heads is optimal, reduces energy consumption rate of network nodes effectively and prolongs the life cycle of the network. The simulation results show that, the proposed algorithm reduces energy consumption obviously compared with LEACH algorithm, prolongs the life span of the network effectively.Finally, the algorithm called CBSRM is proposed when making a comprehensive analysis for routing policy about LEACH algorithm and RBMC algorithm according to the current status of clustering routing algorithm on the basis of the above paper. CBSRM algorithm makes an independent split ring for the network, removes the man-made fixed split ring mode, keeps the number of cluster heads of every ring is same, forms the stable heterogeneous cluster network model. According to simulation results, we can know that CBSRM algorithm prolongs the network life cycle effectively and improves the stability of the entire network.