Name
Abstract | ||
|---|---|---|
In Wireless Sensor Networks (WSNs), coverage is a critical issue that has a major bearing on the quality of sensing over the target region. In this paper, we study the coverage of a region P with a transparent boundary and transparent obstacles. A transparent obstacle is an area in which a sensor cannot be deployed but through which sensing signals can pass. For cost-effectiveness, our problem is to deploy the minimum number of sensors to cover P excluding the obstacles. This problem is challenging mainly due to the fact that the target region is continuous. A straight-forward idea is to sample a finite set of crucial coverage points in P, thus making the coverage space discrete. Most existing approaches, however, tend to either require too many sampled points, which leads to increased running time, or have an inferior coverage of the region. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1016/j.procs.2013.06.035 | Procedia Computer Science |
Keywords | Field | DocType |
Area Coverage,ɛ-net,Random Sampling,Shifting Strategy,Wireless Sensor Networks | Integer,Topology,Data mining,Discretization,Obstacle,Mathematical optimization,Polynomial,Computer science,ε-net,Time complexity,Wireless sensor network,Bounded function | Conference |
Volume | ISSN | Citations |
19 | 1877-0509 | 3 |
PageRank | References | Authors |
0.46 | 12 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Tan Haisheng | 1 | 182 | 27.13 |
| Xiaohong Hao | 2 | 70 | 9.23 |
| Yuexuan Wang | 3 | 385 | 44.81 |
| Francis C. M. Lau | 4 | 1942 | 181.31 |
| Yuezhou Lv | 5 | 42 | 3.49 |