Algorithm 920: SFSDP: A sparse version of full semidefinite programming relaxation for sensor network localization problems
- 주제(키워드) Matlab software package , Semidefinite programming relaxation , Sensor network localization problems , Sparsity exploitation
- 관리정보기술 faculty
- 등재 SCIE, SCOPUS
- 발행기관 Association for Computing Machinary, Inc.
- 발행년도 2012
- 총서유형 Journal
- URI http://www.dcollection.net/handler/ewha/000000094078
- 본문언어 영어
- Published As http://dx.doi.org/10.1145/2331130.2331135
초록/요약
SFSDP is a Matlab package for solving sensor network localization (SNL) problems. These types of problems arise in monitoring and controlling applications using wireless sensor networks. SFSDP implements the semidefinite programming (SDP) relaxation proposed in Kim et al. [2009] for sensor network localization problems, as a sparse version of the full semidefinite programming relaxation (FSDP) by Biswas and Ye [2004]. To improve the efficiency of FSDP, SFSDP exploits the aggregated and correlative sparsity of a sensor network localization problem. As a result, SFSDP can handle much larger problems than other software as well as three-dimensional anchor-free problems. SFSDP analyzes the input data of a sensor network localization problem, solves the problem, and displays the computed locations of sensors. SFSDP also includes the features of generating test problems for numerical experiments. © 2012 ACM.
more