Date Added: May 2012
The authors extend one of their recently proposed anchorless mobile network localization algorithms (called PEST) to operate in a partially connected network. To this aim, they 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. They compare the computational complexity of the new link reconstruction algorithm with existing related algorithms and show that their proposed algorithm has the lowest complexity, and hence, is the best extension of the low complexity PEST.