Font Size: a A A

Research On Clustering Route Protocol And The Localization Algorithm In Wireless Sensor Networks

Posted on:2014-08-01Degree:MasterType:Thesis
Country:ChinaCandidate:H Y ShenFull Text:PDF
GTID:2268330425968373Subject:Signal and Information Processing
Abstract/Summary:PDF Full Text Request
Wireless sensor networks (WSN) are composed of a large number of sensor nodes deployed in monitoring area. These nodes gather information of objects in the area of network coverage, and then process the information and provide it to target users. The support of fixed network is not required for WSN, so with the characteristics of quick stretching, strong resistance to destruction, wide coverage, WSN are widely used in military reconnaissance, environmental monitoring, agriculture, and space exploration, disaster rescue, and other fields.Routing protocols of WSN play an important role in the process of data transmission. The problem of energy consumption in WSN affects the entire network life, so the research of low power consumption and high performance routing protocol is a hot spot. Clustering routing protocols can effectively save energy and prolong network life. In consideration of the problem of the uneven distribution of cluster nodes in LEACH, this master’s degree paper combines the grads and data flow mechanism to improve the classic LEACH routing protocol, and makes the way of cluster more flexible, and reduces the consumption of communication within the cluster and between different clusters. So the network lifetime is prolonged. The simulation results show that, compared with LEACH, the improved protocol prolongs the network life more than50%.Localization algorithm of nodes is also an important aspect of research for wireless sensor networks. However, very few scholars combine routing protocols and localization algorithm in the traditional localization algorithm. Actually, in the process of routing establishment, nodes have collected large amount of information. There is information of some nodes location or the relative position information among them, and this part of the message is of certain significance to nodes localization. Based on the availability of routing information in the positioning process, the information is used in the correction of DV-Hop localization algorithm in this paper. The simulation results show that, positioning accuracy is improved obviously with the correction.Through this improved LEACH clustering routing protocol in this paper, the network life is prolonged a lot in the case of nodes density is relatively sparse. And the positioning accuracy of the DV-Hop algorithm with correction by routing information improved obviously.
Keywords/Search Tags:wireless sensor networks, clustering routing protocol, gradient, data flowmechanism, DV-Hop, routing information
PDF Full Text Request
Related items