An Approximate Approach for Area Coverage in Wireless Sensor Networks
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, the authors 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, their 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.