Energy-efficient protocol for deterministic and probabilistic coverage in sensor networks

Mohamed Hefeeda, Hossein Ahmadi

Research output: Contribution to journalArticle

64 Citations (Scopus)

Abstract

Various sensor types, e.g., temperature, humidity, and acoustic, sense physical phenomena in different ways, and thus, are expected to have different sensing models. Even for the same sensor type, the sensing model may need to be changed in different environments. Designing and testing a different coverage protocol for each sensing model is indeed a costly task. To address this challenging task, we propose a new probabilistic coverage protocol (denoted by PCP) that could employ different sensing models. We show that PCP works with the common disk sensing model as well as probabilistic sensing models, with minimal changes. We analyze the complexity of PCP and prove its correctness. In addition, we conduct an extensive simulation study of large-scale sensor networks to rigorously evaluate PCP and compare it against other deterministic and probabilistic protocols in the literature. Our simulation demonstrates that PCP is robust, and it can function correctly in presence of random node failures, inaccuracies in node locations, and imperfect time synchronization of nodes. Our comparisons with other protocols indicate that PCP outperforms them in several aspects, including number of activated sensors, total energy consumed, and network lifetime.

Original languageEnglish
Article number5161257
Pages (from-to)579-593
Number of pages15
JournalIEEE Transactions on Parallel and Distributed Systems
Volume21
Issue number5
DOIs
Publication statusPublished - 26 Feb 2010
Externally publishedYes

    Fingerprint

Keywords

  • Coverage in sensor networks
  • Coverage protocols
  • Probabilistic coverage
  • Sensor networks

ASJC Scopus subject areas

  • Hardware and Architecture
  • Signal Processing
  • Computational Theory and Mathematics

Cite this