Super-Accurate Source Localization via Multiple Measurement Vectors and Compressed Sensing Techniques

被引:0
作者
Pana, Cristian [1 ]
Severi, Stefano [1 ]
de Abreu, Giuseppe Thadeu Freitas [1 ,2 ]
机构
[1] Jacobs Univ, Focus Area Mobil, Campus Ring 1, D-28759 Bremen, Germany
[2] Ritsumeikan Univ, Dept Elect & Elect Engn, Kusatsu, Shiga 5258577, Japan
来源
2018 IEEE WIRELESS COMMUNICATIONS AND NETWORKING CONFERENCE (WCNC) | 2018年
关键词
Compressed Sensing; sparse signals recovery algorithms; source localization; multiple measurement vectors; simultaneous orthogonal matching pursuit; SIMULTANEOUS SPARSE APPROXIMATION; RECOVERY;
D O I
暂无
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
In this paper we propose a novel Compressed Sensing (CS) approach for source localization in wireless sensor networks (WSN). While this is not the first work on applying CS to target localization, it is the first one (to our knowledge) to construct the sensing matrix based only on distance information and a discrete grid. Most of the CS approaches are based on received signal strength (RSS) fingerprinting methods. Moreover, we propose to use this new CS approach in conjunction with a multiple measurement vectors (MMV) problem, which we solve by the Simultaneous Orthogonal Matching Pursuit (SOMP) algorithm. Finally, we demonstrate the superiority of this new approach (even with a relatively small number of measurements) over the non-CS based and more complex Super Multidimensional Scaling (SMDS) algorithm, which is an improved version of the metric MDS. In order for the latter algorithm to be fairly compared against the MMV approach, based on the number of measurements, the noisy distances were fed to a maximum likelihood estimator (MLE) which first estimated the parameters of the Gamma distribution corresponding to the noisy measured distances. The mode of the estimated distribution was then fed to the SMDS.
引用
收藏
页数:5
相关论文
共 20 条
[1]  
[Anonymous], 2001, Probability, Random Variables and Stochastic Processes
[2]  
[Anonymous], 2017, IEEE COMMUNICATIONS
[3]  
[Anonymous], IEEE T COMMUNICATION
[4]  
[Anonymous], SIGN PROC C 2008 16
[5]  
[Anonymous], IEEE J SEL TOP SIGNA
[6]  
[Anonymous], WIR COMM NETW C 2007
[7]  
Boyd L., 2004, CONVEX OPTIMIZATION
[8]  
Candes E. J., 2006, INT C MATH, V3, P1433, DOI DOI 10.4171/022-3/69
[9]   Atomic decomposition by basis pursuit [J].
Chen, SSB ;
Donoho, DL ;
Saunders, MA .
SIAM JOURNAL ON SCIENTIFIC COMPUTING, 1998, 20 (01) :33-61
[10]   Sparse solutions to linear inverse problems with multiple measurement vectors [J].
Cotter, SF ;
Rao, BD ;
Engan, K ;
Kreutz-Delgado, K .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2005, 53 (07) :2477-2488