Prasant Misra
Wen Hu
ABSTRACT
Cross-correlation is a popular signal processing technique used in numerous localization and tracking systems for obtaining reliable range information. However, a practical efficient implementation has not yet been achieved on resource constrained wireless sensor network platforms. We propose cross-correlation via sparse representation: a new framework for ranging based on l1-minimization. The key idea is to compress the signal samples on the mote platform by efficient random projections and transfer them to a central device, where a convex optimization process estimates the range by exploiting its sparsity in our proposed correlation domain. Through sparse representation theory 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, together with the proposed correlation domain achieved up to two order of magnitude better performance compared to naive approaches such as working on DCT domain and downsampling. Furthermore, compared to cross-correlation results, 30-40% measurements are sufficient to obtain precise range estimates with an additional bias of only 2-6cm for high accuracy application requirements, while 5% measurements are adequate to achieve approximately 100cm precision for lower accuracy applications.
- Andy Harter, Andy Hopper, Pete Steggles, Andy Ward, and Paul Webster. The anatomy of a context-aware application. In MobiCom, pages 59--68. ACM, 1999. Google Scholar
Digital Library
- Nissanka Bodhi Priyantha. The Cricket Indoor Location System. PhD thesis, MIT, 2005.Google ScholarDigital Library
- Andreas Savvides, Chih-Chieh Han, and Mani B. Strivastava. Dynamic fine-grained localization in ad-hoc networks of sensors. In MobiCom, pages 66--179. ACM, 2001. Google ScholarDigital Library
- Evangelos Mazomenos, Dirk De Jager, Jeffrey S. Reeve, and Neil M. White. A two-way time of flight ranging scheme for wireless sensor networks. In EWSN. Springer-Verlag, 2011. Google ScholarDigital Library
- P. Misra, D. Ostry, and S. Jha. Improving the coverage range of ultrasound-based localization systems. In WCNC, pages 605--610. IEEE, 2011.Google ScholarCross Ref
- M. Hazas and A. Hopper. Broadband ultrasonic location systems for improved indoor positioning. IEEE TMC, 5(5):536--547, 2006. Google ScholarDigital Library
- M. Kushwaha, K. Molnar, J. Sallai, P. Volgyesi, M. Maroti, and A. Ledeczi. Sensor node localization using mobile acoustic beacons. In MASS, pages 9pp.--491. IEEE, 2005.Google Scholar
- Lewis Girod, Martin Lukac, Vlad Trifa, and Deborah Estrin. The design and implementation of a self-calibrating distributed acoustic sensing platform. In SenSys, pages 71--84. ACM, 2006. Google ScholarDigital Library
- Peng Chunyi, Shen Guobin, Zhang Yongguang, Li Yanlin, and Tan Kun. Beepbeep: a high accuracy acoustic ranging system using cots mobile devices. In SenSys, pages 1--14. ACM, 2007. Google ScholarDigital Library
- P. Misra, D. Ostry, N. Kottege, and S. Jha. Tweet: An envelope detection based ultrasonic ranging system. In MSWiM, pages 409--416. ACM, 2011. Google ScholarDigital Library
- Kamin Whitehouse and David Culler. Calibration as parameter estimation in sensor networks. In WSNA. ACM, 2002. Google ScholarDigital Library
- János Sallai, György Balogh, Miklós Maróti, Ákos Lédeczi, and Branislav Kusy. Acoustic ranging in resource constrained sensor networks. In ICWN, page 04. CSREA Press, 2004.Google Scholar
- David L. Donoho. For most large underdetermined systems of linear equations the minimal l1-norm solution is also the sparsest solution. Communications on Pure and Applied Mathematics, 59(6):797--829, 2006.Google ScholarCross Ref
- P. Zhao and B. Yu. On model selection consistency of lasso. J. Machine Learning Research, 7:2541--2567, 2006. Google ScholarDigital Library
- R. Tibshirani. Regression shrinkage and selection via the lasso. J. Royal Statistical Soc. B, 58(1):267--288, 1996.Google ScholarCross Ref
- E. Amaldi and V. Kann. On the approximability of minimizing nonzero variables or unsatisfied relations in linear systems. Theoretical Computer Science, 209:237--260, 1998. Google ScholarDigital Library
- Edoardo Amaldi and Viggo Kann. On the approximability of minimizing nonzero variables or unsatisfied relations in linear systems. Theoretical Computer Science, 209(1-2):237--260, 1998. Google ScholarDigital Library
- E. J. Candes and T. Tao. Near-optimal signal recovery from random projections: Universal encoding strategies? IEEE Trans. on Inf. Theory, 52(12):5406--5425, 2006. Google ScholarDigital Library
- D. L. Donoho. Compressed sensing. IEEE Trans. on Inf. Theory, 52(4):1289--1306, april 2006. Google ScholarDigital Library
- B. F. Logan. Properties of high-pass signals. Ph.D. Thesis, 1965.Google Scholar
- Donoho D. L. and B. F. Logan. Signal recovery and the large sieve. SIAM J. APPL. MATH., 52(2):577--591, 1992. Google ScholarDigital Library
- S. S. Chen, D. L. Donoho, and M. A. Saunders. Atomic decomposition by basis pursuit. SIAM J. Scientific Computing, 20(1):33--61, 1999. Google ScholarDigital Library
- D. L. Donoho and X. Huo. Uncertainty principles and ideal atomic decomposition. IEEE Trans. Inf. Theory, 47(7):2845--2862, 2001. Google ScholarDigital Library
- R. Gribonval and M Nielsen. Sparse representations in unions of bases. IEEE Trans. Inf. Theory, 49(12):3320--3325, 2003. Google ScholarDigital Library
- David L. Donoho and Michael Elad. Optimally sparse representation in general (nonorthogonal) dictionaries via l1 minimization. Proceedings of the National Academy of Sciences, 100(5):2197--2202, 2003.Google ScholarCross Ref
- M. Elad and A.M. Bruckstein. A generalized uncertainty principle and sparse representation in pairs of bases. IEEE Trans. on Inf. Theory, 48(9):2558--2567, sep 2002. Google ScholarDigital Library
- R. Baraniuk, M. Davenport, R. DeVore, and Wakin M. A simple proof of the restricted isometry property for random matrices. Constr Approx, 28:253--263, 2008.Google ScholarCross Ref
- J. Wright, A. Y. Yang, A. Ganesh, S. S. Sastry, and Ma Yi. Robust face recognition via sparse representation. IEEE PAMI, 31(2):210--227, 2009. Google ScholarDigital Library
- http://sentilla.com/files/pdf/eol/tmote-invent-user-guide.pdf.Google Scholar
- Ben Greenstein, Christopher Mar, Alex Pesterev, Shahin Farshchi, Eddie Kohler, Jack Judy, and Deborah Estrin. Capturing high-frequency phenomena using a bandwidth-limited sensor network. In SenSys. ACM, 2006. 279--292. Google ScholarDigital Library
- Christopher M. Sadler and Margaret Martonosi. Data compression algorithms for energy-constrained devices in delay tolerant networks. In SenSys, pages 265--278. ACM, 2006. Google ScholarDigital Library
- G. Oberholzer, P. Sommer, and R. Wattenhofer. Spiderbat: Augmenting wireless sensor networks with distance and angle information. In IPSN, pages 211--222. ACM/IEEE, 2011.Google Scholar
- Kusy Branislav, Sallai Janos, Balogh Gyorgy, Ledeczi Akos, Protopopescu Vladimir, Tolliver Johnny, DeNap Frank, and Parang Morey. Radio interferometric tracking of mobile wireless nodes. In Mobisys. ACM, 2007. Google ScholarDigital Library
- P. Misra, S. Kanhere, D. Ostry, and S. Jha. Safety assurance and rescue communication systems in high-stress environments: A a mining case study. IEEE Communication Magazine, 48(4):66--73, 2010. Google ScholarDigital Library
Index Terms
- Efficient cross-correlation via sparse representation in sensor networks
Recommendations
A fast gradient projection algorithm for efficient cross-correlation via sparse representation in sensor networks
SenSys '12: Proceedings of the 10th ACM Conference on Embedded Network Sensor SystemsCross-correlation is a popular signal processing technique used for obtaining reliable range information. Recently, a practical and efficient implementation of cross-correlation (via sparse approximation) was demonstrated on resource constrained wireless ...
Sparse Representation of Sensor Network Signals Based on the K-SVD Algorithm
PE-WASUN'18: Proceedings of the 15th ACM International Symposium on Performance Evaluation of Wireless Ad Hoc, Sensor, & Ubiquitous NetworksThe sparse basis of signals plays a key role in signals processing of wireless sensor networks (WSNs). However, the existing sparse bases, such as principal component analysis (PCA) and discrete cosine transform (DCT), do not support a good recovery ...
Efficient and accurate sensor network localization
Wireless sensor networks (WSN) have great potential in ubiquitous computing. However, the severe resource constraints of WSN rule out the use of many existing networking protocols and require careful design of systems that prioritizes energy ...
Comments