Semidefinite programming relaxations for sensor network localization

Sunyoung Kim, Masakazu Kojima

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

3 Scopus citations

Abstract

Sensor network localization (SNL) has been an important subject of research in recent years for a wide variety of applications. Among the solution methods proposed for SNL problems, semidefinite programming (SDP) approach is known for its effectiveness of obtaining solutions. In particular, the full SDP (FSDP) relaxation by Biswas and Ye was shown to be successful for solving small to medium-sized SNL problems. We present a sparse version of FSDP (SFSDP) for larger-sized problems by exploiting the sparsity of the problem. This method finds the same quality of solutions as the FSDP in a shorter amount of time. The performance of the SFSDP is measured with randomly generated test problems and compared with other methods. Numerical results suggest that exploiting the sparsity of the problem improve the efficiency of solving largersized problems.

Original languageEnglish
Title of host publication2010 IEEE International Symposium on Computer-Aided Control System Design, CACSD 2010
Pages19-23
Number of pages5
DOIs
StatePublished - 2010
Event2010 IEEE International Symposium on Computer-Aided Control System Design, CACSD 2010 - Yokohama, Japan
Duration: 8 Sep 201010 Sep 2010

Publication series

NameProceedings of the IEEE International Symposium on Computer-Aided Control System Design

Conference

Conference2010 IEEE International Symposium on Computer-Aided Control System Design, CACSD 2010
Country/TerritoryJapan
CityYokohama
Period8/09/1010/09/10

Fingerprint

Dive into the research topics of 'Semidefinite programming relaxations for sensor network localization'. Together they form a unique fingerprint.

Cite this