On minimum cost coverage in wireless sensor networks

S. A.R. Zaidi, M. Hafeez, S. A. Khayam, D. C. Mclernon, M. Ghogho, K. Kim

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

14 Citations (Scopus)


A solution to the coverage problem in wireless sensor networks provides the total number of sensors that are required to cover a given area of deployment. While prior studies have proposed different formulations and solutions to this problem, these studies have not addressed the problem of minimum cost coverage in which full coverage is achieved by using the minimum number of sensor nodes for an arbitrary geometric shape region. In this paper, we present a geometric solution to the minimum cost coverage problem under a deterministic deployment. Furthermore, we present a probabilistic coverage solution which provides a relationship between the probability of coverage and the number of randomly deployed sensors in an arbitrarily-shaped region. We demonstrate that for virtually 100% probability of coverage, random deployment needs approximately seven times more sensors as compared to a deterministic setup.

Original languageEnglish
Title of host publicationProceedings - 43rd Annual Conference on Information Sciences and Systems, CISS 2009
Number of pages6
ISBN (Electronic)9781424427345
ISBN (Print)9781424427338
Publication statusPublished - 2 Jun 2009
Externally publishedYes
Event43rd Annual Conference on Information Sciences and Systems - Baltimore, United States
Duration: 18 Mar 200920 Mar 2009
Conference number: 43


Conference43rd Annual Conference on Information Sciences and Systems
Abbreviated titleCISS 2009
Country/TerritoryUnited States


Dive into the research topics of 'On minimum cost coverage in wireless sensor networks'. Together they form a unique fingerprint.

Cite this