Study Of Wireless Sensor Network Routing Protocols

Wireless sensor networks have emerged with the rapid development of the micro-electronics technology, wireless communications and information networks in recent years. These networks change the way people interact with nature and help understand the world by closely linking the physical world with the information world. WSNs have received great concern from numerous researchers abroad and at home owing to their huge potential. Rooting protocol is studied for communicating more comprehensive information about the physical world to whom it may concern. Besides, the Rooting protocol algorithm also merits study since it is directly related to the wireless network communication bandwidth, the node energy consumption, network processing, etc., which can enhance the quality of service (QoS), such as the network lifetime, energy consumption, delay.In this thesis, the conceptions and key technologies of WSNs are introduced briefly, and some applications of WSNs and structure of the networks are covered. Then we give the classification of the routing protocols for WSN and summarize the characteristics of routing protocols. We also list and make comparison of several kinds of existing protocols. Finally, we abstract the target of design for routing protocols.LEACH is selected to be the research target as the representative of the cluster-based routing protocols. We bring forward some improvements to LEACH protocol based on analyzing the shortages of it. The neighbor number of redundant nodes can be employed in rooting algorithm of WSNs, which leads to the emergence of LEACH-C, an improved coverage rooting algorithm. The cluster heads in LEACH easily die and result in the network blind point. However, the improved LEACH-C chooses as the cluster heads some redundant nodes which have more residual energy and can satisfy coverage, and it allows other redundant nodes to sleep in accordance with its appropriate sleeping mechanism, so that it guarantees network coverage and lengthens the network lifetime. In addition, the improved algorithm still has the advantages of simple control mechanism like LEACH. The results of simulation show that LEACH-C outdoes LEACH in various aspects, be it in network coverage or in network lifetime.