Research On Energy Efficient Hierarchical Rounting Protocol In Wireless Sensor Networks

Wireless sensor networks (WSN) are integration of sensor techniques, embedded computation techniques, distributed computation techniques and wireless communication techniques. Sensor networks are composed of a large number of sensor nodes that are densely deployed inside the phenomenon. Since the number of sensor nodes in WSN is numerous and single node is extraordinarily limited in resource, the important aim of designing routing protocol in WSN is to reduce the overall energy dissipated in the network and to maximize the network lifetime.In the thesis, the concepts, the system structure and features of WSN are introduced firstly. In addition, we study the characteristics of routing protocols in WSN and requirements for design. Meanwhile, several typical routing protocols are analyzed and evaluated overall. Based on the study above, we present an energy efficient hierarchical routing protocol (EEHRP) used in the large scale WSN with the continuous data stream.EEHRP uses an intelligent delay mechanism to choose the cluster head. The nodes which have higher residual energy are earlier to declare cluster head than the lower ones around. Other nodes which inside the declarant's communication radius no longer apply for cluster head this round. All nodes do not need to broadcast vast messages to build clusters and the clusters distribution is fairly uniform; Gateway nodes are introduced in routing algorithm. Cluster heads can efficiently avoid overfull energy consumption through transmiting data by gateway so as to maximize the network lifetime. We build the simulation mode with MATLAB. Simulation results show that EEHRP can meliorate the situation that some nodes which are overloaded die too early owing to the uneven node energy consumption in LEACH and prolong network lifetime effectively.