Sparsity Based Efficient Cross-Correlation Techniques in Sensor Networks

被引:6
作者
Misra, Prasant [1 ]
Hu, Wen [2 ]
Yang, Mingrui [3 ]
Duarte, Marco [4 ]
Jha, Sanjay [2 ]
机构
[1] TATA Consultancy Serv Ltd, TCS Res & Innovat, Bangalore 560100, Karnataka, India
[2] Univ New South Wales, Sydney, NSW 2052, Australia
[3] Case Western Reserve Univ, Cleveland, OH 44106 USA
[4] Univ Massachusetts, Amherst, MA USA
关键词
Ranging; location sensing; positioning; cross-correlation; sparse approximation; compressed sensing; l(1)-norm minimization; structured sparsity; REPRESENTATION; SYSTEMS; SELECTION;
D O I
10.1109/TMC.2016.2605689
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Cross-correlation is a popular signal processing technique used in numerous location tracking systems for obtaining reliable range information. However, its efficient design and practical implementation has not yet been achieved on mote platforms that are typical in wireless sensor network due to resource constrains. In this paper, we propose StructS-XCorr: cross-correlation via structured sparse representation, a new computing framework for ranging based on l(1)-norm minimization [1] and structured sparsity. The key idea is to compress the ranging signal samples on the mote by efficient random projections and transfer them to a central device; where a convex optimization process estimates the range by exploiting the sparse signal structure in the proposed correlation dictionary. Through theoretical validation, extensive empirical studies and experiments on an end-to-end acoustic ranging system implemented on resource limited off-the-shelf sensor nodes, we show that the proposed framework can achieve up to two orders of magnitude better performance compared to other approaches such as working on DCT domain and downsampling. Compared to the standard cross-correlation, it is able to obtain range estimates with a bias of 2-6 cm with 30 percent and approximately 100 cm with 5 percent compressed measurements. Its structured sparsity model is able to improve the ranging accuracy by 40 percent under challenging recovery conditions (such as high compression factor and low signal-to-noise ratio) by overcoming limitations due to dictionary coherence.
引用
收藏
页码:2037 / 2050
页数:14
相关论文
共 39 条
[1]   On the approximability of minimizing nonzero variables or unsatisfied relations in linear systems [J].
Amaldi, E ;
Kann, V .
THEORETICAL COMPUTER SCIENCE, 1998, 209 (1-2) :237-260
[2]  
[Anonymous], 1965, THESIS
[3]   A Simple Proof of the Restricted Isometry Property for Random Matrices [J].
Baraniuk, Richard ;
Davenport, Mark ;
DeVore, Ronald ;
Wakin, Michael .
CONSTRUCTIVE APPROXIMATION, 2008, 28 (03) :253-263
[4]  
Branislav K., 2007, P 5 INT C MOB SYST A
[5]   Near-optimal signal recovery from random projections: Universal encoding strategies? [J].
Candes, Emmanuel J. ;
Tao, Terence .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2006, 52 (12) :5406-5425
[6]   Compressed sensing with coherent and redundant dictionaries [J].
Candes, Emmanuel J. ;
Eldar, Yonina C. ;
Needell, Deanna ;
Randall, Paige .
APPLIED AND COMPUTATIONAL HARMONIC ANALYSIS, 2011, 31 (01) :59-73
[7]   Atomic decomposition by basis pursuit [J].
Chen, SSB ;
Donoho, DL ;
Saunders, MA .
SIAM JOURNAL ON SCIENTIFIC COMPUTING, 1998, 20 (01) :33-61
[8]   For most large underdetermined systems of linear equations the minimal l1-norm solution is also the sparsest solution [J].
Donoho, DL .
COMMUNICATIONS ON PURE AND APPLIED MATHEMATICS, 2006, 59 (06) :797-829
[9]   Compressed sensing [J].
Donoho, DL .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2006, 52 (04) :1289-1306
[10]   Optimally sparse representation in general (nonorthogonal) dictionaries via l1 minimization [J].
Donoho, DL ;
Elad, M .
PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA, 2003, 100 (05) :2197-2202