Global barrier coverage that requires much fewer sensors than full coverage, is known to be
an appropriate model of coverage for movement detection applications such as intrusion …

Deriving the critical density (which is equivalent to deriving the critical radius or power) to
achieve coverage and/or connectivity for random deployments is a fundamental problem in …

The Voronoi Diagram (VD) is a fundamental algorithm for resolving the coverage problems
of wireless sensor networks. Most VD based coverage algorithms collect global location …

Coverage is an important issue related to WSN quality of service. Several centralized/
decentralized solutions based on geometry information and under the assumption of disk …

Target detection and field surveillance are among the most prominent applications of Sensor
Networks (SN). The quality of detection achieved by a SN can be quantified by evaluating …

The problem of sleep wakeup has been extensively studied for the full coverage model,
where every point in the deployment region is covered by some sensor. Since the sleep …

In this article we analyze the capabilities of various models of sensor networks with the
Boolean sensing model for mobile or stationary sensors and targets, under random or …

In this paper, we propose a k-coverage preserving protocol to achieve energy efficiency
while ensuring the required coverage. In our protocol, we try to select a minimal active set of …

Recent research in sensor networks highlights the low-power mode operation of sensor
networks. In wireless sensor networks, network lifetime can be extended by organizing …

The circular sensing model has been widely used to estimate performance of sensing
applications in existing analysis and simulations. While this model provides valuable high …