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 Dive into the research topics of 'A probabilistic model of k-coverage in minimum cost wireless sensor networks'. Together they form a unique fingerprint.

  • 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