4.5 Article

Algorithm 920: SFSDP: A Sparse Version of Full Semidefinite Programming Relaxation for Sensor Network Localization Problems

期刊

出版社

ASSOC COMPUTING MACHINERY
DOI: 10.1145/2331130.2331135

关键词

Algorithms; Performance; Sensor network localization problems; semidefinite programming relaxation; sparsity exploitation; Matlab software package

资金

  1. National Research Fund [KOSEF 2009-007-1314, 19310096, 20003236, 21710148]
  2. Grants-in-Aid for Scientific Research [20241038, 22310089, 22740056] Funding Source: KAKEN

向作者/读者索取更多资源

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.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.5
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据