Stable arrangements of mobile sensors for sampling physical fields

Today's wireless sensor nodes can be easily attached to mobile platforms such as robots, cars and cell phones enabling pervasive sensing of physical fields (say of temperature, vibrations, air quality and chemicals). We address the sensor arrangement problem, i.e. when and where sensors should take samples to obtain a good estimate of a field using mobile sensors. In particular, we focus on incidentally mobile sensors that move passively under the influence of the environment (e.g. sensors attached to floating buoys, cars and smartphones carried by humans). We model the field as a linear combination of known basis functions. Given the samples, we use a linear estimator to find unknown coefficients of the basis functions. We formulate the sensor arrangement problem as one of finding suitably characterized classes of sensor arrangements that lead to a stable reconstruction of the field. We consider a family of multidimensional δ-dense sensor arrangements, where any square disc of size δ contains at least one sample, and derive sufficiency conditions for the arrangement to be stable. δ-dense sensor arrangements are geometrically intuitive and are easily compatible with the incidental mobility of sensors in many situations. We present simulation results on the stability of such arrangements for two-dimensional basis functions. We also present an example for constructing basis functions through proper orthogonal decompositions for a one-dimensional chemical diffusion field in a heterogeneous medium, which are later used for field estimation through δ-dense sampling.

[1]  N.M. Patrikalakis,et al.  Path Planning of Autonomous Underwater Vehicles for Adaptive Sampling Using Mixed Integer Linear Programming , 2008, IEEE Journal of Oceanic Engineering.

[2]  C.E. Shannon,et al.  Communication in the Presence of Noise , 1949, Proceedings of the IRE.

[3]  Mark G. Terwilliger,et al.  Overview of Sensor Networks , 2004 .

[4]  Andreas Krause,et al.  Efficient Informative Sensing using Multiple Robots , 2014, J. Artif. Intell. Res..

[5]  R. Murray,et al.  Model reduction for compressible flows using POD and Galerkin projection , 2004 .

[6]  Michael Jackson,et al.  Optimal Design of Experiments , 1994 .

[7]  M. Unser Sampling-50 years after Shannon , 2000, Proceedings of the IEEE.

[8]  K. Gröchenig A discrete theory of irregular sampling , 1993 .

[9]  A. Deshpande,et al.  Error Tolerant Arrangements of sensors for sampling fields , 2008, 2008 American Control Conference.

[10]  Akram Aldroubi,et al.  Nonuniform Sampling and Reconstruction in Shift-Invariant Spaces , 2001, SIAM Rev..

[11]  Thomas Strohmer,et al.  Computationally attractive reconstruction of bandlimited images from irregular samples , 1997, IEEE Trans. Image Process..

[12]  G. Goodwin,et al.  Reconstruction of multidimensional bandlimited signals from nonuniform and generalized samples , 2005, IEEE Transactions on Signal Processing.

[13]  Andreas Krause,et al.  Nonmyopic Adaptive Informative Path Planning for Multiple Robots , 2009, IJCAI.

[14]  Deborah Estrin,et al.  Coping with irregular spatio-temporal sampling in sensor networks , 2004, CCRV.

[15]  Mani Srivastava,et al.  Overview of sensor networks , 2004 .

[16]  Vivek K Goyal,et al.  Quantized Frame Expansions with Erasures , 2001 .

[17]  Gaurav S. Sukhatme,et al.  Adaptive Sampling for Estimating a Scalar Field using a Robotic Boat and a Sensor Network , 2007, Proceedings 2007 IEEE International Conference on Robotics and Automation.

[18]  K. Gröchenig RECONSTRUCTION ALGORITHMS IN IRREGULAR SAMPLING , 1992 .

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

[20]  F. Pukelsheim Optimal Design of Experiments (Classics in Applied Mathematics) (Classics in Applied Mathematics, 50) , 2006 .

[21]  Robert H. Halstead,et al.  Matrix Computations , 2011, Encyclopedia of Parallel Computing.

[22]  J. Lienhard A heat transfer textbook , 1981 .

[23]  Julio R. Banga,et al.  Optimal sensor location and reduced order observer design for distributed process systems , 2004, Comput. Chem. Eng..

[24]  Antonio A. Alonso,et al.  Optimal sensor placement for state reconstruction of distributed process systems , 2004 .

[25]  A. Chatterjee An introduction to the proper orthogonal decomposition , 2000 .

[26]  Allison Woodruff,et al.  Common Sense: participatory urban sensing using a network of handheld air quality monitors , 2009, SenSys '09.

[27]  Robert Gould,et al.  A Modern Approach to Regression with R , 2010 .

[28]  Vivek K. Goyal,et al.  Generalized Regular Sampling of Trigonometric Polynomials and Optimal Sensor Arrangement , 2010, IEEE Signal Processing Letters.

[29]  J. Peraire,et al.  A ‘best points’ interpolation method for efficient approximation of parametrized functions , 2008 .

[30]  Ajay A. Deshpande,et al.  Coverage problems in mobile sensing , 2008 .

[31]  Deborah Estrin,et al.  Guest Editors' Introduction: Overview of Sensor Networks , 2004, Computer.

[32]  Naomi Ehrich Leonard,et al.  Collective Motion, Sensor Networks, and Ocean Sampling , 2007, Proceedings of the IEEE.

[33]  Andreas Krause,et al.  Near-Optimal Sensor Placements in Gaussian Processes: Theory, Efficient Algorithms and Empirical Studies , 2008, J. Mach. Learn. Res..