Research Of Energy-balanced And Clustering Routing Scheme In Wireless Sensor Network

With its unique technical advantages, more and more research attention act in Wireless sensor networks. As the sensor node's own factors, there is a serious energy constraint. How to extend the network lifetime of sensor networks without affecting the function under the premise of the energy efficient use of the node, in order to play a potentially great value becomes wireless sensor network routing protocol design of the primary considerations. Thus, energy-efficient routing protocol for wireless sensor networks research has important significance.In this paper, the wireless sensor network routing protocols is based on clustering level research. Analysis and discussion of several levels of routing protocols targeted algorithm , Reference the excellent idea of inspiration, from the viewpoint of energy balance and studies to cut, proposed a clustering-based, energy-balanced level of routing protocols EBCRS (Energy-balanced and Clustered Routing Scheme). Based on the three-stage that is gathered to form, Clustering generated and node routing, EBCRS proposed some idea and methods in these three areas for improvement:1,In clustering leader formation stage, according to a strategy, calculate each node's residual energy and the numbers of its neighbor nodes. Let those nodes which have the most remaining energy and maximum connectivity be the clustering head. It takes into account various factors to elect clustering leader so that each leader has a local optimum characteristics. 2,In clustering generation stage, the ordinary nodes select the node that the distance between them is shortest and the selected node has the least connectivity numbers to join in. Calculate the distance between the ordinary node and the leader as well as the leader's connectivity to numerical regularization. The ordinary nodes compute their weighted average as the cost to join the cluster. The clustering approach is aim to balance all energy load, so the formed cluster divide the whole network evenly.3,In the data routing phase, drawing on the idea of simulated annealing algorithm, based on degree-constraint and energy consumption, select each leader's next-hop. It can avoid the problem of energy hotspot. In the data routing process, in order to reduce energy cost of telecommunication, nodes are all followed the selection rules of single-hop and multi-hop routing during data transmission step in the internal clusters. Between clusters, the communication is through each leader's next-hop to routing destination.