Paper Info
Title
Algorithm 920: SFSDP: A Sparse Version of Full Semidefinite Programming Relaxation for Sensor Network Localization Problems
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.
Year
DOI
Venue
2012
10.1145/2331130.2331135
ACM Trans. Math. Softw.
Keywords
Field
DocType
matlab package,larger problem,sparse version,sensor network localization problem,sensor network localization,three-dimensional anchor-free problem,wireless sensor network,sensor network localization problems,full semidefinite programming relaxation,semidefinite programming,computed location,test problem,three dimensional
Mathematical optimization,MATLAB,Computer science,Algorithm,Theoretical computer science,Exploit,Software,Wireless sensor network,Semidefinite programming relaxation,Semidefinite programming
Journal
Volume
Issue
ISSN
38
4
0098-3500
Citations 
PageRank 
References 
11
0.61
18
Authors
4
Name
Order
Citations
PageRank
Sunyoung Kim146138.82
Masakazu Kojima21603222.51
Hayato Waki337628.82
Makato Yamashita4110.61