GNN-Based Method for Data Flow Path Completion in Electric Power Information Networks
DOI:
https://doi.org/10.4108/ew.13904Keywords:
power information network, path completion, Graph Attention Network, persistent homology, topology enhancementAbstract
The reliability of power information networks is paramount for smart grid security, yet incomplete data transmission paths due to link failures or cyberattacks critically impair topology awareness and operational decision-making. To address the limitations of existing methods in handling the dynamic and structurally complex nature of these networks, this paper proposes a Topology-Enhanced Dynamic Perception Graph Neural Network (TEDP-GNN) for accurate path completion. The core methodology revolves around three integrated innovations. First, we introduce a topological deep learning framework that models high-order node interactions and network connectivity patterns beyond pairwise relationships. This is achieved by employing simplicial complexes to capture multi-node dependencies inherent in power data routing structures. Second, a novel dynamic perception mechanism is designed to continuously monitor link state changes. This mechanism utilizes a temporal gating unit that ingests real-time network alert data, enabling the model to adaptively reweight message-passing pathways in response to topological disturbances such as failures or attacks. Finally, the task is formulated as a topology-constrained optimization problem. Within this framework, we deploy a hybrid attention module that simultaneously computes both node-level and path-level attentions, alongside a multi-dimensional feature aggregation strategy that synthesizes information from topological embeddings, dynamic states, and historical transmission patterns. Preliminary validation on simulated power communication topologies demonstrates that TEDP-GNN significantly outperforms baseline models in predicting missing links, showing marked improvements in precision and recall. The model provides a robust, topology-aware solution for maintaining data path integrity, thereby enhancing the situational awareness and resilience of power information infrastructures.
Downloads
References
[1] Krause T, Ernst R, Klaer B, Hacker I, Henze M. Cybersecurity in power grids: Challenges and opportunities. Sensors. 2021; 21(18):6225.
[2] Rajkumar V, Subramaniam V, Ştefanov A, Presekal A, Palensky P, Torres JLR. Cyber attacks on power grids: Causes and propagation of cascading failures. IEEE Access. 2023; 11:103154–103176.
[3] Islam MZ, Lin Y, Vokkarane VM, Venkataramanan V. Cyber-physical cascading failure and resilience of power grid: A comprehensive review. Front. Energy Res. 2023; 11:1095303.
[4] Deng R, Xiao G, Lu R, Liang H, Vasilakos AV. False data injection on state estimation in power systems—Attacks, impacts, and defense: A survey. IEEE Trans. Ind. Inf. 2016; 13(2):411–423.
[5] Li Y, Ge Y, Xu T, Zhu M, He Z. Controllability evaluation of complex networks in cyber–physical power systems via critical nodes and edges. Int. J. Electr. Power Energy Syst. 2024; 155:109625.
[6] Jia H, Li J, He B, Li S, Cheng Z, Zhao C. Enhancing the robustness of cyber-physical power systems against cross-domain cascading failures: Cyber-physical dynamic reconfiguration. Reliab. Eng. Syst. Saf. 2026; 112329.
[7] Wu H, Song C, Ge Y, Ge T. Link prediction on complex networks: An experimental survey. Data Sci. Eng. 2022; 7(3):253–278.
[8] Jin ZX, Yi JF, Shang KK. Learning-based link prediction methods integrating network topological features and embedding representations. arXiv preprint arXiv:2512.06677. 2025.
[9] Zare G, Navimipour NJ, Hosseinzadeh M, Sahafi A. Network link prediction via deep learning method: A comparative analysis with traditional methods. Eng. Sci. Technol. Int. J. 2024; 56:101782.
[10] Liao W, Bak-Jensen B, Pillai JR, Wang Y, Wang Y. A review of graph neural networks and their applications in power systems. J. Mod. Power Syst. Clean Energy. 2021; 10(2):345–360.
[11] Dolatyabi P, Khodayar M. Graph neural networks and their applications in power systems: A review. In 2025 IEEE Int. Conf. Electro Information Technology (eIT), 2025: 1–10.
[12] Zhao C, Li X, Cai Y. A power grid topology detection method based on edge graph attention neural network. Electr. Power Syst. Res. 2025; 239:111219.
[13] Karabulut B, Manna C, Develder C. Generalization of graph neural network models for distribution grid fault detection. In 2025 IEEE Int. Conf. Communications, Control, and Computing Technologies for Smart Grids (SmartGridComm), 2025: 1–7.
[14] Millán AP, Sun H, Giambagli L, et al. Topology shapes dynamics of higher-order networks. Nat. Phys. 2025; 21: 353–361.
[15] Papamarkou T, Birdal T, Bronstein M, Carlsson G, Curry J, Gao Y, Hajij M, et al. Position: Topological deep learning is the new frontier for relational learning. Proc. Mach. Learn. Res. 2024; 235:39529.
[16] Wu Z, Pan S, Chen F, Long G, Zhang C, Yu PS. A comprehensive survey on graph neural networks. IEEE Trans. Neural Netw. Learn. Syst. 2020; 32(1):4–24.
[17] Zhou J, Cui G, Hu S, Zhang Z, Yang C, Liu Z, Wang L, Li C, Sun M. Graph neural networks: A review of methods and applications. AI Open. 2020; 1:57–81.
[18] Gharsallah S, Yahia S, Bouchelligua W, Bouchrika T. Advancing link prediction with a hybrid graph neural network approach. Mathematics. 2025; 13(22):3594.
[19] Zhu J, Li G, Yang YA, Zhu J, Cui X, Koutra D. On the impact of feature heterophily on link prediction with graph neural networks. Adv. Neural Inf. Process. Syst. 2024; 37:65823–65851.
[20] Besta M, Scheidl F, Gianinazzi L, Kwasniewski G, Klaiman S, Müller J, Hoefler T. Demystifying higher-order graph neural networks. IEEE Trans. Pattern Anal. Mach. Intell. 2026; 48(3):2544-2565.
[21] Bailie T, Koh YS, Mukkavilli K. Higher order graph attention probabilistic walk networks. arXiv preprint arXiv:2411.12052. 2024.
[22] Malott NO, Chen S, Wilsey PA. A survey on the high-performance computation of persistent homology. IEEE Trans. Knowl. Data Eng. 2022; 35(5):4466–4484.
[23] Pun CS, Xia K, Lee SX. Persistent-homology-based machine learning and its applications—A survey. arXiv preprint arXiv:1811.00252. 2018.
[24] Xin C, Xu F, Ding X, Gao J, Ding J. Toping: Topologically interpretable graph learning via persistent rationale filtration. arXiv preprint arXiv:2510.05102. 2025.
[25] Ying C, Zhao X, Yu T. Boosting graph pooling with persistent homology. Adv. Neural Inf. Process. Syst. 2024; 37:19087–19113.
[26] Buffelli D, Soleymani F, Rieck B. CliquePH: Higher-order information for graph neural networks through persistent homology on clique graphs. arXiv preprint arXiv:2409.08217. 2024.
[27] Hofer CD, Kwitt R, Niethammer M. Learning representations of persistence barcodes. J. Mach. Learn. Res. 2019; 20(126):1–45.
[28] Veličković P, Cucurull G, Casanova A, et al. Graph attention networks. arXiv preprint arXiv:1710.10903. 2017.
[29] Lü L, Zhou T. Link prediction in complex networks: A survey. Physica A. 2011; 390(6):1150–1170.
[30] Wang M, Lou X, et al. A degree-related and link clustering coefficient approach for link prediction in complex networks. Eur. Phys. J. B. 2021; 94(1):33.
[31] Scellato S, Noulas A, et al. Exploiting place features in link prediction on location-based social networks. In Proc. 17th ACM SIGKDD Int. Conf. Knowledge Discovery and Data Mining. 2011:1046–1054.
[32] Duan Y, Guan Q. Predicting potential knowledge convergence of solar energy: Bibliometric analysis based on link prediction model. Scientometrics. 2021; 126(5):3749–3773.
Downloads
Published
Issue
Section
License
Copyright (c) 2026 Xing Liu, Zhengqi Wang, Wangyong Guo, Liang Guo, Shuang Chen, Yizhou Chen

This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
This is an open-access article distributed under the terms of the Creative Commons Attribution CC BY 4.0 license, which permits unlimited use, distribution, and reproduction in any medium so long as the original work is properly cited.