Research On Energy-balancing Routing Algorithm For Wireless Sensor Network

Wireless Sensor Network(WSN) is self-organizing distributed network composed by a large number of sensor nodes with perception, information collection, data processing and wireless communication capabilities. Currently, Wireless Sensor Network is widely used, but limited energy of sensor nodes and complex deployment environment factors, how to save energy and improve energy utilization has been a hot research of Wireless Sensor Network. Routing protocol is an important factor to affect the energy consumption of Wireless Sensor Network nodes. Its performance largely determines the overall performance of the network. Therefore, efficient and energy balanced routing algorithm has important theoretical and practical significance to promote the development of Wireless Sensor Network.After analyzing the various typical Wireless Sensor Network routing protocols, select the most representative of the hierarchical routing protocol as the main object of study. Detailed analysis of the basic principles and main characteristics of the protocols, and summarizes the design requirements of energy balanced routing algorithm.The main work is summarized as following:Firstly, a multi-hop routing algorithm for energy consumption balance(MRECB) was proposed. LEACH protocol is not suitable for the network node energy uneven, the cluster head election algorithm of LEACH protocol has great randomness, by modifying the threshold function and get a new cluster head election method. The new method gives full consideration to the actual situation of the node, ensure that nodes with high residual energy priority was elected as the cluster head. In addition, the elected cluster head is more reasonable, optimization of the structure of the cluster. Otherwise, cluster heads direct communication with the base station cause the expansion of network is not strong and energy consumption of cluster heads is too hight,combined with the idea of nodes into a chain on PEGASIS protocol t, proposed a multi-hop routing algorithm of cluster heads into a chain. By using the communication mode of single-hop within cluster and multi-hop between clusters, reducing the energy cost of long-distance communication, improve the utilization of energy, and enhance network scalability. The simulation results showed that the algorithm proposed in this thesis has better energy efficiency and effectively prolong the network lifetime to a certain extent. Secondly, a unequal clustering routing algorithm on time competition was proposed(UCTC). Most currently existing clustering routing protocols are based on isomorphism assumptions, and have great limitations in practice. In UCTC algorithm, the value of every node’s available energy is mapped into time delay, and used time-based competition mechanism to elect cluster heads, making the higher energy cluster head nodes priority to participate in elections.In addition, in order to avoid multi-hop communication method based on clustering routing protocols have a "hot zone" phenomenon, the algorithm using non-uniform clustering strategy to build a different scale cluster structure. Experimental results show that, UCTC algorithm largely alleviated "hot zone", and effectively balance the load of nodes in the network.