A probabilistic model of k-coverage in minimum cost wireless sensor networks

S. Ali Raza Zaidi, Maryam Hafeez, D C McLernon, Mounir Ghogho

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

11 Citations (Scopus)

Abstract

One of the fundamental problems in the wireless sensor
networks is the coverage problem. The coverage problem
fundamentally address the quality of service (surveillance
or monitoring) provided in the desired area. In past, several
studies have proposed different formulation and solutions
to this problem. Nevertheless none of them has addressed
minimum cost solution to the coverage problem. In this
paper we consider minimum cost wireless sensor network
which provides full coverage to any arbitrary geometric
profile under deterministic/random deployment. We then
formulate probabilistic coverage model which provides k -
coverage probability for minimum cost wireless sensor
networks.1
Original languageEnglish
Title of host publicationProceedings of the 2008 ACM CoNEXT Conference
PublisherAssociation for Computing Machinery (ACM)
Number of pages2
ISBN (Print)9781605582108
DOIs
Publication statusPublished - 2008
Externally publishedYes
Event4th International Conference On Emerging Networking Experiments And Technologies - Madrid, Spain
Duration: 9 Dec 200812 Dec 2008
https://dl.acm.org/citation.cfm?id=1544012

Conference

Conference4th International Conference On Emerging Networking Experiments And Technologies
Abbreviated titleCoNEXT 08
CountrySpain
CityMadrid
Period9/12/0812/12/08
Internet address

Fingerprint

Wireless sensor networks
Costs
Quality of service
Monitoring
Sensors
Statistical Models

Cite this

Zaidi, S. A. R., Hafeez, M., McLernon, D. C., & Ghogho, M. (2008). A probabilistic model of k-coverage in minimum cost wireless sensor networks. In Proceedings of the 2008 ACM CoNEXT Conference Association for Computing Machinery (ACM). https://doi.org/10.1145/1544012.1544045
Zaidi, S. Ali Raza ; Hafeez, Maryam ; McLernon, D C ; Ghogho, Mounir. / A probabilistic model of k-coverage in minimum cost wireless sensor networks. Proceedings of the 2008 ACM CoNEXT Conference. Association for Computing Machinery (ACM), 2008.
@inproceedings{f096410796864d4bb0baaf29984a9cde,
title = "A probabilistic model of k-coverage in minimum cost wireless sensor networks",
abstract = "One of the fundamental problems in the wireless sensornetworks is the coverage problem. The coverage problemfundamentally address the quality of service (surveillanceor monitoring) provided in the desired area. In past, severalstudies have proposed different formulation and solutionsto this problem. Nevertheless none of them has addressedminimum cost solution to the coverage problem. In thispaper we consider minimum cost wireless sensor networkwhich provides full coverage to any arbitrary geometricprofile under deterministic/random deployment. We thenformulate probabilistic coverage model which provides k -coverage probability for minimum cost wireless sensornetworks.1",
author = "Zaidi, {S. Ali Raza} and Maryam Hafeez and McLernon, {D C} and Mounir Ghogho",
year = "2008",
doi = "10.1145/1544012.1544045",
language = "English",
isbn = "9781605582108",
booktitle = "Proceedings of the 2008 ACM CoNEXT Conference",
publisher = "Association for Computing Machinery (ACM)",
address = "United States",

}

Zaidi, SAR, Hafeez, M, McLernon, DC & Ghogho, M 2008, A probabilistic model of k-coverage in minimum cost wireless sensor networks. in Proceedings of the 2008 ACM CoNEXT Conference. Association for Computing Machinery (ACM), 4th International Conference On Emerging Networking Experiments And Technologies, Madrid, Spain, 9/12/08. https://doi.org/10.1145/1544012.1544045

A probabilistic model of k-coverage in minimum cost wireless sensor networks. / Zaidi, S. Ali Raza; Hafeez, Maryam; McLernon, D C ; Ghogho, Mounir.

Proceedings of the 2008 ACM CoNEXT Conference. Association for Computing Machinery (ACM), 2008.

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

TY - GEN

T1 - A probabilistic model of k-coverage in minimum cost wireless sensor networks

AU - Zaidi, S. Ali Raza

AU - Hafeez, Maryam

AU - McLernon, D C

AU - Ghogho, Mounir

PY - 2008

Y1 - 2008

N2 - One of the fundamental problems in the wireless sensornetworks is the coverage problem. The coverage problemfundamentally address the quality of service (surveillanceor monitoring) provided in the desired area. In past, severalstudies have proposed different formulation and solutionsto this problem. Nevertheless none of them has addressedminimum cost solution to the coverage problem. In thispaper we consider minimum cost wireless sensor networkwhich provides full coverage to any arbitrary geometricprofile under deterministic/random deployment. We thenformulate probabilistic coverage model which provides k -coverage probability for minimum cost wireless sensornetworks.1

AB - One of the fundamental problems in the wireless sensornetworks is the coverage problem. The coverage problemfundamentally address the quality of service (surveillanceor monitoring) provided in the desired area. In past, severalstudies have proposed different formulation and solutionsto this problem. Nevertheless none of them has addressedminimum cost solution to the coverage problem. In thispaper we consider minimum cost wireless sensor networkwhich provides full coverage to any arbitrary geometricprofile under deterministic/random deployment. We thenformulate probabilistic coverage model which provides k -coverage probability for minimum cost wireless sensornetworks.1

U2 - 10.1145/1544012.1544045

DO - 10.1145/1544012.1544045

M3 - Conference contribution

SN - 9781605582108

BT - Proceedings of the 2008 ACM CoNEXT Conference

PB - Association for Computing Machinery (ACM)

ER -

Zaidi SAR, Hafeez M, McLernon DC, Ghogho M. A probabilistic model of k-coverage in minimum cost wireless sensor networks. In Proceedings of the 2008 ACM CoNEXT Conference. Association for Computing Machinery (ACM). 2008 https://doi.org/10.1145/1544012.1544045