Network connectivity under probabilistic communication models in wireless sensor networks

Mohamed Hefeeda, Hossein Ahmadi

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

9 Citations (Scopus)

Abstract

Several previous works have experimentally shown that communication ranges of sensors are not regular disks. Rather, they follow probabilistic models. Yet, many current connectivity maintenance protocols assume the disk communication model for convenience and ease of analysis. In addition, current protocols do not provide any assessment of the quality of communication between nodes. In this paper, we take a first step in designing connectivity maintenance protocols for more realistic communication models. We propose a distributed connectivity maintenance protocol that explicitly accounts for the probabilistic nature of communication links and achieves a given target communication quality between nodes. Our protocol is simple to implement, and we demonstrate its robustness against random node failures, inaccuracy of node locations, and imperfect time synchronization of nodes using extensive simulations. We compare our protocol against others in the literature and show that it activates fewer number of nodes, consumes much less energy, and significantly prolongs the network lifetime.

Original languageEnglish
Title of host publication2007 IEEE Internatonal Conference on Mobile Adhoc and Sensor Systems, MASS
DOIs
Publication statusPublished - 1 Dec 2007
Externally publishedYes
Event2007 IEEE Internatonal Conference on Mobile Adhoc and Sensor Systems, MASS - Pisa, Italy
Duration: 8 Oct 200711 Oct 2007

Other

Other2007 IEEE Internatonal Conference on Mobile Adhoc and Sensor Systems, MASS
CountryItaly
CityPisa
Period8/10/0711/10/07

Fingerprint

Wireless sensor networks
Network protocols
Communication
Telecommunication links
Synchronization
Sensors

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Control and Systems Engineering

Cite this

Hefeeda, M., & Ahmadi, H. (2007). Network connectivity under probabilistic communication models in wireless sensor networks. In 2007 IEEE Internatonal Conference on Mobile Adhoc and Sensor Systems, MASS [4428600] https://doi.org/10.1109/MOBHOC.2007.4428600

Network connectivity under probabilistic communication models in wireless sensor networks. / Hefeeda, Mohamed; Ahmadi, Hossein.

2007 IEEE Internatonal Conference on Mobile Adhoc and Sensor Systems, MASS. 2007. 4428600.

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

Hefeeda, M & Ahmadi, H 2007, Network connectivity under probabilistic communication models in wireless sensor networks. in 2007 IEEE Internatonal Conference on Mobile Adhoc and Sensor Systems, MASS., 4428600, 2007 IEEE Internatonal Conference on Mobile Adhoc and Sensor Systems, MASS, Pisa, Italy, 8/10/07. https://doi.org/10.1109/MOBHOC.2007.4428600
Hefeeda M, Ahmadi H. Network connectivity under probabilistic communication models in wireless sensor networks. In 2007 IEEE Internatonal Conference on Mobile Adhoc and Sensor Systems, MASS. 2007. 4428600 https://doi.org/10.1109/MOBHOC.2007.4428600
Hefeeda, Mohamed ; Ahmadi, Hossein. / Network connectivity under probabilistic communication models in wireless sensor networks. 2007 IEEE Internatonal Conference on Mobile Adhoc and Sensor Systems, MASS. 2007.
@inproceedings{f216f87046a44537b080b6c187ae7315,
title = "Network connectivity under probabilistic communication models in wireless sensor networks",
abstract = "Several previous works have experimentally shown that communication ranges of sensors are not regular disks. Rather, they follow probabilistic models. Yet, many current connectivity maintenance protocols assume the disk communication model for convenience and ease of analysis. In addition, current protocols do not provide any assessment of the quality of communication between nodes. In this paper, we take a first step in designing connectivity maintenance protocols for more realistic communication models. We propose a distributed connectivity maintenance protocol that explicitly accounts for the probabilistic nature of communication links and achieves a given target communication quality between nodes. Our protocol is simple to implement, and we demonstrate its robustness against random node failures, inaccuracy of node locations, and imperfect time synchronization of nodes using extensive simulations. We compare our protocol against others in the literature and show that it activates fewer number of nodes, consumes much less energy, and significantly prolongs the network lifetime.",
author = "Mohamed Hefeeda and Hossein Ahmadi",
year = "2007",
month = "12",
day = "1",
doi = "10.1109/MOBHOC.2007.4428600",
language = "English",
isbn = "1424414555",
booktitle = "2007 IEEE Internatonal Conference on Mobile Adhoc and Sensor Systems, MASS",

}

TY - GEN

T1 - Network connectivity under probabilistic communication models in wireless sensor networks

AU - Hefeeda, Mohamed

AU - Ahmadi, Hossein

PY - 2007/12/1

Y1 - 2007/12/1

N2 - Several previous works have experimentally shown that communication ranges of sensors are not regular disks. Rather, they follow probabilistic models. Yet, many current connectivity maintenance protocols assume the disk communication model for convenience and ease of analysis. In addition, current protocols do not provide any assessment of the quality of communication between nodes. In this paper, we take a first step in designing connectivity maintenance protocols for more realistic communication models. We propose a distributed connectivity maintenance protocol that explicitly accounts for the probabilistic nature of communication links and achieves a given target communication quality between nodes. Our protocol is simple to implement, and we demonstrate its robustness against random node failures, inaccuracy of node locations, and imperfect time synchronization of nodes using extensive simulations. We compare our protocol against others in the literature and show that it activates fewer number of nodes, consumes much less energy, and significantly prolongs the network lifetime.

AB - Several previous works have experimentally shown that communication ranges of sensors are not regular disks. Rather, they follow probabilistic models. Yet, many current connectivity maintenance protocols assume the disk communication model for convenience and ease of analysis. In addition, current protocols do not provide any assessment of the quality of communication between nodes. In this paper, we take a first step in designing connectivity maintenance protocols for more realistic communication models. We propose a distributed connectivity maintenance protocol that explicitly accounts for the probabilistic nature of communication links and achieves a given target communication quality between nodes. Our protocol is simple to implement, and we demonstrate its robustness against random node failures, inaccuracy of node locations, and imperfect time synchronization of nodes using extensive simulations. We compare our protocol against others in the literature and show that it activates fewer number of nodes, consumes much less energy, and significantly prolongs the network lifetime.

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

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

U2 - 10.1109/MOBHOC.2007.4428600

DO - 10.1109/MOBHOC.2007.4428600

M3 - Conference contribution

SN - 1424414555

SN - 9781424414550

BT - 2007 IEEE Internatonal Conference on Mobile Adhoc and Sensor Systems, MASS

ER -