A probabilistic coverage protocol for wireless sensor networks

Mohamed Hefeeda, Hossein Ahmadi

Research output: Chapter in Book/Report/Conference proceedingConference contribution

64 Citations (Scopus)

Abstract

We propose a new probabilistic coverage protocol (denoted by PCP) that considers probabilistic sensing models. PCP is fairly general and can be used with different sensing models. In particular, PCP requires the computation of a single parameter from the adopted sensing model, while everything else remains the same. We show how this parameter can be derived in general, and we actually do the calculations for two example sensing models: (i) the probabilistic exponential sensing model, and (ii) the commonly-used deterministic disk sensing model. The first model is chosen because it is conservative in terms of estimating sensing capacity, and it has been used before in another probabilistic coverage protocol, which enables us to conduct a fair comparison. Because it is conservative, the exponential sensing model can be used as a first approximation for many other sensing models. The second model is chosen to show that our protocol can easily function as a deterministic coverage protocol. In this case, we compare our protocol against two recent deterministic protocols that were shown to outperform others in the literature. Our comparisons indicate that our protocol outperforms all other protocols in several aspects, including number of activated sensors and total energy consumed. We also demonstrate the robustness of our protocol against random node failures, node location inaccuracy, and imperfect time synchronization.

Original languageEnglish
Title of host publicationProceedings - International Conference on Network Protocols, ICNP
Pages41-50
Number of pages10
DOIs
Publication statusPublished - 1 Dec 2007
Externally publishedYes
Event15th IEEE International Conference on Network Protocols, ICNP 2007 - Beijing, China
Duration: 16 Oct 200719 Oct 2007

Other

Other15th IEEE International Conference on Network Protocols, ICNP 2007
CountryChina
CityBeijing
Period16/10/0719/10/07

Fingerprint

Wireless sensor networks
Network protocols
Synchronization
Sensors

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Hefeeda, M., & Ahmadi, H. (2007). A probabilistic coverage protocol for wireless sensor networks. In Proceedings - International Conference on Network Protocols, ICNP (pp. 41-50). [4375835] https://doi.org/10.1109/ICNP.2007.4375835

A probabilistic coverage protocol for wireless sensor networks. / Hefeeda, Mohamed; Ahmadi, Hossein.

Proceedings - International Conference on Network Protocols, ICNP. 2007. p. 41-50 4375835.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Hefeeda, M & Ahmadi, H 2007, A probabilistic coverage protocol for wireless sensor networks. in Proceedings - International Conference on Network Protocols, ICNP., 4375835, pp. 41-50, 15th IEEE International Conference on Network Protocols, ICNP 2007, Beijing, China, 16/10/07. https://doi.org/10.1109/ICNP.2007.4375835
Hefeeda M, Ahmadi H. A probabilistic coverage protocol for wireless sensor networks. In Proceedings - International Conference on Network Protocols, ICNP. 2007. p. 41-50. 4375835 https://doi.org/10.1109/ICNP.2007.4375835
Hefeeda, Mohamed ; Ahmadi, Hossein. / A probabilistic coverage protocol for wireless sensor networks. Proceedings - International Conference on Network Protocols, ICNP. 2007. pp. 41-50
@inproceedings{e50964d31f3c49259cbe6933900abe4d,
title = "A probabilistic coverage protocol for wireless sensor networks",
abstract = "We propose a new probabilistic coverage protocol (denoted by PCP) that considers probabilistic sensing models. PCP is fairly general and can be used with different sensing models. In particular, PCP requires the computation of a single parameter from the adopted sensing model, while everything else remains the same. We show how this parameter can be derived in general, and we actually do the calculations for two example sensing models: (i) the probabilistic exponential sensing model, and (ii) the commonly-used deterministic disk sensing model. The first model is chosen because it is conservative in terms of estimating sensing capacity, and it has been used before in another probabilistic coverage protocol, which enables us to conduct a fair comparison. Because it is conservative, the exponential sensing model can be used as a first approximation for many other sensing models. The second model is chosen to show that our protocol can easily function as a deterministic coverage protocol. In this case, we compare our protocol against two recent deterministic protocols that were shown to outperform others in the literature. Our comparisons indicate that our protocol outperforms all other protocols in several aspects, including number of activated sensors and total energy consumed. We also demonstrate the robustness of our protocol against random node failures, node location inaccuracy, and imperfect time synchronization.",
author = "Mohamed Hefeeda and Hossein Ahmadi",
year = "2007",
month = "12",
day = "1",
doi = "10.1109/ICNP.2007.4375835",
language = "English",
isbn = "1424415888",
pages = "41--50",
booktitle = "Proceedings - International Conference on Network Protocols, ICNP",

}

TY - GEN

T1 - A probabilistic coverage protocol for wireless sensor networks

AU - Hefeeda, Mohamed

AU - Ahmadi, Hossein

PY - 2007/12/1

Y1 - 2007/12/1

N2 - We propose a new probabilistic coverage protocol (denoted by PCP) that considers probabilistic sensing models. PCP is fairly general and can be used with different sensing models. In particular, PCP requires the computation of a single parameter from the adopted sensing model, while everything else remains the same. We show how this parameter can be derived in general, and we actually do the calculations for two example sensing models: (i) the probabilistic exponential sensing model, and (ii) the commonly-used deterministic disk sensing model. The first model is chosen because it is conservative in terms of estimating sensing capacity, and it has been used before in another probabilistic coverage protocol, which enables us to conduct a fair comparison. Because it is conservative, the exponential sensing model can be used as a first approximation for many other sensing models. The second model is chosen to show that our protocol can easily function as a deterministic coverage protocol. In this case, we compare our protocol against two recent deterministic protocols that were shown to outperform others in the literature. Our comparisons indicate that our protocol outperforms all other protocols in several aspects, including number of activated sensors and total energy consumed. We also demonstrate the robustness of our protocol against random node failures, node location inaccuracy, and imperfect time synchronization.

AB - We propose a new probabilistic coverage protocol (denoted by PCP) that considers probabilistic sensing models. PCP is fairly general and can be used with different sensing models. In particular, PCP requires the computation of a single parameter from the adopted sensing model, while everything else remains the same. We show how this parameter can be derived in general, and we actually do the calculations for two example sensing models: (i) the probabilistic exponential sensing model, and (ii) the commonly-used deterministic disk sensing model. The first model is chosen because it is conservative in terms of estimating sensing capacity, and it has been used before in another probabilistic coverage protocol, which enables us to conduct a fair comparison. Because it is conservative, the exponential sensing model can be used as a first approximation for many other sensing models. The second model is chosen to show that our protocol can easily function as a deterministic coverage protocol. In this case, we compare our protocol against two recent deterministic protocols that were shown to outperform others in the literature. Our comparisons indicate that our protocol outperforms all other protocols in several aspects, including number of activated sensors and total energy consumed. We also demonstrate the robustness of our protocol against random node failures, node location inaccuracy, and imperfect time synchronization.

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

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

U2 - 10.1109/ICNP.2007.4375835

DO - 10.1109/ICNP.2007.4375835

M3 - Conference contribution

SN - 1424415888

SN - 9781424415885

SP - 41

EP - 50

BT - Proceedings - International Conference on Network Protocols, ICNP

ER -