Formal probabilistic analysis of detection properties in wireless sensor networks

AbstractIn the context of wireless sensor networks (WSNs), the ability to detect an intrusion event is the most desired characteristic. Due to the randomness in nodes scheduling algorithm and sensor deployment, probabilistic techniques are used to analyze the detection properties of WSNs. However traditional probabilistic analysis techniques, such as simulation and model checking, do not ensure accurate results, which is a severe limitation considering the mission-critical nature of most of the WSNs. In this paper, we overcome these limitations by using higher-order-logic theorem proving to formally analyze the detection properties of randomly-deployed WSNs using the randomized scheduling of nodes. Based on the probability theory, available in the HOL theorem prover, we first formally reason about the intrusion period of any occurring event. This characteristic is then built upon to develop the fundamental formalizations of the key detection metrics: the detection probability and the detection delay. For illustration purposes, we formally analyze the detection performance of a WSN deployed for border security monitoring.

[1]  Sofiène Tahar,et al.  On the Formalization of the Lebesgue Integration Theory in HOL , 2010, ITP.

[2]  Joe Hurd,et al.  Formal verification of probabilistic algorithms , 2003 .

[3]  Rekha Jain,et al.  Wireless Sensor Network -A Survey , 2013 .

[4]  Sofiène Tahar,et al.  Using Theorem Proving to Verify Expectation and Variance for Discrete Random Variables , 2008, Journal of Automated Reasoning.

[5]  Xiaojiang Du,et al.  Two and three-dimensional intrusion object detection under randomized scheduling algorithms in sensor networks , 2009, Comput. Networks.

[6]  Sofiène Tahar,et al.  Formal Reasoning about Expectation Properties for Continuous Random Variables , 2009, FM.

[7]  David R Lester,et al.  Topology in PVS: continuous mathematics with applications , 2007, AFM '07.

[8]  M. Gordon,et al.  Introduction to HOL: a theorem proving environment for higher order logic , 1993 .

[9]  Hridesh Rajan,et al.  Slede: a domain-specific verification framework for sensor network security protocol implementations , 2008, WiSec '08.

[10]  Peter V. Schaeffer,et al.  Econometric methods for analyzing economic development , 2014 .

[11]  Mark-Alexander Sujan,et al.  Computer Safety, Reliability, and Security , 2014, Lecture Notes in Computer Science.

[12]  Reformatting Fighter Tactics , .

[13]  H. Katzgraber.  Introduction to Monte Carlo Methods , 2009, 0905.1629.

[14]  Sofiène Tahar,et al.  Formalization of Continuous Probability Distributions , 2007, CADE.

[15]  Yang Xiao,et al.  IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, PAPER ID: TPDS-0307-0605.R1 1 Random Coverage with Guaranteed Connectivity: Joint Scheduling for Wireless Sensor Networks , 2022 .

[16]  L.F.W. van Hoesel,et al.  Modelling and Verification of the LMAC Protocol for Wireless Sensor Networks , 2007, IFM.

[17]  Ying Zhang,et al.  Asymptotic Coverage and Detection in Randomized Scheduling Algorithm in Wireless Sensor Networks , 2007, 2007 IEEE International Conference on Communications.

[18]  Jean-Raymond Abrial,et al.  Faultless Systems: Yes We Can! , 2009, Computer.

[19]  Peter Csaba Ölveczky,et al.  Formal Modeling and Analysis of the OGDC Wireless Sensor Network Algorithm in Real-Time Maude , 2007, FMOODS.

[20]  R. Burger,et al.  A New Keynesian Phillips Curve for South Africa , 2014 .

[21]  Christine Paulin-Mohring,et al.  Proofs of randomized algorithms in Coq , 2006, Sci. Comput. Program..

[22]  Jun Sun,et al.  Towards a Model Checker for NesC and Wireless Sensor Networks , 2011, ICFEM.

[23]  David J. C. Mackay,et al.  Introduction to Monte Carlo Methods , 1998, Learning in Graphical Models.

[24]  Liya Liu,et al.  Formalization of Discrete-time Markov Chains in HOL , 2013 .

[25]  Sofiène Tahar,et al.  Formal Analysis of a Scheduling Algorithm for Wireless Sensor Networks , 2011, ICFEM.

[26]  Jenn-Wei Lin,et al.  Improving the coverage of randomized scheduling in wireless sensor networks , 2008, IEEE Transactions on Wireless Communications.

[27]  William Feller,et al.  An Introduction to Probability Theory and Its Applications , 1951 .

[28]  Sofiène Tahar,et al.  Formal Probabilistic Analysis of a Wireless Sensor Network for Forest Fire Detection , 2012, SCSS.

[29]  Johannes Hölzl,et al.  Three Chapters of Measure Theory in Isabelle/HOL , 2011, ITP.

[30]  Osman Hasan,et al.  Formal probabilistic analysis using theorem proving , 2008 .

[31]  W. Feller,et al.  An Introduction to Probability Theory and Its Applications, Vol. 1 , 1967 .

[32]  Kamel Barkaoui,et al.  Probabilistic verification and evaluation of Backoff procedure of the WSN ECo-MAC protocol , 2010, ArXiv.

[33]  Anil Aggarwal,et al.  Managing Big Data Integration in the Public Sector , 2015 .

[34]  Edmund M. Clarke,et al.  Model Checking , 1999, Handbook of Automated Reasoning.

[35]  Sofiène Tahar,et al.  Formalization of Entropy Measures in HOL , 2011, ITP.

[36]  Cinzia Bernardeschi,et al.  Analysis of Wireless Sensor Network Protocols in Dynamic Scenarios , 2009, SSS.

[37]  José Meseguer,et al.  PMaude: Rewrite-based Specification Language for Probabilistic Object Systems , 2006, QAPL.

[38]  Ashish Goel,et al.  Set k-cover algorithms for energy efficient monitoring in wireless sensor networks , 2003, Third International Symposium on Information Processing in Sensor Networks, 2004. IPSN 2004.

[39]  Matthias Fruth,et al.  Probabilistic Model Checking of Contention Resolution in the IEEE 802.15.4 Low-Rate Wireless Personal Area Network Protocol , 2006, Second International Symposium on Leveraging Applications of Formal Methods, Verification and Validation (isola 2006).

[40]  Jan J. M. M. Rutten,et al.  Mathematical techniques for analyzing concurrent and probabilistic systems , 2004, CRM monograph series.

[41]  Ian F. Akyildiz,et al.  BorderSense: Border patrol through advanced wireless sensor networks , 2011, Ad Hoc Networks.

[42]  Tarek Mhamdi,et al.  Information-Theoretic Analysis using Theorem Proving , 2012 .

[43]  Cinzia Bernardeschi,et al.  Early Prototyping of Wireless Sensor Network Algorithms in PVS , 2008, SAFECOMP.

[44]  S. Srivastava,et al.  A Survey and Classification of Distributed Scheduling Algorithms for Sensor Networks , 2007, 2007 International Conference on Sensor Technologies and Applications (SENSORCOMM 2007).

[45]  Ying Zhang,et al.  Coverage and Detection of a Randomized Scheduling Algorithm in Wireless Sensor Networks , 2010, IEEE Transactions on Computers.

[46]  Vinayak S. Naik,et al.  A line in the sand: a wireless sensor network for target detection, classification, and tracking , 2004, Comput. Networks.