Research Article
Evaluation Method for Water Network Connectivity Based on Graph Theory
@INPROCEEDINGS{10.1007/978-3-030-62205-3_11, author={Yujia Zhou and Yannan Shi and Hui Wu and Yifan Chen and Qiong Yang and Zhongshuai Fang}, title={Evaluation Method for Water Network Connectivity Based on Graph Theory}, proceedings={Mobile Wireless Middleware, Operating Systems and Applications. 9th EAI International Conference, MOBILWARE 2020, Hohhot, China, July 11, 2020, Proceedings}, proceedings_a={MOBILWARE}, year={2020}, month={11}, keywords={Water network Graph theory Connectivity Dredging}, doi={10.1007/978-3-030-62205-3_11} }- Yujia Zhou
Yannan Shi
Hui Wu
Yifan Chen
Qiong Yang
Zhongshuai Fang
Year: 2020
Evaluation Method for Water Network Connectivity Based on Graph Theory
MOBILWARE
Springer
DOI: 10.1007/978-3-030-62205-3_11
Abstract
Water network connectivity plays a pivotal role in water security and ecological civilization, which also has been viewed as an important part for water comprehensive improvement. Using graph theory, the water network can be modeled as an undirected graph with multiple interconnected elements which represent rivers by edges and junctions by nodes. In this paper, the weight on edge represents the simplified river cross-section area which can be equivalent to flow capacity between two adjacent nodes. In order to obtain the flow capacity between any two nodes, a maximum flow evaluation scheme is designed by using Boykov-Kolmogorov algorithm. Then by using the maximum flow between nodes before and after dredging based on node degree features, a solution is assayed for average flow capacity of each node and water network connectivity. The proposed approach has been tested on the river network of Xiacheng District in Hangzhou with dredging data in year 2016. The result shows that the water network connectivity is improved by 7.89% over the whole area and more than 40% in part region by dredging, and significant influenced by intersect density and dredging extent.
