Cooperative localization in partially connected mobile wireless sensor networks using geometric link reconstruction

We extend one of our recently proposed anchorless mobile network localization algorithms (called PEST) to operate in a partially connected network. To this aim, we propose a geometric missing link reconstruction algorithm for noisy scenarios and repeat the proposed algorithm in a local-to-global fashion to reconstruct a complete distance matrix. This reconstructed matrix is then used in the PEST to localize the mobile network. We compare the computational complexity of the new link reconstruction algorithm with existing related algorithms and show that our proposed algorithm has the lowest complexity, and hence, is the best extension of the low complexity PEST. Simulation results further illustrate that the proposed link reconstruction algorithm leads to the lowest reconstruction error as well as the most accurate network localization performance.