Related papers: Guaranteed sensor coverage with the weighted-$D^2$…
Many location-based services use Received Signal Strength (RSS) measurements due to their universal availability. In this paper, we study the association of a large number of low-cost Internet-of-Things (IoT) sensors and their possible…
Sensor networks play a critical role in many situational awareness applications. In this paper, we study the problem of determining sensor placements to balance coverage and connectivity objectives over a target region. Leveraging algebraic…
We revisit the static coverage control problem for placement of vehicles with simple motion on the real line, under the assumption that the cost is a polynomial function of the locations of the vehicles. The main contribution of this paper…
Wireless sensor networks consisting of great number of cheap and tiny sensor nodes which are used for military environment controlling, natural events recording, traffic monitoring, robot navigation, and etc. Such a networks encounter with…
This paper tackles optimal sensor placement for Bayesian linear inverse problems, a popular version of the more general Optimal Experimental Design (OED) problem, using the D-optimality criterion. This is done by establishing connections…
Wireless sensor networks (WSNs) are emerging as an effective means for environment monitoring. This paper investigates a strategy for energy efficient monitoring in WSNs that partitions the sensors into covers, and then activates the covers…
Wireless rechargeable sensor networks, consisting of sensor nodes with rechargeable batteries and mobile chargers to replenish their batteries, have gradually become a promising solution to the bottleneck of energy limitation that hinders…
This paper examines the spatial coverage optimization problem for multiple sensors in a known convex environment, where the coverage service of each sensor is heterogeneous and anisotropic. We introduce the Stein Coverage algorithm, a…
Assume n wireless mobile sensors are initially dispersed in an ad hoc manner in a rectangular region. They are required to move to final locations so that they can detect any intruder crossing the region in a direction parallel to the sides…
In this paper we propose distributed flooding-based storage algorithms for large-scale wireless sensor networks. Assume a wireless sensor network with $n$ nodes that have limited power, memory, and bandwidth. Each node is capable of both…
Distributed consensus has been widely studied for sensor network applications. Whereas the asymptotic convergence rate has been extensively explored in prior work, other important and practical issues, including energy efficiency and link…
This paper considers three related mobile robot multi-target sensory coverage and inspection planning problems in 2-D environments. In the first problem, a mobile robot must find the shortest path to observe multiple targets with a limited…
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…
In this article we consider the problems of distributed detection and estimation in wireless sensor networks. In the first part, we provide a general framework aimed to show how an efficient design of a sensor network requires a joint…
Mobile sensor networks are important for several strategic applications devoted to monitoring critical areas. In such hostile scenarios, sensors cannot be deployed manually and are either sent from a safe location or dropped from an…
Coverage is one of the fundamental issues in wireless sensor networks (WSNs). It reflects the ability of WSNs to detect the fields of interest. In a real sensor networks application, the detection area is always non-ideal and the terrain of…
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…
This paper studies a graph-based sensor deployment approach in wireless sensor networks (WSNs). Specifically, in today's world, where sensors are everywhere, detecting various attributes like temperature and movement, their deteriorating…
We study a two-tiered wireless sensor network (WSN) consisting of $N$ access points (APs) and $M$ base stations (BSs). The sensing data, which is distributed on the sensing field according to a density function $f$, is first transmitted to…
We show that a $k$-fold covering using translates of an arbitrary convex polygon can be decomposed into $\Omega(k)$ covers (using an efficient algorithm). We generalize this result to obtain a constant factor approximation to the sensor…