Research On DV-Hop Algorithm For Wireless Sensor Network

With the rapid development of microelectronic technology, embedded technology and wireless communication technology, wireless sensor network has become a hot spot in the field of internet application. Node location technology is particularly important because the monitoring activities in the wireless sensor network is successfully completed based on the accurate positioning of sensor node.The DV-Hop algorithm has many advantages such as the low hardware requirements, the higher positioning accuracy as well as the strong network adaptability which is a typical range-free localization algorithm. But at the same time it has some deficiencies in the larger positioning error and low coverage. In this thesis, two improved strategy is brought forward aiming at existing problems after the comprehensive analysis and further research for DV-Hop algorithm. For one thing, the average hop distance of parameters is confirmed by the difference of the average hop distance obtained by the diverse calculation method. For another, the novel algorithm effectively restructure the all known information of the anchor nodes and combine with weighted centroid algorithm to accurately position the unknown nodes when the distance of three or more beacon nodes are learned.Finally, the traditional DV-Hop algorithm, weighted centroid algorithm and improved algorithm were respectively simulated for positioning error and coverage on MATLAB with the different experiment scene. The simulation results show that the improved algorithm can effectively improve the positioning precision, the coverage rate of positioning and algorithm performance without increasing hardware consumption which has adequately proved its validity, practicability and feasibility. Therefore, the new algorithm has been regarded as a high efficient positioning scheme.