Covering of problem in wireless sensor networks (original) (raw)

Coverage in Wireless Sensor Networks

Computer Communications and Networks, 2009

Ad-hoc networks of devices and sensors with (limited) sensing and wireless communication capabilities are becoming increasingly available for commercial and military applications. The first step in deploying these wireless sensor networks is to determine, with respect to application-specific performance criteria, (i) in the case that the sensors are static, where to deploy or activate them; and (ii) in the case that (a subset of) the sensors are mobile, how to plan the trajectory of the mobile sensors. These two cases are collectively termed as the coverage problem in wireless sensor networks. In this book chapter, we give a comprehensive treatment of the coverage problem. Specifically, we first introduce several fundamental properties of coverage that have been derived in the literature and the corresponding algorithms that will realize these properties. While giving insights on how optimal operations can be devised, most of the properties are derived (and hence their corresponding algorithms are constructed) under the perfect disk assumption. Hence, we consider in the second part of the book chapter coverage in a more realistic setting, and allow (i) the sensing area of a sensor to be anisotropic and of arbitrary shape, depending on the terrain and the meteorological conditions, and (ii) the utilities of coverage in different parts of the monitoring area to be non-uniform, in order to account for the impact of a threat on the population, or the likelihood of a threat taking place at certain locations. Finally, in the third part of the book chapter, we consider mobile sensor coverage, and study how mobile sensors may navigate in a deployment area in order to maximize threat-based coverage.

The coverage problem in a wireless sensor network

Mobile Networks and Applications, 2005

One fundamental issue in sensor networks is the coverage problem, which reflects how well a sensor network is monitored or tracked by sensors. In this paper, we formulate this problem as a decision problem, whose goal is to determine whether every point in the service area of the sensor network is covered by at least k sensors, where k is a predefined value. The sensing ranges of sensors can be unit disks or non-unit disks. We present polynomial-time algorithms, in terms of the number of sensors, that can be easily translated to distributed protocols. The result is a generalization of some earlier results where only k = 1 is assumed. Applications of the result include: (i) positioning applications, (ii) situations which require stronger environmental monitoring capability, and (iii) scenarios which impose more stringent fault-tolerant capability.

Energy-efficient coverage problem s in wireless ad hoc sensor networks

2004

Wireless sensor networks constitute the platform of a broad range of applications related to national security, surveillance, military, health care, and environmental monitoring. The sensor coverage problem has received increased attention recently, being considerably driven by recent advances in affordable and efficient integrated electronic devices. This problem is centered around a fundamental question: How well do the sensors observe the physical space? The coverage concept is subject to a wide range of interpretations due to a variety of sensors and their applications. Different coverage formulations have been proposed, based on the subject to be covered (area versus discrete points) and sensor deployment mechanism (random versus deterministic) as well as on other wireless sensor network properties (e.g. network connectivity and minimum energy consumption). In this article, we survey recent contributions addressing energy-efficient coverage problems in the context of static wireless sensor networks. We present various coverage formulations, their assumptions, as well as an overview of the solutions proposed. q 2005 Published by Elsevier B.V.

On minimum cost coverage in wireless sensor networks

2009 43rd Annual Conference on Information Sciences and Systems, 2009

A solution to the coverage problem in wireless sensor networks provides the total number of sensors that are required to cover a given area of deployment. While prior studies have proposed different formulations and solutions to this problem, these studies have not addressed the problem of minimum cost coverage in which full coverage is achieved by using the minimum number of sensor nodes for an arbitrary geometric shape region. In this paper, we present a geometric solution to the minimum cost coverage problem under a deterministic deployment. Furthermore, we present a probabilistic coverage solution which provides a relationship between the probability of coverage and the number of randomly deployed sensors in an arbitrarily-shaped region. We demonstrate that for virtually 100% probability of coverage, random deployment needs approximately seven times more sensors as compared to a deterministic setup.

Coverage Problem for Sensor Networks: An Overview of Solution Strategies

Coverage is one of the metrics used to quantify the quality of service (QoS) of sensor networks. In general, we use this term to measure the ability of the network to interact with -observe or react to -the phenomena taking place in the area of interest. In addition, coverage is associated with connectivity and energy consumption, both important aspects of the design process of a Wireless Sensor Network (WSN). This paper aims at offering a critical overview and presentation of the problem as well as the main strategies developed so far.

Coverage problems in wireless sensor networks: designs and analysis

International Journal of Sensor Networks, 2008

Recently, a concept of wireless sensor networks has attracted much attention due to its widerange of potential applications. Wireless sensor networks also pose a number of challenging optimization problems. One of the fundamental problems in sensor networks is the coverage problem, which reflects the quality of service that can be provided by a particular sensor network. The coverage concept is defined from several points of view due to a variety of sensors and a wide-range of their applications. Several different designs and formulations of coverage problems have been proposed. They are subject to various topics such as types of interest regions (areas vs. targets) and different objectives (maximum network lifetime, minimum coverage breach) with other constraints. In this paper, we survey the state-of-the-art coverage formulations, present an overview and analysis of the solutions proposed in recent research literature.

Coverage Strategies in Wireless Sensor Networks

International Journal of Distributed Sensor Networks, 2006

An energy efficient cover of a region using Wireless Sensor Networks (WSNs) is addressed in this paper. Sensor nodes in a WSN are characterized by limited power and computational capabilities, and are expected to function for extended periods of time with minimal human intervention. The life span of such networks depends on the efficient use of the available power for sensing and communication. In this paper, the coverage problem in a three dimensional space is rigorously analyzed and the minimum number of sensor nodes and their placement for complete coverage is determined. Also, given a random distribution of sensor nodes, the problem of selecting a minimum subset of sensor nodes for complete coverage is addressed. A computationally efficient algorithm is developed and implemented in a distributed fashion.

A Survey on Coverage Problem in Wireless Ad Hoc and Sensor Networks

2015

A wireless sensor network (WSN) is composed of a group of small power-constrained nodes with functions of sensing and communication, which can be scattered over a vast region for the purpose of detecting or monitoring some special events.Today One of the fundamental issues in sensor networks is the coverage problem, which reflects how well a sensor network is monitored or tracked by sensors. In this paper, we formulate this problem as a decision problem, whose goal is to determine whether every point in the service area of the sensor network is covered by at least k sensors, where k is a given parameter. The sensing ranges of sensors can be unit disks or non-unit disks. We present polynomial-time algorithms, in terms of the number of sensors, that can be easily translated to distributed protocols. The result is a generalization of some earlier results where only k = 1 is assumed. Applications of the result include determining insufficiently covered areas in a sensor network, enhanci...

Solving coverage problems in wireless sensor networks using cover sets

Ad Hoc Networks, 2010

To achieve power efficient monitoring of targets by sensor networks, various coverage algorithms have been proposed. These algorithms divide the sensor nodes into cover sets, where each cover set is capable of monitoring all targets. Generating the maximum number of cover sets has been proven to be an NP-complete problem and, thus, algorithms producing sub-optimal solutions have been proposed. In this paper we present a novel and efficient coverage algorithm, that can produce both disjoint cover sets, i.e. cover sets with no common sensor nodes, as well as non-disjoint cover sets. While searching for the best sensor to include in a cover set, our algorithm uses a cost function that takes into account the monitoring capabilities of a sensor, its association with poorly monitored targets, but also the sensor's remaining battery life. Through simulations, we show that the proposed algorithm outperforms similar heuristic algorithms found in the literature, producing collections of cover sets of optimal (or near-optimal) size. The increased availability offered by these cover sets along with the short execution time of the proposed algorithm make it desirable for a wide range of node deployment environments.

Efficient coverage algorithms for wireless sensor networks

Systems and Information …, 2006

One of the biggest disadvantages of large scale wireless sensor networks lies on the complexity of logistics involving selective replacement of sensors that have ran out of energy. Fortunately, efficient power management schemes provide some relief as they are designed to extend network's lifetime and thus reduce the need of external intervention. In this paper, three centralized and one distributed efficient coverage algorithms are proposed to obtain an improved monitoring quality over time. Simulation results evidence a moderate yet encouraging performance of the distributed scheme and an excellent behavior of the centralized ones.