View : 44 Download: 0

Algorithm 920: SFSDP: A sparse version of full semidefinite programming relaxation for sensor network localization problems

Title
Algorithm 920: SFSDP: A sparse version of full semidefinite programming relaxation for sensor network localization problems
Authors
Kim S.Kojima M.Waki H.Yamashita M.
Ewha Authors
김선영
SCOPUS Author ID
김선영scopus
Issue Date
2012
Journal Title
ACM Transactions on Mathematical Software
ISSN
0098-3500JCR Link
Citation
vol. 38, no. 4
Indexed
SCI; SCIE; SCOPUS WOS scopus
Abstract
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.
DOI
10.1145/2331130.2331135
Appears in Collections:
자연과학대학 > 수학전공 > Journal papers
Files in This Item:
There are no files associated with this item.
Export
RIS (EndNote)
XLS (Excel)
XML


qrcode

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

BROWSE