Mathematical Programming

, Volume 109, Issue 2, pp 367–384

Theory of semidefinite programming for Sensor Network Localization

FULL LENGTH PAPER

DOI: 10.1007/s10107-006-0040-1

Cite this article as:
So, A.MC. & Ye, Y. Math. Program. (2007) 109: 367. doi:10.1007/s10107-006-0040-1

Abstract

We analyze the semidefinite programming (SDP) based model and method for the position estimation problem in sensor network localization and other Euclidean distance geometry applications. We use SDP duality and interior-point algorithm theories to prove that the SDP localizes any network or graph that has unique sensor positions to fit given distance measures. Therefore, we show, for the first time, that these networks can be localized in polynomial time. We also give a simple and efficient criterion for checking whether a given instance of the localization problem has a unique realization in \(\mathcal{R}^2\) using graph rigidity theory. Finally, we introduce a notion called strong localizability and show that the SDP model will identify all strongly localizable sub-networks in the input network.

Keywords

Euclidean distance geometryGraph realizationSensor network localizationSemidefinite programmingRigidity theory

Mathematics Subject Classification (2000)

51K0552C2568Q2590C2290C35

Copyright information

© Springer-Verlag 2006

Authors and Affiliations

  1. 1.Department of Computer ScienceStanford UniversityStanfordUSA
  2. 2.Department of Management Science and Engineering and, by courtesy, Electrical EngineeringStanford UniversityStanfordUSA