Sensor Selection Based Routing for Monitoring Gaussian Processes M odeled Spatial Phenomena

This paper addresses the trade-off between the sensing quality and the energy consumption in the wireless sensor network associated with monitoring spatial phenomena. We use a nonparametric Gaussian Process to model the spatial phenomena to be monitored and simulated annealing based approximately heuristic algorithm for sensor selection. Our novel Sensor Selection based Routing (SSR) algorithm uses this model to identify the most informative nodes, which gives the root mean square prediction error less than a specified threshold, to construct the minimal energy-expended routing tree rooted at the sink. Our experiments have verified that the proposed computationally efficient SSR algorithm has significant advantages over conventional techniques.

[1]  Maurice Queyranne,et al.  An Exact Algorithm for Maximum Entropy Sampling , 1995, Oper. Res..

[2]  G. Dissanayake,et al.  Simulated annealing based approach for near-optimal sensor selection in Gaussian Processes , 2012, 2012 International Conference on Control, Automation and Information Sciences (ICCAIS).

[3]  K. Fernow New York , 1896, American Potato Journal.

[4]  Theodore S. Rappaport,et al.  Wireless Communications: Principles and Practice (2nd Edition) by , 2012 .

[5]  Dario Pompili,et al.  Optimal local topology knowledge for energy efficient geographical routing in sensor networks , 2004, IEEE INFOCOM 2004.

[6]  Nasser M. Nasrabadi,et al.  Pattern Recognition and Machine Learning , 2006, Technometrics.

[7]  Noel A Cressie,et al.  Statistics for Spatial Data. , 1992 .

[8]  Jorge Cortes,et al.  Distributed Control of Robotic Networks: A Mathematical Approach to Motion Coordination Algorithms , 2009 .

[9]  Baltasar Beferull-Lozano,et al.  Power-Aware Joint Sensor Selection and Routing for Distributed Estimation: A Convex Optimization Approach , 2012, 2012 IEEE 8th International Conference on Distributed Computing in Sensor Systems.

[10]  Öznur Özkasap,et al.  Ad-Hoc Networks , 2008, Encyclopedia of Algorithms.

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

[12]  Andreas Krause,et al.  Robust sensor placements at informative and communication-efficient locations , 2011, TOSN.

[13]  K. F. Riley,et al.  Mathematical Methods for Physics and Engineering , 1998 .

[14]  Mohamed F. Younis,et al.  A survey on routing protocols for wireless sensor networks , 2005, Ad Hoc Networks.

[15]  Baltasar Beferull-Lozano,et al.  Joint sensor selection and routing for distributed estimation in wireless sensor networks , 2009, 2009 17th European Signal Processing Conference.

[16]  Theodore S. Rappaport,et al.  Wireless communications - principles and practice , 1996 .

[17]  W. F. Caselton,et al.  Optimal monitoring network designs , 1984 .