Research On Localization Algorithm Of Wireless Sensor Networks

Wireless sensor network technology, as one of the ten emerging technologies inthe future, integrates technologies of micro-electro-mechanism, embedded and wirelesscommunication, and it can be widely used in the areas of space exploration, nationaldefense and military, city construction, medical and health care and so on. Locationtechnology, as one of the important supporting technologies of wireless sensornetworks, has received more and more attention. This paper focuses on the locationtechnology in wireless sensor networks.Firstly, in the traditional DV-Hop location algorithm, range error betweenunknown nodes and anchor nodes is large. In order to solve the problem, a newalgorithm based on distance correction is proposed. The distances between anchornodes are estimated using the average hop distance of the anchor nodes in theimproved algorithm, and then the distances between unknown nodes and anchor nodesare corrected using the relative error of actual distance and estimated distance betweenanchor nodes to make the estimated distance more accurate. Then the improvedalgorithm and the traditional DV-Hop location algorithm are compared by simulationresults.Secondly, an algorithm based on average hop distance correction is proposed toreduce the influence of the average hop distance on the positioning error. It considersnot only the influence of the nearest anchor node, but also the mutual influencebetween the anchor nodes in calculating the unknown correction value. Thetwo-dimensional hyperbola is applied to the proposed algorithm to compute nodescoordinates. After that, nodes coordinates are corrected to make the nodes locationmore accurate. The improved algorithm and the traditional DV-Hop location algorithmare compared by the simulation results.Thirdly, an improved algorithm based on hop correction is proposed. In order toimprove location accuracy, this algorithm defines ideal hop and coefficient of hopcorrection, and then amends the hops between nodes using the coefficient to make the estimated hops between nodes closer to the ideal hops. At the end of the paper, theperformance of the proposed algorithm is verified by simulation results.