Scalable and fully distributed localization with mere connectivity

Abstract—This work proposes a novel connectivity-based localization algorithm, well suitable for large-scale sensor networks with complex shapes and non-uniform nodal distribution. In contrast to current state-of-art connectivity-based localization methods, the proposed algorithm is fully distributed, where each node only needs the information of its neighbors, without cumbersome partitioning and merging process. The algorithm is highly scalable, with limited error propagation and linear computation and communication cost with respect to the size of the network. Moreover, the algorithm is theoretically guaranteed and numerically stable. Extensive simulations and comparison with other methods under various representative network settings are carried out, showing superior performance of the proposed algorithm.

• Type: Journal
• Year: 2011
• Where: INFOCOM
• Authors: Miao Jin, Su Xia, Hongyi Wu, Xianfeng Gu
• Keywords: Algorithm, Communications, Connectivity-based Localization, Connectivity-based Localization Algorithm, INFOCOM 2011