Research On Hierarchical Energy Saving Routing Algorithm For Wireless Sensor Networks

Routing protocol is one of the key technologies in wireless sensor networks,which can reduce the energy consumption efficiently in the data transmission phase.In the current research on routing protocol,the hierarchical energy saving algorithm has the advantages of high energy efficiency and network robustness.On this basis,two kinds of hierarchical energy saving algorithms for wireless sensor networks are proposed in this thesis:1.Aiming at the problems that the existing chain-based routing algorithms have larger network latency and don't consider enough factors resulting in unbalance of energy consumption while selecting the leader node,a multi-chain algorithm for wireless sensor networks based on energy balance is proposed in this thesis.Firstly,the algorithm determines the number of sub-regions to be divided according to the network energy balance.Then by using static clustering,each sub-region selects its leader node and then the leader nodes establish tree topology based on the parameters of path loss,gradient and residual energy.Finally,in the set of the current leader nodes,a root node is selected by taking account of the degree of node,the residual energy and the distance between the Base Station.In addition,to avoid the topology changing at each round resulting in additional energy consumption,the recombination frequency of topology need to be controlled during the processing of algorithm.The simulation results show that the proposed algorithm has advantages of low transmission delay and energy consumption,and thus obviously improve the performance of network.2.Due to that the existing routing algorithms for wireless sensor networks based on small world properties add logical links with randomness and do not take into account the energy consumption of the sending nodes,a hierarchical routing algorithm for wireless sensor networks based on small world network model is proposed.Firstly,the sensor nodes are randomly deployed in the monitoring area and are divided into high-energy sensor nodes and low-energy sensor nodes.The proposed algorithm adopts static clustering,and each cluster selects the cluster head node based on the reliability of data transmission.If a low-energy sensor node is selected as the cluster head,then it will choose the nearest cluster node as the next-hop in data transmission phase.For the case of a high-energy sensor node selected as cluster head,with its energy higher than the average of all cluster nodes,then the endpoint of shortcut closest to the base station is selected as the next-hop by following the steps of determining the adaptive search area,the candidate endpoint of shortcut and the finally endpoint of shortcut.For the case of a high-energy sensor node selected as the cluster head,with its energy lower than the average of all cluster heads,then the first candidate endpoint of shortcut satisfying the principle of random number being less than the connection probability is selected as the next-hop.The proposed algorithm controls the adaptive search area of the cluster head and increases the search area of the node with its distance between the Base Station getting closer,which will avoid the problem of high betweenness centrality of the sensor nodes around the Base Station.The simulation results show that the algorithm has large clustering coefficients as well as small average path length and low energy consumption.