15,008 research outputs found
Optimal sensor placement for classifier-based leak localization in drinking water networks
© 2016 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.This paper presents a sensor placement method for classifier-based leak localization in Water Distribution Networks. The proposed approach consists in applying a Genetic Algorithm to decide the sensors to be used by a classifier (based on the k-Nearest Neighbor approach). The sensors are placed in an optimal way maximizing the accuracy of the leak localization. The results are illustrated by means of the application to the Hanoi District Metered Area and they are compared to the ones obtained by the Exhaustive Search Algorithm. A comparison with the results of a previous optimal sensor placement method is provided as well.Postprint (author's final draft
Sensor placement for fault location identification in water networks: A minimum test cover approach
This paper focuses on the optimal sensor placement problem for the
identification of pipe failure locations in large-scale urban water systems.
The problem involves selecting the minimum number of sensors such that every
pipe failure can be uniquely localized. This problem can be viewed as a minimum
test cover (MTC) problem, which is NP-hard. We consider two approaches to
obtain approximate solutions to this problem. In the first approach, we
transform the MTC problem to a minimum set cover (MSC) problem and use the
greedy algorithm that exploits the submodularity property of the MSC problem to
compute the solution to the MTC problem. In the second approach, we develop a
new \textit{augmented greedy} algorithm for solving the MTC problem. This
approach does not require the transformation of the MTC to MSC. Our augmented
greedy algorithm provides in a significant computational improvement while
guaranteeing the same approximation ratio as the first approach. We propose
several metrics to evaluate the performance of the sensor placement designs.
Finally, we present detailed computational experiments for a number of real
water distribution networks
ADVANCED MODELING AND EFFICIENT OPTIMIZATION METHODS FOR REAL-TIME RESPONSE IN WATER NETWORKS
In response to a contamination incident in water distribution networks, effective mitigation procedures must be planned. Disinfectant booster stations can be used to neutralize a variety of contaminant and protect the public. In this thesis, two methods are proposed for the optimal placement of booster stations. Since the contaminant species is unknown a priori, these two methods differ in how they model the unknown reaction between the contaminant and the disinfectant. Both methods employ Mixed-Integer Linear Programming to minimize the expected impact over a large set of potential contamination scenarios that consider the uncertainty in the location and time of the incident. To make the optimal booster placement problem tractable for realistic large-scale networks, we exploit the symmetry in the problem structure to drastically reduce the problem size. The results highlight the effectiveness of booster stations in reducing the overall impact on the population, which is measured using two different metrics - mass of contaminant consumed, and population dosed above a cumulative mass threshold. Additionally, we also study the importance of various factors that influence the performance of disinfectant booster stations (e.g., sensor placement, contaminant reactivity and toxicity, etc.)
Optimizing Sensing: From Water to the Web
Where should we place sensors to quickly detect contamination in drinking water distribution networks? Which blogs should we read to learn about the biggest stories on the Web? Such problems are typically NP-hard in theory and extremely challenging in practice. The authors present algorithms that exploit submodularity to efficiently find provably near-optimal solutions to large, complex real-world sensing problems
Sequential Decision Algorithms for Measurement-Based Impromptu Deployment of a Wireless Relay Network along a Line
We are motivated by the need, in some applications, for impromptu or
as-you-go deployment of wireless sensor networks. A person walks along a line,
starting from a sink node (e.g., a base-station), and proceeds towards a source
node (e.g., a sensor) which is at an a priori unknown location. At equally
spaced locations, he makes link quality measurements to the previous relay, and
deploys relays at some of these locations, with the aim to connect the source
to the sink by a multihop wireless path. In this paper, we consider two
approaches for impromptu deployment: (i) the deployment agent can only move
forward (which we call a pure as-you-go approach), and (ii) the deployment
agent can make measurements over several consecutive steps before selecting a
placement location among them (which we call an explore-forward approach). We
consider a light traffic regime, and formulate the problem as a Markov decision
process, where the trade-off is among the power used by the nodes, the outage
probabilities in the links, and the number of relays placed per unit distance.
We obtain the structures of the optimal policies for the pure as-you-go
approach as well as for the explore-forward approach. We also consider natural
heuristic algorithms, for comparison. Numerical examples show that the
explore-forward approach significantly outperforms the pure as-you-go approach.
Next, we propose two learning algorithms for the explore-forward approach,
based on Stochastic Approximation, which asymptotically converge to the set of
optimal policies, without using any knowledge of the radio propagation model.
We demonstrate numerically that the learning algorithms can converge (as
deployment progresses) to the set of optimal policies reasonably fast and,
hence, can be practical, model-free algorithms for deployment over large
regions.Comment: 29 pages. arXiv admin note: text overlap with arXiv:1308.068
JamLab: Augmenting Sensornet Testbeds with Realistic and Controlled Interference Generation
Radio interference drastically affects the performance of sensor-net communications, leading to packet loss and reduced energy-efficiency. As an increasing number of wireless devices operates on the same ISM frequencies, there is a strong need for understanding and debugging the performance of existing sensornet protocols under interference. Doing so requires a low-cost flexible testbed infrastructure that allows the repeatable generation of a wide range of interference patterns. Unfortunately, to date, existing sensornet testbeds lack such capabilities, and do not permit to study easily the coexistence problems between devices sharing the same frequencies. This paper addresses the current lack of such an infrastructure by using off-the-shelf sensor motes to record and playback interference patterns as well as to generate customizable and repeat-able interference in real-time. We propose and develop JamLab: a low-cost infrastructure to augment existing sensornet testbeds with accurate interference generation while limiting the overhead to a simple upload of the appropriate software. We explain how we tackle the hardware limitations and get an accurate measurement and regeneration of interference, and we experimentally evaluate the accuracy of JamLab with respect to time, space, and intensity. We further use JamLab to characterize the impact of interference on sensornet MAC protocols
- …