In-situ soil moisture sensing: Measurement scheduling and estimation using compressive sensing

We consider the problem of monitoring soil moisture evolution using a wireless network of in-situ underground sensors. To reduce cost and prolong lifetime, it is highly desirable to rely on fewer measurements and estimate with higher accuracy the original signal (soil moisture temporal evolution). In this paper we explore results from the compressive sensing (CS) literature and examine their applicability to this problem. Our main challenge lies in the selection of two matrices, the measurement matrix and a representation basis. The physical constraints of our problem make it highly nontrivial to select these matrices, so that the latter can sufficient sparsify the underlying signal while at the same time be sufficiently incoherent with the former, two common pre-conditions for CS techniques to work well. We construct a representation basis by exploiting unique features of soil moisture evolution. We show that this basis attains very good tradeoff between its ability to sparsify the signal and its incoherence with measurement matrices that are consistent with our physical constraints. Extensive numerical evaluation is performed on both real, high-resolution soil moisture data and simulated data, and through comparison with a closed-loop scheduling approach. Our results demonstrate that our approach is extremely effective in reconstructing the soil moisture process with high accuracy and low sampling rate.

[1]  Mingyan Liu,et al.  A Wireless Soil Moisture Smart Sensor Web Using Physics-Based Optimal Control: Concept and Initial Demonstrations , 2010, IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing.

[2]  Mingyan Liu,et al.  Measurement Scheduling for Soil Moisture Sensing: From Physical Models to Optimal Control , 2010, Proceedings of the IEEE.

[3]  Deanna Needell,et al.  Signal Recovery From Incomplete and Inaccurate Measurements Via Regularized Orthogonal Matching Pursuit , 2007, IEEE Journal of Selected Topics in Signal Processing.

[4]  R. Vershynin,et al.  Signal Recovery from Inaccurate and Incomplete Measurements via Regularized Orthogonal Matching Pursuit , 2010 .

[5]  Edwin K. P. Chong,et al.  Approximate stochastic dynamic programming for sensor scheduling to track multiple targets , 2009, Digit. Signal Process..

[6]  Deborah Estrin,et al.  Suelo: human-assisted sensing for exploratory soil monitoring studies , 2009, SenSys '09.

[7]  Jun Sun,et al.  Compressive data gathering for large-scale wireless sensor networks , 2009, MobiCom '09.

[8]  Michele Zorzi,et al.  On the interplay between routing and signal representation for Compressive Sensing in wireless sensor networks , 2009, 2009 Information Theory and Applications Workshop.

[9]  Christian Jutten,et al.  A Fast Approach for Overcomplete Sparse Decomposition Based on Smoothed $\ell ^{0}$ Norm , 2008, IEEE Transactions on Signal Processing.

[10]  Joel A. Tropp,et al.  Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit , 2007, IEEE Transactions on Information Theory.

[11]  Georgios B. Giannakis,et al.  Compressed Sensing for Wideband Cognitive Radios , 2007, 2007 IEEE International Conference on Acoustics, Speech and Signal Processing - ICASSP '07.

[12]  George E. Monahan,et al.  A Survey of Partially Observable Markov Decision Processes: Theory, Models, and Algorithms , 2007 .

[13]  D. Donoho.  For most large underdetermined systems of linear equations the minimal 𝓁1‐norm solution is also the sparsest solution , 2006 .

[14]  Emmanuel J. Candès,et al.  Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies? , 2004, IEEE Transactions on Information Theory.

[15]  E. Candès,et al.  Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information , 2004, IEEE Transactions on Information Theory.

[16]  E.J. Candes.  Compressive Sampling , 2022 .

[17]  Michael Elad,et al.  Stable recovery of sparse overcomplete representations in the presence of noise , 2006, IEEE Transactions on Information Theory.

[18]  Emmanuel J. Candès,et al.  Decoding by linear programming , 2005, IEEE Transactions on Information Theory.

[19]  E. Candes,et al.  11-magic : Recovery of sparse signals via convex programming , 2005 .

[20]  Ian F. Akyildiz,et al.  Sensor Networks , 2002, Encyclopedia of GIS.

[21]  Vikram Krishnamurthy,et al.  Algorithms for optimal scheduling and management of hidden Markov model sensors , 2002, IEEE Trans. Signal Process..

[22]  Vikram Krishnamurthy,et al.  Optimal sensor scheduling for Hidden Markov models , 1998, Proceedings of the 1998 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP '98 (Cat. No.98CH36181).

[23]  Bhaskar D. Rao,et al.  Sparse signal reconstruction from limited data using FOCUSS: a re-weighted minimum norm algorithm , 1997, IEEE Trans. Signal Process..

[24]  Demosthenis Teneketzis,et al.  Measurement scheduling for recursive team estimation , 1996 .

[25]  A. Bensoussan,et al.  Optimal sensor scheduling in nonlinear filtering of diffusion processes , 1989 .

[26]  G. Monahan.  State of the Art—A Survey of Partially Observable Markov Decision Processes: Theory, Models, and Algorithms , 1982 .

[27]  Michael Athans,et al.  1972 IFAC congress paper: On the determination of optimal costly measurement strategies for linear stochastic systems , 1972 .

[28]  M. Athans.  On the Determination of Optimal Costly Measurement Strategies for Linear Stochastic Systems , 1972 .

[29]  J. Peschon,et al.  Optimal control of measurement subsystems , 1967, IEEE Transactions on Automatic Control.

[30]  Michael Athans,et al.  Optimal Waveform Design via Control Theoretic Concepts , 1967, Inf. Control..

[31]  Harold J. Kushner,et al.  On the optimum timing of observations for linear control systems with unknown initial state , 1964 .