Wireless Sensor Networks Leach Routing Algorithm Improvements

Wireless sensor networks (WSN) is a low-cost, low power, small size and short communication distance miniature sensor module through the network linking the form of self-organization. The clustering structure of the cluster head election and energy consumption is the hierarchical WSN important issue. The cluster head election determines the degree of network coverage of the WSN, Also determine the ability of monitoring the physical world, Energy consumption determines the lifetime of WSN.LEACH protocol is a typical WSN routing protocol, it has the advantage of hierarchical routing protocols; Cluster head election and cluster routing are still deficiencies. To solve these problems, This paper studies how to reduce the LEACH protocol routing energy consumption, We propose the optimization program,First, In this thesis presents the REOC algorithm, The new algorithm takes into account the election of cluster head residual energy of the amendment,Number of clusters adjusting and optimizing the clustering scale. The simulation results show that the REOC routing algorithm relative LEACH allows WSN's lifetime extended28.8%and7.2%increase in network robustness.Second, In this thesis proposes the PDSL cluster routing algorithm to optimize the LEACH protocol, the cluster head dynamically select single-hop routing or multi-hop routing, Saving network energy consumption and energy balance between nodes, At the same time the transmission of data to provide differentiated services. The simulation results show that the new algorithm allows WSN's lifetime is extended by14.2%relative LEACH, and Avoid network hot spot phenomenon, Also the most important data timely and effective transfer to the gateway.