Risk-Aware Secure Routing Mechanism for Power Communication Networks Based on GNNs
DOI:
https://doi.org/10.4108/eetsis.12042Keywords:
Cyberattack, Power Communication Network, Key Node Identification, Risk-Aware, Secure RoutingAbstract
INTRODUCTION: As digital transformation progresses, power communication networks become exposed to increasingly complex security threats. Moreover, traditional routing algorithms cannot perceive or respond to dynamic security threats, making reliable data transmission difficult to achieve under network attack conditions. OBJECTIVES: Therefore, this study proposes a risk-aware secure routing (RASR) mechanism for power communication networks based on graph neural networks (GNNs). METHODS: The mechanism first introduces an autoencoder-graph neural network (AGNN) architecture for determining critical nodes, thus establishing a scoring prediction model customized to the structure of power communication backbone networks. It then integrates the essential scores of the nodes, historical failure rates, and traffic load factors to devise a path node risk quantification model. Finally, it incorporates risk quantification results into routing policies to enable proactive routing avoidance and thus bypass high-risk nodes. RESULTS: Experimental results show that the RASR algorithm effectively meets the differentiated service requirements of heterogeneous traffic—including delay-sensitive, bandwidth-sensitive, and reliability-sensitive traffic. Compared with traditional routing algorithms, it demonstrates greater stability and fault tolerance under high-risk attack scenarios while eliminating the need for redundant backup strategies, thereby markedly reducing resource overhead. CONCLUSION: Therefore, the proposed mechanism offers important theoretical support and a novel technical approach for establishing secure, reliable power communication networks.
References
[1] Lin X, Yao Y, Hu B, et al. Enhancing power communication network security: A comprehensive cyber risk visual analytics framework with real-time risk assessment. Sust. Energy Grids Netw. 2024; 38:101325.
[2] Wen H, Xu, A, Qi H. Application of quantum key distribution in intelligent security operation and maintenance of power communication networks. Result Phys. (2023); 54:107041 https://doi.org/10.1016/j.rinp.2023.107041
[3] Somasundaram K, Kanna RP. Scalable hierarchical balanced clustering-based routing with multipath authentication for secured data transmission in large-scale multicast group communications. Expert Syst. Appl. 2025; 286:128149.
[4] K R MR, Katiravan J. Dynamic trusted cross-layer IDS for secured communications in wireless networks using routing algorithm and FT-CNN. J. Intell. Fuzzy Syst. 2024; 46:6171-6183.
[5] Zhang J, Yan Z, Wang H, et al. CCRPS: Customized cross-domain routing with privacy preservation and stable quality-of-experience based on deep reinforcement learning. Inf. Sci. 2025; 716:122255. https://doi.org/10.1016/J.INS.2025.122255
[6] Chen Y, Gu A, Cui L, et al. MTEAL: Network routing optimization of SD-WAN traffic engineering integrating multi-dimensional QoS metrics. J. Netw. Comput. Appl. 2025; 242:104272. https://doi.org/10.1016/J.JNCA.2025.104272
[7] Zhang F, Shi Y, Xu G, et al. Heuristic community path awareness based routing algorithm in opportunistic Networks. Ad Hoc Netw. 2025; 179:104005. https://doi.org/10.1016/J.ADHOC.2025.104005
[8] Meng Q, Liu L, Zhou D, Tang H, Zhang R, Liu X, Yan D. Application of Artificial Bee Colony Algorithm in Power Communication Network Routing Optimization Simulation. In Proceedings of the 2023 International Conference on Communication Network and Machine Learning, Zhengzhou, China, 27–28 October 2023; https://doi.org/10.1145/3640912.3640921
[9] Jin Z, Xu H, Kong Z, et al. A resilient routing strategy based on deep reinforcement learning for urban emergency communication networks. Comput. Netw. 2025; 257:110898.
[10] Bai J, Sun J, Wang Z, et al. An adaptive intelligent routing algorithm based on deep reinforcement learning. Comput. Commun. 2024; 216:195-208.
[11] Guo Y, Huang Z, Ding M, et al. PROM: A persistent routing optimization method based on supervised learning. J. Netw. Comput. Appl. 2025; 42:104223.
[12] Xiao L, Li S, Wen Q, et al. Load balancing routing algorithm of industrial wireless network for digital twin. Comput. Netw. 2025; 258:111059.
[13] He H, Li Y, Cheng K, Jiao Z, Guo H, Hou X. Research on Invulnerable Routing optimization in Power Communication Backbone Network based on Link-Risk Equalization. In 2023 5th International Academic Exchange Conference on Science and Technology Innovation (IAECST), 8–10 December 2023, Guangzhou, China. https://doi.org/10.1109/IAECST60924.2023.10503476
[14] Tian R, Gu J, Hou Z. Design of Network Routing Optimization Algorithm for Electric Power Communication System. In 2023 International Conference on Telecommunications, Electronics and Informatics (ICTEI), Lisbon, Portugal, 11-13 September 2023, https://doi.org/10.1109/ICTEI60496.2023.00063
[15] Cai J, Wu XS, Sun P. et al. Parameter optimization method for antimisalignment of inductive power transfer system based on a genetic algorithm. J. Power Electron. 2021; 21:1888–1899. https://doi.org/10.1007/s43236-021-00322-9
[16] Sun T, Wu J, Wang X, Zhou W, Li Z. A Risk Balanced Routing Optimization Method for Power Communication Private Networks. In 2023 3rd International Conference on Intelligent Power and Systems (ICIPS), Shenzhen China, 20–22 October 2023. https://doi.org/10.1109/ICIPS59254.2023.10405298
[17] Cheppali P, Selvakumar M. Hybrid optimal parent selection based energy efficient routing protocol for Low-Power and lossy networks (RPL) routing. Expert Syst. Appl. 2025; 277:127011. https://doi.org/10.1016/J.ESWA.2025.127011
[18] Arat F, Akleylek, S. Security-aware RPL: Designing a novel objective function for risk-based routing with rank evaluation. Comput. Netw., 2025; 260:111122.
[19] Lin Z, Zeng Z, Yu Y, et al. Graph Attention Residual Network Based Routing and Fault-Tolerant Scheduling Mechanism for Data Flow in Power Communication Network. Comput. Mater. Continua 2024; 81:1641-1665.
[20] Xiang, K., Fan, L., Shen, R. et al: Topology derivation of a single-phase bridgeless three-level PFC converter based on graph theory. J. Power Electron. (2025). https://doi.org/10.1007/s43236-025-01135-w
[21] Moreno Y, Pastor-Satorras R, Vespignani A. Epidemic outbreaks in complex heterogeneous networks. Eur. Phys. J. B 2002; 26:521-529.
[22] Xia F, Liu T, Wang J, Zhang W, Li H. Listwise approach to learning to rank: theory and algorithm. In Proceedings of the 25th international conference on Machine learning, Helsinki, Finland, 5–9 July 2008. https://doi.org/10.1145/1390156.1390306.
Downloads
Published
Issue
Section
License
Copyright (c) 2026 Yanjun Zhao, Yue Zhang, Xiaowei Zhao, Liyu Liu, Xiang Wang, Kaiyue An
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 CC BY-NC-SA 4.0, which permits copying, redistributing, remixing, transformation, and building upon the material in any medium so long as the original work is properly cited.
