Related papers: Covering a line segment with variable radius discs
The coverage problem in wireless sensor networks deals with the problem of covering a region or parts of it with sensors. In this paper, we address the problem of covering a set of line segments in sensor networks. A line segment ` is said…
Given a set of objects with durations (jobs) that cover a base region, can we schedule the jobs to maximize the duration the original region remains covered? We call this problem the sensor cover problem. This problem arises in the context…
The problem of covering random points in a plane with sets of a given shape has several practical applications in communications and operations research. One especially prominent application is the coverage of randomly-located points of…
A common robotics sensing problem is to place sensors to robustly monitor a set of assets, where robustness is assured by requiring asset $p$ to be monitored by at least $\kappa(p)$ sensors. Given $n$ assets that must be observed by $m$…
An important application of wireless sensor networks is the deployment of mobile sensors to periodically monitor (cover) a set of points of interest (PoIs). The problem of Point Sweep Coverage is to deploy fewest sensors to periodically…
Given a set $P$ of $n$ points and a set $S$ of $m$ disks in the plane, the disk coverage problem asks for a smallest subset of disks that together cover all points of $P$. The problem is NP-hard. In this paper, we consider a line-separable…
Sweep coverage is to realize the periodic coverage of targets by planning the periodic sweeping paths of mobile sensors. It is difficult for sensors to reduce energy consumption by reducing the moving distances. Therefore, charging…
In this paper, we consider the problem of covering a plane region with unit discs. We present an improved upper bound and the first nontrivial lower bound on the number of discs needed for such a covering, depending on the area and…
Given a collection $L$ of line segments, we consider its arrangement and study the problem of covering all cells with line segments of $L$. That is, we want to find a minimum-size set $L'$ of line segments such that every cell in the…
Given a set $P$ of $n$ points and a set $S$ of $m$ weighted disks in the plane, the disk coverage problem asks for a subset of disks of minimum total weight that cover all points of $P$. The problem is NP-hard. In this paper, we consider a…
Given a set $P$ of $n$ points and a set $S$ of $n$ weighted disks in the plane, the disk coverage problem is to compute a subset of disks of smallest total weight such that the union of the disks in the subset covers all points of $P$. The…
Coverage problem in wireless sensor networks measures how well a region or parts of it is sensed by the deployed sensors. Definition of coverage metric depends on its applications for which sensors are deployed. In this paper, we introduce…
This paper primarily focuses on figuring out the best array of cameras, or visual sensors, so that such a placement enables the maximum utilization of these visual sensors. Maximizing the utilization of these cameras can convert to another…
We consider the Set Once Strip Cover problem, in which n wireless sensors are deployed over a one-dimensional region. Each sensor has a fixed battery that drains in inverse proportion to a radius that can be set just once, but activated at…
Given a line segment $I=[0,L]$, the so-called barrier, and a set of $n$ sensors with varying ranges positioned on the line containing $I$, the barrier coverage problem is to move the sensors so that they cover $I$, while minimising the…
Assuming a random uniform distribution of n sensor nodes over a virtual grid, this paper addresses the problem of finding the maximum number of connected set covers each ensuring 100% coverage of the query region. The connected sets remain…
Measurements and sensing implementations impose certain cost in sensor networks. The sensor selection cost optimization is the problem of minimizing the sensing cost of monitoring a physical (or cyber- physical) system. Consider a given set…
This paper deals with the accomplishment of total area coverage of an arbitrary region using sensors with a finite sensing radius of rs. For a given region, we aim to obtain a deterministic placement of sensors which, apart from ensuring…
Target coverage problem in wireless sensor networks is concerned with maximizing the lifetime of the network while continuously monitoring a set of targets. A sensor covers targets which are within the sensing range. For a set of sensors…
Most current results on coverage control using mobile sensors require that one partitioned cell is associated with precisely one sensor. In this paper, we consider a class of coverage control problems involving higher order Voronoi…