Research On Routing Protocols Of Wireless Sensor Networks

Wireless sensor network(WSN) is a new technology. It appeared after sensor technology, computer technology, and MEMS technology developed. As a new technology of information collection, WSN is paid more attention in a lot domain. It's used in environment inspection, military spy, medical treatment, counterstrike, etc. The wireless sensor network consists of a large quantity of sensor nodes whose power, calculation ability and bandwidth are so limited that traditional wireless routing protocol is not suitable for wireless sensor network, and it is a key point to save power and prolong the lifetime of network in the research of wireless sensor network.In this dissertation, the conceptions and key technologies of WSN are introduced briefly, and some applications of WSN 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.Researching cluster-based routing protocol of WSN is the main part of this work. 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 paper presents a novel uneven cluster-based routing protocol for wireless sensor networks. Its core is an Energy-Efficient Unequal Clustering algorithm for network topology organization, in which tentative cluster heads use uneven competition ranges to construct clusters of uneven sizes. The clusters closer to the sink have smaller sizes than those farther away from the sink, thus the cluster heads closer to the sink can preserve some energy for the inter-cluster data forwarding.Simulation results show that the improved protocol in the rounds clusters energy consumption was significantly lower than LEACH . Comparing the impact of the two clusters to the network survival time whether the algorithm of death time on the first node or the death time on the last proposed in this paper are better than LEACH.