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

Mohamed Hefeeda, Hossein Ahmadi

Research output: Contribution to journalArticle

59 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

Sensor networks
Network protocols
Sensors
Atmospheric humidity
Synchronization
Acoustics
Testing
Temperature

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

Energy-efficient protocol for deterministic and probabilistic coverage in sensor networks. / Hefeeda, Mohamed; Ahmadi, Hossein.

In: IEEE Transactions on Parallel and Distributed Systems, Vol. 21, No. 5, 5161257, 26.02.2010, p. 579-593.

Research output: Contribution to journalArticle

@article{145f953b70064d919a5e011c353e6b7b,
title = "Energy-efficient protocol for deterministic and probabilistic coverage in sensor networks",
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.",
keywords = "Coverage in sensor networks, Coverage protocols, Probabilistic coverage, Sensor networks",
author = "Mohamed Hefeeda and Hossein Ahmadi",
year = "2010",
month = "2",
day = "26",
doi = "10.1109/TPDS.2009.112",
language = "English",
volume = "21",
pages = "579--593",
journal = "IEEE Transactions on Parallel and Distributed Systems",
issn = "1045-9219",
publisher = "IEEE Computer Society",
number = "5",

}

TY - JOUR

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

AU - Hefeeda, Mohamed

AU - Ahmadi, Hossein

PY - 2010/2/26

Y1 - 2010/2/26

N2 - 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.

AB - 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.

KW - Coverage in sensor networks

KW - Coverage protocols

KW - Probabilistic coverage

KW - Sensor networks

UR - http://www.scopus.com/inward/record.url?scp=77950629206&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77950629206&partnerID=8YFLogxK

U2 - 10.1109/TPDS.2009.112

DO - 10.1109/TPDS.2009.112

M3 - Article

VL - 21

SP - 579

EP - 593

JO - IEEE Transactions on Parallel and Distributed Systems

JF - IEEE Transactions on Parallel and Distributed Systems

SN - 1045-9219

IS - 5

M1 - 5161257

ER -