Skip to content

Simplicial Graph-Based Detection and Localization of Cyber Attacks Against Large-Scale Smart Grids

Sep 2026 · IEEE Transactions on Smart Grid · Vol 17, pp. 4681-4696 · 0 citations · 34 references

Abstract

Ensuring the resilience of large-scale power systems against cyber attacks is critical to maintaining the stability of modern cyber-physical energy systems. Existing machine learning (ML)-based detection frameworks predominantly focus on pairwise node interactions (i.e., edges) and often overlook capturing higher-order topological structures (i.e., simplicial complexes) that emerge within power networks. This paper introduces a novel simplicial recurrent graph neural network (SRGNN) for attack detection and localization in large-scale smart grid infrastructure. Unlike conventional graph models, SRGNN incorporates higher-order simplicial interactions to capture group-wise dependencies among buses and transmission lines, allowing the model to better reflect the multi-scale dynamics of grid operation and control. We investigate the robustness of our model against benchmark and proposed complex simplicial-based attack node selection strategies. Our extensive experiments on large-scale transmission power networks (<inline-formula> <tex-math notation="LaTeX">$2{,}869$ </tex-math></inline-formula>-bus, <inline-formula> <tex-math notation="LaTeX">$9{,}241$ </tex-math></inline-formula>-bus, and <inline-formula> <tex-math notation="LaTeX">$70{,}000$ </tex-math></inline-formula>-bus systems) demonstrate that the proposed SRGNN model outperforms ML-based benchmark models, achieving superior detection and localization performance by 9–39% and 8–35%, respectively, in detection rate against complex attacks. These results underscore the importance of modeling higher-order topological structures for robust and scalable security in power systems.

View source

Similar papers

Preprint Aug 2026

Graph-Native Attention Acceleration for Attack Detection in Cyber-Physical Systems

Cyber-physical systems (CPSs) consist of sensors, controllers, and actuators through communication and physical interactions, making them vulnerable to attacks on measurements, control logic, and equipment operation. Graph-based attack detectors, especially graph attention models, can localize such attacks by learning...

Zhenan Feng, Ehsan Nekouei · 0 citations
Preprint Sep 2026

Gramian-Informed Framework for Edge Flow Network Analysis Against Nodal Attacks

We study the first-order effects of nodal inputs on edge flows of network systems through controllability Gramians. We consider both discrete- and continuous-time dynamics subject to impulse and step input disturbances. To characterize their impact on network behavior, we introduce the notion of a vulnerability matrix...

Prasad Vilas Chanekar, B. Poolla, J. Cortés · 0 citations
#graph neural networks Open access Oct 2026

Synthetic false data injection-inspired perturbation framework for power grid attack detection using graph neural networks and deep learning models

The novelty of this work lies in providing a unified, leakage-free comparative framework spanning graph- and non-graph-based deep learning architectures under identical experimental conditions, which provides a realistic and extensible benchmark for future power-grid cybersecurity research.

Niharika Agrawal, Sheila Mahapatra, Bishwajit Dey · 0 citations
Review Aug 2026

Graph Machine Learning: An Opportunity for Power Systems

Modern power systems face growing operational complexity driven by the integration of renewable energy sources, decentralization, and the need for real-time decision-making across a wide range of timescales. Addressing these challenges traditionally relies on model-based methods that, while accurate, can be too slow fo...

Martin Sadric, Sebastian Pütz, Christian Nauck et al. · 0 citations
Open access Aug 2026

Network Monitoring Using Spectrum-Reduced Laplacian Energy Bounds

The experimental results show that gradual edge modifications produce relatively small changes in the monitoring indicators, whereas targeted hub failures lead to larger variations in the optimized bounds and the optimization gap.

Anil Kumar, Anil Kumar Hanspal, Amit Kaura · 0 citations

Related blog posts

Microsoft Research Blog Jul 13, 2026

Verifying Rust cryptography in SymCrypt, from standards to code

Cryptographic code supports vital protections in modern computing systems. Learn how a new method helps verify code as developers write it while preserving speed and adaptability as it gets implemented and evolves. The post Verifying Rust cryptography in SymCrypt, from standards to code appeared first on Microsoft Research.

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.