Sensor network design for contaminant detection and identification in water distribution networks

•Designed minimal sensor network for contaminant detection.•Designed minimal sensor network for identifying source of contamination.•Designed sensor network for identifying multiple simultaneous sources of contamination.•Formulated sensor network design problem as set cover problem of a graph. Water...

Full description

Saved in:
Bibliographic Details
Published in:Computers & chemical engineering 2016-04, Vol.87, p.246-256
Main Authors: Palleti, Venkata Reddy, Narasimhan, Shankar, Rengaswamy, R., Teja, Ravi, Murty Bhallamudi, S.
Format: Article
Language:English
Subjects:
Bipartite graph
Contaminant detection
Contaminants
Design analysis
Design engineering
Graphs
Identifiability
Intrusion
Networks
Observability
Sensors
Water distribution
Water distribution network
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:•Designed minimal sensor network for contaminant detection.•Designed minimal sensor network for identifying source of contamination.•Designed sensor network for identifying multiple simultaneous sources of contamination.•Formulated sensor network design problem as set cover problem of a graph. Water distribution networks (WDN) are vulnerable to either intentional or accidental contamination. In order to protect against such intrusions, effective and efficient online monitoring systems are needed. Due to cost and maintenance reasons, it is not possible to locate sensors at each and every potential intrusion point. In this work, we design minimal sensor networks which satisfy the two important properties of observability (ability to detect an intrusion) and identifiability (ability to identify the point of intrusion). Based on the hydraulic analysis of the network, a bipartite graph is constructed between intrusion points and the corresponding nodes that can potentially be affected by the contaminant. The problem of sensor network design is converted to a minimum set cover problem on the bipartite graph, and is solved using a greedy heuristic algorithm. The proposed method is illustrated using a medium scale urban WDN.
ISSN:0098-1354
1873-4375
DOI:10.1016/j.compchemeng.2015.12.022