Incremental Sensor Placement Optimization on Water Network
Abstract
Sensor placement on water networks is critical for the detection of accidental or intentional contamination event. With the development and expansion of cities, the public water distribution systems in cities are continuously growing. As a result, the current sensor placement will lose its effectiveness in detecting contamination event. Hence, in many real applications, we need to solve the incremental sensor placement (ISP) problem. We expect to find a sensor placement solution that reuses existing sensor deployments as much as possible to reduce cost, while ensuring the effectiveness of contamination detection. In this paper, we propose scenario-cover model to formalize ISP and prove that ISP is NP-hard and propose our greedy approaches with provable quality bound. Extensive experiments show the effectiveness, robustness and efficiency of the proposed solutions.
Cite
Text
Xu et al. "Incremental Sensor Placement Optimization on Water Network." European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, 2013. doi:10.1007/978-3-642-40994-3_30Markdown
[Xu et al. "Incremental Sensor Placement Optimization on Water Network." European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, 2013.](https://mlanthology.org/ecmlpkdd/2013/xu2013ecmlpkdd-incremental/) doi:10.1007/978-3-642-40994-3_30BibTeX
@inproceedings{xu2013ecmlpkdd-incremental,
title = {{Incremental Sensor Placement Optimization on Water Network}},
author = {Xu, Xiaomin and Lu, Yiqi and Huang, Sheng and Xiao, Yanghua and Wang, Wei},
booktitle = {European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases},
year = {2013},
pages = {467-482},
doi = {10.1007/978-3-642-40994-3_30},
url = {https://mlanthology.org/ecmlpkdd/2013/xu2013ecmlpkdd-incremental/}
}