Research Of Energy-saving Routing Protocols In Wireless Sensor Network Based On Clustering

Wireless Sensor Network (WSN) is constructed by the sensor nodes which have the self-organization ability in the deployment zone. With the development of information society, the ability of data collecting become more and more important in relevant application areas, while, the WSN with well-adjusted and easily constructed characteristic provides huge convenient for these. In WSN, the resource such as power is limited and data routing is the most partition of energy consumption, but some extreme application environment usually decides that people cannot replace the disabled nodes with new ones in time. So, the research for designing efficient routing protocols is very significant for prolonging the lifespan of WSN and increasing the usability of network.This paper introduces the concept and characteristics of WSN first and has a simple description to the situation and challenges in current research. Then the existing routing protocols are classified and the representative protocols in different types are analyzed, with indicating the main points should be cared in designing the routing protocols. At the same time, based on the classical hierarchical Low Energy Adaptive Clustering Hierarchy protocol, the paper does the research from four aspects including the selection of cluster-heads, distribution of cluster-heads, multi-hop among cluster-heads and the extension of communication time in clusters. The main works is as follows:First, the paper expounds the work process and the randomness of LEACH’s threshold formula during the selection of cluster-heads. By introducing the factors of energy and distance, sensor nodes with more energy can have a better chance to act as cluster-heads, which is of benefit to the balance of energy.Second, based on the energy consumption model of sensor nodes, the paper analyzes the best number of cluster-heads and points out the disadvantage while the cluster-heads locates too close. Then the ideas that the high energy base station controls the generation of cluster-heads and optimize the location distribution of cluster-heads by the way of shortest distance iteration is proposed to save the energy.Third, after analyzing the disadvantage of single hop in data transmitting of LEACH by formula derivation, the relative energy saving divisor is introduced. So each cluster-head can make use of the routing table which includes the information of relative energy saving divisor to choose the appropriate next hop for consuming less energy as multi-hop communication.Fourth, based on the characteristic of period clustering in LEACH, the paper proposes to choose a subsequent cluster-head for each cluster with considering the residual energy of member nodes, which can diminish the energy spending in large-scale re-clustering.During the research, the network simulation tool NS2is used to prove the results of improved algorithm are better than LEACH in saving network energy and prolong the lifetime of network.At last, the main works of the paper are concluded and the future research direction gets exposition.