A WSN Node Positioning Algorithm Combined With Centroid And DV - Hop Algorithm

Localization, which is the key technique in wireless sensor network(WSN), serves as the cornerstone of WSN applications. In addition, accurate localization after network deployment is necessary for sensor nodes to provide useful information. According to the definition, node localization is the procedure to get relative or absolute locations of nodes by utilizing specific techniques. These nodes could be classified into two categories: beacon nodes that already have their coordinates and unknown nodes that need to calculate their coordinates. Correspondingly, localization algorithms could be categorized into range-based and range-free two classes based on whether range measurements will be taken. WSN localization theory has made remarkable progress in localization algorithms proposing by far. However, these algorithms have some limitations, there is still a certain distance from the actual application. Following challenges stand in the way of implementing energy efficient localization systems with high accuracy.Even though Centroid algorithm has lower communication cost and is easy to calculate, its accuracy heavily depends on the nodes distribution. DV-Hop algorithm bears little distribution influence, but with higher communication cost. There have been some researches done on the improvement of DV-Hop. However, high energy consumptions and inaccurate localizations still exist in the current solutions. The main contributions of our work include deep analysis of DV-Hop algorithm and its current improvements and proposing a new algorithm taking the advantages of Centroid algorithm and DV-Hop to improve the accuracy by adjusting average distance of each hop. The improved algorithm proposed in this paper compared to the existing DV-Hop algorithm can improve the positioning accuracy, and ensure the effective reduces the amount of computation required by the algorithm positioning accuracy.