Abstract
Optimal sensor placement for detecting contamination events in water distribution systems is a well explored problem in water distribution systems security. We study herein the problem of sensor placement in water networks to minimize the consumption of contaminated water prior to contamination detection. For any sensor placement, the average consumption of contaminated water prior to event detection amongst all simulated events is employed as the sensing performance metric. A branch and bound sensor placement algorithm is proposed based on greedy heuristics and convex relaxation. Compared to the state of the art results of the battle of the water sensor networks (BWSN) study, the proposed methodology demonstrated a significant performance enhancement, in particular by applying greedy heuristics to repeated sampling of random subsets of events.
Original language | English |
---|---|
Pages (from-to) | 128-136 |
Number of pages | 9 |
Journal | Environmental Modelling and Software |
Volume | 76 |
DOIs | |
State | Published - 1 Feb 2016 |
Externally published | Yes |
Bibliographical note
Publisher Copyright:© 2015 Elsevier Ltd.
Keywords
- Contamination
- Convex optimization
- Optimization
- Sensor placement
- Water distribution systems
- Water security
ASJC Scopus subject areas
- Software
- Environmental Engineering
- Ecological Modeling