.png){kind=icon}
返回
An Angular Approach for Range-Based Approximate Maximum Likelihood Source Localization Through Convex Relaxation
.png){kind=icon}
OA
AI
DOI：10.1109/TWC.2014.2314653.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This work considers the problem of locating a single source from noisy range measurements to a set of nodes in a wireless sensor network. We propose two new techniques that we designate as Source Localization with Nuclear Norm (SLNN) and Source Localization with l(1)-norm (SL-l(1)), which extend to arbitrary real dimensions our prior work on 2D source localization formulated in the complex plane. Our approach is based on formulating a Maximum-Likelihood (ML) estimation problem, and then using convex relaxation techniques to obtain a semidefinite program (SDP) that can be globally and efficiently solved. SLNN directly approximates the Gaussian ML solution, and the relaxation is shown to be tighter than in other methods in the same class. We present an analysis of the convexity properties of the constraint set for the 2D complex version of SLNN (SLCP) to justify the observed tightness of the relaxation. We propose the SL-l(1) algorithm to address the Laplacian noise case, which models the presence of outliers in range measurements. We overcome the non-differentiability of the Laplacian likelihood function by rewriting the ML problem as an exact weighted version of the Gaussian case. In terms of accuracy of localization, the proposed algorithms globally outperform state-of-the-art optimization-based methods in different noise scenarios, while exhibiting moderate computational complexity.
Keyword:
Centralized method
convex hull
convex relaxation
range-based source localization
semidefinite programming
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
10.7
论文数:
1.3W
被引数:
5.3W
机构
引用论文
.png){kind=icon}
分享收藏A New Approach to Sensor Node Localization Using RSS Measurements in Wireless Sensor Networks无线传感器网络中基于RSS测量的传感器节点定位新方法
PREAI
分享收藏
查看更多内容