The coverage-control optimization in sensor network subject to sensing area
Computers & Mathematics with Applications
Coverage problems in sensor networks: A survey
ACM Computing Surveys (CSUR)
Journal of Network and Computer Applications
| Hi-index | 0.00 |
Coverage is an important issue in wireless sensor networks (WSNs) and is often used to measure how well a sensor field is monitored by the deployed sensors. If the area covered by a sensor can also be covered by some other sensors, this sensor can go into an energy-saving sleep state without sacrificing the coverage requirement. In this paper, we study the problem of how to select active sensors with the constraints that the selected active sensors can provide complete field coverage and are completely connected. We propose to use the notion of information coverage, which is based on estimation theory to exploit the collaborative nature of WSNs, instead of using the conventional definition of coverage. Owing to the use of information coverage, a point that is not within the sensing disk of any sensor can still be considered to be covered without loss of estimation reliability. We propose a heuristic to approximately solve our problem. The basic idea is to grow a connected sensor tree to maximize the profit from the covered points of the selected sensors in each step. Simulations are used to validate the effectiveness of the proposed algorithm and the results illustrate that the number of active sensors to provide area coverage can be greatly reduced by using the notion of information coverage compared with that by using the conventional definition of coverage. Copyright © 2008 John Wiley & Sons, Ltd.