china | Behavior ec. Policy design
Identifying sets of key nodes in dynamic water distribution networks
The design of a sensor-placement scheme capable of detecting all possible contamination events for a water distribution system before consumers are put at risk is essentially impossible given current technologies and budgets.
It is, however, possible to design sensor-placement schemes that optimize related objectives (e.g., minimize expected volume of contaminated water consumed prior to detection), but this requires the availability of hydraulic and water quality models for the distribution network and significant computational power, which are the main obstacles to the identification of optimal sensor locations. This paper describes a different approach that reduces the problem’s complexity by expressing a water distribution system as different graphs based on the information readily available from most, if not all, water utilities. The approach provides critical policy and decision support for utilities when hydraulic and water quality models are not available and/or when simulation-based techniques are computationally infeasible.
Centers
- china
Type of publication
- Peer reviewed
Reference
Jianhua Xu, P. Fischbeck, M. Small, J. VanBriesen, and E. Casman (2008), "Identifying sets of key nodes in dynamic water distribution networks", Journal of Water Resources Planning and Management, 134 (4), 378-385Publications
- Peer reviewed
- EfD Discussion papers
- Discussion papers
- Policy briefs
- EfD/RFF Books
- Books
- Reports
- Research Briefs
- Other
- Theses PhD & MSc
- All Publications
EfD Newsletter
Subscribe to our Newsletter service
Join or share
See Also
Setting Priorities, Targeting Subsidies among Water, Sanitation, and Preventive Health [...]
This paper challenges the conventional wisdom that water and sanitation improvements and other [cont...]
Climate Policy, Uncertainty, and the Role of Technological Innovation
We study how uncertainty about climate change severity affects the relative benefits of early [cont...]
