Name
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 |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1145/1544012.1544045 | CoNEXT |
Keywords | Field | DocType |
arbitrary geometric profile,probabilistic coverage model,full coverage,probabilistic model,coverage problem,coverage probability,wireless sensor network,minimum cost solution,fundamental problem,sensor network,minimum cost,quality of service,tcp | Key distribution in wireless sensor networks,Software deployment,Wireless,Computer science,Quality of service,Computer network,Statistical model,Probabilistic logic,Coverage probability,Wireless sensor network,Distributed computing | Conference |
Citations | PageRank | References |
9 | 0.71 | 3 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| S. Ali Raza Zaidi | 1 | 9 | 0.71 |
| Maryam Hafeez | 2 | 45 | 4.38 |
| D. C. Mclernon | 3 | 126 | 15.01 |
| Mounir Ghogho | 4 | 1072 | 113.80 |