Font Size: a A A

Research On Node Localization In Wireless Sensor Network

Posted on:2012-11-27Degree:MasterType:Thesis
Country:ChinaCandidate:M Q YangFull Text:PDF
GTID:2178330335454487Subject:Computer application technology
Abstract/Summary:PDF Full Text Request
WSN(Wireless Sensor Network) is a new information acquisition and processing technology integrated the technologies of sensors, embedded, networking and wireless communication. In the modern military, medical, rescue, traffic management and geographical exploration and other fields, it have a wide range of applications. In order to work collaboratively with other nodes, the nodes must be able to accurately obtain the location information. Therefore, node localization of WSN has always been the key underlying technology. The shortcomings of low accuracy, complex calculations, high consumption of time and power is ubiquitous in existing localization algorithm for WSN. As WSN has matured, its application has become increasingly widespread, so node localization algorithm becomes more important. In this paper, after studying on the traditional location algorithm, we proposed the SDV-Hop(Series-based DV-Hop),a improved DV-HOP algorithm and a path planning algorithm of mobile anchor node path planning based on fuzzy control. The main research contents and results are as follows:1. The improved of the calculated average hop-length in DV-Hop algorithm and the proposed of the SDV-Hop algorithm. In this paper, we found that the localization error of DV-Hop algorithm is mainly because of the error of the average hop-length. Because the traditional DV-HOP in the calculation of the average hop-length using the straight-line distance between two nodes and the hops of data packet transmission. The packet is not transferred in straight-line, which makes the calculation of average hop-length a big error. To solve the problem we find a new solution in the SDV-Hop algorithm, using a predetermined series to calculate the hops. The series can be determined according to network conditions. The elements of series are not limited to integer, which correct the errors when calculating the number of hops. That make the hops as close as possible to the hops between two nodes when the packet is transferred in straight-line.2. The algorithm of mobile anchor node path planning based on fuzzy control. In this paper, we analysis the existing path planning of mobile anchor nodes, and then combined the mobile anchor node path planning with the fuzzy control theory. We divided the area of in forward of the mobile anchor node into three regions:the left, the middle and the right. We use the number of the nodes in every region as the fuzzy input. The direction of the anchor's next movement can be calculated by fuzzy algorithm. The anchor node moves towards the region with the highest density, so that more nodes can complete better localization and the accuracy of the network improves. Simulation results indicate that compare to the existing algorithm for path planning of mobile anchor node, the algorithm in positioning accuracy, positioning time and adaptability to environment is improved obviously.
Keywords/Search Tags:Wireless Sensor Networks, Node Localization, Mobile Anchor Node, Path Planning
PDF Full Text Request
Related items