Iterative Cooperation DV-Hop Localization Algorithm in Wireless Sensor Networks

According to the comprehensive analysis of the traditional DV-Hop, we propose an Iterative Cooperation DV-Hop localization (ICDV-Hop) algorithm, which improves the localization performance through adopting hop count threshold, collinearity test and new beacon nomination. The proposed algorithm selects the optimal beacon nodes for high localization accuracy by employing the hop count threshold to limit the distances between nodes and using collinearity degree to restrict topology relations between nodes. When the localization error of the located node is under the error threshold, it is nominated as new beacon to help the remaining unknown nodes to re-locate themselves, namely to expand localization coverage by iterative cooperation. Simulation results demonstrate that ICDV-Hop algorithm is more effective to improve the localization accuracy and coverage. Moreover, it is more reliable and robust compared to the traditional DV-Hop, especially when the ratio of beacon nodes is low and the network topology is sparse.