Randomized k-coverage algorithms for dense sensor networks

Mohamed Hefeeda, Majid Bagheri

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

113 Citations (Scopus)

Abstract

We propose new algorithms to achieve k-coverage in dense sensor networks. In such networks, covering sensor locations approximates covering the whole area. However, it has been shown before that selecting the minimum set of sensors to activate from an already deployed set of sensors is NP-hard. We propose an efficient approximation algorithm which achieves a solution of size within a logarithmic factor of the optimal. We prove that our algorithm is correct and analyze its complexity. We implement our algorithm and compare it against two others in the literature. Our results show that the logarithmic factor is only a worst-case upper bound and the solution size is close to the optimal in most cases. A key feature of our algorithm is that it can be implemented in a distributed manner with local information and low message complexity. We design and implement a fully distributed version of our algorithm. Our distributed algorithm does not require that sensors know their locations. Comparison with two other distributed algorithms in the literature indicates that our algorithm: (i) converges much faster than the others, (ii) activates near-optimal number of sensors, and (iii) significantly prolongs (almost doubles) the network lifetime because it consumes much less energy than the other algorithms.

Original languageEnglish
Title of host publicationProceedings - IEEE INFOCOM
Pages2376-2380
Number of pages5
DOIs
Publication statusPublished - 4 Sep 2007
Externally publishedYes
EventIEEE INFOCOM 2007: 26th IEEE International Conference on Computer Communications - Anchorage, AK, United States
Duration: 6 May 200712 May 2007

Other

OtherIEEE INFOCOM 2007: 26th IEEE International Conference on Computer Communications
CountryUnited States
CityAnchorage, AK
Period6/5/0712/5/07

Fingerprint

Sensor networks
Sensors
Parallel algorithms
Approximation algorithms

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Hardware and Architecture

Cite this

Hefeeda, M., & Bagheri, M. (2007). Randomized k-coverage algorithms for dense sensor networks. In Proceedings - IEEE INFOCOM (pp. 2376-2380). [4215866] https://doi.org/10.1109/INFCOM.2007.284

Randomized k-coverage algorithms for dense sensor networks. / Hefeeda, Mohamed; Bagheri, Majid.

Proceedings - IEEE INFOCOM. 2007. p. 2376-2380 4215866.

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

Hefeeda, M & Bagheri, M 2007, Randomized k-coverage algorithms for dense sensor networks. in Proceedings - IEEE INFOCOM., 4215866, pp. 2376-2380, IEEE INFOCOM 2007: 26th IEEE International Conference on Computer Communications, Anchorage, AK, United States, 6/5/07. https://doi.org/10.1109/INFCOM.2007.284
Hefeeda M, Bagheri M. Randomized k-coverage algorithms for dense sensor networks. In Proceedings - IEEE INFOCOM. 2007. p. 2376-2380. 4215866 https://doi.org/10.1109/INFCOM.2007.284
Hefeeda, Mohamed ; Bagheri, Majid. / Randomized k-coverage algorithms for dense sensor networks. Proceedings - IEEE INFOCOM. 2007. pp. 2376-2380
@inproceedings{8dc73481c9594955a22fdb012591b7c2,
title = "Randomized k-coverage algorithms for dense sensor networks",
abstract = "We propose new algorithms to achieve k-coverage in dense sensor networks. In such networks, covering sensor locations approximates covering the whole area. However, it has been shown before that selecting the minimum set of sensors to activate from an already deployed set of sensors is NP-hard. We propose an efficient approximation algorithm which achieves a solution of size within a logarithmic factor of the optimal. We prove that our algorithm is correct and analyze its complexity. We implement our algorithm and compare it against two others in the literature. Our results show that the logarithmic factor is only a worst-case upper bound and the solution size is close to the optimal in most cases. A key feature of our algorithm is that it can be implemented in a distributed manner with local information and low message complexity. We design and implement a fully distributed version of our algorithm. Our distributed algorithm does not require that sensors know their locations. Comparison with two other distributed algorithms in the literature indicates that our algorithm: (i) converges much faster than the others, (ii) activates near-optimal number of sensors, and (iii) significantly prolongs (almost doubles) the network lifetime because it consumes much less energy than the other algorithms.",
author = "Mohamed Hefeeda and Majid Bagheri",
year = "2007",
month = "9",
day = "4",
doi = "10.1109/INFCOM.2007.284",
language = "English",
isbn = "1424410479",
pages = "2376--2380",
booktitle = "Proceedings - IEEE INFOCOM",

}

TY - GEN

T1 - Randomized k-coverage algorithms for dense sensor networks

AU - Hefeeda, Mohamed

AU - Bagheri, Majid

PY - 2007/9/4

Y1 - 2007/9/4

N2 - We propose new algorithms to achieve k-coverage in dense sensor networks. In such networks, covering sensor locations approximates covering the whole area. However, it has been shown before that selecting the minimum set of sensors to activate from an already deployed set of sensors is NP-hard. We propose an efficient approximation algorithm which achieves a solution of size within a logarithmic factor of the optimal. We prove that our algorithm is correct and analyze its complexity. We implement our algorithm and compare it against two others in the literature. Our results show that the logarithmic factor is only a worst-case upper bound and the solution size is close to the optimal in most cases. A key feature of our algorithm is that it can be implemented in a distributed manner with local information and low message complexity. We design and implement a fully distributed version of our algorithm. Our distributed algorithm does not require that sensors know their locations. Comparison with two other distributed algorithms in the literature indicates that our algorithm: (i) converges much faster than the others, (ii) activates near-optimal number of sensors, and (iii) significantly prolongs (almost doubles) the network lifetime because it consumes much less energy than the other algorithms.

AB - We propose new algorithms to achieve k-coverage in dense sensor networks. In such networks, covering sensor locations approximates covering the whole area. However, it has been shown before that selecting the minimum set of sensors to activate from an already deployed set of sensors is NP-hard. We propose an efficient approximation algorithm which achieves a solution of size within a logarithmic factor of the optimal. We prove that our algorithm is correct and analyze its complexity. We implement our algorithm and compare it against two others in the literature. Our results show that the logarithmic factor is only a worst-case upper bound and the solution size is close to the optimal in most cases. A key feature of our algorithm is that it can be implemented in a distributed manner with local information and low message complexity. We design and implement a fully distributed version of our algorithm. Our distributed algorithm does not require that sensors know their locations. Comparison with two other distributed algorithms in the literature indicates that our algorithm: (i) converges much faster than the others, (ii) activates near-optimal number of sensors, and (iii) significantly prolongs (almost doubles) the network lifetime because it consumes much less energy than the other algorithms.

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

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

U2 - 10.1109/INFCOM.2007.284

DO - 10.1109/INFCOM.2007.284

M3 - Conference contribution

AN - SCOPUS:34548297823

SN - 1424410479

SN - 9781424410477

SP - 2376

EP - 2380

BT - Proceedings - IEEE INFOCOM

ER -