1. Introduction
As a typical example of industrial digitalization, the smart grid relies heavily on information and communication technology (ICT) for data transmission and operation. This integration enables unprecedented efficiencies and supports the proliferation of distributed energy resources. However, the open communication network and the remote monitoring significantly increase the risk of cyberattacks from both external and internal adversaries [
1]. The integrity of critical data and the stability of operational control are constantly continually under threat, as evidenced by incidents such as the BlackEnergy attack, which compromised power-system [
2]. Recent years have witnessed a sharp escalation in cyberattacks targeting power grids worldwide, underscoring the persistent and growing risks to smart grid infrastructure. For instance, in May 2023, a coordinated cyber campaign struck 22 Danish energy companies in what became Denmark’s largest recorded cyber incident, exploiting vulnerabilities in decentralized grid components (David Kasabji, “Deep Dive into the May 2023 Cyber Attack on Danish Energy Infrastructure,”
https://conscia.com/ie/blog/deep-dive-into-the-may-2023-cyber-attack-on-danish-energy-infrastructure/, accessed on 25 January 2026). In 2024, U.S. utilities experienced a nearly 70% surge in cyberattacks compared to 2023, with over 1100 incidents reported in the first eight months alone, according to Check Point Research (Check Point Research, “Cyber Attacks on Utilities Surge 70% in 2024,”
https://www.reuters.com/technology/cybersecurity/cyberattacks-us-utilities-surged-70-this-year-says-check-point-2024-09-11/, accessed on 25 January 2026). Additionally, the U.S. Department of Energy documented at least 175 physical attacks or threats against critical grid infrastructure in 2023, highlighting the dual cyber-physical threat vector (U.S. Department of Energy, “Electric Disturbance Events (OE-417) Annual Summaries,”
https://securethegrid.com/oe-417-database/, accessed on 25 January 2026). These developments, alongside ongoing state-sponsored probing and ransomware targeting European energy firms, emphasize the urgent need for advanced defenses against sophisticated threats, including those exploiting load measurements in modern smart grids. Particularly vulnerable is the ICT infrastructure on the load side, which is more easily penetrated by skilled attackers [
3], making load measurements attractive targets for malicious manipulation.
The LRA is a prime example of such a cyberattack, specifically targeting load measurements. LRAs maliciously modify these measurements and redistribute loads while maintaining a constant total power consumption, thereby enabling them to bypass conventional Bad Data Detection (BDD) mechanisms [
4]. While prior work has explored various LRA designs to enhance stealthiness against BDD [
5,
6,
7], it has also introduced dummy data attacks to evade cluster-based and machine learning detectors [
8]. Mohsenian-Rad and Leon-Garcia [
9] laid the groundwork for understanding how adversaries could manipulate power consumption on a large scale by exploiting IoT-enabled devices. The core idea is that by coordinating synchronized load changes (e.g., turning devices on or off), attackers can disrupt the balance between power supply and demand, thereby impacting grid stability. This initial conceptualization established LRAs as a distinct and significant cyber threat to modern power systems. Lakshminarayana et al. [
10] delve into the heightened vulnerability of power grids to LRAs, particularly under low-inertia conditions. This research was motivated by observations of load consumption patterns during events like the COVID-19 pandemic, where errors in Renewable Energy Source (RES) forecasting could exacerbate the effects of LRAs. Soleymani et al. [
11] explore a crucial aspect of the attacker model: the ability to execute LRAs with limited knowledge of the power system. Specifically, this paper focuses on an (EV-oriented) LRA that constructs its attack vector based only on the grid’s frequency. Maleki et al. [
12] provide an analytical framework to quantify the impact of LRAs specifically on distribution systems with ZIP loads. Ospina et al. [
13] expand the understanding of LRA impacts beyond grid stability to energy market manipulation. This paper investigates how LRAs can affect locational marginal prices in distribution systems. The authors demonstrate that LRAs can propagate from targeted distribution systems to neighboring areas, causing substantial local increases in electricity prices.
Current literature faces two primary challenges in comprehensively addressing LRAs. First, many existing LRA constructions, despite bypassing BDD, may still exhibit anomalous patterns detectable by more sophisticated, data-driven algorithms that exploit statistical or behavioral anomalies. A truly robust LRA needs to be inherently stealthy, not just against basic BDD, but also against these advanced detection methods that often rely on statistical properties of aggregated measurements. Second, a significant gap in existing LRA research is the emphasis on an attack’s actual impact on grid operations. Many LRAs are designed with stealth as the primary goal. Still, if an attack does not genuinely disrupt system operations—such as by increasing generation costs or compromising economic dispatch—its practical threat is diminished. Understanding how to design LRAs that are not only stealthy but also effective in causing tangible adverse effects remains an underexplored area. To be more clear, we provide
Figure 1 to illustrate these issues.
In response to the growing sophistication of LRAs, various countermeasures have been proposed. These include model-based approaches like sliding mode observers [
14] and low-rank Kalman filters [
15] for detecting Load Alteration Attacks (LAAs), physics-informed machine learning algorithms for detection and localization [
16], and control-based defenses [
17]. Some methods leverage signal processing techniques like Fast Fourier Transform [
18] or deep learning with PMU data [
19] and even genetic algorithms for enhanced data management security [
20]. However, these existing detectors also present several limitations. First, model-based detectors often require precise system models and global measurement vectors (i.e., all sensor measurements) as input, which can be challenging to obtain, maintain, and computationally intensive in dynamic, large-scale smart grids. These approaches may also overlook localized, subtle anomalies. Second, many data-driven and machine learning-based detectors necessitate labeled attack data for training, which is typically scarce, difficult to acquire, and may not encompass the full spectrum of evolving attack types. Third, most current detectors focus on the overall system state or aggregate deviations. They tend to overlook the unique temporal characteristics and dynamic features inherent in measurements from individual sensors, which can be critical indicators of an LRA, even when global aggregated measurements appear normal.
Therefore, this paper aims to address these critical challenges by proposing a two-fold investigation. First, we introduce novel stealthy-enhanced LRAs and impact-enhanced LRAs to thoroughly investigate advanced attack vectors that are designed to bypass not only BDD but also data-driven detectors, and to demonstrate significant operational disruption, respectively. Second, and as our core contribution, we develop a novel sensor-oriented temporal detector (STD). The STD is designed to effectively identify these multi-type attacks by uniquely exploiting the temporal relationships of individual sensor measurements through a combination of principal subspace projection and sequential change extraction, all without requiring labeled attack data. The goal is to provide a more robust and responsive detection mechanism against sophisticated load redistribution attacks in smart grids.
Therefore, in this paper, we propose a stealthiness-enhanced and an effectiveness-enhanced LRA, and develop a sensor-oriented temporal detector (STD) to detect these attacks. For constructing a more powerful LRA, our idea lies in the fact that many recent detectors exploit clusters to distinguish attacks, and that the LRA fails to affect the system’s operation if it is not designed to cause system loss, except for its stealthiness. For detecting the LRA, we observe that the measurements of an individual sensor are changed in an unreasonable manner, although the LRA is stealthy against the BDD. The abnormal change in the measurements of a separate sensor is typically ignored by the BDD and other detectors, which use the norm of measurement deviations of all sensors. The goal of this paper is to address the issues mentioned above. In summary, our contributions are as follows:
We propose two LRA types that enhance stealthiness in bypassing cluster-based detectors and increase effectiveness in raising the generation cost.
We develop a sensor-oriented temporal detector (STD) by combining the principal subspace projection and the sequential change extraction.
We conduct extensive simulations to analyze the impact of the attack and the detection performance of STD.
The remainder of this paper is organized as follows.
Section 2 introduces the system model and the LRA models. The sensor-oriented temporal detector is presented in
Section 3.
Section 4 provides the simulation results.
Section 5 concludes the paper.
2. System Model and Load Redistribution Attack
In this section, we first introduce the power flow model and provide background on the power system. Then, we introduce three types of load redistribution attack (LRA). The general LRA is designed to bypass the bad data detection (BDD). The hidden LRA (HLRA) is hidden from the BDD and the cluster-based detector. The effective LRA (ELRA) considers the effectiveness of the LRA and HLRA to cause an increase in the generation cost. The attack’s impact is becoming increasingly powerful with LRA, HLRA, and ELRA.
2.1. Power Flow Model
The power flow model represents the physical law of the transmission network. Here we assume that the network consists of a set
of buses (bus 1 is the reference bus) and a set
of transmission lines. Given each line
, it starts from the bus
i and ends at the bus
j. The line-bus incidence matrix
is formulated as
where
is the element of
at the position
. Since the first bus is regarded as the reference bus, the first column of
is usually eliminated. The new
(Here we do not use a new symbol for simplification) is used in the following. We do not change the notation to make it easy to follow. The diagonal susceptance matrix is
, whose element at the position
is the susceptance of line
. Therefore, the invertible symmetric admittance matrix is derived as
and the line-bus shift factor matrix is
. Except for the reference bus, the power generations of the buses form a vector
(if bus
i is not a generator, then the
ith element of
is 0). The power loads of the buses form a vector
(if bus
i is not a load, then the
ith element of
is 0). Hence, the vector of power injections is
. With the DC power flow model [
21], we can derive that
where
is a vector of power flows corresponding to the transmission lines (each line has a power flow measurement in the positive direction).
2.2. Load Redistribution Attack
Given the vulnerabilities of communication networks and smart sensors, load measurements can be compromised by both internal and external attackers. The LRA is a typical attack that maliciously modifies the load measurements and remains stealthy. The stealthiness is guaranteed by maintaining the following equations
where
,
, and
are vectors of injected errors into the load measurements, power flow measurements, and generation measurements,
is a vector with all elements equal to 1 and
is a vector with all elements equal to 0. The constraint (
3) indicates that the sum of the injected errors into the load measurements is 0. The injected errors are carefully balanced to be stealthy. The constraint (4) limits the injected errors for the load measurements. The constraint (5) ensures that the injected errors adhere to the DC model (
2), which is crucial for maintaining the stealthiness of the attack (i.e., LRA). According to [
4], we can prove that the LRA can bypass the bad data detection (BDD), and thus realize a stealthy attack.
2.3. Hidden LRA
Although the LRA is stealthy against BDD, it might be detected by cluster-based data-driven detectors [
22]. By minimizing the distance between the modified measurement and the historical measurements, we can effectively conceal the measurement within the normal measurements. The attacked measurement is treated as normal with the Principal Component Analysis (PCA) distance [
23]. The following problem is formulated to compute a malicious measurement
for the hidden load redistribution attack (HLRA):
where the constraint (9) is used to limit the error injected into the power flow measurement, and
is the threshold for limiting the change in
. The objective is to minimize the distance between the target measurement and the historical measurements. The length
depends on the system dynamics. As the system loads usually change in a periodic manner (daily, monthly, or seasonal), the
is less than the cycle time.
2.4. Effective LRA
Although the LRA and HLRA are stealthy, they might be ineffective in disrupting the system’s operation. Therefore, an effective load redistribution attack (ELRA) must be designed. The main idea is to consider the impact of LRA on the grid’s operation when planning the attack. For example, we believe the additional generation cost incurred by LRA. If the generation cost increases after the attack, then the LRA is effective; otherwise, the LRA fails.
The security-constrained DC optimal power flow (SC-DCOPF) is used to compute the generation cost. Therefore, we compare the generation cost before and after the LRA. The SC-DCOPF is formulated by
where
is a cost function and usually in a quadratic form (for example,
, where
and
are vectors and
is a constant.),
and
are the lower and upper limits of power injections, and
is the positive congested power flows of transmission lines. Once the load profile is determined, the SC-DCOPF is used to compute the generation cost. Without the LRA, the generation cost is
. With the LRA, the generation cost might be changed. The generation cost after the LRA is formulated by
where
and
. Therefore, the LRA is effective if
. For the HLRA, it is effective by solving the following optimization problem:
The HLRA is effective if
.
While LRAs are a known cyber threat, their efficacy is often limited by existing defense mechanisms. Our work introduces Hidden LRA (HLRA) and Effective LRA (ELRA), which are not fundamentally new attack vectors but rather advanced iterations of the LRA. HLRA is meticulously designed to bypass traditional bad data detection (BDD) and cluster-based data-driven detectors by minimizing its deviation from historical measurement patterns. ELRA further enhances this by ensuring the attack causes a significant and quantifiable increase in generation costs, thereby demonstrating a more impactful and economically damaging threat. These enhanced LRA models are specifically crafted to succeed where simpler LRAs might fail against current defense strategies.
In response to this evolving threat landscape, we propose the Sensor-oriented Temporal Detector (STD). Unlike conventional methods that often treat sensor measurements as static vectors or rely on aggregated data, STD leverages the dynamic, temporal characteristics of individual sensor measurements. By combining principal subspace projection with sequential change extraction, STD is designed to identify subtle anomalies that stealthier attacks, such as HLRA and ELRA, introduce into the system. Our comprehensive simulations demonstrate STD’s superior performance in detecting not only general LRAs but critically, also these advanced HLRA and ELRA variants, highlighting its robustness against more sophisticated attack strategies where existing detectors often fall short. This integrated approach allows for a rigorous assessment of both the enhanced attack models as realistic threats and the robust capabilities of our proposed detection method.
3. Sensor-Oriented Attack Detection
Most existing approaches detect the measurement modification attacks from a statistical perspective. This will ignore the specific dynamics of each sensor and the structural information. Therefore, the sensor-oriented attack detection can be more effective. More importantly, the detector is designed in an unsupervised form. The labelled abnormal data is not required since it cannot be comprehensively and well generated.The attack-defense relationship is given in
Figure 2.
For each sensor, its measurements change in response to the system dynamics. As a time series data, the sensor measurements of the load or power flow sensor are denoted by
, where
is a load or power flow measurement. Given a lag parameter
L, the subseries is formed by
This measurement vector is typically referred to as the lag vector. Suppose there are
H lag vectors. Then, for
, we can construct a measurement matrix as
where
G is the length of the time series data. The covariance matrix is
. We can conduct the singular value decomposition (SVD) on
. The eigenvectors of
are obtained as
,
, ⋯,
. The principal eigenvalues of
can be derived with SVD. Suppose there are
k principal eigenvalues. The eigenvectors corresponding to these principle eigenvalues are
,
, ⋯,
. These eigenvectors form a matrix
.
Considering the system dynamics, time is a critical factor in defining the data characteristics. As the lag vectors are time-stamped, we compute the weighted mean in the following way.
where
is the weighted mean of the lag vectors. With the matrix
, we can obtain a projection matrix like
. Using the projection matrix, the cluster center is computed by
Therefore, the abnormal measurement can be captured by the distance between the measured vector and the cluster center. That is, given the current lag vector
of measurements, we compute the distance by
A threshold
is predefined to determine whether there are abnormal measurements in
or not. The theory given in [
24] said that the normal measurements are contained in the subspace
spanned by
. Therefore, in the normal case, the distance
is small. However, this is a rough detection since the temporal characteristic is not taken into account. In other words, although the lag vector formed by the measurements is contained in the subspace
, it is not normal since the measurements are not normal at the time. An example is the replace attack, the attacker replaced
with
(both
and
are contained by the subspace
) to bypass the detection with (
26). Therefore, except for distance detection, we develop a spectral method to detect abnormal measurements.
The spectral is defined as
Then, the dynamic time warping (DTW) is used to compute the distance between
and
. For easy understanding, we denote
and
as
The alignment cost is computed by evaluating each cost cell. The cost cell is calculated as
where
is the value at the position
of the cost matrix
and
is the distance between
and
. The result
(i.e.,
) indicates the dissimilarity between the sequences
and
, where
is the size of the set. Therefore, the sensor-oriented temporal detector is formulated as
where
and
are coefficients to trade-off the distance. The details of the sensor-oriented temporal detector (STD) are given in Algorithm 1. Given a measurement vector
, the abnormal indicator is
where
is the threshold for detecting the abnormal measurement. The theoretical complexity for a single detection step is
. Given that
L and
H are typically much smaller than
N (the total data length) and are constant parameters for the detector, the per-sample detection is efficient. For a total of
N samples, the total complexity would be
. The per-sample (per-sensor, per-time-step) computational complexity of STD is dominated by the SVD on the lag vector matrix (size
), yielding
in the training phase and similar for online updates with incremental SVD approximations. Here,
L is the lag parameter (dimension of each difference vector).
H is the sliding window size (number of lag vectors).
| Algorithm 1 Sensor-oriented temporal detector (STD) |
- 1:
function STD(The measurement matrix , the current measurement ) - 2:
Compute the eigenvectors , , ⋯, and form the eigenvector matrix of with SVD - 3:
Compute the projection matrix - 4:
Compute the weighted mean - 5:
Compute the distance - 6:
- 7:
for to H do - 8:
for to H do - 9:
- 10:
- 11:
end for - 12:
end for - 13:
Compute - 14:
return - 15:
end function
|
The parameters are selected according to the following. The key parameters in STD-subspace dimension k, weighting ratio , and detection threshold are selected based on standard practices in subspace-based anomaly detection and statistical properties of normal data, while ensuring robust performance across varying conditions.
The subspace dimension
k is determined using the cumulative explained variance ratio from the eigenvalues obtained via SVD on the lag vector matrix. Specifically,
k is chosen such that the principal subspace captures at least 95% of the total variance in normal historical measurements:
where
are the sorted eigenvalues. This threshold is a common heuristic in PCA-based methods for retaining the dominant normal patterns while projecting subtle anomalies into the residual space, as supported by extensive literature on subspace anomaly detection in power systems and time series data.
The weighting factors and (with ratio ) balance the contributions of projection residuals and sequential DTW changes in the combined anomaly score. We set (equal weighting) as a baseline, which empirically provides stable performance, reflecting the complementary nature of spatial (subspace) and temporal (DTW) deviations under LRAs.
The detection threshold is statistically derived from the distribution of anomaly scores on attack-free training data. Specifically, , where and are the mean and standard deviation of normal scores, corresponding to a false positive rate below 0.3% under Gaussian assumptions (common for residual-based detectors).
To demonstrate robustness, we conducted a sensitivity analysis on the IEEE 14-bus test system. Varying k via explained variance thresholds (90–99%) yields detection rates above 98% for all LRA variants, with minimal variation (±1.2% in F1-score). Adjusting the weighting ratio from 0.5 to 2 changes the F1-score by less than 2.5%, confirming insensitivity. For , scaling the multiplier trades recall for precision predictably, maintaining overall F1-scores above 97%. These results affirm that STD’s performance is stable across reasonable parameter ranges, enhancing reproducibility.