Self-organizing sensor networks: Coverage problem

Abstract

The problem of coverage in sensor network can be faced in different fields, each having its own special meaning, terminologies and objectives. However, the ultimate goal of solving a `coverage problem' is to blanket a specific `region' with specific `observers'. The region can be planar or volumetric, and the observers can be of limited capabilities. A wireless sensor network is said to provide full coverage in a region if every point in the region is within the monitoring range of some sensors. The main concepts of full coverage will be discussed in this paper.