Formal analysis of a scheduling algorithm for wireless sensor networks

  • Authors:

  • Maissa Elleuch;Osman Hasan;Sofiène Tahar;Mohamed Abid

  • Affiliations:

  • CES Laboratory, National School of Engineers of Sfax, Sfax University, Sfax, Tunisia and Dept. of Electrical & Computer Engineering, Concordia University, Montreal, Quebec, Canada;Dept. of Electrical & Computer Engineering, Concordia University, Montreal, Quebec, Canada;Dept. of Electrical & Computer Engineering, Concordia University, Montreal, Quebec, Canada;CES Laboratory, National School of Engineers of Sfax, Sfax University, Sfax, Tunisia

  • Venue:
  • ICFEM'11 Proceedings of the 13th international conference on Formal methods and software engineering
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

In wireless sensor networks (WSNs), scheduling of the sensors is considered to be themost effective energy conservation mechanism. The random and unpredictable deployment of sensors in many WSNs in the open fieldsmakes the sensor scheduling problemvery challenging and thus randomized scheduling algorithms are used. The performance of these algorithms is usually analyzed using simulation techniques, which do not offer 100% accurate results. Moreover, probabilistic model checking, when used, does not include a strong support to reason accurately about statistical quantities like expectation and variance. In this paper, we overcome these limitations by using higher-order-logic theorem proving to formally analyze the coverage-based random scheduling algorithm for WSNs. Using the probabilistic framework developed in the HOL theorem prover, we formally reason about the expected values of coverage intensity, the upper bound on the total number of disjoint subsets, for a given expected coverage intensity, the lower bound on the total number of nodes and the average detection delay inside the network.