DV-Hop localization algorithms based on centroid in wireless sensor networks

The localization of the unknown nodes is essential for many applications in wireless sensor networks (WSN). But the traditional DV-Hop algorithm has not high accuracy of the localization of the nodes. In this paper, we proposed an improved DV-Hop location algorithm based on reduce the accumulation errors of the average hop distance of the unknown nodes in wireless sensor networks. We have made detailed analysis of the DV-Hop algorithm, and have introduced the weighted averaged method for calculate to the average hop distance in the second stages. Then the estimates regional based on two beacon nodes is built, and the centroid of the region is the coordinates of the unknown node. Simulation experiments are conducted to compare the traditional DV-Hop algorithm and improved DV-Hop algorithm. The simulation results show that the proposed algorithm has better localization accuracy based on the same or different number of the sensor nodes and the communication radius.