About | Contact Us | Register | Login
ProceedingsSeriesJournalsSearchEAI
sis 26(7):

Research Article

Risk-Aware Secure Routing Mechanism for Power Communication Networks Based on GNNs

Download5 downloads
Cite
BibTeX Plain Text
  • @ARTICLE{10.4108/eetsis.12042,
        author={Yanjun Zhao and Yue Zhang and Xiaowei Zhao and Liyu Liu and Xiang Wang and Kaiyue An},
        title={Risk-Aware Secure Routing Mechanism for Power Communication Networks Based on GNNs},
        journal={EAI Endorsed Transactions on Scalable Information Systems},
        volume={12},
        number={7},
        publisher={EAI},
        journal_a={SIS},
        year={2026},
        month={3},
        keywords={Cyberattack, Power Communication Network, Key Node Identification, Risk-Aware, Secure Routing},
        doi={10.4108/eetsis.12042}
    }
    
  • Yanjun Zhao
    Yue Zhang
    Xiaowei Zhao
    Liyu Liu
    Xiang Wang
    Kaiyue An
    Year: 2026
    Risk-Aware Secure Routing Mechanism for Power Communication Networks Based on GNNs
    SIS
    EAI
    DOI: 10.4108/eetsis.12042
Yanjun Zhao1,*, Yue Zhang1, Xiaowei Zhao1, Liyu Liu1, Xiang Wang1, Kaiyue An1
  • 1: Inner Mongolia Power Communication Company
*Contact email: zhaoyanjun198111@yeah.cn

Abstract

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.

Keywords
Cyberattack, Power Communication Network, Key Node Identification, Risk-Aware, Secure Routing
Received
2025-09-15
Accepted
2025-10-18
Published
2026-03-16
Publisher
EAI
http://dx.doi.org/10.4108/eetsis.12042

Copyright © 2026 Y. Zhao et al., licensed to EAI. 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.

EBSCOProQuestDBLPDOAJPortico
EAI Logo

About EAI

  • Who We Are
  • Leadership
  • Research Areas
  • Partners
  • Media Center
  • Cookie Preferences

Community

  • Membership
  • Conference
  • Recognition
  • Sponsor Us

Publish with EAI

  • Publishing
  • Journals
  • Proceedings
  • Books
  • EUDL