CGDV-Hop: An Optimized DV-Hop Algorithm with Anchor Selection for Enhancing Sensor Node Localization in Wireless Sensor Networks

In Wireless Sensor Networks (WSNs), many sensor nodes are deployed to gather information about their surroundings. The accuracy of this information is dependent on determining the exact location where it was collected. Localization is widely employed in WSNs to find the coordinates of target nodes using anchor nodes as reference points. In this paper, we propose the Closeness Greedy DV-Hop (CGDV-Hop) algorithm, which combines three different techniques, namely, Closeness Centrality for selecting the optimal anchors, Greedy Best First Search for optimizing the Hop count between unknown nodes and anchors, and a DV-Hop for determining the sensor node locations. Simulation results demonstrate the superiority of the CGDV-Hop compared to traditional DV-Hop and its current improvements primarily in terms of Average Localization Error (ALE) and Localization Error Reduction Ratio (LERR), while maintaining a favorable accuracy-complexity tradeoff.