Abstract
We propose a distributed connectivity maintenance protocol that explicitly accounts for the probabilistic nature of wireless communication links. The proposed protocol is simple to implement and it achieves a given target communication quality between nodes, which is quantified by the minimum packet delivery rate between any pair of nodes in the network. We demonstrate the robustness of the proposed protocol against random node failures, inaccuracy of node locations, and imperfect time synchronization of nodes using extensive simulations. We extend our connectivity protocol to provide probabilistic coverage as well, where the sensing ranges of sensors follow probabilistic models. Because it employs both probabilistic communication and sensing models, the proposed protocol is more suitable for real sensor network environments than other protocols in the literature that assume a simple disk model for communication and sensing. 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 language | English |
|---|---|
| Pages (from-to) | 295-323 |
| Number of pages | 29 |
| Journal | Ad-Hoc and Sensor Wireless Networks |
| Volume | 7 |
| Issue number | 3-4 |
| Publication status | Published - 2009 |
| Externally published | Yes |
Keywords
- Connectivity maintenance protocols
- Coverage protocols
- Probabilistic communication models
- Probabilistic sensing models
Fingerprint
Dive into the research topics of 'An integrated protocol for maintaining connectivity and coverage under probabilistic models forwireless sensor networks'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver