Related papers: Approximation Algorithm for Line Segment Coverage …
We study problems related to connecting multi-interface networks of wireless devices. These problems are modeled using graphs, where vertices represent the devices and edges represent potential communication links. Each vertex can activate…
A wireless sensor network comprises of small sensor nodes each of which consists of a processing device, small amount of memory, battery and radio transceiver for communication. The sensor nodes are autonomous and spatially distributed in…
In this paper we use the MAP criterion to locate a region containing a source. Sensors placed in a field of interest divide the latter into smaller regions and take measurements that are transmitted over noisy wireless channels. We propose…
Given an undirected graph $G$ whose edge weights change over $s$ time slots, the sub-tree scheduling for wireless sensor networks with partial coverage asks to partition the vertices of $G$ in $s$ non-empty trees such that the total weight…
$\delta$-Covering, for some covering range $\delta>0$, is a continuous facility location problem on undirected graphs where all edges have unit length. The facilities may be positioned on the vertices as well as on the interior of the…
In this work, we study the target detection and tracking problem in mobile sensor networks, where the performance metrics of interest are probability of detection and tracking coverage, when the target can be stationary or mobile and its…
In this paper, we first remodel the line coverage as a 1D discrete problem with co-linear targets. Then, an order-based greedy algorithm, called OGA, is proposed to solve the problem optimally. It will be shown that the existing order in…
The localization problem in a wireless sensor network is to determine the coordination of sensor nodes using the known positions of some nodes (called anchors) and corresponding noisy distance measurements. There is a variety of different…
We study several natural instances of the geometric hitting set problem for input consisting of sets of line segments (and rays, lines) having a small number of distinct slopes. These problems model path monitoring (e.g., on road networks)…
In this paper we consider the question of sensor network coverage for a 2-dimensional domain. We seek to compute the probability that a set of sensors fails to cover given only non-metric, local (who is talking to whom) information and a…
This paper presents coordination algorithms for groups of mobile agents performing deployment and coverage tasks. As an important modeling constraint, we assume that each mobile agent has a limited sensing/communication radius. Based on the…
The growing amount of applications that generate vast amount of data in short time scales render the problem of partial monitoring, coupled with prediction, a rather fundamental one. We study the aforementioned canonical problem under the…
We consider the problem of maximizing the lifetime of coverage (MLCP) of targets in a wireless sensor network with battery-limited sensors. We first show that the MLCP cannot be approximated within a factor less than $\ln n$ by any…
First, we study geometric variants of the standard set cover motivated by assignment of directional antenna and shipping with deadlines, providing the first known polynomial-time exact solutions. Next, we consider the following general…
The primary function of a sensor network is to perform the sensing task. For proper sensing, the coverage and connectivity property of the network must be maintained. Relationship between coverage and connectivity has been extensively…
This paper considers a wireless sensor network deployed to sense an environment variable with a known spatial statistical profile. We propose to use the additional information of the spatial profile to improve the sensing range of sensors…
Multi-Robot Coverage problems have been extensively studied in robotics, planning and multi-agent systems. In this work, we consider the coverage problem when there are constraints on the proximity (e.g., maximum distance between the…
This paper presents a method for determining the area explored by a line-sweep sensor during an area-covering mission in a two-dimensional plane. Accurate knowledge of the explored area is crucial for various applications in robotics, such…
As wireless sensor networks grow larger, more complex and their role more significant, it becomes necessary to have an insight into the network traffic. For this purpose, sniffers play an irreplaceable role. Since a sniffer is a device of…
This paper addresses problems on the robust structural design of complex networks. More precisely, we address the problem of deploying the minimum number of dedicated sensors, i.e., those measuring a single state variable, that ensure the…