Cooperative network localizability via semidefinite programming

In cooperative localization, the aim is to compute the locations in Euclidean space of a set of nodes performing pairwise distance measurements. In cases of lack of measurements, several nodes might have multiple feasible solutions meeting the distance constraints. In this paper, we are interested in identifying the nodes that have a unique solution.

[1]  Robert Connelly,et al.  Generic Global Rigidity , 2005, Discret. Comput. Geom..

[2]  A. Savvides,et al.  Network localization in partially localizable networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[3]  Davide Dardari,et al.  Understanding and Solving Flip-Ambiguity in Network Localization via Semidefinite Programming , 2009, GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference.

[4]  Anthony Man-Cho So,et al.  Theory of semidefinite programming for Sensor Network Localization , 2005, SODA '05.

[5]  David C. Moore,et al.  Robust distributed network localization with noisy range measurements , 2004, SenSys '04.

[6]  Yinyu Ye,et al.  Semidefinite programming based algorithms for sensor network localization , 2006, TOSN.

[7]  Moe Z. Win,et al.  Cooperative Localization in Wireless Networks , 2009, Proceedings of the IEEE.

[8]  Alfred O. Hero,et al.  Relative location estimation in wireless sensor networks , 2003, IEEE Trans. Signal Process..

[9]  Yinyu Ye,et al.  On Sensor Network Localization Using SDP Relaxation , 2010, ArXiv.