An Improved DV-Hop Algorithm Using Hop-Count Information and Geometric Constraint

The localization of nodes is essential for many applications in wireless sensor networks (WSN). Compared with the range-based localization schemes, the range-free ones are more suitable for WSN because of their low-cost and ease for implementation. DV-Hop is considered as one of the pioneering range-free localization methods. In this paper, we propose a new algorithm named Advanced DV-Hop (ADV-Hop). For each unknown node, ADV-Hop estimates the node-to-anchor distance with the help of reference anchor, and the reference anchor gives a geometric constraint to narrow down the potential area of the unknown node. Experiment shows that our algorithm performs better than the DV-Hop algorithm, especially in the case where the connectivity is low.