Outlier-resistant Multi-hop Localization Based on Weighted Bounding-Box with the Virtual Anchor

Outlier-resistant Multi-hop Localization Based on Weighted Bounding-Box with the Virtual Anchor

Multi-hop localization has attracted considerable research interests, recently. Most of the existing methods assume that the distribution of anchors is non-collinear, which often does not represent real-world scenes, particularly for irregular networks. In this paper, we present a novel multihop localization scheme to address the ill-posed issue caused by the inappropriate distribution of anchors. First, we recognize whether the preliminary estimated location of nonanchor obtained from existing methods deviates from its true location. So it becomes a new anchor (also called the virtual anchor) after it is identified that the preliminary location of a nonanchor is within an unfit area. With the support of both the virtual anchor and other anchors, a smaller and delimited area can be found in which the target node is situated. Next, we employ the weighted Bounding-Box algorithm to compute the non-anchors’ locations that are close to their true locations. We evaluate our scheme with different network topologies based on other state-of-the-art research and analyze its performance. The results demonstrate that our proposed scheme can improve the accuracy of localization with lower computation complexity.