On minimum cost coverage in wireless sensor networks

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

doi:10.1109/CISS.2009.5054719

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 proceeding › Conference contribution › peer-review

14 Citations (Scopus)

Abstract

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 language	English
Title of host publication	Proceedings - 43rd Annual Conference on Information Sciences and Systems, CISS 2009
Publisher	IEEE
Pages	213-218
Number of pages	6
ISBN (Electronic)	9781424427345
ISBN (Print)	9781424427338
DOIs	https://doi.org/10.1109/CISS.2009.5054719
Publication status	Published - 2 Jun 2009
Externally published	Yes
Event	43rd Annual Conference on Information Sciences and Systems - Baltimore, United States Duration: 18 Mar 2009 → 20 Mar 2009 Conference number: 43

Conference

Conference	43rd Annual Conference on Information Sciences and Systems
Abbreviated title	CISS 2009
Country/Territory	United States
City	Baltimore
Period	18/03/09 → 20/03/09

Access to Document

10.1109/CISS.2009.5054719Licence: Unspecified

Cite this

@inproceedings{6ee18f66dc8d4f07aacbff72a660060c,

title = "On minimum cost coverage in wireless sensor networks",

abstract = "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.",

keywords = "costs, wireless sensor networks, shape, computer science, personal area networks, computerized monitoring, surveillance, medical services, automation, condition monitoring",

author = "Zaidi, {S. A.R.} and M. Hafeez and Khayam, {S. A.} and Mclernon, {D. C.} and M. Ghogho and K. Kim",

year = "2009",

month = jun,

day = "2",

doi = "10.1109/CISS.2009.5054719",

language = "English",

isbn = "9781424427338",

pages = "213--218",

booktitle = "Proceedings - 43rd Annual Conference on Information Sciences and Systems, CISS 2009",

publisher = "IEEE",

address = "United States",

}

Zaidi, SAR, Hafeez, M, Khayam, SA, Mclernon, DC, Ghogho, M & Kim, K 2009, On minimum cost coverage in wireless sensor networks. in Proceedings - 43rd Annual Conference on Information Sciences and Systems, CISS 2009., 5054719, IEEE, pp. 213-218, 43rd Annual Conference on Information Sciences and Systems, Baltimore, Maryland, United States, 18/03/09. https://doi.org/10.1109/CISS.2009.5054719

TY - GEN

T1 - On minimum cost coverage in wireless sensor networks

AU - Zaidi, S. A.R.

AU - Hafeez, M.

AU - Khayam, S. A.

AU - Mclernon, D. C.

AU - Ghogho, M.

AU - Kim, K.

N1 - Conference code: 43

PY - 2009/6/2

Y1 - 2009/6/2

N2 - 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.

AB - 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.

KW - costs

KW - wireless sensor networks

KW - shape

KW - computer science

KW - personal area networks

KW - computerized monitoring

KW - surveillance

KW - medical services

KW - automation

KW - condition monitoring

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

U2 - 10.1109/CISS.2009.5054719

DO - 10.1109/CISS.2009.5054719

M3 - Conference contribution

AN - SCOPUS:70349653774

SN - 9781424427338

SP - 213

EP - 218

BT - Proceedings - 43rd Annual Conference on Information Sciences and Systems, CISS 2009

PB - IEEE

T2 - 43rd Annual Conference on Information Sciences and Systems

Y2 - 18 March 2009 through 20 March 2009

ER -

On minimum cost coverage in wireless sensor networks

Abstract

Conference

Access to Document

Other files and links

Fingerprint

Cite this