.png){kind=icon}
返回
Sensor Network Localization via Alternating Rank Minimization Algorithms
.png){kind=icon}
OA
AI
DOI：10.1109/TCNS.2019.2926775.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Sensor network localization (SNL) is to determine physical coordinates of all sensors in a network given global coordinates of anchors and available measurements among sensors and anchors. Two challenges related to SNL are to find conditions leading to a uniquely localizable network and develop effective and efficient methods to solve SNL problems. This work first proves that infinitesimal rigidity, together with some mild conditions, is sufficient for unique localizability of a network considering additional relationships between nonadjacent sensors. On the other hand, solving an SNL problem is generally NP-hard due to its nonconvex constraints. Instead of ignoring the rank constraint used in existing relaxation methods, we convert the rank constraint in the SNL problem into its equivalent constraints and solve it alternatively by proposing the alternating rank minimization algorithm (ARMA). We start with the centralized ARMA to solve the exact SNL problem. Next, to improve the scalability for solving large-scale SNL problems, ARMA is extended in a distributed manner by decomposing the original problem into a group of subproblems, which can be solved independently. Finally, simulation cases are provided for both centralized and distributed ARMA to validate the improved localization accuracy, efficiency, and robustness by being compared to the state-of-the-art localization methods.
Keyword:
Distributed optimization
graph rigidity
rank-constrained optimization
sensor network localization (SNL)
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
5
论文数:
1.7K
被引数:
5.8K
机构
引用论文
分享收藏A dynamic state transition algorithm with application to sensor network localization.png)
NEUROCOMPUTINGOAAI
NEUROCOMPUTINGIF6.5
OAAI分享收藏
查看更多内容