Towards the Formal Performance Analysis of Wireless Sensor Networks

The performance of Wireless Sensor Networks (WSNs) is traditionally analyzed using simulation or paper-and-pencil proof methods. However, such methods cannot ascertain accurate analysis, which is a serious drawback for safety and financial-critical applications. In order to overcome this limitation, we propose to use a higher-order-logic theorem prover (HOL) to formally analyze the performance of WSNs. In particular, this paper presents a generic formal performance analysis methodology for WSNs using the k-set randomized scheduling as an energy saving approach. The proposed methodology is primarily based on the formalized theories of measure and probability. For illustration purposes, we formally analyze the performance of a WSN deployed for volcanic earthquake detection.

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

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

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

[4]  Yang Xiao,et al.  Divide- and conquer-based surveillance framework using robots, sensor nodes, and RFID tags , 2011, Wirel. Commun. Mob. Comput..

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

[6]  Renjie Huang,et al.  Air-dropped sensor network for real-time high-fidelity volcano monitoring , 2009, MobiSys '09.

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

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

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

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

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

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

[13]  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 .

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

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

[16]  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).

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

[18]  Biswanath Mukherjee,et al.  Wireless sensor network survey , 2008, Comput. Networks.

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