Sensor Placement for Learning in Flow Networks
- URL: http://arxiv.org/abs/2401.02438v1
- Date: Tue, 12 Dec 2023 01:08:08 GMT
- Title: Sensor Placement for Learning in Flow Networks
- Authors: Arnav Burudgunte, Arlei Silva
- Abstract summary: This paper investigates the sensor placement problem for networks.
We first formalize the problem under a flow conservation assumption and show that it is NP-hard to place a fixed set of sensors optimally.
Next, we propose an efficient and adaptive greedy for sensor placement that scales to large networks.
- Score: 6.680930089714339
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Large infrastructure networks (e.g. for transportation and power
distribution) require constant monitoring for failures, congestion, and other
adversarial events. However, assigning a sensor to every link in the network is
often infeasible due to placement and maintenance costs. Instead, sensors can
be placed only on a few key links, and machine learning algorithms can be
leveraged for the inference of missing measurements (e.g. traffic counts, power
flows) across the network. This paper investigates the sensor placement problem
for networks. We first formalize the problem under a flow conservation
assumption and show that it is NP-hard to place a fixed set of sensors
optimally. Next, we propose an efficient and adaptive greedy heuristic for
sensor placement that scales to large networks. Our experiments, using datasets
from real-world application domains, show that the proposed approach enables
more accurate inference than existing alternatives from the literature. We
demonstrate that considering even imperfect or incomplete ground-truth
estimates can vastly improve the prediction error, especially when a small
number of sensors is available.
Related papers
- Efficient Unsupervised Domain Adaptation Regression for Spatial-Temporal Air Quality Sensor Fusion [6.963971634605796]
We propose a novel unsupervised domain adaptation (UDA) method specifically tailored for regression tasks on graph-structured data.
We incorporate spatial-temporal graph neural networks (STGNNs) to model the relationships between sensors.
Our approach allows low-cost IoT sensors to learn calibration parameters from expensive reference sensors.
arXiv Detail & Related papers (2024-11-11T12:20:57Z) - Analysis and Optimization of Seismic Monitoring Networks with Bayesian Optimal Experiment Design [0.0]
Bayesian optimal experimental design (OED) seeks to identify data, sensor configurations, or experiments which can optimally reduce uncertainty.
Information theory guides OED by formulating the choice of experiment or sensor placement as an optimization problem.
In this work, we develop the framework necessary to use Bayesian OED to optimize a sensor network's ability to locate seismic events.
arXiv Detail & Related papers (2024-09-27T04:45:27Z) - `Just One More Sensor is Enough' -- Iterative Water Leak Localization with Physical Simulation and a Small Number of Pressure Sensors [0.0]
We propose an approach to leak localisation in a complex water delivery grid with the use of data from physical simulation.
Our algorithm is based on physical simulations (EPANET software) and an iterative scheme for mobile sensor relocation.
arXiv Detail & Related papers (2024-06-28T13:10:13Z) - Optimizing Sensor Network Design for Multiple Coverage [0.9668407688201359]
We introduce a new objective function for the greedy (next-best-view) algorithm to design efficient and robust sensor networks.
We also introduce a Deep Learning model to accelerate the algorithm for near real-time computations.
arXiv Detail & Related papers (2024-05-15T05:13:20Z) - Physical-Layer Semantic-Aware Network for Zero-Shot Wireless Sensing [74.12670841657038]
Device-free wireless sensing has recently attracted significant interest due to its potential to support a wide range of immersive human-machine interactive applications.
Data heterogeneity in wireless signals and data privacy regulation of distributed sensing have been considered as the major challenges that hinder the wide applications of wireless sensing in large area networking systems.
We propose a novel zero-shot wireless sensing solution that allows models constructed in one or a limited number of locations to be directly transferred to other locations without any labeled data.
arXiv Detail & Related papers (2023-12-08T13:50:30Z) - A distributed neural network architecture for dynamic sensor selection
with application to bandwidth-constrained body-sensor networks [53.022158485867536]
We propose a dynamic sensor selection approach for deep neural networks (DNNs)
It is able to derive an optimal sensor subset selection for each specific input sample instead of a fixed selection for the entire dataset.
We show how we can use this dynamic selection to increase the lifetime of a wireless sensor network (WSN) by imposing constraints on how often each node is allowed to transmit.
arXiv Detail & Related papers (2023-08-16T14:04:50Z) - Bandwidth-efficient distributed neural network architectures with
application to body sensor networks [73.02174868813475]
This paper describes a conceptual design methodology to design distributed neural network architectures.
We show that the proposed framework enables up to a factor 20 in bandwidth reduction with minimal loss.
While the application focus of this paper is on wearable brain-computer interfaces, the proposed methodology can be applied in other sensor network-like applications as well.
arXiv Detail & Related papers (2022-10-14T12:35:32Z) - A Deep Reinforcement Learning-based Adaptive Charging Policy for
Wireless Rechargeable Sensor Networks [14.67786743033424]
Wireless power transfer technology is emerging as a reliable solution for energizing the sensors.
We propose a novel adaptive charging scheme using a deep reinforcement learning (DRL) approach.
Our model can adapt to spontaneous changes in the network topology.
arXiv Detail & Related papers (2022-08-16T16:10:52Z) - Bandit Quickest Changepoint Detection [55.855465482260165]
Continuous monitoring of every sensor can be expensive due to resource constraints.
We derive an information-theoretic lower bound on the detection delay for a general class of finitely parameterized probability distributions.
We propose a computationally efficient online sensing scheme, which seamlessly balances the need for exploration of different sensing options with exploitation of querying informative actions.
arXiv Detail & Related papers (2021-07-22T07:25:35Z) - Real-time detection of uncalibrated sensors using Neural Networks [62.997667081978825]
An online machine-learning based uncalibration detector for temperature, humidity and pressure sensors was developed.
The solution integrates an Artificial Neural Network as main component which learns from the behavior of the sensors under calibrated conditions.
The obtained results show that the proposed solution is able to detect uncalibrations for deviation values of 0.25 degrees, 1% RH and 1.5 Pa, respectively.
arXiv Detail & Related papers (2021-02-02T15:44:39Z) - Resolution Adaptive Networks for Efficient Inference [53.04907454606711]
We propose a novel Resolution Adaptive Network (RANet), which is inspired by the intuition that low-resolution representations are sufficient for classifying "easy" inputs.
In RANet, the input images are first routed to a lightweight sub-network that efficiently extracts low-resolution representations.
High-resolution paths in the network maintain the capability to recognize the "hard" samples.
arXiv Detail & Related papers (2020-03-16T16:54:36Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.