Information Theoretic Approach to Detecting Systematic Node Destructions in Wireless Sensor Networks

Hazards such as fires and floods may destroy and prevent nodes of a wireless sensor network from functioning properly and reporting measurements of interest. Destructions by hazardous events are systematic and hence different from random node and link failures, which are very common in wireless sensor networks due to the fragility of devices and the intermittent degradation in wireless link quality. An information theoretic approach is presented that may be used for detecting systematic node destructions in dense sensor deployments wherein detection by visual inspection of the destroyed sensors on a "sensor map" at a central monitoring station is hard, if not impossible. It is shown that the information theoretic approach combined with the statistical methodology presented can effectively be used for automated triggering of alarms in decision support systems to rapidly contain hazards. It is also shown that as few as approximately 20 close-proximity sensor failures could be considered "unusual" enough to detect a systematic destruction with 90% confidence in dense sensor deployments, and this is observed to be independent of deployment density. Simulations also indicate that connectivity, which is critical in wireless sensor networks for relaying measured data, is with high probability not compromised before detection takes place.

[1]  Dogu Arifler,et al.  Second-Order Analysis of Formation of Holes in Spatial Point Patterns: Applications in Wireless Sensor Networks , 2007, 2007 5th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks and Workshops.

[2]  Sándor P. Fekete,et al.  Deterministic boundary recognition and topology extraction for large sensor networks , 2005, SODA '06.

[3]  Sanjay Jha,et al.  The holes problem in wireless sensor networks: a survey , 2005, MOCO.

[4]  Piyush Gupta,et al.  Critical Power for Asymptotic Connectivity in Wireless Networks , 1999 .

[5]  Ian F. Akyildiz,et al.  Wireless sensor networks: a survey , 2002, Comput. Networks.

[6]  Stefan Funke,et al.  Hole detection or: "how much geometry hides in connectivity?" , 2006, SCG '06.

[7]  G. Chapman,et al.  The Application of Information Theory to the Analysis of Population Distributions in Space , 1970 .

[8]  Leonidas J. Guibas,et al.  Locating and bypassing routing holes in sensor networks , 2004, IEEE INFOCOM 2004.

[9]  Henri Theil,et al.  Economics and information theory , 1967 .

[10]  Paolo Santi Topology control in wireless ad hoc and sensor networks , 2005 .

[11]  Bhaskar Krishnamachari,et al.  An adaptive energy-efficient and low-latency MAC for data gathering in wireless sensor networks , 2004, 18th International Parallel and Distributed Processing Symposium, 2004. Proceedings..

[12]  Atsuyuki Okabe,et al.  Spatial Tessellations: Concepts and Applications of Voronoi Diagrams , 1992, Wiley Series in Probability and Mathematical Statistics.

[13]  Daniel Zwillinger,et al.  CRC Standard Probability and Statistics Tables and Formulae, Student Edition , 1999 .

[14]  Stefan Funke,et al.  Topological hole detection in wireless sensor networks and its applications , 2005, DIALM-POMC '05.

[15]  R. Srikant,et al.  Unreliable sensor grids: coverage, connectivity and diameter , 2005, Ad Hoc Networks.

[16]  D. Stoyan,et al.  Stochastic Geometry and Its Applications , 1989 .

[17]  W. Beyer CRC Standard Probability And Statistics Tables and Formulae , 1990 .

[18]  Sándor P. Fekete,et al.  Neighborhood-Based Topology Recognition in Sensor Networks , 2004, ALGOSENSORS.

[19]  Ralph Lews,et al.  Redundancy as an Index of Change in Point Pattern Analysis , 2010 .

[20]  M. Penrose The longest edge of the random minimal spanning tree , 1997 .

[21]  I.F. Akyildiz,et al.  Spatial correlation-based collaborative medium access control in wireless sensor networks , 2006, IEEE/ACM Transactions on Networking.