Papers
Topics
Authors
Recent
Search
2000 character limit reached

On Graph Theory vs. Time-Domain Discrete Event Simulation for Topology-Informed Assessment of Power Grid Cyber Risk

Published 6 Sep 2024 in math.NA and cs.NA | (2409.04590v1)

Abstract: The shift toward more renewable energy sources and distributed generation in smart grids has underscored the significance of modeling and analyzing modern power systems as cyber-physical systems (CPS). This transformation has highlighted the importance of cyber and cyber-physical properties of modern power systems for their reliable operation. Graph theory emerges as a pivotal tool for understanding the complex interactions within these systems, providing a framework for representation and analysis. The challenge is vetting these graph theoretic methods and other estimates of system behavior from mathematical models against reality. High-fidelity emulation and/or simulation can help answer this question, but the comparisons have been understudied. This paper employs graph-theoretic metrics to assess node risk and criticality in three distinct case studies, using a Python-based discrete-event simulation called SimPy. Results for each case study show that combining graph theory and simulation provides a topology-informed security assessment. These tools allow us to identify critical network nodes and evaluate their performance and reliability under a cyber threat such as denial of service threats.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.