Modeling and Detection of False Data Injection Attacks for State Estimation and Automatic Generation Control in Power Systems
Bibliographic record
Abstract
Electricity is crucial for modern societies, necessitating stable and consistent power systems.In power systems, various communication protocols coexist, each designed for specific functions like state estimation (SE) or automatic generation control (AGC).SE can estimate the power states by eliminating inaccuracies and errors from measurement data, while AGC adjusts the power outputs of multiple generators in response to changes in the load.Given their reliance on measurement data, SE and AGC are vulnerable to cyber threats.Among the array of conventional cyberattacks, such as replay attacks, denial of service attacks, and resonance attacks, the false data injection attacks (FDIAs) stand out.FDIA subtly injects misleading data, making it especially hard to detect compared to other attacks which may show obvious signs or require physical intrusions.This thesis, therefore, explores innovative approaches to both create and identify FDIA within the SE and AGC frameworks.From the perspective of an intruder, we propose an FDIA model against alternating current SE.This model exploits the intrinsic load dynamics in ambient conditions and the properties of the Ornstein-Uhlenbeck (OU) process.Without the need for line parameters and by leveraging only limited data from phasor measurement units, the proposed method can target specific node voltage and launch large deviation attacks.Various tests on the IEEE 39-bus system validate that the proposed FDIA can effectively bypass bad data detection (BDD), launching targeted attacks with high probabilities.Assuming the role of intruders, we introduce an innovative FDIA algorithm targeting AGC, which operates without requiring AGC parameters.We first utilize the maximum likelihood estimation (MLE) of the multivariate OU process to extract AGC parameters, topology details, and the conditional variance of states, purely from intercepted sensor data.With this information, FDIA vectors are designed through optimization to bypass conventional AGC BDD.Numerical assessments in 2-area and 3-area systems demonstrate the capability of the developed FDIA algorithm to compromise the system's frequency within mere minutes, even when considering factors like measurement noise, transmission delay, and computational time.While attack methods can be executed rapidly, spanning seconds to minutes, defense mechanisms in contrast require continuous 24/7 operation.To counter FDIAs aimed at AGC, we adopt a defender's perspective.We incorporate a more practical loading model characterized by its stochastic short-term behavior and deterministic long-term convergence.This allows us to represent the AGC system as a multivariate OU process enhanced with a drift term.We then derive the MLE for this OU process, eliminating the need for real-time load observability and forecast data, which may not be accurately observed or predicted in actual power systems.In simulations, the proposed detection method proves effective not just against basic FDIA but also against sophisticated coordinated attacks that could bypass traditional detectors.Contents vii 4.2.1 Estimating the AGC Key Parameters Based on the MLE for the Multivariate OU Process . . . . . . . . . . . . . . . . . . . . . . . . . . .4.2.2Observability and Vulnerability of Power Measurements and Commands 4.2.3Estimating AGC Parameters with Limited Measurements . . . . . . .4.2.4Cyberattacks Types and Basic BDD . . . . . . . . . . . . . . . . . .4.2.5The Proposed Online FDIA Detection Algorithm . . . . . . . . . . .
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.008 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.001 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".