Numerical methods for large sensor network localization problems
| Project/Area Number |
22310089
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research (B)
|
| Allocation Type | Single-year Grants |
|---|
| Section | 一般 |
|---|
| Research Field |
Social systems engineering/Safety system
|
|---|
| Research Institution | Tokyo Institute of Technology |
|---|
Principal Investigator |
KOJIMA Masakazu 東京工業大学, 大学院・情報理工学研究科, 名誉教授 (90092551)
|
|---|
| Co-Investigator(Kenkyū-buntansha) |
OKAMOTO Yoshio 電気通信大学, 情報理工学(系)研究科, 准教授 (00402660)
MIYOSHI Naoto 東京工業大学, 情報理工学(系)研究科, 准教授 (20263121)
YAMASHITA Makoto 東京工業大学, 情報理工学(系)研究科, 准教授 (20386824)
FUJISAWA Katsuki 中央大学, 理工学部, 教授 (40303854)
|
|---|
| Project Period (FY) |
2010 – 2012
|
| Project Status |
Completed (Fiscal Year 2012)
|
| Budget Amount *help |
¥14,950,000 (Direct Cost: ¥11,500,000、Indirect Cost: ¥3,450,000)
Fiscal Year 2012: ¥3,900,000 (Direct Cost: ¥3,000,000、Indirect Cost: ¥900,000)
Fiscal Year 2011: ¥3,770,000 (Direct Cost: ¥2,900,000、Indirect Cost: ¥870,000)
Fiscal Year 2010: ¥7,280,000 (Direct Cost: ¥5,600,000、Indirect Cost: ¥1,680,000)
|
|---|
| Keywords | OR / 最適化 / センサネットワーク / 最適化問題 / 半正定値計画 / 位置推定 |
|---|
| Research Abstract |
Sensor network localization (SNL) problems have attracted considerable research interests for a broad spectrum of applications such as environmental monitoring, traffic control and structural assessment. The problem is to estimate the locations of n sensors of unknown positions using given distances and some m sensors of known positions (called anchors) in a sensor network of m+n sensors. Finding the solutions of this problem is known to be NP-hard. Thus, approximating the solution of this problem has been dealt with from many angles. In this project, we have studied numerical methods based on the semidefinite programming (SDP) relaxation．The SDP relaxation can provide approximate solutions with accuracy, but the computational cost of solving SNL problems by the SDP relaxation becomes expensive rapidly as their sizes increase. To avoid this difficulty, we fully exploited the sparsity which were involved in large scale SNL problems and improved the performance of the SDP solver SDPA. As a final product, we released a software package SFSDP that can solve large-scale sensor network localization problems in high speed.
|
Report
(4 results)
Research Products
(188 results)
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
[Journal Article] On problems as hard as CNF-SAT2012
Author(s)
Marek Cygan, Holger Dell, Daniel Lokshtanov, Dániel Marx, Jesper Nederlof, Yoshio Okamoto, Ramamohan Paturi, Saket Saurabh, and Magnus Wahlström
-
Journal Title
Proceedings of 27th IEEE Conference on Computational Complexity (CCC 2012)
Volume: --
Pages: 74-84
DOI
Related Report
Peer Reviewed
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
[Presentation] Universal Point Subsets for Planar Graphs2012
Author(s)
P.Angelini, C.Binucci, W.Evans, F.Hurtado, G.Liotta, T.Mchedlidze, H. Meijer and Y.Okamoto
Organizer
23rd International Symposium on Algorithms andComputation (ISAAC 2012)
Place of Presentation
National Taiwan University(台湾)
Year and Date
2012-12-20
Related Report
-
-
-
-
-
-
-
-
-
-
-
-
-
-
[Presentation] On problems as hard as CNF-SAT2012
Author(s)
M.Cygan, H.Dell, D.Lokshtanov, D.Marx, J.Nederlof, Y.Okamoto, R.Paturi, S. Saurabh, and M. Wahlstrom
Organizer
27th IEEE Conference on Computational Complexity (CCC 2012)
Place of Presentation
Universidade do Porto(ポル トガル)
Year and Date
2012-06-26
Related Report
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
[Presentation] 2と3の違い2011
Author(s)
岡本吉央
Organizer
名古屋工業大学情報フロンティアセミナー
Place of Presentation
名古屋工業大学(愛知県)
Year and Date
2011-10-18
Related Report
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
