An Iterative Connectivity-based Localization Algorithm for Sensor Networks

There has been a lot of work on localization for sensor networks. A considerable part of existing localization schemes are based on connectivity (average number of neighbors), that affects the robustness and achievable throughput of communication in a sensor network. However, very little research has been done for the case out of the radio range that lacks connectivity. In this paper, we propose a distributed localization algorithm based on both neighbor and non-neighbor constraints. We compare our localization scheme to convex optimization approach (COA). Using extensive simulations, we show that the new algorithm achieves more accurate solutions than COA, especially when there are few network nodes or anchor nodes.