Abstract
An efficient way of distributing water in urban cities is one of the major global challenges of our time. A Water Distribution Network (WDN) is a vital infrastructure, intended to provide fresh water to households within a city or designated boundary. Given the WDN’s complexity, effective numerical techniques are required to aid in the development of an ideal monitoring system. Flow meters and gate valves should be placed in low-connected areas of the WDN with water flow reaching several regions of the network. This study proposes a general strategy for assisting water utilities in making decisions for effective water supply. The aim of the research is to use weighted spectral clustering algorithms to outline water districts while addressing hydraulic restrictions via weighted adjacency and Laplacian matrices of the weighted network. This work aims to identify influenced nodes in the network based on Eigen centrality and effectively distribute water across those nodes. This project also looks at how to measure the network’s connection strength to avoid water leaks. The best clusters are found using Eigenvalues and Eigenvectors of weighted adjacency matrices and Laplacian matrices of the water network in the proposed graph spectral framework. In order to establish the optimum water network division approach, topological and graph metrics were used to compare multiple spectral clustering techniques. The proposed graph spectral approach is tested using a genuine water distribution network serving an urban area of Coimbatore city in India and offering a method for partitioning complex networks that employ the spectral graph partitioning algorithm.
Similar content being viewed by others
Availability of data and material
All data generated or analyzed during this study are included in this article (and its supplementary information files)
Code availability
Not applicable
Abbreviations
- WDN:
-
Water Distribution Network
- DMA:
-
District Meter Area
- WNC:
-
Water Network Clustering
- GST:
-
Graph Spectral Techniques
- EPA:
-
Environmental Protection Agency
References
Alshammari M, Stavrakakis J, Takatsuka M (2021) Refining a k-nearest neighbor graph for a computationally efficient spectral clustering. Pattern Recog 14:107869
Arsic B, Cvetkovic D, Simic SK, Skaric M (2012) Graph spectral techniques in computer sciences. Appl Anal Discret Math
Athulya, Anjali K Ullas (2020) Design of water distribution network using epanet software. IRJET
Boccaletti S, Latora V, Moreno Y, Chavez M, Hwang D (2006) Complex networks: structure and dynamics. Phys Rep 424:175–308
De Arruda G, Barbieri A, Rodríguez P, Rodrigues F, Moreno Y, Costa L (2014) Role of centrality for the identification of influential spreaders in complex networks. Phys Rev E - Stat Nonlinear
Filippi M, Rypina I, Hadjighasem A, Peacock T (2021) An optimized-parameter spectral clustering approach to coherent structure detection in geophysical flows. Fluids 6:39
Freeman L (1977) A set of measures of centrality based on betweenness. Sociometry 40:35–41
Giovanni FS, Armando DN, Enrico C, Dino M, Roberto G (2021) Comparison of topological, empirical and optimization-based approaches for locating quality detection points in water distribution networks. Environ Sci Pollut Res 28:33844–33853
Giudicianni C, Herrera M, Nardo AD, Adeyeye K (2020) Automatic multiscale approach for water networks partitioning into dynamic district metered areas. Water Resour Manag 34(2):835–848
Giudicianni C, Nardo AD, Natale MD, Greco R, Santonastaso GF, Scala A (2018) Topological taxonomy of water distribution networks. Water 10(4):444
Han R, Liu J (2017) Spectral clustering and genetic algorithm for design of district metered areas in water distribution systems. Procedia Eng 186:152–159
Jovanovic N, Jovanovic Z, Jevremovic A (2017) Complex networks analysis by spectral graph theory. Sinteza
Kelmans A, Yong X (1999) On the distributions of eigenvalues of graphs. Discrete Math 199:251–258
Kozelj D, Gorjup M, Kramar Fijavz M (2017) An application of spectral graph partition for designing district metered areas in water supply networks. Acta Hydrotechnica 30(53):81–96
Luxburg UV (2007) A tutorial on spectral clustering. Stat Comput 17(4):395–416
Miroslav F (1973) Algebraic connectivity of graphs. Czechoslov Math J 23:298
Nardo AD, Giudicianni C, Greco R, Herrera M (2018a) Sensor placement in water distribution networks based on spectral algorithms. 13th International Conference on Hydroinformatics HIC
Nardo AD, Giudicianni C, Greco R, Manuel Herrera, Santonastaso G (2018) Applications of graph spectral techniques to water distribution network management. Water 10(1):45
Nardo AD, Giudicianni C, Greco R, Santonastaso GF (2016) Water supply network partitioning based on weighted spectral clustering. Complex Networks and Their Applications V
Nardo AD, Natale MD, Giudicianni C, Greco R, Nardo GFSD (2017) Weighted spectral clustering for water distribution network partitioning. Appl Netw Sci 2(1):1–16
Nardo AD, Natale MD, Santonastaso GF, Tzatchkov VG, Alcocer-Yamanaka VH (2014) Water network sectorization based on graphtheory and energy performance indices. Am Soc Civil Eng 140(5):620–629
Newman M (2008) Mathematics of Networks, pp 1–8
Park TJ, Han KJ, Kumar M, Shrikanth Narayanan (2020) Auto-tuning spectral clustering for speaker diarization using normalized maximum eigengap. IEEE
Perelman L, Allen M, Preis A, MudasserIqbal, Whittle A J (2014) Automated sub-zoning of water distribution systems. Environ Modell and Software
Rahman M, Akhter M, Meghanathan N (2019) Use of eigenvector centrality to rank the vertices in a disease-disease network. Advances in Intelligent Systems and Computing, 800
Rajeswaran A, Narasimhan S, Narasimhan S (2016) A graph partitioning algorithm for leak detection in water distribution networks. cs.DS
Santo F (2010) Community detection in graphs. Phys Rep 486:75–174
Shi J, Malik J (2000) Normalized cuts and image segmentation. IEEE 22:888–905
Spielman DA (2007) Spectral graph theory and its applications. 48th Annual IEEE symposium on foundations of computer science
Torres JM, Leonardo Duenas-Osorio M, Qilin Li M, Yazdani A (2016) Exploring topological effects on water distribution system performance using graph theory and statistical models. American Society of Civil Engineers
Wan Y, Di Z, Fan Y (2011) Identifying and characterizing nodes important to community structure using the spectrum of the graph. PLoS ONE 6(11):e27418
Yazdani A, Jeffrey P (2010a) A complex network approach to robustness and vulnerability of spatially organized water distribution networks
Yazdani A, Jeffrey P (2010b) Robustness and vulnerability analysis of water distribution networks using graph theoretic and complex network principles. Water Distribution Systems Analysis
Yazdani A, Jeffrey P (2011) Complex network analysis of water distribution systems. Chaos Interdiscip J Nonlinear Sci 21(1):016111
Yoo D, Chung G, Sadollah A, Kim J (2015) Applications of network analysis and multi-objective genetic algorithm for selecting optimal water quality sensor locations in water distribution networks. KSCE J Civ Eng 19:2333–2344
Funding
This research received no external funding
Author information
Authors and Affiliations
Contributions
Tamilselvi, G: writing original draft. Vasanthi, T: review and supervision. Sundar, C: review and editing.
Corresponding author
Ethics declarations
Ethics approval
Not applicable
Consent to participate
Not applicable
Consent for publication
Not applicable
Conflicts of interest
The authors declare no conflict of interest.
Additional information
Responsible Editor: Arshian Sharif
Vasanthi Thankappan and Sundar Chandramohan contributed equally to this work.
Rights and permissions
Springer Nature or its licensor holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Gopalsamy, T., Thankappan, V. & Chandramohan, S. An efficient supply management in water flow network using graph spectral techniques. Environ Sci Pollut Res 30, 2530–2543 (2023). https://doi.org/10.1007/s11356-022-22335-y
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11356-022-22335-y