Sciweavers

Share
CONEXT
2008
ACM

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

8 years 8 months ago
A probabilistic model of k-coverage in minimum cost wireless sensor networks
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
S. Ali Raza Zaidi, Maryam Hafeez, Desmond C. McLer
Added 08 Nov 2010
Updated 08 Nov 2010
Type Conference
Year 2008
Where CONEXT
Authors S. Ali Raza Zaidi, Maryam Hafeez, Desmond C. McLernon, Mounir Ghogho
Comments (0)
books