<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD with MathML3 v1.1d2 20140930//EN" "JATS-journalpublishing1-mathml3.dtd">
<article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" dtd-version="1.1d2" xml:lang="en">
  <front>
    <journal-meta>
      <journal-id journal-id-type="nlm-ta">CJIF</journal-id>
      <journal-id journal-id-type="publisher-id">ICCK</journal-id>
      <journal-title-group>
        <journal-title>Chinese Journal of Information Fusion</journal-title>
      </journal-title-group>
      <issn pub-type="ppub" publication-format="print">2998-3363</issn>
      <issn pub-type="epub" publication-format="electronic">2998-3371</issn>
      <publisher>
        <publisher-name>Institute of Central Computation and Knowledge Inc</publisher-name>
        <publisher-loc>522 W RIVERSIDE AVE STE N, SPOKANE, WA, 99201, UNITED STATES</publisher-loc>
      </publisher>
    </journal-meta>
    <article-meta>
      <article-id pub-id-type="doi">10.62762/CJIF.2024.740709</article-id>
      <article-categories>
        <subj-group subj-group-type="heading">
          <subject>Research Article</subject>
        </subj-group>
      </article-categories>
      <title-group>
        <article-title>Robust Distributed State Estimation in Power Systems: A Multi-Estimator Data Fusion Approach to Counteract Cyber-Attacks</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <contrib-id contrib-id-type="orcid">https://orcid.org/0009-0004-3482-3221</contrib-id>
          <name>
            <surname>Jin</surname>
            <given-names>Shiyu</given-names>
          </name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <contrib-id contrib-id-type="orcid">https://orcid.org/0000-0003-4943-7919</contrib-id>
          <name>
            <surname>Yang</surname>
            <given-names>Wen</given-names>
          </name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <contrib-id contrib-id-type="orcid">https://orcid.org/0009-0004-1544-0743</contrib-id>
          <name>
            <surname>Yuan</surname>
            <given-names>Hongbo</given-names>
          </name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <contrib-id contrib-id-type="orcid">https://orcid.org/0000-0002-2854-2800</contrib-id>
          <name>
            <surname>Ding</surname>
            <given-names>Wenjie</given-names>
          </name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <contrib-id contrib-id-type="orcid">https://orcid.org/0009-0005-0637-3494</contrib-id>
          <name>
            <surname>Wu</surname>
            <given-names>Han</given-names>
          </name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <contrib-id contrib-id-type="orcid">https://orcid.org/0000-0003-4929-9499</contrib-id>
          <name>
            <surname>Wang</surname>
            <given-names>Jie</given-names>
          </name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff1"><label>1</label>Key Laboratory of Smart Manufacturing in Energy Chemical Process, Ministry of Education, East China University of Science and Technology, Shanghai 200237, China</aff>
      </contrib-group>
      <author-notes>
        <corresp id="cor2">Corresponding Author: Wen Yang. Email: <email>weny@ecust.edu.cn</email></corresp>
      </author-notes>
      <pub-date date-type="pub" pub-type="epub" publication-format="online">
        <day>30</day>
        <month>12</month>
        <year>2024</year>
      </pub-date>
      <volume>1</volume>
      <issue>3</issue>
      <fpage>212</fpage>
      <lpage>225</lpage>
      <history>
        <date date-type="received">
          <day>11</day>
          <month>11</month>
          <year>2024</year>
        </date>
        <date date-type="accepted">
          <day>29</day>
          <month>12</month>
          <year>2024</year>
        </date>
      </history>
      <permissions>
        <copyright-statement>© 2024 by the Authors. Published by Institute of Central Computation and Knowledge. This is an open access article under the CC BY license (https://creativecommons.org/licenses/by/4.0/).</copyright-statement>
        <copyright-year>2024</copyright-year>
        <copyright-holder>The Authors</copyright-holder>
        <license xlink:href="https://creativecommons.org/licenses/by/4.0/">
        </license>
      </permissions>
      <self-uri xlink:href="https://www.icck.org/article/abs/cjif.2024.740709">This article is available from https://www.icck.org/article/abs/cjif.2024.740709</self-uri>
      <abstract>
        <p>Cyber security in power systems has become increasingly critical with the rise of network attacks such as Denial-of-Service (DoS) attacks and False Data Injection (FDI) attacks. These threats can severely compromise the integrity and reliability of state estimation, which are fundamental to the operation and control of power systems. In this manuscript, an estimation algorithm based on the fusion of information from multiple estimators is proposed to ensure that state estimation at critical buses can function properly in case of attacks. Our approach leverages a network of estimators that can dynamically adjust to maintain system stability and accuracy. Furthermore, a new detector is adopted based on Kullback-Leibler divergence to detect linear FDI attacks. To address stealthy attacks that may evade detection, we propose a novel weighting scheme that reduces the impact of attacks on estimation results. Numerical experiments demonstrate the effectiveness and accuracy of our proposed estimation algorithm under cyber attacks.</p>
      </abstract>
      <kwd-group kwd-group-type="author" xml:lang="en">
        <kwd>state estimation</kwd>
        <kwd>smart grid</kwd>
        <kwd>data fusion</kwd>
        <kwd>Kullback-Leibler divergence</kwd>
        <kwd>cyber attack</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="S1">
      <label>1.</label>
      <title>Introduction</title>
      <p id="S1.p1">State estimation, as an important backbone of smart grid, providing critical data essential for the operation and surveillance of power systems. Yet, with the proliferation of intelligent devices and communication networks, the risk of cyber threats has correspondingly increased. Attackers can employ diverse cyber-attack methods to disrupt the functioning of state estimation, thereby impacting the stable operation of the system. The two most prevalent forms of cyber attacks are DoS attacks and FDI attacks. DoS attacks aim to disrupt the communication channels, preventing the transmission of data between sensors and estimators. FDI attackers replace the measurements with designed false data, resulting in incorrect state estimations. Both types of attack have the potential to result in significant consequences [<xref rid="ref002" ref-type="bibr">2</xref>, <xref rid="ref003" ref-type="bibr">3</xref>, <xref rid="ref004" ref-type="bibr">4</xref>, <xref rid="ref005" ref-type="bibr">5</xref>, <xref rid="ref006" ref-type="bibr">6</xref>].</p>
      <p id="S1.p2">Recently, numerous studies have been conducted on cyber attacks within power systems. Traditional state estimation methods are based on static estimation using the least squares approach. To detect cyber attacks in the system under static estimation, researchers in [<xref rid="ref007" ref-type="bibr">7</xref>] have explored how to enhance the robustness of power system state estimation against stealthy FDI attacks. The authors proposed a method that combines data preprocessing with post-processing of state estimates to reduce the likelihood of successful attacks by adversaries. An optimization-based approach was presented in [<xref rid="ref008" ref-type="bibr">8</xref>] to maximize the impact of attacks, and the manuscript discussed how to mitigate these attacks by adjusting system parameters. A probabilistic approach is employed in [<xref rid="ref009" ref-type="bibr">9</xref>] to analyze and defend against FDI attacks. The researchers introduced a detection algorithm based on a probabilistic model, aimed at enhancing the power system's resilience against such attacks. Moving target denfence (MTD) has emerged as an effective strategy for detecting FDI attacks within the static state estimation of power systems. Defenders increase the error introduced by the attack vector by altering the system's topology. Comprehensive analyses have been conducted in [<xref rid="ref010" ref-type="bibr">10</xref>, <xref rid="ref011" ref-type="bibr">11</xref>, <xref rid="ref012" ref-type="bibr">12</xref>, <xref rid="ref013" ref-type="bibr">13</xref>, <xref rid="ref014" ref-type="bibr">14</xref>], defining both complete and incomplete MTD and designing robust denfence algorithms. Reference [<xref rid="ref015" ref-type="bibr">15</xref>] takes economic factors into account, and an optimal defense strategy is presented by integrating game-theoretic methods. Additionally, detection methods based on machine learning have recently gained widespread research attention, playing a significant role in attack detection [<xref rid="ref016" ref-type="bibr">16</xref>, <xref rid="ref017" ref-type="bibr">17</xref>].</p>
      <p id="S1.p3">With the continuous development of smart grids, the static estimation, which is computationally simple and updates at a slower frequency, no longer meets the demands of modern power systems. Dynamic estimation based on the Kalman filter is gradually becoming the mainstream in state estimation [<xref rid="ref018" ref-type="bibr">18</xref>]. Dynamic state estimation in power systems, augmented by high-sampling and high-precision measurements from Phasor Measurement Units (PMUs), effectively enhances the detection of cyber attacks within the system. Reference [<xref rid="ref019" ref-type="bibr">19</xref>] introduces an Extended Kalman Particle Filter-based approach for dynamic state estimation in power systems. By constructing the importance sampling density function within the particle filter using the Extended Kalman Filter, it effectively addresses the particle degeneracy issue, achieving high-precision state estimation. References [<xref rid="ref020" ref-type="bibr">20</xref>] and [<xref rid="ref021" ref-type="bibr">21</xref>] further refine the Kalman filter within the context of dynamic estimation, significantly improving the system's robustness. The authors derive and calculate the range of attack vectors for three types of attacks that can successfully destabilize the system, and determine the range of failure for the chi-squared detector against FDI attacks in [<xref rid="ref022" ref-type="bibr">22</xref>].</p>
      <p id="S1.p4">The methods described above are capable of detecting cyber attacks within a system and initiating alarms, with the resumption of normal state estimation operations contingent upon the resolution of detected anomalies. However, the operation of power systems is critically important, and even brief periods of maintenance can lead to substantial economic losses. Furthermore, as the capabilities of attackers advance, there has been a surge in research on stealth FDI attacks [<xref rid="ref023" ref-type="bibr">23</xref>, <xref rid="ref024" ref-type="bibr">24</xref>]. These meticulously designed attack vectors can evade detection while inflicting the maximum possible damage on the system. Consequently, there is an urgent requirement for estimation algorithms that can sustain the normal functioning of power systems under attacks and significantly reduce the impact of such attacks. It is evident that traditional estimation methods, which rely on a single estimator, are inadequate for achieving this objective. In this manuscript, we introduce an innovative approach by combining information-fusion-based distributed algorithms with dynamic power system estimation to address the current challenges. Information fusion, a cutting-edge technology, is particularly effective in mitigating the effects of data loss and the introduction of false data [<xref rid="ref025" ref-type="bibr">25</xref>, <xref rid="ref026" ref-type="bibr">26</xref>, <xref rid="ref027" ref-type="bibr">27</xref>]. We introduce a novel multi-estimator-based distributed estimation methodology, which is designed to effectively diminish the repercussions of data loss and the infiltration of false data. Furthermore, we have developed a weighting strategy grounded in KL-divergence principles, which has proven to be instrumental in diminishing the effects of covert attacks.</p>
      <p id="S1.p5">The main contributions of our research are as follows:</p>
      <p>
        <list list-type="order" id="S1.I1">
          <list-item id="S1.I1.i1">
            <p id="S1.I1.i1.p1">We have designed a state estimation algorithm that ensures the normal operation of state estimation at critical buses under cyber attacks. Additionally, by incorporating KL-divergence detectors on each estimator to detect linear FDI attacks, the integrity of state estimation is effectively safeguarded.</p>
          </list-item>
          <list-item id="S1.I1.i2">
            <p id="S1.I1.i2.p1">In response to stealthy attacks that can evade detection, we propose a novel weighting strategy. This strategy assigns lower weights to estimation results that are significantly affected by noise and attacks, while higher weights are given to those less affected, thereby effectively reducing the interference of noise and stealthy attacks and enhancing the accuracy of estimation.</p>
          </list-item>
          <list-item id="S1.I1.i3">
            <p id="S1.I1.i3.p1">We demonstrate that the proposed algorithm is superior in accuracy and robustness compared to traditional algorithms when subjected to DoS attacks and FDI attacks by numerical experiments.</p>
          </list-item>
        </list>
      </p>
      <p id="S1.p6">The structure of this manuscript is organized as follow: Section 2 provides a concise introduce about the system model and related theories. Section 3 presents the model and estimation algorithm proposed in this manuscript. Section 4 consists of numerical experiments and analysis of the results. Section 5 presents the conclusion of this manuscript.</p>
    </sec>
    <sec id="S2">
      <label>2.</label>
      <title>System Model</title>
      <sec id="S2.SS1">
        <label>2.1</label>
        <title>State-space model </title>
        <p id="S2.SS1.p1">Power system state estimation can be categorized into two primary methods: DC (Direct Current) estimation and AC (Alternating Current) estimation.The state variables in AC estimation encompass both the phase angle and the voltage magnitude, providing a comprehensive representation of the system's state.In contrast, DC estimation, a simplified version, includes only the voltage magnitude, omitting the phase angle.In this manuscript, we focus primarily on the more prevalent AC estimation approach due to its comprehensiveness and applicability in practical scenarios.Similar to the work presented in [<xref rid="ref018" ref-type="bibr">18</xref>], the state signal obtained in real-time by sensors can be considered as a discrete-time function concerning the voltage amplitude <inline-formula><mml:math alttext="A_{v}" display="inline"><mml:msub><mml:mi>A</mml:mi><mml:mi>v</mml:mi></mml:msub></mml:math></inline-formula> and the phase angle <inline-formula><mml:math alttext="(\theta+\phi)" display="inline"><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>θ</mml:mi><mml:mo>+</mml:mo><mml:mi>ϕ</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:math></inline-formula>, denoted as :</p>
        <p>
          <disp-formula id="S2.E1">
            <mml:math alttext="V(t)=A_{v}\cos(\omega t+\phi)" display="block">
              <mml:mrow>
                <mml:mrow>
                  <mml:mi>V</mml:mi>
                  <mml:mo>⁢</mml:mo>
                  <mml:mrow>
                    <mml:mo stretchy="false">(</mml:mo>
                    <mml:mi>t</mml:mi>
                    <mml:mo stretchy="false">)</mml:mo>
                  </mml:mrow>
                </mml:mrow>
                <mml:mo>=</mml:mo>
                <mml:mrow>
                  <mml:msub>
                    <mml:mi>A</mml:mi>
                    <mml:mi>v</mml:mi>
                  </mml:msub>
                  <mml:mo lspace="0.167em">⁢</mml:mo>
                  <mml:mrow>
                    <mml:mi>cos</mml:mi>
                    <mml:mo>⁡</mml:mo>
                    <mml:mrow>
                      <mml:mo stretchy="false">(</mml:mo>
                      <mml:mrow>
                        <mml:mrow>
                          <mml:mi>ω</mml:mi>
                          <mml:mo>⁢</mml:mo>
                          <mml:mi>t</mml:mi>
                        </mml:mrow>
                        <mml:mo>+</mml:mo>
                        <mml:mi>ϕ</mml:mi>
                      </mml:mrow>
                      <mml:mo stretchy="false">)</mml:mo>
                    </mml:mrow>
                  </mml:mrow>
                </mml:mrow>
              </mml:mrow>
            </mml:math>
          </disp-formula>
        </p>
        <p>By expanding the trigonometric function in Eq.<xref rid="S2.E1">1</xref>, we can derive the following equation:</p>
        <p>
          <disp-formula id="S2.E2">
            <mml:math alttext="V(t)=A_{v}\cos(\omega t+\phi)-A_{v}\sin(\omega t+\phi)" display="block">
              <mml:mrow>
                <mml:mrow>
                  <mml:mi>V</mml:mi>
                  <mml:mo>⁢</mml:mo>
                  <mml:mrow>
                    <mml:mo stretchy="false">(</mml:mo>
                    <mml:mi>t</mml:mi>
                    <mml:mo stretchy="false">)</mml:mo>
                  </mml:mrow>
                </mml:mrow>
                <mml:mo>=</mml:mo>
                <mml:mrow>
                  <mml:mrow>
                    <mml:msub>
                      <mml:mi>A</mml:mi>
                      <mml:mi>v</mml:mi>
                    </mml:msub>
                    <mml:mo lspace="0.167em">⁢</mml:mo>
                    <mml:mrow>
                      <mml:mi>cos</mml:mi>
                      <mml:mo>⁡</mml:mo>
                      <mml:mrow>
                        <mml:mo stretchy="false">(</mml:mo>
                        <mml:mrow>
                          <mml:mrow>
                            <mml:mi>ω</mml:mi>
                            <mml:mo>⁢</mml:mo>
                            <mml:mi>t</mml:mi>
                          </mml:mrow>
                          <mml:mo>+</mml:mo>
                          <mml:mi>ϕ</mml:mi>
                        </mml:mrow>
                        <mml:mo stretchy="false">)</mml:mo>
                      </mml:mrow>
                    </mml:mrow>
                  </mml:mrow>
                  <mml:mo>−</mml:mo>
                  <mml:mrow>
                    <mml:msub>
                      <mml:mi>A</mml:mi>
                      <mml:mi>v</mml:mi>
                    </mml:msub>
                    <mml:mo lspace="0.167em">⁢</mml:mo>
                    <mml:mrow>
                      <mml:mi>sin</mml:mi>
                      <mml:mo>⁡</mml:mo>
                      <mml:mrow>
                        <mml:mo stretchy="false">(</mml:mo>
                        <mml:mrow>
                          <mml:mrow>
                            <mml:mi>ω</mml:mi>
                            <mml:mo>⁢</mml:mo>
                            <mml:mi>t</mml:mi>
                          </mml:mrow>
                          <mml:mo>+</mml:mo>
                          <mml:mi>ϕ</mml:mi>
                        </mml:mrow>
                        <mml:mo stretchy="false">)</mml:mo>
                      </mml:mrow>
                    </mml:mrow>
                  </mml:mrow>
                </mml:mrow>
              </mml:mrow>
            </mml:math>
          </disp-formula>
        </p>
        <p>Assuming that the voltage frequency <inline-formula><mml:math alttext="\omega" display="inline"><mml:mi>ω</mml:mi></mml:math></inline-formula> of the system's buses remains constant over time, and considering only the voltage amplitude and phase angle as variables in the state space, we define the system's state as <inline-formula><mml:math alttext="x_{1}=A_{v}\cos(\omega t)" display="inline"><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>=</mml:mo><mml:mrow><mml:msub><mml:mi>A</mml:mi><mml:mi>v</mml:mi></mml:msub><mml:mo lspace="0.167em">⁢</mml:mo><mml:mrow><mml:mi>cos</mml:mi><mml:mo>⁡</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>ω</mml:mi><mml:mo>⁢</mml:mo><mml:mi>t</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:mrow></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math alttext="x_{2}=A_{v}\sin(\omega t)" display="inline"><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mn>2</mml:mn></mml:msub><mml:mo>=</mml:mo><mml:mrow><mml:msub><mml:mi>A</mml:mi><mml:mi>v</mml:mi></mml:msub><mml:mo lspace="0.167em">⁢</mml:mo><mml:mrow><mml:mi>sin</mml:mi><mml:mo>⁡</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>ω</mml:mi><mml:mo>⁢</mml:mo><mml:mi>t</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:mrow></mml:mrow></mml:math></inline-formula>. The state signal <inline-formula><mml:math alttext="V(t)" display="inline"><mml:mrow><mml:mi>V</mml:mi><mml:mo>⁢</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> acquired by the sensor can be expressed as:</p>
        <p>
          <disp-formula id="S2.E3">
            <mml:math alttext="V(t)=x_{1}\cos(\omega t)-x_{2}\sin(\omega t)" display="block">
              <mml:mrow>
                <mml:mrow>
                  <mml:mi>V</mml:mi>
                  <mml:mo>⁢</mml:mo>
                  <mml:mrow>
                    <mml:mo stretchy="false">(</mml:mo>
                    <mml:mi>t</mml:mi>
                    <mml:mo stretchy="false">)</mml:mo>
                  </mml:mrow>
                </mml:mrow>
                <mml:mo>=</mml:mo>
                <mml:mrow>
                  <mml:mrow>
                    <mml:msub>
                      <mml:mi>x</mml:mi>
                      <mml:mn>1</mml:mn>
                    </mml:msub>
                    <mml:mo lspace="0.167em">⁢</mml:mo>
                    <mml:mrow>
                      <mml:mi>cos</mml:mi>
                      <mml:mo>⁡</mml:mo>
                      <mml:mrow>
                        <mml:mo stretchy="false">(</mml:mo>
                        <mml:mrow>
                          <mml:mi>ω</mml:mi>
                          <mml:mo>⁢</mml:mo>
                          <mml:mi>t</mml:mi>
                        </mml:mrow>
                        <mml:mo stretchy="false">)</mml:mo>
                      </mml:mrow>
                    </mml:mrow>
                  </mml:mrow>
                  <mml:mo>−</mml:mo>
                  <mml:mrow>
                    <mml:msub>
                      <mml:mi>x</mml:mi>
                      <mml:mn>2</mml:mn>
                    </mml:msub>
                    <mml:mo lspace="0.167em">⁢</mml:mo>
                    <mml:mrow>
                      <mml:mi>sin</mml:mi>
                      <mml:mo>⁡</mml:mo>
                      <mml:mrow>
                        <mml:mo stretchy="false">(</mml:mo>
                        <mml:mrow>
                          <mml:mi>ω</mml:mi>
                          <mml:mo>⁢</mml:mo>
                          <mml:mi>t</mml:mi>
                        </mml:mrow>
                        <mml:mo stretchy="false">)</mml:mo>
                      </mml:mrow>
                    </mml:mrow>
                  </mml:mrow>
                </mml:mrow>
              </mml:mrow>
            </mml:math>
          </disp-formula>
        </p>
        <p>Assuming there are no additional delays in the system and taking into account the process noise and measurement noise in the calculation, the state equation and measurement equation for the system's buses are: <p><disp-formula-group id="S2.E4"><disp-formula-group id="S5.EGx1"><disp-formula id="S2.E4.1"><mml:math alttext="\displaystyle x(t+1)=Ax(t)+w_{0}(t)" display="inline"><mml:mrow><mml:mrow><mml:mi>x</mml:mi><mml:mo>⁢</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>t</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mrow><mml:mi>A</mml:mi><mml:mo>⁢</mml:mo><mml:mi>x</mml:mi><mml:mo>⁢</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:msub><mml:mi>w</mml:mi><mml:mn>0</mml:mn></mml:msub><mml:mo>⁢</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:mrow></mml:mrow></mml:math></disp-formula><disp-formula id="S2.E4.2"><mml:math alttext="\displaystyle y(t)=Cx(t)+w_{i}(t)" display="inline"><mml:mrow><mml:mrow><mml:mi>y</mml:mi><mml:mo>⁢</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mrow><mml:mi>C</mml:mi><mml:mo>⁢</mml:mo><mml:mi>x</mml:mi><mml:mo>⁢</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:msub><mml:mi>w</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>⁢</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:mrow></mml:mrow></mml:math></disp-formula></disp-formula-group></disp-formula-group></p> where the state vector <inline-formula><mml:math alttext="x(t)=\begin{bmatrix}x_{1}(t)\\&#10;x_{2}(t)\end{bmatrix}^{T}" display="inline"><mml:mrow><mml:mrow><mml:mi>x</mml:mi><mml:mo>⁢</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mo>=</mml:mo><mml:msup><mml:mrow><mml:mo>[</mml:mo><mml:mtable rowspacing="0pt"><mml:mtr><mml:mtd><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>⁢</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mn>2</mml:mn></mml:msub><mml:mo>⁢</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:mtd></mml:mtr></mml:mtable><mml:mo>]</mml:mo></mml:mrow><mml:mi>T</mml:mi></mml:msup></mml:mrow></mml:math></inline-formula>, the system matrix <inline-formula><mml:math alttext="A=\begin{bmatrix}1&amp;0\\&#10;0&amp;1\end{bmatrix}" display="inline"><mml:mrow><mml:mi>A</mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:mo>[</mml:mo><mml:mtable columnspacing="5pt" rowspacing="0pt"><mml:mtr><mml:mtd><mml:mn>1</mml:mn></mml:mtd><mml:mtd><mml:mn>0</mml:mn></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mn>0</mml:mn></mml:mtd><mml:mtd><mml:mn>1</mml:mn></mml:mtd></mml:mtr></mml:mtable><mml:mo>]</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> , and the measurement matrix <inline-formula><mml:math alttext="C=\begin{bmatrix}\cos(\omega t)\\&#10;-\sin(\omega t)\end{bmatrix}" display="inline"><mml:mrow><mml:mi>C</mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:mo>[</mml:mo><mml:mtable rowspacing="0pt"><mml:mtr><mml:mtd><mml:mrow><mml:mi>cos</mml:mi><mml:mo>⁡</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>ω</mml:mi><mml:mo>⁢</mml:mo><mml:mi>t</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:mo rspace="0.167em">−</mml:mo><mml:mrow><mml:mi>sin</mml:mi><mml:mo>⁡</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>ω</mml:mi><mml:mo>⁢</mml:mo><mml:mi>t</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:mrow></mml:mtd></mml:mtr></mml:mtable><mml:mo>]</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>. <inline-formula><mml:math alttext="w_{0}(t)" display="inline"><mml:mrow><mml:msub><mml:mi>w</mml:mi><mml:mn>0</mml:mn></mml:msub><mml:mo>⁢</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math alttext="w_{i}(t)" display="inline"><mml:mrow><mml:msub><mml:mi>w</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>⁢</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> represent the system's process noise and measurement noise, respectively. In power systems, the process noise <inline-formula><mml:math alttext="w_{0}(t)" display="inline"><mml:mrow><mml:msub><mml:mi>w</mml:mi><mml:mn>0</mml:mn></mml:msub><mml:mo>⁢</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> is small enough and can be neglected during estimation. The measurement noise <inline-formula><mml:math alttext="w_{i}(t)" display="inline"><mml:mrow><mml:msub><mml:mi>w</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>⁢</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> is assumed to be zero-mean, independently and identically distributed Gaussian noise with a standard deviation of <inline-formula><mml:math alttext="\sigma" display="inline"><mml:mi>σ</mml:mi></mml:math></inline-formula> and independent of the initial conditions of the system and the process noise.</p>
        <p id="S2.SS1.p2">Based on the state and measurement equations presented, the control center can perform optimal estimation of the system state using the Kalman filter. The estimation process of the Kalman filter follows the formula shown below: <p><disp-formula-group id="S2.E5"><disp-formula-group id="S5.EGx2"><disp-formula id="S2.E5.1"><mml:math alttext="\displaystyle x(t)=Ax(t-1)" display="inline"><mml:mrow><mml:mrow><mml:mi>x</mml:mi><mml:mo>⁢</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mi>A</mml:mi><mml:mo>⁢</mml:mo><mml:mi>x</mml:mi><mml:mo>⁢</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>t</mml:mi><mml:mo>−</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:mrow></mml:math></disp-formula><disp-formula id="S2.E5.2"><mml:math alttext="\displaystyle P(t)=AP(t-1)A^{T}" display="inline"><mml:mrow><mml:mrow><mml:mi>P</mml:mi><mml:mo>⁢</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mi>A</mml:mi><mml:mo>⁢</mml:mo><mml:mi>P</mml:mi><mml:mo>⁢</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>t</mml:mi><mml:mo>−</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>⁢</mml:mo><mml:msup><mml:mi>A</mml:mi><mml:mi>T</mml:mi></mml:msup></mml:mrow></mml:mrow></mml:math></disp-formula><disp-formula id="S2.E5.3"><mml:math alttext="\displaystyle K(t)=P(t-1)C^{T}(CP(t-1)C^{T}+W_{i})^{-1}" display="inline"><mml:mrow><mml:mrow><mml:mi>K</mml:mi><mml:mo>⁢</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mi>P</mml:mi><mml:mo>⁢</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>t</mml:mi><mml:mo>−</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>⁢</mml:mo><mml:msup><mml:mi>C</mml:mi><mml:mi>T</mml:mi></mml:msup><mml:mo>⁢</mml:mo><mml:msup><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mrow><mml:mi>C</mml:mi><mml:mo>⁢</mml:mo><mml:mi>P</mml:mi><mml:mo>⁢</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>t</mml:mi><mml:mo>−</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>⁢</mml:mo><mml:msup><mml:mi>C</mml:mi><mml:mi>T</mml:mi></mml:msup></mml:mrow><mml:mo>+</mml:mo><mml:msub><mml:mi>W</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mrow><mml:mo>−</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msup></mml:mrow></mml:mrow></mml:math></disp-formula><disp-formula id="S2.E5.4"><mml:math alttext="\displaystyle\hat{P}(t)=(AP(t-1)A^{T})^{-1}+C^{T}W_{i}^{-1}C" display="inline"><mml:mrow><mml:mrow><mml:mover accent="true"><mml:mi>P</mml:mi><mml:mo>^</mml:mo></mml:mover><mml:mo>⁢</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:msup><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>A</mml:mi><mml:mo>⁢</mml:mo><mml:mi>P</mml:mi><mml:mo>⁢</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>t</mml:mi><mml:mo>−</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>⁢</mml:mo><mml:msup><mml:mi>A</mml:mi><mml:mi>T</mml:mi></mml:msup></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mrow><mml:mo>−</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msup><mml:mo>+</mml:mo><mml:mrow><mml:msup><mml:mi>C</mml:mi><mml:mi>T</mml:mi></mml:msup><mml:mo>⁢</mml:mo><mml:msubsup><mml:mi>W</mml:mi><mml:mi>i</mml:mi><mml:mrow><mml:mo>−</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msubsup><mml:mo>⁢</mml:mo><mml:mi>C</mml:mi></mml:mrow></mml:mrow></mml:mrow></mml:math></disp-formula><disp-formula id="S2.E5.5"><mml:math alttext="\displaystyle\hat{x}(t)=A{x}(t)+K(y(t)-CAx(t-1))" display="inline"><mml:mrow><mml:mrow><mml:mover accent="true"><mml:mi>x</mml:mi><mml:mo>^</mml:mo></mml:mover><mml:mo>⁢</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mrow><mml:mi>A</mml:mi><mml:mo>⁢</mml:mo><mml:mi>x</mml:mi><mml:mo>⁢</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:mi>K</mml:mi><mml:mo>⁢</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mrow><mml:mi>y</mml:mi><mml:mo>⁢</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mo>−</mml:mo><mml:mrow><mml:mi>C</mml:mi><mml:mo>⁢</mml:mo><mml:mi>A</mml:mi><mml:mo>⁢</mml:mo><mml:mi>x</mml:mi><mml:mo>⁢</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>t</mml:mi><mml:mo>−</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:mrow></mml:mrow></mml:math></disp-formula></disp-formula-group></disp-formula-group></p> where <inline-formula><mml:math alttext="x(t)" display="inline"><mml:mrow><mml:mi>x</mml:mi><mml:mo>⁢</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> represents the estimated state vector <inline-formula><mml:math alttext="x(t)" display="inline"><mml:mrow><mml:mi>x</mml:mi><mml:mo>⁢</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> at time <inline-formula><mml:math alttext="t" display="inline"><mml:mi>t</mml:mi></mml:math></inline-formula>, and <inline-formula><mml:math alttext="P(t)" display="inline"><mml:mrow><mml:mi>P</mml:mi><mml:mo>⁢</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> denotes the covariance matrix of the estimated state at time <inline-formula><mml:math alttext="t" display="inline"><mml:mi>t</mml:mi></mml:math></inline-formula>.<inline-formula><mml:math alttext="K(t)" display="inline"><mml:mrow><mml:mi>K</mml:mi><mml:mo>⁢</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> represents the Kalman gain and <inline-formula><mml:math alttext="z(t)=(y(t)-CAx(t-1))" display="inline"><mml:mrow><mml:mrow><mml:mi>z</mml:mi><mml:mo>⁢</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mrow><mml:mi>y</mml:mi><mml:mo>⁢</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mo>−</mml:mo><mml:mrow><mml:mi>C</mml:mi><mml:mo>⁢</mml:mo><mml:mi>A</mml:mi><mml:mo>⁢</mml:mo><mml:mi>x</mml:mi><mml:mo>⁢</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>t</mml:mi><mml:mo>−</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> is defined as the innovation of the system. Through the iterative updates, we can obtain the state prediction value at time <inline-formula><mml:math alttext="t" display="inline"><mml:mi>t</mml:mi></mml:math></inline-formula> with the information at time <inline-formula><mml:math alttext="(t-1)" display="inline"><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>t</mml:mi><mml:mo>−</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:math></inline-formula>, which contains the voltage amplitude and phase angle of the buses.</p>
      </sec>
      <sec id="S2.SS2">
        <label>2.2</label>
        <title>Attack model</title>
        <p id="S2.SS2.p1">In this section, we would like to model prevalent cyber threats within power system networks. We mainly focuses on DoS attacks, linear FDI attacks targeting single estimator systems, and stochastic stealth attacks targeting multi-estimaor systems. We begin our analysis with the most fundamental form of DoS attack. The DoS attack, which is an aggressive maneuver designed to impede the control center's ability to retrieve data from sensors. This disruption is orchestrated by adversaries who either sever communication channels or inundate the network with an excessive deluge of data packets, consequently compromising bandwidth and thwarting the transmission of essential data[<xref rid="ref003" ref-type="bibr">3</xref>, <xref rid="ref004" ref-type="bibr">4</xref>]. In this manuscript, the DoS attack on estimator <inline-formula><mml:math alttext="i" display="inline"><mml:mi>i</mml:mi></mml:math></inline-formula> is modeled as a Bernoulli variable <inline-formula><mml:math alttext="\gamma_{i}\sim\mathcal{B}(1,p)" display="inline"><mml:mrow><mml:msub><mml:mi>γ</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>∼</mml:mo><mml:mrow><mml:mi class="ltx_font_mathcaligraphic">ℬ</mml:mi><mml:mo>⁢</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mi>p</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:mrow></mml:math></inline-formula>, implying that the occurrence of an attack is a stochastic event that can be described by a Bernoulli distribution. The Bernoulli distribution is a discrete probability distribution with only two possible outcomes: <inline-formula><mml:math alttext="\gamma_{i}=0" display="inline"><mml:mrow><mml:msub><mml:mi>γ</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:mrow></mml:math></inline-formula> (the attack occurs) and <inline-formula><mml:math alttext="\gamma_{i}=1" display="inline"><mml:mrow><mml:msub><mml:mi>γ</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:math></inline-formula> (the attack does not occur).In the context of DoS attacks, the probability of fail attack is denoted by <inline-formula><mml:math alttext="p" display="inline"><mml:mi>p</mml:mi></mml:math></inline-formula>, and the probability of successful attack is <inline-formula><mml:math alttext="1-p" display="inline"><mml:mrow><mml:mn>1</mml:mn><mml:mo>−</mml:mo><mml:mi>p</mml:mi></mml:mrow></mml:math></inline-formula>.</p>
        <p>
          <disp-formula id="S2.Ex1">
            <mml:math alttext="\gamma_{i}(t)=\begin{cases}0&amp;\text{if an attack occurs at time }t\\&#10;1&amp;\text{if no attack occurs at time }t\end{cases}" display="block">
              <mml:mrow>
                <mml:mrow>
                  <mml:msub>
                    <mml:mi>γ</mml:mi>
                    <mml:mi>i</mml:mi>
                  </mml:msub>
                  <mml:mo>⁢</mml:mo>
                  <mml:mrow>
                    <mml:mo stretchy="false">(</mml:mo>
                    <mml:mi>t</mml:mi>
                    <mml:mo stretchy="false">)</mml:mo>
                  </mml:mrow>
                </mml:mrow>
                <mml:mo>=</mml:mo>
                <mml:mrow>
                  <mml:mo>{</mml:mo>
                  <mml:mtable columnspacing="5pt" displaystyle="true" rowspacing="0pt">
                    <mml:mtr>
                      <mml:mtd class="ltx_align_left" columnalign="left">
                        <mml:mn>0</mml:mn>
                      </mml:mtd>
                      <mml:mtd class="ltx_align_left" columnalign="left">
                        <mml:mrow>
                          <mml:mtext>if an attack occurs at time </mml:mtext>
                          <mml:mo>⁢</mml:mo>
                          <mml:mi>t</mml:mi>
                        </mml:mrow>
                      </mml:mtd>
                    </mml:mtr>
                    <mml:mtr>
                      <mml:mtd class="ltx_align_left" columnalign="left">
                        <mml:mn>1</mml:mn>
                      </mml:mtd>
                      <mml:mtd class="ltx_align_left" columnalign="left">
                        <mml:mrow>
                          <mml:mtext>if no attack occurs at time </mml:mtext>
                          <mml:mo>⁢</mml:mo>
                          <mml:mi>t</mml:mi>
                        </mml:mrow>
                      </mml:mtd>
                    </mml:mtr>
                  </mml:mtable>
                </mml:mrow>
              </mml:mrow>
            </mml:math>
          </disp-formula>
        </p>
        <p>We assume that the attacker's assault is exerted during the process where the sensor transmits the innovation <inline-formula><mml:math alttext="z" display="inline"><mml:mi>z</mml:mi></mml:math></inline-formula> to the estimator. Assuming that the <inline-formula><mml:math alttext="i_{th}" display="inline"><mml:msub><mml:mi>i</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mo>⁢</mml:mo><mml:mi>h</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> sensor is under attack, all subsequent subscripts <inline-formula><mml:math alttext="i" display="inline"><mml:mi>i</mml:mi></mml:math></inline-formula> in the following text refer to estimator <inline-formula><mml:math alttext="i" display="inline"><mml:mi>i</mml:mi></mml:math></inline-formula>. Consequently, the innovation received by the estimator can be represented as:</p>
        <p>
          <disp-formula id="S2.E6">
            <mml:math alttext="\hat{z}_{i}(t)=\gamma_{i}(t)*z_{i}(t)" display="block">
              <mml:mrow>
                <mml:mrow>
                  <mml:msub>
                    <mml:mover accent="true">
                      <mml:mi>z</mml:mi>
                      <mml:mo>^</mml:mo>
                    </mml:mover>
                    <mml:mi>i</mml:mi>
                  </mml:msub>
                  <mml:mo>⁢</mml:mo>
                  <mml:mrow>
                    <mml:mo stretchy="false">(</mml:mo>
                    <mml:mi>t</mml:mi>
                    <mml:mo stretchy="false">)</mml:mo>
                  </mml:mrow>
                </mml:mrow>
                <mml:mo>=</mml:mo>
                <mml:mrow>
                  <mml:mrow>
                    <mml:mrow>
                      <mml:msub>
                        <mml:mi>γ</mml:mi>
                        <mml:mi>i</mml:mi>
                      </mml:msub>
                      <mml:mo>⁢</mml:mo>
                      <mml:mrow>
                        <mml:mo stretchy="false">(</mml:mo>
                        <mml:mi>t</mml:mi>
                        <mml:mo rspace="0.055em" stretchy="false">)</mml:mo>
                      </mml:mrow>
                    </mml:mrow>
                    <mml:mo rspace="0.222em">∗</mml:mo>
                    <mml:msub>
                      <mml:mi>z</mml:mi>
                      <mml:mi>i</mml:mi>
                    </mml:msub>
                  </mml:mrow>
                  <mml:mo>⁢</mml:mo>
                  <mml:mrow>
                    <mml:mo stretchy="false">(</mml:mo>
                    <mml:mi>t</mml:mi>
                    <mml:mo stretchy="false">)</mml:mo>
                  </mml:mrow>
                </mml:mrow>
              </mml:mrow>
            </mml:math>
          </disp-formula>
        </p>
        <p id="S2.SS2.p2">When the attack is successful, <inline-formula><mml:math alttext="\gamma_{i}(t)=0" display="inline"><mml:mrow><mml:mrow><mml:msub><mml:mi>γ</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>⁢</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:mrow></mml:math></inline-formula>, indicating that the estimator is unable to receive the innovation transmitted from the sensor. Conversely, when the attack fails, the innovation transmitted to the estimator remains unaffected. So that we have completed the modeling of the DoS attack.</p>
        <p id="S2.SS2.p3">Next, we consider linear FDI attacks targeting single-estimator systems. Similar to the mathematical model used in man-in-the-middle attacks [<xref rid="ref005" ref-type="bibr">5</xref>, <xref rid="ref006" ref-type="bibr">6</xref>], we assume that the attacker has complete knowledge of the system's physical model and possesses the capability to access and alter measurements. Specifically, the attacker can arbitrarily modify the innovation <inline-formula><mml:math alttext="z_{i}" display="inline"><mml:msub><mml:mi>z</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:math></inline-formula> obtained by the estimator. Consequently, the attack strategy against estimator <inline-formula><mml:math alttext="i" display="inline"><mml:mi>i</mml:mi></mml:math></inline-formula> can be defined as:</p>
        <p>
          <disp-formula id="S2.E7">
            <mml:math alttext="\tilde{z}_{i}(t)=f_{k}(z_{i}(t))" display="block">
              <mml:mrow>
                <mml:mrow>
                  <mml:msub>
                    <mml:mover accent="true">
                      <mml:mi>z</mml:mi>
                      <mml:mo>~</mml:mo>
                    </mml:mover>
                    <mml:mi>i</mml:mi>
                  </mml:msub>
                  <mml:mo>⁢</mml:mo>
                  <mml:mrow>
                    <mml:mo stretchy="false">(</mml:mo>
                    <mml:mi>t</mml:mi>
                    <mml:mo stretchy="false">)</mml:mo>
                  </mml:mrow>
                </mml:mrow>
                <mml:mo>=</mml:mo>
                <mml:mrow>
                  <mml:msub>
                    <mml:mi>f</mml:mi>
                    <mml:mi>k</mml:mi>
                  </mml:msub>
                  <mml:mo>⁢</mml:mo>
                  <mml:mrow>
                    <mml:mo stretchy="false">(</mml:mo>
                    <mml:mrow>
                      <mml:msub>
                        <mml:mi>z</mml:mi>
                        <mml:mi>i</mml:mi>
                      </mml:msub>
                      <mml:mo>⁢</mml:mo>
                      <mml:mrow>
                        <mml:mo stretchy="false">(</mml:mo>
                        <mml:mi>t</mml:mi>
                        <mml:mo stretchy="false">)</mml:mo>
                      </mml:mrow>
                    </mml:mrow>
                    <mml:mo stretchy="false">)</mml:mo>
                  </mml:mrow>
                </mml:mrow>
              </mml:mrow>
            </mml:math>
          </disp-formula>
        </p>
        <p>Regarding the non-linear function <inline-formula><mml:math alttext="f_{k}" display="inline"><mml:msub><mml:mi>f</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:math></inline-formula>, it is challenging to analyze its statistical properties, which complicates the determination of system performance and the effectiveness of attacks. Additionally, linear transformations of data do not alter the type of statistical distribution of the data, which enables attackers to deceive detectors that rely on distribution properties. Furthermore, in real-world power systems, random linear attacks may be more feasible and cost-effective to implement. Therefore, we only focus on FDI attacks under the assumption of linear functions [<xref rid="ref024" ref-type="bibr">24</xref>].</p>
        <p>
          <disp-formula id="S2.E8">
            <mml:math alttext="\hat{z}_{i}(t)=T_{i}\cdot z_{i}(t)+b_{i}" display="block">
              <mml:mrow>
                <mml:mrow>
                  <mml:msub>
                    <mml:mover accent="true">
                      <mml:mi>z</mml:mi>
                      <mml:mo>^</mml:mo>
                    </mml:mover>
                    <mml:mi>i</mml:mi>
                  </mml:msub>
                  <mml:mo>⁢</mml:mo>
                  <mml:mrow>
                    <mml:mo stretchy="false">(</mml:mo>
                    <mml:mi>t</mml:mi>
                    <mml:mo stretchy="false">)</mml:mo>
                  </mml:mrow>
                </mml:mrow>
                <mml:mo>=</mml:mo>
                <mml:mrow>
                  <mml:mrow>
                    <mml:mrow>
                      <mml:msub>
                        <mml:mi>T</mml:mi>
                        <mml:mi>i</mml:mi>
                      </mml:msub>
                      <mml:mo lspace="0.222em" rspace="0.222em">⋅</mml:mo>
                      <mml:msub>
                        <mml:mi>z</mml:mi>
                        <mml:mi>i</mml:mi>
                      </mml:msub>
                    </mml:mrow>
                    <mml:mo>⁢</mml:mo>
                    <mml:mrow>
                      <mml:mo stretchy="false">(</mml:mo>
                      <mml:mi>t</mml:mi>
                      <mml:mo stretchy="false">)</mml:mo>
                    </mml:mrow>
                  </mml:mrow>
                  <mml:mo>+</mml:mo>
                  <mml:msub>
                    <mml:mi>b</mml:mi>
                    <mml:mi>i</mml:mi>
                  </mml:msub>
                </mml:mrow>
              </mml:mrow>
            </mml:math>
          </disp-formula>
        </p>
        <p>where <inline-formula><mml:math alttext="T_{i}" display="inline"><mml:msub><mml:mi>T</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:math></inline-formula> is an arbitrary attack matrix and <inline-formula><mml:math alttext="b_{i}" display="inline"><mml:msub><mml:mi>b</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:math></inline-formula> is a constant independent of <inline-formula><mml:math alttext="z_{i}" display="inline"><mml:msub><mml:mi>z</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:math></inline-formula>.</p>
        <p id="S2.SS2.p4">In light of the preceding discussion, we now turn our attention to stochastic stealth attacks targeting multiple estimators. The linear FDI attacks strategy mentioned earlier impose demanding requirements on the attackers, necessitating capabilities that are not feasible to replicate across multiple estimators simultaneously. Additionally, the multi-estimator system significantly increases the complexity of information, which renders the attack methods applied to single estimators ineffective or less potent. To maximize the impact of attacks within a system equipped with multiple estimators, a stochastic stealthy attack strategy based on maximum attack probability has been proposed in [<xref rid="ref025" ref-type="bibr">25</xref>]:</p>
        <p>
          <disp-formula id="S2.E9">
            <mml:math alttext="\hat{z}_{i}(t)=z_{i}(t)+c_{i}\zeta_{i}(t)" display="block">
              <mml:mrow>
                <mml:mrow>
                  <mml:msub>
                    <mml:mover accent="true">
                      <mml:mi>z</mml:mi>
                      <mml:mo>^</mml:mo>
                    </mml:mover>
                    <mml:mi>i</mml:mi>
                  </mml:msub>
                  <mml:mo>⁢</mml:mo>
                  <mml:mrow>
                    <mml:mo stretchy="false">(</mml:mo>
                    <mml:mi>t</mml:mi>
                    <mml:mo stretchy="false">)</mml:mo>
                  </mml:mrow>
                </mml:mrow>
                <mml:mo>=</mml:mo>
                <mml:mrow>
                  <mml:mrow>
                    <mml:msub>
                      <mml:mi>z</mml:mi>
                      <mml:mi>i</mml:mi>
                    </mml:msub>
                    <mml:mo>⁢</mml:mo>
                    <mml:mrow>
                      <mml:mo stretchy="false">(</mml:mo>
                      <mml:mi>t</mml:mi>
                      <mml:mo stretchy="false">)</mml:mo>
                    </mml:mrow>
                  </mml:mrow>
                  <mml:mo>+</mml:mo>
                  <mml:mrow>
                    <mml:msub>
                      <mml:mi>c</mml:mi>
                      <mml:mi>i</mml:mi>
                    </mml:msub>
                    <mml:mo>⁢</mml:mo>
                    <mml:msub>
                      <mml:mi>ζ</mml:mi>
                      <mml:mi>i</mml:mi>
                    </mml:msub>
                    <mml:mo>⁢</mml:mo>
                    <mml:mrow>
                      <mml:mo stretchy="false">(</mml:mo>
                      <mml:mi>t</mml:mi>
                      <mml:mo stretchy="false">)</mml:mo>
                    </mml:mrow>
                  </mml:mrow>
                </mml:mrow>
              </mml:mrow>
            </mml:math>
          </disp-formula>
        </p>
        <p>where <inline-formula><mml:math alttext="c_{i}" display="inline"><mml:msub><mml:mi>c</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:math></inline-formula> represents if there is an attack present in the communication channel of estimator <inline-formula><mml:math alttext="i" display="inline"><mml:mi>i</mml:mi></mml:math></inline-formula>.<inline-formula><mml:math alttext="P(c_{i}=1)=p" display="inline"><mml:mrow><mml:mrow><mml:mi>P</mml:mi><mml:mo>⁢</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mi>c</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mo>=</mml:mo><mml:mi>p</mml:mi></mml:mrow></mml:math></inline-formula>, representing the attack being applied to estimator <inline-formula><mml:math alttext="i" display="inline"><mml:mi>i</mml:mi></mml:math></inline-formula> and <inline-formula><mml:math alttext="P(c_{i}=0)=1-p" display="inline"><mml:mrow><mml:mrow><mml:mi>P</mml:mi><mml:mo>⁢</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mi>c</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mn>1</mml:mn><mml:mo>−</mml:mo><mml:mi>p</mml:mi></mml:mrow></mml:mrow></mml:math></inline-formula>, indicating that estimator <inline-formula><mml:math alttext="i" display="inline"><mml:mi>i</mml:mi></mml:math></inline-formula> is not under attack. The attack signal <inline-formula><mml:math alttext="\zeta_{i}\&gt;\sim\&gt;{\mathcal{N}(0,\sigma_{\zeta})}" display="inline"><mml:mrow><mml:msub><mml:mi>ζ</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo lspace="0.498em" rspace="0.498em">∼</mml:mo><mml:mrow><mml:mi class="ltx_font_mathcaligraphic">𝒩</mml:mi><mml:mo>⁢</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mn>0</mml:mn><mml:mo>,</mml:mo><mml:msub><mml:mi>σ</mml:mi><mml:mi>ζ</mml:mi></mml:msub><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:mrow></mml:math></inline-formula> is a Gaussian distribution that is independent of <inline-formula><mml:math alttext="z_{i}" display="inline"><mml:msub><mml:mi>z</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:math></inline-formula>. With the modeling of the three attack methodologies now complete, it is important to note that the strategies discussed are among the simpler to implement, offer effective attack outcomes, and possess a high degree of stealth. In the realm of power systems, there also exist FDI attacks constructed through data-driven approaches and physical-model based methods. However, these alternatives present various challenges: some are not suitable for dynamic estimation, others demand extensive datasets, and some could be too demanding for attackers. Furthermore, certain methods can disrupt the statistical properties of data, making them more susceptible to detection by common detectors, such as those based on KL-divergence. For these reasons, they are not within the scope of the present discussion.</p>
      </sec>
      <sec id="S2.SS3">
        <label>2.3</label>
        <title>Detection model </title>
        <p id="S2.SS3.p1">We now proceed to discuss the detection model within the system. The extensive wireless sensor networks in smart grids offer ample opportunities for attackers to launch attacks. Consequently, it is imperative to have a detector at the controller end to scrutinize the acquired data for any anomalies or signs of compromise. In the realm of dynamic estimation within smart grids, detectors based on the Kullback-Leibler (KL) divergence have demonstrated remarkable efficacy in detecting cyber attacks. KL-divergence is a crucial concept used to quantify the differences between two probability distributions, which can measure the degree of difference between an actual distribution and another expected distribution. Its definition follows:</p>
        <p>
          <disp-formula id="S2.E10">
            <mml:math alttext="D(\tilde{\gamma}_{k}\|\gamma_{k})=\int\log\frac{f_{\tilde{\gamma}_{k}}(\xi_{k}%&#10;)}{f_{\gamma_{k}}(\xi_{k})}f_{\tilde{\gamma}_{k}\|\gamma_{k}}(\xi_{k})d\xi_{k}\\&#10;" display="block">
              <mml:mrow>
                <mml:mrow>
                  <mml:mi>D</mml:mi>
                  <mml:mo>⁢</mml:mo>
                  <mml:mrow>
                    <mml:mo stretchy="false">(</mml:mo>
                    <mml:mrow>
                      <mml:msub>
                        <mml:mover accent="true">
                          <mml:mi>γ</mml:mi>
                          <mml:mo>~</mml:mo>
                        </mml:mover>
                        <mml:mi>k</mml:mi>
                      </mml:msub>
                      <mml:mo>∥</mml:mo>
                      <mml:msub>
                        <mml:mi>γ</mml:mi>
                        <mml:mi>k</mml:mi>
                      </mml:msub>
                    </mml:mrow>
                    <mml:mo stretchy="false">)</mml:mo>
                  </mml:mrow>
                </mml:mrow>
                <mml:mo rspace="0.111em">=</mml:mo>
                <mml:mrow>
                  <mml:mo>∫</mml:mo>
                  <mml:mrow>
                    <mml:mrow>
                      <mml:mi>log</mml:mi>
                      <mml:mo lspace="0.167em">⁡</mml:mo>
                      <mml:mrow>
                        <mml:mfrac>
                          <mml:mrow>
                            <mml:msub>
                              <mml:mi>f</mml:mi>
                              <mml:msub>
                                <mml:mover accent="true">
                                  <mml:mi>γ</mml:mi>
                                  <mml:mo>~</mml:mo>
                                </mml:mover>
                                <mml:mi>k</mml:mi>
                              </mml:msub>
                            </mml:msub>
                            <mml:mo>⁢</mml:mo>
                            <mml:mrow>
                              <mml:mo stretchy="false">(</mml:mo>
                              <mml:msub>
                                <mml:mi>ξ</mml:mi>
                                <mml:mi>k</mml:mi>
                              </mml:msub>
                              <mml:mo stretchy="false">)</mml:mo>
                            </mml:mrow>
                          </mml:mrow>
                          <mml:mrow>
                            <mml:msub>
                              <mml:mi>f</mml:mi>
                              <mml:msub>
                                <mml:mi>γ</mml:mi>
                                <mml:mi>k</mml:mi>
                              </mml:msub>
                            </mml:msub>
                            <mml:mo>⁢</mml:mo>
                            <mml:mrow>
                              <mml:mo stretchy="false">(</mml:mo>
                              <mml:msub>
                                <mml:mi>ξ</mml:mi>
                                <mml:mi>k</mml:mi>
                              </mml:msub>
                              <mml:mo stretchy="false">)</mml:mo>
                            </mml:mrow>
                          </mml:mrow>
                        </mml:mfrac>
                        <mml:mo>⁢</mml:mo>
                        <mml:msub>
                          <mml:mi>f</mml:mi>
                          <mml:mrow>
                            <mml:msub>
                              <mml:mover accent="true">
                                <mml:mi>γ</mml:mi>
                                <mml:mo>~</mml:mo>
                              </mml:mover>
                              <mml:mi>k</mml:mi>
                            </mml:msub>
                            <mml:mo>∥</mml:mo>
                            <mml:msub>
                              <mml:mi>γ</mml:mi>
                              <mml:mi>k</mml:mi>
                            </mml:msub>
                          </mml:mrow>
                        </mml:msub>
                      </mml:mrow>
                    </mml:mrow>
                    <mml:mo>⁢</mml:mo>
                    <mml:mrow>
                      <mml:mo stretchy="false">(</mml:mo>
                      <mml:msub>
                        <mml:mi>ξ</mml:mi>
                        <mml:mi>k</mml:mi>
                      </mml:msub>
                      <mml:mo stretchy="false">)</mml:mo>
                    </mml:mrow>
                    <mml:mo lspace="0em">⁢</mml:mo>
                    <mml:mrow>
                      <mml:mo rspace="0em">𝑑</mml:mo>
                      <mml:msub>
                        <mml:mi>ξ</mml:mi>
                        <mml:mi>k</mml:mi>
                      </mml:msub>
                    </mml:mrow>
                  </mml:mrow>
                </mml:mrow>
              </mml:mrow>
            </mml:math>
          </disp-formula>
        </p>
        <p>
          <disp-formula id="S2.Ex2">
            <mml:math alttext="D(\tilde{\gamma}_{k}\ \parallel\gamma_{k})\leq\delta" display="block">
              <mml:mrow>
                <mml:mrow>
                  <mml:mi>D</mml:mi>
                  <mml:mo>⁢</mml:mo>
                  <mml:mrow>
                    <mml:mo stretchy="false">(</mml:mo>
                    <mml:mrow>
                      <mml:msub>
                        <mml:mover accent="true">
                          <mml:mi>γ</mml:mi>
                          <mml:mo>~</mml:mo>
                        </mml:mover>
                        <mml:mi>k</mml:mi>
                      </mml:msub>
                      <mml:mo>∥</mml:mo>
                      <mml:msub>
                        <mml:mi>γ</mml:mi>
                        <mml:mi>k</mml:mi>
                      </mml:msub>
                    </mml:mrow>
                    <mml:mo stretchy="false">)</mml:mo>
                  </mml:mrow>
                </mml:mrow>
                <mml:mo>≤</mml:mo>
                <mml:mi>δ</mml:mi>
              </mml:mrow>
            </mml:math>
          </disp-formula>
        </p>
        <p>where <inline-formula><mml:math alttext="f_{\tilde{\gamma}_{k}}" display="inline"><mml:msub><mml:mi>f</mml:mi><mml:msub><mml:mover accent="true"><mml:mi>γ</mml:mi><mml:mo>~</mml:mo></mml:mover><mml:mi>k</mml:mi></mml:msub></mml:msub></mml:math></inline-formula> and <inline-formula><mml:math alttext="f_{\gamma_{k}}" display="inline"><mml:msub><mml:mi>f</mml:mi><mml:msub><mml:mi>γ</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:msub></mml:math></inline-formula> are the probability density function of random sequences <inline-formula><mml:math alttext="\tilde{\gamma_{k}}" display="inline"><mml:mover accent="true"><mml:msub><mml:mi>γ</mml:mi><mml:mi>k</mml:mi></mml:msub><mml:mo>~</mml:mo></mml:mover></mml:math></inline-formula> and <inline-formula><mml:math alttext="\gamma_{k}" display="inline"><mml:msub><mml:mi>γ</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:math></inline-formula>.It can be observed that <inline-formula><mml:math alttext="D(\tilde{\gamma}_{k}\ \parallel\gamma_{k})=0" display="inline"><mml:mrow><mml:mrow><mml:mi>D</mml:mi><mml:mo>⁢</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mover accent="true"><mml:mi>γ</mml:mi><mml:mo>~</mml:mo></mml:mover><mml:mi>k</mml:mi></mml:msub><mml:mo>∥</mml:mo><mml:msub><mml:mi>γ</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:mrow></mml:math></inline-formula> if and only if <inline-formula><mml:math alttext="f_{\tilde{\gamma}_{k}}=f_{\gamma_{k}}" display="inline"><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:msub><mml:mover accent="true"><mml:mi>γ</mml:mi><mml:mo>~</mml:mo></mml:mover><mml:mi>k</mml:mi></mml:msub></mml:msub><mml:mo>=</mml:mo><mml:msub><mml:mi>f</mml:mi><mml:msub><mml:mi>γ</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:msub></mml:mrow></mml:math></inline-formula>, and the K-L divergence is generally not symmetric, ie., <inline-formula><mml:math alttext="D(\tilde{\gamma}_{k}\|{\gamma_{k}})\neq D(\gamma_{k}\|\tilde{\gamma}_{k})" display="inline"><mml:mrow><mml:mrow><mml:mi>D</mml:mi><mml:mo>⁢</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mover accent="true"><mml:mi>γ</mml:mi><mml:mo>~</mml:mo></mml:mover><mml:mi>k</mml:mi></mml:msub><mml:mo>∥</mml:mo><mml:msub><mml:mi>γ</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mo>≠</mml:mo><mml:mrow><mml:mi>D</mml:mi><mml:mo>⁢</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mi>γ</mml:mi><mml:mi>k</mml:mi></mml:msub><mml:mo>∥</mml:mo><mml:msub><mml:mover accent="true"><mml:mi>γ</mml:mi><mml:mo>~</mml:mo></mml:mover><mml:mi>k</mml:mi></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:mrow></mml:math></inline-formula>[<xref rid="ref028" ref-type="bibr">28</xref>]. When <inline-formula><mml:math alttext="D(\tilde{\gamma}_{k}\|{\gamma_{k}})\leq\delta" display="inline"><mml:mrow><mml:mrow><mml:mi>D</mml:mi><mml:mo>⁢</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mover accent="true"><mml:mi>γ</mml:mi><mml:mo>~</mml:mo></mml:mover><mml:mi>k</mml:mi></mml:msub><mml:mo>∥</mml:mo><mml:msub><mml:mi>γ</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mo>≤</mml:mo><mml:mi>δ</mml:mi></mml:mrow></mml:math></inline-formula> , no anomalies are detected by the sensors, and the data acquired by the estimator is considered normal.When <inline-formula><mml:math alttext="D(\tilde{\gamma}_{k}\|{\gamma_{k}})\textgreater\delta" display="inline"><mml:mrow><mml:mrow><mml:mi>D</mml:mi><mml:mo>⁢</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mover accent="true"><mml:mi>γ</mml:mi><mml:mo>~</mml:mo></mml:mover><mml:mi>k</mml:mi></mml:msub><mml:mo>∥</mml:mo><mml:msub><mml:mi>γ</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mo>&gt;</mml:mo><mml:mi>δ</mml:mi></mml:mrow></mml:math></inline-formula>, the sensors trigger an alarm, indicating that the data requires inspection. It is necessary to troubleshoot and mitigate any faults or stop any ongoing attacks before resuming normal operation.</p>
        <statement id="S2.Thmremark1">
          <title>
            <bold>.</bold>
          </title>
          <p id="S2.Thmremark1.p1">
            <italic>Considering the persistent operational nature of power systems, which are vast and complex, the acquisition of extensive data required for analysis is readily achievable. Based on historical data, we can derive the probability density function of the real innovation.</italic>
          </p>
        </statement>
      </sec>
    </sec>
    <sec id="S3">
      <label>3.</label>
      <title>Main Result</title>
      <sec id="S3.SS1">
        <label>3.1</label>
        <title>Multi-estimator based estimation</title>
        <p id="S3.SS1.p1">In this section, we present our main results, beginning with the distribution approach based on multi-estimator information fusion. When anomalies occur within the system, state estimation relying on single estimator must be stopped to address the issues before resuming operations. However, the measurement data from certain critical buses are essential for the whole system, and even brief interruptions can lead to significant losses. Therefore, this manuscript is dedicated to devising a novel estimation strategy that ensures the system's continuous operation despite the presence of faults or under attack. It is evident that a single estimator is inadequate for the task of state estimation mentioned above. Therefore, we contemplate employing an approach that integrates information from multiple estimators to achieve this objective. Dynamic estimation based on the fusion of information from multiple estimators has become a widely applied method for interference-resistant estimation in recent years. Since the estimators are independent of each other and the attacker's capabilities are limited, an attack on a single estimator cannot affect the entire state estimation process. Utilizing an estimation approach that fuses information at critical buses can effectively ensure that the system continues to operate normally even when attacks are detected.</p>
        <p>
          <fig id="F1">
            <label>Figure 1.</label>
            <caption>
              <p>Schematic of multi-estimator based state estimation.</p>
            </caption>
            <graphic xlink:href="figures/graph abstract.jpg"/>
          </fig>
        </p>
        <p id="S3.SS1.p2">First, we need to select key buses based on economic considerations and the degree of information redundancy[<xref rid="ref029" ref-type="bibr">29</xref>], and deploy multiple estimators at these critical buses. The structure of the estimator network at the key buses is shown in Figure <xref ref-type="fig" rid="F1">1</xref>. Each estimator includes a PMU for independently collecting data, a Kalman filter for estimating the state, and communication equipment for transmitting data. Each estimator operates independently, processing data and generating results that are subsequently subjected to a verification procedure. If the results are deemed normal, they are incorporated into subsequent computational steps. However, if any anomalies are detected, the communication of the respective estimator is immediately severed, and an alarm is triggered to alert system operators. By combining the estimation results from neighbor estimators, the estimated state vector <inline-formula><mml:math alttext="\hat{x}_{i}(t)" display="inline"><mml:mrow><mml:msub><mml:mover accent="true"><mml:mi>x</mml:mi><mml:mo>^</mml:mo></mml:mover><mml:mi>i</mml:mi></mml:msub><mml:mo>⁢</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> at time <inline-formula><mml:math alttext="t" display="inline"><mml:mi>t</mml:mi></mml:math></inline-formula> and estimated covariance matrix <inline-formula><mml:math alttext="\hat{P}_{i}(t)" display="inline"><mml:mrow><mml:msub><mml:mover accent="true"><mml:mi>P</mml:mi><mml:mo>^</mml:mo></mml:mover><mml:mi>i</mml:mi></mml:msub><mml:mo>⁢</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> by estimator <inline-formula><mml:math alttext="e_{i}" display="inline"><mml:msub><mml:mi>e</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:math></inline-formula> can be obtained as follows:</p>
        <p>
          <disp-formula-group id="S3.E1">
            <disp-formula-group id="S5.EGx3">
              <disp-formula id="S3.E1.1">
                <mml:math alttext="\displaystyle\hat{x}_{i}(t)=\sum_{j\in\mathcal{N}_{i}}\lambda_{ij}(t)w_{ij}(t)%&#10;\hat{x}_{ij}(t)" display="inline">
                  <mml:mrow>
                    <mml:mrow>
                      <mml:msub>
                        <mml:mover accent="true">
                          <mml:mi>x</mml:mi>
                          <mml:mo>^</mml:mo>
                        </mml:mover>
                        <mml:mi>i</mml:mi>
                      </mml:msub>
                      <mml:mo>⁢</mml:mo>
                      <mml:mrow>
                        <mml:mo stretchy="false">(</mml:mo>
                        <mml:mi>t</mml:mi>
                        <mml:mo stretchy="false">)</mml:mo>
                      </mml:mrow>
                    </mml:mrow>
                    <mml:mo>=</mml:mo>
                    <mml:mrow>
                      <mml:mstyle displaystyle="true">
                        <mml:munder>
                          <mml:mo movablelimits="false">∑</mml:mo>
                          <mml:mrow>
                            <mml:mi>j</mml:mi>
                            <mml:mo>∈</mml:mo>
                            <mml:msub>
                              <mml:mi class="ltx_font_mathcaligraphic">𝒩</mml:mi>
                              <mml:mi>i</mml:mi>
                            </mml:msub>
                          </mml:mrow>
                        </mml:munder>
                      </mml:mstyle>
                      <mml:mrow>
                        <mml:msub>
                          <mml:mi>λ</mml:mi>
                          <mml:mrow>
                            <mml:mi>i</mml:mi>
                            <mml:mo>⁢</mml:mo>
                            <mml:mi>j</mml:mi>
                          </mml:mrow>
                        </mml:msub>
                        <mml:mo>⁢</mml:mo>
                        <mml:mrow>
                          <mml:mo stretchy="false">(</mml:mo>
                          <mml:mi>t</mml:mi>
                          <mml:mo stretchy="false">)</mml:mo>
                        </mml:mrow>
                        <mml:mo>⁢</mml:mo>
                        <mml:msub>
                          <mml:mi>w</mml:mi>
                          <mml:mrow>
                            <mml:mi>i</mml:mi>
                            <mml:mo>⁢</mml:mo>
                            <mml:mi>j</mml:mi>
                          </mml:mrow>
                        </mml:msub>
                        <mml:mo>⁢</mml:mo>
                        <mml:mrow>
                          <mml:mo stretchy="false">(</mml:mo>
                          <mml:mi>t</mml:mi>
                          <mml:mo stretchy="false">)</mml:mo>
                        </mml:mrow>
                        <mml:mo>⁢</mml:mo>
                        <mml:msub>
                          <mml:mover accent="true">
                            <mml:mi>x</mml:mi>
                            <mml:mo>^</mml:mo>
                          </mml:mover>
                          <mml:mrow>
                            <mml:mi>i</mml:mi>
                            <mml:mo>⁢</mml:mo>
                            <mml:mi>j</mml:mi>
                          </mml:mrow>
                        </mml:msub>
                        <mml:mo>⁢</mml:mo>
                        <mml:mrow>
                          <mml:mo stretchy="false">(</mml:mo>
                          <mml:mi>t</mml:mi>
                          <mml:mo stretchy="false">)</mml:mo>
                        </mml:mrow>
                      </mml:mrow>
                    </mml:mrow>
                  </mml:mrow>
                </mml:math>
              </disp-formula>
              <disp-formula id="S3.E1.2">
                <mml:math alttext="\displaystyle\hat{P}_{i}(t)=\sum_{j\in\mathcal{N}_{i}}\lambda_{ij}(t)w_{ij}(t)%&#10;\hat{P}_{ij}(t)" display="inline">
                  <mml:mrow>
                    <mml:mrow>
                      <mml:msub>
                        <mml:mover accent="true">
                          <mml:mi>P</mml:mi>
                          <mml:mo>^</mml:mo>
                        </mml:mover>
                        <mml:mi>i</mml:mi>
                      </mml:msub>
                      <mml:mo>⁢</mml:mo>
                      <mml:mrow>
                        <mml:mo stretchy="false">(</mml:mo>
                        <mml:mi>t</mml:mi>
                        <mml:mo stretchy="false">)</mml:mo>
                      </mml:mrow>
                    </mml:mrow>
                    <mml:mo>=</mml:mo>
                    <mml:mrow>
                      <mml:mstyle displaystyle="true">
                        <mml:munder>
                          <mml:mo movablelimits="false">∑</mml:mo>
                          <mml:mrow>
                            <mml:mi>j</mml:mi>
                            <mml:mo>∈</mml:mo>
                            <mml:msub>
                              <mml:mi class="ltx_font_mathcaligraphic">𝒩</mml:mi>
                              <mml:mi>i</mml:mi>
                            </mml:msub>
                          </mml:mrow>
                        </mml:munder>
                      </mml:mstyle>
                      <mml:mrow>
                        <mml:msub>
                          <mml:mi>λ</mml:mi>
                          <mml:mrow>
                            <mml:mi>i</mml:mi>
                            <mml:mo>⁢</mml:mo>
                            <mml:mi>j</mml:mi>
                          </mml:mrow>
                        </mml:msub>
                        <mml:mo>⁢</mml:mo>
                        <mml:mrow>
                          <mml:mo stretchy="false">(</mml:mo>
                          <mml:mi>t</mml:mi>
                          <mml:mo stretchy="false">)</mml:mo>
                        </mml:mrow>
                        <mml:mo>⁢</mml:mo>
                        <mml:msub>
                          <mml:mi>w</mml:mi>
                          <mml:mrow>
                            <mml:mi>i</mml:mi>
                            <mml:mo>⁢</mml:mo>
                            <mml:mi>j</mml:mi>
                          </mml:mrow>
                        </mml:msub>
                        <mml:mo>⁢</mml:mo>
                        <mml:mrow>
                          <mml:mo stretchy="false">(</mml:mo>
                          <mml:mi>t</mml:mi>
                          <mml:mo stretchy="false">)</mml:mo>
                        </mml:mrow>
                        <mml:mo>⁢</mml:mo>
                        <mml:msub>
                          <mml:mover accent="true">
                            <mml:mi>P</mml:mi>
                            <mml:mo>^</mml:mo>
                          </mml:mover>
                          <mml:mrow>
                            <mml:mi>i</mml:mi>
                            <mml:mo>⁢</mml:mo>
                            <mml:mi>j</mml:mi>
                          </mml:mrow>
                        </mml:msub>
                        <mml:mo>⁢</mml:mo>
                        <mml:mrow>
                          <mml:mo stretchy="false">(</mml:mo>
                          <mml:mi>t</mml:mi>
                          <mml:mo stretchy="false">)</mml:mo>
                        </mml:mrow>
                      </mml:mrow>
                    </mml:mrow>
                  </mml:mrow>
                </mml:math>
              </disp-formula>
            </disp-formula-group>
          </disp-formula-group>
        </p>
        <p id="S3.SS1.p4">where <inline-formula><mml:math alttext="N_{i}" display="inline"><mml:msub><mml:mi>N</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:math></inline-formula> represents the set of estimators that can exchange information with estimator <inline-formula><mml:math alttext="e_{i}" display="inline"><mml:msub><mml:mi>e</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:math></inline-formula>, including <inline-formula><mml:math alttext="e_{i}" display="inline"><mml:msub><mml:mi>e</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:math></inline-formula> itself. The variable <inline-formula><mml:math alttext="\lambda_{ij}(t)" display="inline"><mml:mrow><mml:msub><mml:mi>λ</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>⁢</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>⁢</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> denotes the detection outcome of the detector in estimator <inline-formula><mml:math alttext="e_{j}" display="inline"><mml:msub><mml:mi>e</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:math></inline-formula> at time <inline-formula><mml:math alttext="t" display="inline"><mml:mi>t</mml:mi></mml:math></inline-formula>. If the detection is normal at that moment, <inline-formula><mml:math alttext="\lambda_{ij}(t)=1" display="inline"><mml:mrow><mml:mrow><mml:msub><mml:mi>λ</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>⁢</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>⁢</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:math></inline-formula>; if estimator <inline-formula><mml:math alttext="e_{j}" display="inline"><mml:msub><mml:mi>e</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:math></inline-formula> is abnormal at that moment, its communication network is severed by the detector, and <inline-formula><mml:math alttext="\lambda_{ij}" display="inline"><mml:msub><mml:mi>λ</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>⁢</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> will remain 0 until the anomaly is resolved. The notation <inline-formula><mml:math alttext="\hat{x}_{ij}(t)" display="inline"><mml:mrow><mml:msub><mml:mover accent="true"><mml:mi>x</mml:mi><mml:mo>^</mml:mo></mml:mover><mml:mrow><mml:mi>i</mml:mi><mml:mo>⁢</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>⁢</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math alttext="\hat{P}_{ij}(t)" display="inline"><mml:mrow><mml:msub><mml:mover accent="true"><mml:mi>P</mml:mi><mml:mo>^</mml:mo></mml:mover><mml:mrow><mml:mi>i</mml:mi><mml:mo>⁢</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>⁢</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> represent respectively the estimation result and covariance matrixz received by estimator <inline-formula><mml:math alttext="e_{i}" display="inline"><mml:msub><mml:mi>e</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:math></inline-formula> from estimator <inline-formula><mml:math alttext="e_{j}" display="inline"><mml:msub><mml:mi>e</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:math></inline-formula>.The convergence of this distributed method has been demonstrated in [<xref rid="ref030" ref-type="bibr">30</xref>].The weight <inline-formula><mml:math alttext="w_{ij}(t)" display="inline"><mml:mrow><mml:msub><mml:mi>w</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>⁢</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>⁢</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> indicates the influence of the results obtained by estimator <inline-formula><mml:math alttext="e_{j}" display="inline"><mml:msub><mml:mi>e</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:math></inline-formula> within estimator <inline-formula><mml:math alttext="e_{i}" display="inline"><mml:msub><mml:mi>e</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:math></inline-formula>; For the time being, all estimation results are assigned equal weight.</p>
        <p>
          <disp-formula id="S3.E2">
            <mml:math alttext="w_{ij}=\frac{1}{\sum{\lambda_{ij}(t)}}" display="block">
              <mml:mrow>
                <mml:msub>
                  <mml:mi>w</mml:mi>
                  <mml:mrow>
                    <mml:mi>i</mml:mi>
                    <mml:mo>⁢</mml:mo>
                    <mml:mi>j</mml:mi>
                  </mml:mrow>
                </mml:msub>
                <mml:mo>=</mml:mo>
                <mml:mfrac>
                  <mml:mn>1</mml:mn>
                  <mml:mrow>
                    <mml:mo>∑</mml:mo>
                    <mml:mrow>
                      <mml:msub>
                        <mml:mi>λ</mml:mi>
                        <mml:mrow>
                          <mml:mi>i</mml:mi>
                          <mml:mo>⁢</mml:mo>
                          <mml:mi>j</mml:mi>
                        </mml:mrow>
                      </mml:msub>
                      <mml:mo>⁢</mml:mo>
                      <mml:mrow>
                        <mml:mo stretchy="false">(</mml:mo>
                        <mml:mi>t</mml:mi>
                        <mml:mo stretchy="false">)</mml:mo>
                      </mml:mrow>
                    </mml:mrow>
                  </mml:mrow>
                </mml:mfrac>
              </mml:mrow>
            </mml:math>
          </disp-formula>
        </p>
        <p>A multitude of strategies have been proposed to counteract FDI attacks in sensor networks such as the correntropy-based method [<xref rid="ref031" ref-type="bibr">31</xref>] and partial consensus method [<xref rid="ref032" ref-type="bibr">32</xref>] . However, with the constraints on computational resources and bandwidth at buses within power systems, the feasibility of implementing highly sophisticated methods is limited. Consequently, we have adopted a more straightforward weighted approach, which is better suited to the operational realities of power system environments. We will make improvements based on arithmetic and bandwidth constraints in next subsection.</p>
        <p id="S3.SS1.p5">Subsequent numerical experiments have demonstrated that our methodology is capable of sustaining the regular functioning of crucial buses within the system, even in the scene of DoS and FDI attacks."</p>
        <statement id="S3.Thmremark1">
          <title>
            <bold>.</bold>
          </title>
          <p id="S3.Thmremark1.p1">
            <italic>Despite the robustness against interference and the high estimation precision of state estimation methods that leverage multiple estimators, the prohibitive costs associated with PMUs and the constraints on computational resources preclude their universal application across all buses in power systems.Additionally, the number of estimators installed at each bus should not be excessive; ideally, the best choice based on practical considerations is to install 3-4 sets. In [<xref rid="ref029" ref-type="bibr">29</xref>], an installation strategy for PMUs is proposed that takes into account the correlation of measurements, enabling the strategic placement of PMUs at critical buses to utilize the methodologies proposed in this manuscript.</italic>
          </p>
        </statement>
      </sec>
      <sec id="S3.SS2">
        <label>3.2</label>
        <title>KL-divergence based weighting strategy</title>
        <p id="S3.SS2.p1">In the event of cyber attacks, the multi-estimator based data fusion approach is adept at sustaining the system's normalcy even amidst anomalous conditions.Nevertheless, with the advancement in attackers' capabilities, the stealthiness and destructive potential of these attacks have escalated.As delineated in [<xref rid="ref023" ref-type="bibr">23</xref>] and [<xref rid="ref024" ref-type="bibr">24</xref>] two stealthy FDI attack models are presented, which not only evade detection by KL-divergence detectors but also inflict substantial damage on the system. When confronted with such stealth attacks, the aforementioned method falls short in reducing the influence imposed by these threats.</p>
        <p id="S3.SS2.p2">Prior to implementing the novel weighting strategy, it is essential to determine the differences between the actual innovation probability distribution under cyber attacks and the prior probability distribution of the innovation.</p>
        <statement id="S3.Thmassumption1">
          <title>
            <bold>.</bold>
          </title>
          <p id="S3.Thmassumption1.p1">
            <italic>Considering the complex information within power systems and the capabilities of potential attackers. In this manuscript assumes that no more than one type of cyber attack will occur simultaneously within the system., which means an attacker can only execute a single type of attack on the system at any given time.</italic>
          </p>
        </statement>
        <sec id="S3.SS2.SSS1">
          <label>3.2.1</label>
          <title>DoS attack</title>
          <p id="S3.SS2.SSS1.p1">We begin by analyzing the KL-divergence between <inline-formula><mml:math alttext="\hat{z}_{i}(t)" display="inline"><mml:mrow><mml:msub><mml:mover accent="true"><mml:mi>z</mml:mi><mml:mo>^</mml:mo></mml:mover><mml:mi>i</mml:mi></mml:msub><mml:mo>⁢</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math alttext="z_{i}(t)" display="inline"><mml:mrow><mml:msub><mml:mi>z</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>⁢</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> under the conditions of DoS attack. As previously mentioned, <inline-formula><mml:math alttext="z_{i}(t)" display="inline"><mml:mrow><mml:msub><mml:mi>z</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>⁢</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> is a Gaussian variable with mean <inline-formula><mml:math alttext="0" display="inline"><mml:mn>0</mml:mn></mml:math></inline-formula> and standard deviation <inline-formula><mml:math alttext="\sigma" display="inline"><mml:mi>σ</mml:mi></mml:math></inline-formula>, its probability density function can be expressed as:</p>
          <p>
            <disp-formula id="S3.E3">
              <mml:math alttext="f_{z_{i}}(x)=\frac{1}{\sqrt{2\pi\sigma^{2}}}e^{-\frac{x^{2}}{2\sigma^{2}}}" display="block">
                <mml:mrow>
                  <mml:mrow>
                    <mml:msub>
                      <mml:mi>f</mml:mi>
                      <mml:msub>
                        <mml:mi>z</mml:mi>
                        <mml:mi>i</mml:mi>
                      </mml:msub>
                    </mml:msub>
                    <mml:mo>⁢</mml:mo>
                    <mml:mrow>
                      <mml:mo stretchy="false">(</mml:mo>
                      <mml:mi>x</mml:mi>
                      <mml:mo stretchy="false">)</mml:mo>
                    </mml:mrow>
                  </mml:mrow>
                  <mml:mo>=</mml:mo>
                  <mml:mrow>
                    <mml:mfrac>
                      <mml:mn>1</mml:mn>
                      <mml:msqrt>
                        <mml:mrow>
                          <mml:mn>2</mml:mn>
                          <mml:mo>⁢</mml:mo>
                          <mml:mi>π</mml:mi>
                          <mml:mo>⁢</mml:mo>
                          <mml:msup>
                            <mml:mi>σ</mml:mi>
                            <mml:mn>2</mml:mn>
                          </mml:msup>
                        </mml:mrow>
                      </mml:msqrt>
                    </mml:mfrac>
                    <mml:mo>⁢</mml:mo>
                    <mml:msup>
                      <mml:mi>e</mml:mi>
                      <mml:mrow>
                        <mml:mo>−</mml:mo>
                        <mml:mfrac>
                          <mml:msup>
                            <mml:mi>x</mml:mi>
                            <mml:mn>2</mml:mn>
                          </mml:msup>
                          <mml:mrow>
                            <mml:mn>2</mml:mn>
                            <mml:mo>⁢</mml:mo>
                            <mml:msup>
                              <mml:mi>σ</mml:mi>
                              <mml:mn>2</mml:mn>
                            </mml:msup>
                          </mml:mrow>
                        </mml:mfrac>
                      </mml:mrow>
                    </mml:msup>
                  </mml:mrow>
                </mml:mrow>
              </mml:math>
            </disp-formula>
          </p>
          <p id="S3.SS2.SSS1.p2">where <inline-formula><mml:math alttext="\hat{z}_{i}(t)" display="inline"><mml:mrow><mml:msub><mml:mover accent="true"><mml:mi>z</mml:mi><mml:mo>^</mml:mo></mml:mover><mml:mi>i</mml:mi></mml:msub><mml:mo>⁢</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> is the product of Bernoulli distribution <inline-formula><mml:math alttext="\gamma_{i}(t)" display="inline"><mml:mrow><mml:msub><mml:mi>γ</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>⁢</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math alttext="z_{i}(t)" display="inline"><mml:mrow><mml:msub><mml:mi>z</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>⁢</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> with the probability density function:</p>
          <p>
            <disp-formula id="S3.E4">
              <mml:math alttext="f_{\hat{z}_{i}}(x)=(1-p)\cdot\delta(x)+p\cdot\frac{1}{\sqrt{2\pi\sigma^{2}}}e^%&#10;{-\frac{x^{2}}{2\sigma^{2}}}" display="block">
                <mml:mrow>
                  <mml:mrow>
                    <mml:msub>
                      <mml:mi>f</mml:mi>
                      <mml:msub>
                        <mml:mover accent="true">
                          <mml:mi>z</mml:mi>
                          <mml:mo>^</mml:mo>
                        </mml:mover>
                        <mml:mi>i</mml:mi>
                      </mml:msub>
                    </mml:msub>
                    <mml:mo>⁢</mml:mo>
                    <mml:mrow>
                      <mml:mo stretchy="false">(</mml:mo>
                      <mml:mi>x</mml:mi>
                      <mml:mo stretchy="false">)</mml:mo>
                    </mml:mrow>
                  </mml:mrow>
                  <mml:mo>=</mml:mo>
                  <mml:mrow>
                    <mml:mrow>
                      <mml:mrow>
                        <mml:mrow>
                          <mml:mo stretchy="false">(</mml:mo>
                          <mml:mrow>
                            <mml:mn>1</mml:mn>
                            <mml:mo>−</mml:mo>
                            <mml:mi>p</mml:mi>
                          </mml:mrow>
                          <mml:mo rspace="0.055em" stretchy="false">)</mml:mo>
                        </mml:mrow>
                        <mml:mo rspace="0.222em">⋅</mml:mo>
                        <mml:mi>δ</mml:mi>
                      </mml:mrow>
                      <mml:mo>⁢</mml:mo>
                      <mml:mrow>
                        <mml:mo stretchy="false">(</mml:mo>
                        <mml:mi>x</mml:mi>
                        <mml:mo stretchy="false">)</mml:mo>
                      </mml:mrow>
                    </mml:mrow>
                    <mml:mo>+</mml:mo>
                    <mml:mrow>
                      <mml:mrow>
                        <mml:mi>p</mml:mi>
                        <mml:mo lspace="0.222em" rspace="0.222em">⋅</mml:mo>
                        <mml:mfrac>
                          <mml:mn>1</mml:mn>
                          <mml:msqrt>
                            <mml:mrow>
                              <mml:mn>2</mml:mn>
                              <mml:mo>⁢</mml:mo>
                              <mml:mi>π</mml:mi>
                              <mml:mo>⁢</mml:mo>
                              <mml:msup>
                                <mml:mi>σ</mml:mi>
                                <mml:mn>2</mml:mn>
                              </mml:msup>
                            </mml:mrow>
                          </mml:msqrt>
                        </mml:mfrac>
                      </mml:mrow>
                      <mml:mo>⁢</mml:mo>
                      <mml:msup>
                        <mml:mi>e</mml:mi>
                        <mml:mrow>
                          <mml:mo>−</mml:mo>
                          <mml:mfrac>
                            <mml:msup>
                              <mml:mi>x</mml:mi>
                              <mml:mn>2</mml:mn>
                            </mml:msup>
                            <mml:mrow>
                              <mml:mn>2</mml:mn>
                              <mml:mo>⁢</mml:mo>
                              <mml:msup>
                                <mml:mi>σ</mml:mi>
                                <mml:mn>2</mml:mn>
                              </mml:msup>
                            </mml:mrow>
                          </mml:mfrac>
                        </mml:mrow>
                      </mml:msup>
                    </mml:mrow>
                  </mml:mrow>
                </mml:mrow>
              </mml:math>
            </disp-formula>
          </p>
          <p>where <inline-formula><mml:math alttext="\delta(x)" display="inline"><mml:mrow><mml:mi>δ</mml:mi><mml:mo>⁢</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>x</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> is a Dirac delta function representing the probability of <inline-formula><mml:math alttext="\hat{z}_{i}=0" display="inline"><mml:mrow><mml:msub><mml:mover accent="true"><mml:mi>z</mml:mi><mml:mo>^</mml:mo></mml:mover><mml:mi>i</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:mrow></mml:math></inline-formula>. Based on the probability density functions we can obtain:</p>
          <p>
            <disp-formula-group id="S3.E5">
              <disp-formula id="S3.E5X">
                <mml:math alttext="\displaystyle D_{KL}\left(f_{\hat{z}_{i}}||f_{z_{i}}\right)=\int_{-\infty}^{%&#10;\infty}\left[(1-p)\delta(x)+p\frac{1}{\sqrt{2\pi\sigma^{2}}}e^{-\frac{x^{2}}{2%&#10;\sigma^{2}}}\right]" class="ltx_math_unparsed" display="inline">
                  <mml:mrow>
                    <mml:msub>
                      <mml:mi>D</mml:mi>
                      <mml:mrow>
                        <mml:mi>K</mml:mi>
                        <mml:mo>⁢</mml:mo>
                        <mml:mi>L</mml:mi>
                      </mml:mrow>
                    </mml:msub>
                    <mml:mrow>
                      <mml:mo>(</mml:mo>
                      <mml:msub>
                        <mml:mi>f</mml:mi>
                        <mml:msub>
                          <mml:mover accent="true">
                            <mml:mi>z</mml:mi>
                            <mml:mo>^</mml:mo>
                          </mml:mover>
                          <mml:mi>i</mml:mi>
                        </mml:msub>
                      </mml:msub>
                      <mml:mo fence="false" rspace="0.167em" stretchy="false">|</mml:mo>
                      <mml:mo fence="false" rspace="0.167em" stretchy="false">|</mml:mo>
                      <mml:msub>
                        <mml:mi>f</mml:mi>
                        <mml:msub>
                          <mml:mi>z</mml:mi>
                          <mml:mi>i</mml:mi>
                        </mml:msub>
                      </mml:msub>
                      <mml:mo>)</mml:mo>
                    </mml:mrow>
                    <mml:mo>=</mml:mo>
                    <mml:mstyle displaystyle="true">
                      <mml:msubsup>
                        <mml:mo>∫</mml:mo>
                        <mml:mrow>
                          <mml:mo>−</mml:mo>
                          <mml:mi mathvariant="normal">∞</mml:mi>
                        </mml:mrow>
                        <mml:mi mathvariant="normal">∞</mml:mi>
                      </mml:msubsup>
                    </mml:mstyle>
                    <mml:mrow>
                      <mml:mo>[</mml:mo>
                      <mml:mrow>
                        <mml:mo stretchy="false">(</mml:mo>
                        <mml:mn>1</mml:mn>
                        <mml:mo>−</mml:mo>
                        <mml:mi>p</mml:mi>
                        <mml:mo stretchy="false">)</mml:mo>
                      </mml:mrow>
                      <mml:mi>δ</mml:mi>
                      <mml:mrow>
                        <mml:mo stretchy="false">(</mml:mo>
                        <mml:mi>x</mml:mi>
                        <mml:mo stretchy="false">)</mml:mo>
                      </mml:mrow>
                      <mml:mo>+</mml:mo>
                      <mml:mi>p</mml:mi>
                      <mml:mstyle displaystyle="true">
                        <mml:mfrac>
                          <mml:mn>1</mml:mn>
                          <mml:msqrt>
                            <mml:mrow>
                              <mml:mn>2</mml:mn>
                              <mml:mo>⁢</mml:mo>
                              <mml:mi>π</mml:mi>
                              <mml:mo>⁢</mml:mo>
                              <mml:msup>
                                <mml:mi>σ</mml:mi>
                                <mml:mn>2</mml:mn>
                              </mml:msup>
                            </mml:mrow>
                          </mml:msqrt>
                        </mml:mfrac>
                      </mml:mstyle>
                      <mml:msup>
                        <mml:mi>e</mml:mi>
                        <mml:mrow>
                          <mml:mo>−</mml:mo>
                          <mml:mfrac>
                            <mml:msup>
                              <mml:mi>x</mml:mi>
                              <mml:mn>2</mml:mn>
                            </mml:msup>
                            <mml:mrow>
                              <mml:mn>2</mml:mn>
                              <mml:mo>⁢</mml:mo>
                              <mml:msup>
                                <mml:mi>σ</mml:mi>
                                <mml:mn>2</mml:mn>
                              </mml:msup>
                            </mml:mrow>
                          </mml:mfrac>
                        </mml:mrow>
                      </mml:msup>
                      <mml:mo>]</mml:mo>
                    </mml:mrow>
                  </mml:mrow>
                </mml:math>
              </disp-formula>
              <disp-formula id="S3.E5Xa">
                <mml:math alttext="\displaystyle*\log\frac{(1-p)\delta(x)+p\frac{1}{\sqrt{2\pi\sigma^{2}}}e^{-%&#10;\frac{x^{2}}{2\sigma^{2}}}}{\frac{1}{\sqrt{2\pi\sigma^{2}}}e^{-\frac{x^{2}}{2%&#10;\sigma^{2}}}}dx" display="inline">
                  <mml:mrow>
                    <mml:mi/>
                    <mml:mo lspace="0.222em" rspace="0.222em">∗</mml:mo>
                    <mml:mrow>
                      <mml:mi>log</mml:mi>
                      <mml:mo lspace="0.167em">⁡</mml:mo>
                      <mml:mrow>
                        <mml:mstyle displaystyle="true">
                          <mml:mfrac>
                            <mml:mrow>
                              <mml:mrow>
                                <mml:mrow>
                                  <mml:mo stretchy="false">(</mml:mo>
                                  <mml:mrow>
                                    <mml:mn>1</mml:mn>
                                    <mml:mo>−</mml:mo>
                                    <mml:mi>p</mml:mi>
                                  </mml:mrow>
                                  <mml:mo stretchy="false">)</mml:mo>
                                </mml:mrow>
                                <mml:mo>⁢</mml:mo>
                                <mml:mi>δ</mml:mi>
                                <mml:mo>⁢</mml:mo>
                                <mml:mrow>
                                  <mml:mo stretchy="false">(</mml:mo>
                                  <mml:mi>x</mml:mi>
                                  <mml:mo stretchy="false">)</mml:mo>
                                </mml:mrow>
                              </mml:mrow>
                              <mml:mo>+</mml:mo>
                              <mml:mrow>
                                <mml:mi>p</mml:mi>
                                <mml:mo>⁢</mml:mo>
                                <mml:mfrac>
                                  <mml:mn>1</mml:mn>
                                  <mml:msqrt>
                                    <mml:mrow>
                                      <mml:mn>2</mml:mn>
                                      <mml:mo>⁢</mml:mo>
                                      <mml:mi>π</mml:mi>
                                      <mml:mo>⁢</mml:mo>
                                      <mml:msup>
                                        <mml:mi>σ</mml:mi>
                                        <mml:mn>2</mml:mn>
                                      </mml:msup>
                                    </mml:mrow>
                                  </mml:msqrt>
                                </mml:mfrac>
                                <mml:mo>⁢</mml:mo>
                                <mml:msup>
                                  <mml:mi>e</mml:mi>
                                  <mml:mrow>
                                    <mml:mo>−</mml:mo>
                                    <mml:mfrac>
                                      <mml:msup>
                                        <mml:mi>x</mml:mi>
                                        <mml:mn>2</mml:mn>
                                      </mml:msup>
                                      <mml:mrow>
                                        <mml:mn>2</mml:mn>
                                        <mml:mo>⁢</mml:mo>
                                        <mml:msup>
                                          <mml:mi>σ</mml:mi>
                                          <mml:mn>2</mml:mn>
                                        </mml:msup>
                                      </mml:mrow>
                                    </mml:mfrac>
                                  </mml:mrow>
                                </mml:msup>
                              </mml:mrow>
                            </mml:mrow>
                            <mml:mrow>
                              <mml:mfrac>
                                <mml:mn>1</mml:mn>
                                <mml:msqrt>
                                  <mml:mrow>
                                    <mml:mn>2</mml:mn>
                                    <mml:mo>⁢</mml:mo>
                                    <mml:mi>π</mml:mi>
                                    <mml:mo>⁢</mml:mo>
                                    <mml:msup>
                                      <mml:mi>σ</mml:mi>
                                      <mml:mn>2</mml:mn>
                                    </mml:msup>
                                  </mml:mrow>
                                </mml:msqrt>
                              </mml:mfrac>
                              <mml:mo>⁢</mml:mo>
                              <mml:msup>
                                <mml:mi>e</mml:mi>
                                <mml:mrow>
                                  <mml:mo>−</mml:mo>
                                  <mml:mfrac>
                                    <mml:msup>
                                      <mml:mi>x</mml:mi>
                                      <mml:mn>2</mml:mn>
                                    </mml:msup>
                                    <mml:mrow>
                                      <mml:mn>2</mml:mn>
                                      <mml:mo>⁢</mml:mo>
                                      <mml:msup>
                                        <mml:mi>σ</mml:mi>
                                        <mml:mn>2</mml:mn>
                                      </mml:msup>
                                    </mml:mrow>
                                  </mml:mfrac>
                                </mml:mrow>
                              </mml:msup>
                            </mml:mrow>
                          </mml:mfrac>
                        </mml:mstyle>
                        <mml:mo>⁢</mml:mo>
                        <mml:mi>d</mml:mi>
                        <mml:mo>⁢</mml:mo>
                        <mml:mi>x</mml:mi>
                      </mml:mrow>
                    </mml:mrow>
                  </mml:mrow>
                </mml:math>
              </disp-formula>
            </disp-formula-group>
          </p>
          <p>Since <inline-formula><mml:math alttext="\hat{z}_{i}" display="inline"><mml:msub><mml:mover accent="true"><mml:mi>z</mml:mi><mml:mo>^</mml:mo></mml:mover><mml:mi>i</mml:mi></mml:msub></mml:math></inline-formula> is a mixture distribution, Eq.<xref rid="S3.E5">5</xref> takes into account the contributions from both the Dirac delta function and the Gaussian distribution. However, the integral involves the logarithm of the Dirac delta function, which is undefined at zero, necessitating an alternative approach to analyze the divergence between <inline-formula><mml:math alttext="f_{\hat{z}_{i}}(x)" display="inline"><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:msub><mml:mover accent="true"><mml:mi>z</mml:mi><mml:mo>^</mml:mo></mml:mover><mml:mi>i</mml:mi></mml:msub></mml:msub><mml:mo>⁢</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>x</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math alttext="f_{z_{i}}(x)" display="inline"><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:msub><mml:mi>z</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:msub><mml:mo>⁢</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>x</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>. By analyzing the composition of <inline-formula><mml:math alttext="\hat{z_{i}}" display="inline"><mml:mover accent="true"><mml:msub><mml:mi>z</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>^</mml:mo></mml:mover></mml:math></inline-formula> we notice that the difference arises mainly from the uncertainty of <inline-formula><mml:math alttext="\gamma_{i}" display="inline"><mml:msub><mml:mi>γ</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:math></inline-formula>. Hence, the information entropy of <inline-formula><mml:math alttext="\gamma_{i}" display="inline"><mml:msub><mml:mi>γ</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:math></inline-formula> serves as a pertinent indicator to quantify the degree of influence on the innovation. The information entropy of a random variable <inline-formula><mml:math alttext="P" display="inline"><mml:mi>P</mml:mi></mml:math></inline-formula> can be obtained through the following formula:</p>
          <p>
            <disp-formula id="S3.E6">
              <mml:math alttext="H(P)=-\sum_{i=1}^{n}p_{i}\log p_{i}" display="block">
                <mml:mrow>
                  <mml:mrow>
                    <mml:mi>H</mml:mi>
                    <mml:mo>⁢</mml:mo>
                    <mml:mrow>
                      <mml:mo stretchy="false">(</mml:mo>
                      <mml:mi>P</mml:mi>
                      <mml:mo stretchy="false">)</mml:mo>
                    </mml:mrow>
                  </mml:mrow>
                  <mml:mo>=</mml:mo>
                  <mml:mrow>
                    <mml:mo>−</mml:mo>
                    <mml:mrow>
                      <mml:munderover>
                        <mml:mo movablelimits="false">∑</mml:mo>
                        <mml:mrow>
                          <mml:mi>i</mml:mi>
                          <mml:mo>=</mml:mo>
                          <mml:mn>1</mml:mn>
                        </mml:mrow>
                        <mml:mi>n</mml:mi>
                      </mml:munderover>
                      <mml:mrow>
                        <mml:msub>
                          <mml:mi>p</mml:mi>
                          <mml:mi>i</mml:mi>
                        </mml:msub>
                        <mml:mo lspace="0.167em">⁢</mml:mo>
                        <mml:mrow>
                          <mml:mi>log</mml:mi>
                          <mml:mo lspace="0.167em">⁡</mml:mo>
                          <mml:msub>
                            <mml:mi>p</mml:mi>
                            <mml:mi>i</mml:mi>
                          </mml:msub>
                        </mml:mrow>
                      </mml:mrow>
                    </mml:mrow>
                  </mml:mrow>
                </mml:mrow>
              </mml:math>
            </disp-formula>
          </p>
          <p>where <inline-formula><mml:math alttext="\gamma_{i}" display="inline"><mml:msub><mml:mi>γ</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:math></inline-formula> is a Bernoulli random variable with probability <inline-formula><mml:math alttext="p" display="inline"><mml:mi>p</mml:mi></mml:math></inline-formula>, its information entropy can be expressed as:</p>
          <p>
            <disp-formula id="S3.E7">
              <mml:math alttext="H(\zeta_{i})=-p\log p-(1-p)\log(1-p)" display="block">
                <mml:mrow>
                  <mml:mrow>
                    <mml:mi>H</mml:mi>
                    <mml:mo>⁢</mml:mo>
                    <mml:mrow>
                      <mml:mo stretchy="false">(</mml:mo>
                      <mml:msub>
                        <mml:mi>ζ</mml:mi>
                        <mml:mi>i</mml:mi>
                      </mml:msub>
                      <mml:mo stretchy="false">)</mml:mo>
                    </mml:mrow>
                  </mml:mrow>
                  <mml:mo>=</mml:mo>
                  <mml:mrow>
                    <mml:mrow>
                      <mml:mo>−</mml:mo>
                      <mml:mrow>
                        <mml:mi>p</mml:mi>
                        <mml:mo lspace="0.167em">⁢</mml:mo>
                        <mml:mrow>
                          <mml:mi>log</mml:mi>
                          <mml:mo lspace="0.167em">⁡</mml:mo>
                          <mml:mi>p</mml:mi>
                        </mml:mrow>
                      </mml:mrow>
                    </mml:mrow>
                    <mml:mo>−</mml:mo>
                    <mml:mrow>
                      <mml:mrow>
                        <mml:mo stretchy="false">(</mml:mo>
                        <mml:mrow>
                          <mml:mn>1</mml:mn>
                          <mml:mo>−</mml:mo>
                          <mml:mi>p</mml:mi>
                        </mml:mrow>
                        <mml:mo stretchy="false">)</mml:mo>
                      </mml:mrow>
                      <mml:mo lspace="0.167em">⁢</mml:mo>
                      <mml:mrow>
                        <mml:mi>log</mml:mi>
                        <mml:mo>⁡</mml:mo>
                        <mml:mrow>
                          <mml:mo stretchy="false">(</mml:mo>
                          <mml:mrow>
                            <mml:mn>1</mml:mn>
                            <mml:mo>−</mml:mo>
                            <mml:mi>p</mml:mi>
                          </mml:mrow>
                          <mml:mo stretchy="false">)</mml:mo>
                        </mml:mrow>
                      </mml:mrow>
                    </mml:mrow>
                  </mml:mrow>
                </mml:mrow>
              </mml:math>
            </disp-formula>
          </p>
          <p>According to the preceding discussion, it becomes evident that the divergence in probability distributions between <inline-formula><mml:math alttext="\hat{z}_{i}(t)" display="inline"><mml:mrow><mml:msub><mml:mover accent="true"><mml:mi>z</mml:mi><mml:mo>^</mml:mo></mml:mover><mml:mi>i</mml:mi></mml:msub><mml:mo>⁢</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math alttext="z_{i}(t)" display="inline"><mml:mrow><mml:msub><mml:mi>z</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>⁢</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> under DoS attacks is solely contingent upon the capabilities of the attacker. When there exist an attack, each estimator is subjected to an attack that makes <inline-formula><mml:math alttext="(1-p)" display="inline"><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mn>1</mml:mn><mml:mo>−</mml:mo><mml:mi>p</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:math></inline-formula> maximal, rendering the KL-divergence-based weighted approach equivalent to one with equal weighting. Therefore, in subsequent experimental results, we will focus exclusively on the distinction between estimates derived from multi-estimator data fusion and those from single estimator.</p>
        </sec>
        <sec id="S3.SS2.SSS2">
          <label>3.2.2</label>
          <title>Linear FDI attack against single estimator</title>
          <p id="S3.SS2.SSS2.p1">Next, we consider a linear attack targeting single estimator, where the attacker constructs an attack vector by performing linear operations on Estimator <inline-formula><mml:math alttext="i" display="inline"><mml:mi>i</mml:mi></mml:math></inline-formula>. Since linear operations on a Gaussian distribution do not alter its probability distribution, <inline-formula><mml:math alttext="\hat{z_{i}}" display="inline"><mml:mover accent="true"><mml:msub><mml:mi>z</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>^</mml:mo></mml:mover></mml:math></inline-formula> remains a Gaussian distribution with mean <inline-formula><mml:math alttext="b" display="inline"><mml:mi>b</mml:mi></mml:math></inline-formula> and variance <inline-formula><mml:math alttext="T^{2}\sigma^{2}" display="inline"><mml:mrow><mml:msup><mml:mi>T</mml:mi><mml:mn>2</mml:mn></mml:msup><mml:mo>⁢</mml:mo><mml:msup><mml:mi>σ</mml:mi><mml:mn>2</mml:mn></mml:msup></mml:mrow></mml:math></inline-formula>. According to [<xref rid="ref033" ref-type="bibr">33</xref>, <xref rid="ref034" ref-type="bibr">34</xref>], we can define <inline-formula><mml:math alttext="b" display="inline"><mml:mi>b</mml:mi></mml:math></inline-formula> and <inline-formula><mml:math alttext="T^{2}\sigma^{2}" display="inline"><mml:mrow><mml:msup><mml:mi>T</mml:mi><mml:mn>2</mml:mn></mml:msup><mml:mo>⁢</mml:mo><mml:msup><mml:mi>σ</mml:mi><mml:mn>2</mml:mn></mml:msup></mml:mrow></mml:math></inline-formula> as <inline-formula><mml:math alttext="\mu_{\hat{z}_{i}}" display="inline"><mml:msub><mml:mi>μ</mml:mi><mml:msub><mml:mover accent="true"><mml:mi>z</mml:mi><mml:mo>^</mml:mo></mml:mover><mml:mi>i</mml:mi></mml:msub></mml:msub></mml:math></inline-formula> and <inline-formula><mml:math alttext="\sigma_{\hat{z}_{i}}" display="inline"><mml:msub><mml:mi>σ</mml:mi><mml:msub><mml:mover accent="true"><mml:mi>z</mml:mi><mml:mo>^</mml:mo></mml:mover><mml:mi>i</mml:mi></mml:msub></mml:msub></mml:math></inline-formula>, the KL-divergence between <inline-formula><mml:math alttext="\hat{z}_{i}" display="inline"><mml:msub><mml:mover accent="true"><mml:mi>z</mml:mi><mml:mo>^</mml:mo></mml:mover><mml:mi>i</mml:mi></mml:msub></mml:math></inline-formula> and <inline-formula><mml:math alttext="z_{i}" display="inline"><mml:msub><mml:mi>z</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:math></inline-formula> as:</p>
          <p>
            <disp-formula-group id="S3.E8">
              <disp-formula id="S3.E8X">
                <mml:math alttext="\displaystyle D_{KL}\left(f_{\hat{z}_{i}}||f_{z_{i}}\right)=-\frac{1}{2}\log%&#10;\frac{\sigma_{\hat{z}_{i}}^{2}}{\sigma_{z_{i}}^{2}}+\frac{\sigma_{z_{i}}^{2}}{%&#10;2\sigma_{\hat{z}_{i}}^{2}}+\frac{(\mu_{\hat{z}_{i}}-\mu_{z_{i}})^{2}}{2\sigma_%&#10;{\hat{z}_{i}}^{2}}-\frac{1}{2}" class="ltx_math_unparsed" display="inline">
                  <mml:mrow>
                    <mml:msub>
                      <mml:mi>D</mml:mi>
                      <mml:mrow>
                        <mml:mi>K</mml:mi>
                        <mml:mo>⁢</mml:mo>
                        <mml:mi>L</mml:mi>
                      </mml:mrow>
                    </mml:msub>
                    <mml:mrow>
                      <mml:mo>(</mml:mo>
                      <mml:msub>
                        <mml:mi>f</mml:mi>
                        <mml:msub>
                          <mml:mover accent="true">
                            <mml:mi>z</mml:mi>
                            <mml:mo>^</mml:mo>
                          </mml:mover>
                          <mml:mi>i</mml:mi>
                        </mml:msub>
                      </mml:msub>
                      <mml:mo fence="false" rspace="0.167em" stretchy="false">|</mml:mo>
                      <mml:mo fence="false" rspace="0.167em" stretchy="false">|</mml:mo>
                      <mml:msub>
                        <mml:mi>f</mml:mi>
                        <mml:msub>
                          <mml:mi>z</mml:mi>
                          <mml:mi>i</mml:mi>
                        </mml:msub>
                      </mml:msub>
                      <mml:mo>)</mml:mo>
                    </mml:mrow>
                    <mml:mo rspace="0em">=</mml:mo>
                    <mml:mo lspace="0em">−</mml:mo>
                    <mml:mstyle displaystyle="true">
                      <mml:mfrac>
                        <mml:mn>1</mml:mn>
                        <mml:mn>2</mml:mn>
                      </mml:mfrac>
                    </mml:mstyle>
                    <mml:mi>log</mml:mi>
                    <mml:mstyle displaystyle="true">
                      <mml:mfrac>
                        <mml:msubsup>
                          <mml:mi>σ</mml:mi>
                          <mml:msub>
                            <mml:mover accent="true">
                              <mml:mi>z</mml:mi>
                              <mml:mo>^</mml:mo>
                            </mml:mover>
                            <mml:mi>i</mml:mi>
                          </mml:msub>
                          <mml:mn>2</mml:mn>
                        </mml:msubsup>
                        <mml:msubsup>
                          <mml:mi>σ</mml:mi>
                          <mml:msub>
                            <mml:mi>z</mml:mi>
                            <mml:mi>i</mml:mi>
                          </mml:msub>
                          <mml:mn>2</mml:mn>
                        </mml:msubsup>
                      </mml:mfrac>
                    </mml:mstyle>
                    <mml:mo>+</mml:mo>
                    <mml:mstyle displaystyle="true">
                      <mml:mfrac>
                        <mml:msubsup>
                          <mml:mi>σ</mml:mi>
                          <mml:msub>
                            <mml:mi>z</mml:mi>
                            <mml:mi>i</mml:mi>
                          </mml:msub>
                          <mml:mn>2</mml:mn>
                        </mml:msubsup>
                        <mml:mrow>
                          <mml:mn>2</mml:mn>
                          <mml:mo>⁢</mml:mo>
                          <mml:msubsup>
                            <mml:mi>σ</mml:mi>
                            <mml:msub>
                              <mml:mover accent="true">
                                <mml:mi>z</mml:mi>
                                <mml:mo>^</mml:mo>
                              </mml:mover>
                              <mml:mi>i</mml:mi>
                            </mml:msub>
                            <mml:mn>2</mml:mn>
                          </mml:msubsup>
                        </mml:mrow>
                      </mml:mfrac>
                    </mml:mstyle>
                    <mml:mo>+</mml:mo>
                    <mml:mstyle displaystyle="true">
                      <mml:mfrac>
                        <mml:msup>
                          <mml:mrow>
                            <mml:mo stretchy="false">(</mml:mo>
                            <mml:mrow>
                              <mml:msub>
                                <mml:mi>μ</mml:mi>
                                <mml:msub>
                                  <mml:mover accent="true">
                                    <mml:mi>z</mml:mi>
                                    <mml:mo>^</mml:mo>
                                  </mml:mover>
                                  <mml:mi>i</mml:mi>
                                </mml:msub>
                              </mml:msub>
                              <mml:mo>−</mml:mo>
                              <mml:msub>
                                <mml:mi>μ</mml:mi>
                                <mml:msub>
                                  <mml:mi>z</mml:mi>
                                  <mml:mi>i</mml:mi>
                                </mml:msub>
                              </mml:msub>
                            </mml:mrow>
                            <mml:mo stretchy="false">)</mml:mo>
                          </mml:mrow>
                          <mml:mn>2</mml:mn>
                        </mml:msup>
                        <mml:mrow>
                          <mml:mn>2</mml:mn>
                          <mml:mo>⁢</mml:mo>
                          <mml:msubsup>
                            <mml:mi>σ</mml:mi>
                            <mml:msub>
                              <mml:mover accent="true">
                                <mml:mi>z</mml:mi>
                                <mml:mo>^</mml:mo>
                              </mml:mover>
                              <mml:mi>i</mml:mi>
                            </mml:msub>
                            <mml:mn>2</mml:mn>
                          </mml:msubsup>
                        </mml:mrow>
                      </mml:mfrac>
                    </mml:mstyle>
                    <mml:mo>−</mml:mo>
                    <mml:mstyle displaystyle="true">
                      <mml:mfrac>
                        <mml:mn>1</mml:mn>
                        <mml:mn>2</mml:mn>
                      </mml:mfrac>
                    </mml:mstyle>
                  </mml:mrow>
                </mml:math>
              </disp-formula>
            </disp-formula-group>
          </p>
          <p id="S3.SS2.SSS2.p2">The above equation indicates that as long as we obtain the parameters of the Gaussian distributions, we can obtain the required KL-divergence. However, although we can easily obtain the probability distribution of <inline-formula><mml:math alttext="z_{i}" display="inline"><mml:msub><mml:mi>z</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:math></inline-formula>, we still cannot directly obtain the distribution of <inline-formula><mml:math alttext="\hat{z_{i}}" display="inline"><mml:mover accent="true"><mml:msub><mml:mi>z</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>^</mml:mo></mml:mover></mml:math></inline-formula>. To obtain the KL-divergence, we need sufficient data to analyze its probability distribution. Therefore, before employing the new weighting strategy, we require a period of data collection to gather information, and state estimation can only proceed once the results are stable.</p>
        </sec>
        <sec id="S3.SS2.SSS3">
          <label>3.2.3</label>
          <title>Stochastic Stealth FDI Attacks Against Multiple Estimators</title>
          <p id="S3.SS2.SSS3.p1">Finally, let us consider the stochastic stealth attack targeting multiple estimators. From the perspective of attackers, we must consider a multi-estimator system as a complex network where information exchange is pervasive. Each estimator's covariance matrix and state updates are influenced by the data obtained from neighboring estimators, which means that an attack on one estimator can have indirect effects on others through the information sharing network.</p>
          <p id="S3.SS2.SSS3.p2">When analyzing attacks on multiple estimators, it is crucial to account for the interconnectedness and the potential for compounded impacts of an attack across the system. The challenge for the attacker is to craft an attack strategy that exploits the system's inherent dependencies and information exchange mechanisms to remain undetected while still achieving the attack objectives.</p>
          <p id="S3.SS2.SSS3.p3">However, as the defender, we cannot obtain the opponents' attack strategy and can only determine whether there is an attack on the corresponding estimator through the detector. Since the design process of the attack vector involves linear operations on the Gaussian distribution, the innovation <inline-formula><mml:math alttext="\hat{z_{i}}" display="inline"><mml:mover accent="true"><mml:msub><mml:mi>z</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>^</mml:mo></mml:mover></mml:math></inline-formula> after being attacked still conforms to the Gaussian distribution with mean 0 and variance <inline-formula><mml:math alttext="\sigma^{2}+\sigma_{\zeta}^{2}" display="inline"><mml:mrow><mml:msup><mml:mi>σ</mml:mi><mml:mn>2</mml:mn></mml:msup><mml:mo>+</mml:mo><mml:msubsup><mml:mi>σ</mml:mi><mml:mi>ζ</mml:mi><mml:mn>2</mml:mn></mml:msubsup></mml:mrow></mml:math></inline-formula>, and its KL-divergence with <inline-formula><mml:math alttext="z_{i}" display="inline"><mml:msub><mml:mi>z</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:math></inline-formula> can still be calculated using Equation <xref rid="S3.E8">8</xref>.</p>
          <p id="S3.SS2.SSS3.p4">In conclusion, we can derive the following insights: Under DoS attacks, the detection and weighting methods based on KL-divergence are not particularly effective, with estimation results closely resembling those of the Multi-estimators based method.Additionally, the innovation <inline-formula><mml:math alttext="\hat{z_{i}}" display="inline"><mml:mover accent="true"><mml:msub><mml:mi>z</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>^</mml:mo></mml:mover></mml:math></inline-formula> in both types of FDI attacks conforms to a Gaussian distribution, and their KL-divergence with <inline-formula><mml:math alttext="z_{i}" display="inline"><mml:msub><mml:mi>z</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:math></inline-formula> can be obtained through Equation <xref rid="S3.E8">8</xref>.</p>
        </sec>
        <sec id="S3.SS2.SSS4">
          <label>3.2.4</label>
          <title>KL-divergence based weighting strategy</title>
          <p id="S3.SS2.SSS4.p1">In this manuscript, we introduce a novel weighting strategy based on KL-divergence. Since KL-divergence is adept at characterizing the degree of difference between two probability distributions, it is highly suitable for assessing the extent to which an estimator is compromised by an attack. Consequently, we can apply varying weights to the estimation results based on the level of attack, thereby mitigating the impact of the attack.</p>
          <p id="S3.SS2.SSS4.p2">Specifically, we computed the KL divergence between the actual innovation probability distribution and the prior innovation probability distribution for each estimator to analyze the extent to which the estimation results were affected by attacks. Results with larger KL divergences were assigned higher weights, while those with lower divergences received lower weights.</p>
          <p>
            <disp-formula id="S3.E9">
              <mml:math alttext="w_{ij}\left(k\right)=\frac{\alpha_{ij}\left(t\right)f\left(D_{ij}\left(t\right%&#10;)\right)}{\sum_{j=1}^{n}{\alpha_{ij}\left(t\right)f\left(D_{ij}\left(t\right)%&#10;\right)}}" display="block">
                <mml:mrow>
                  <mml:mrow>
                    <mml:msub>
                      <mml:mi>w</mml:mi>
                      <mml:mrow>
                        <mml:mi>i</mml:mi>
                        <mml:mo>⁢</mml:mo>
                        <mml:mi>j</mml:mi>
                      </mml:mrow>
                    </mml:msub>
                    <mml:mo>⁢</mml:mo>
                    <mml:mrow>
                      <mml:mo>(</mml:mo>
                      <mml:mi>k</mml:mi>
                      <mml:mo>)</mml:mo>
                    </mml:mrow>
                  </mml:mrow>
                  <mml:mo>=</mml:mo>
                  <mml:mfrac>
                    <mml:mrow>
                      <mml:msub>
                        <mml:mi>α</mml:mi>
                        <mml:mrow>
                          <mml:mi>i</mml:mi>
                          <mml:mo>⁢</mml:mo>
                          <mml:mi>j</mml:mi>
                        </mml:mrow>
                      </mml:msub>
                      <mml:mo>⁢</mml:mo>
                      <mml:mrow>
                        <mml:mo>(</mml:mo>
                        <mml:mi>t</mml:mi>
                        <mml:mo>)</mml:mo>
                      </mml:mrow>
                      <mml:mo>⁢</mml:mo>
                      <mml:mi>f</mml:mi>
                      <mml:mo>⁢</mml:mo>
                      <mml:mrow>
                        <mml:mo>(</mml:mo>
                        <mml:mrow>
                          <mml:msub>
                            <mml:mi>D</mml:mi>
                            <mml:mrow>
                              <mml:mi>i</mml:mi>
                              <mml:mo>⁢</mml:mo>
                              <mml:mi>j</mml:mi>
                            </mml:mrow>
                          </mml:msub>
                          <mml:mo>⁢</mml:mo>
                          <mml:mrow>
                            <mml:mo>(</mml:mo>
                            <mml:mi>t</mml:mi>
                            <mml:mo>)</mml:mo>
                          </mml:mrow>
                        </mml:mrow>
                        <mml:mo>)</mml:mo>
                      </mml:mrow>
                    </mml:mrow>
                    <mml:mrow>
                      <mml:msubsup>
                        <mml:mo>∑</mml:mo>
                        <mml:mrow>
                          <mml:mi>j</mml:mi>
                          <mml:mo>=</mml:mo>
                          <mml:mn>1</mml:mn>
                        </mml:mrow>
                        <mml:mi>n</mml:mi>
                      </mml:msubsup>
                      <mml:mrow>
                        <mml:msub>
                          <mml:mi>α</mml:mi>
                          <mml:mrow>
                            <mml:mi>i</mml:mi>
                            <mml:mo>⁢</mml:mo>
                            <mml:mi>j</mml:mi>
                          </mml:mrow>
                        </mml:msub>
                        <mml:mo>⁢</mml:mo>
                        <mml:mrow>
                          <mml:mo>(</mml:mo>
                          <mml:mi>t</mml:mi>
                          <mml:mo>)</mml:mo>
                        </mml:mrow>
                        <mml:mo>⁢</mml:mo>
                        <mml:mi>f</mml:mi>
                        <mml:mo>⁢</mml:mo>
                        <mml:mrow>
                          <mml:mo>(</mml:mo>
                          <mml:mrow>
                            <mml:msub>
                              <mml:mi>D</mml:mi>
                              <mml:mrow>
                                <mml:mi>i</mml:mi>
                                <mml:mo>⁢</mml:mo>
                                <mml:mi>j</mml:mi>
                              </mml:mrow>
                            </mml:msub>
                            <mml:mo>⁢</mml:mo>
                            <mml:mrow>
                              <mml:mo>(</mml:mo>
                              <mml:mi>t</mml:mi>
                              <mml:mo>)</mml:mo>
                            </mml:mrow>
                          </mml:mrow>
                          <mml:mo>)</mml:mo>
                        </mml:mrow>
                      </mml:mrow>
                    </mml:mrow>
                  </mml:mfrac>
                </mml:mrow>
              </mml:math>
            </disp-formula>
          </p>
          <p>In equation <xref rid="S3.E9">9</xref>, <inline-formula><mml:math alttext="\alpha_{ij}(t)" display="inline"><mml:mrow><mml:msub><mml:mi>α</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>⁢</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>⁢</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> represents the detection result of the K-L divergence detector on estimator <inline-formula><mml:math alttext="e_{j}" display="inline"><mml:msub><mml:mi>e</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:math></inline-formula>.If the detector passes the test, <inline-formula><mml:math alttext="\alpha_{ij}(t)" display="inline"><mml:mrow><mml:msub><mml:mi>α</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>⁢</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>⁢</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> is 1; otherwise, it is 0. <inline-formula><mml:math alttext="D_{ij}(t)" display="inline"><mml:mrow><mml:msub><mml:mi>D</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>⁢</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>⁢</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> denotes the K-L divergence between the actual noise and the normal noise on estimator <inline-formula><mml:math alttext="e_{j}" display="inline"><mml:msub><mml:mi>e</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:math></inline-formula>. When both <inline-formula><mml:math alttext="\lambda_{ij}(t)" display="inline"><mml:mrow><mml:msub><mml:mi>λ</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>⁢</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>⁢</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math alttext="\alpha_{ij}(t)" display="inline"><mml:mrow><mml:msub><mml:mi>α</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>⁢</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>⁢</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> are 1, there is no anomaly on estimator <inline-formula><mml:math alttext="e_{j}" display="inline"><mml:msub><mml:mi>e</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:math></inline-formula>. [<xref rid="ref030" ref-type="bibr">30</xref>] demands that <inline-formula><mml:math alttext="f(x)" display="inline"><mml:mrow><mml:mi>f</mml:mi><mml:mo>⁢</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>x</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> is a continuous non-negative and strictly decreasing function, which in this manuscript is defined as <inline-formula><mml:math alttext="1/x" display="inline"><mml:mrow><mml:mn>1</mml:mn><mml:mo>/</mml:mo><mml:mi>x</mml:mi></mml:mrow></mml:math></inline-formula>. The obtained result <inline-formula><mml:math alttext="\hat{x}_{ij}(t)" display="inline"><mml:mrow><mml:msub><mml:mover accent="true"><mml:mi>x</mml:mi><mml:mo>^</mml:mo></mml:mover><mml:mrow><mml:mi>i</mml:mi><mml:mo>⁢</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>⁢</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> and the K-L divergence can be transmitted to the estimators with which it can communicate, and information can be obtained from these estimators. Then, using this information, the weights for each state estimation value are calculated, which in turn are used to compute the final estimation result.</p>
        </sec>
      </sec>
    </sec>
    <sec id="S4">
      <label>4.</label>
      <title>Numerical Experiments</title>
      <p id="S4.p1">In this section, we conducted numerical experiments using Matlab to evaluate the dynamic estimation based on Kalman Filtering, multi-estimator based estimation and the novel algorithm with KL-divergence based weighting strategy (Abbreviated as KL-divergence based estimation in the subsequent text). Initially, we provide the following clarifications regarding the data used in the experiments:</p>
      <p id="S4.p2">In this manuscript, the primary objective of the proposed method is to safeguard critical buses within the power grid, mitigate the interference from noise and cyber attacks, and ensure the normal operation of the power system, with data from these key buses being acquired exclusively by PMUs. According to [<xref rid="ref016" ref-type="bibr">16</xref>], we have established the following provisions for all PMUs: it is assumed that all PMUs installed in the system are of the same model with identical preset sampling frequencies and cycle periods. The amplitude <inline-formula><mml:math alttext="A_{v}" display="inline"><mml:msub><mml:mi>A</mml:mi><mml:mi>v</mml:mi></mml:msub></mml:math></inline-formula> of the voltage signal in the power system is set to 1, the phase angle <inline-formula><mml:math alttext="\phi" display="inline"><mml:mi>ϕ</mml:mi></mml:math></inline-formula> is 0, and the sampling frequency is 60Hz, and the sampling period is 1800Hz, which means the signal is sampled 1800 times per second, with 30 sampling points existing within each signal period. Sampling time is set to <inline-formula><mml:math alttext="0.1s" display="inline"><mml:mrow><mml:mn>0.1</mml:mn><mml:mo>⁢</mml:mo><mml:mi>s</mml:mi></mml:mrow></mml:math></inline-formula>.Furthermore, in accordance with the guidelines in [<xref rid="ref035" ref-type="bibr">35</xref>, <xref rid="ref036" ref-type="bibr">36</xref>], independent and identically distributed Gaussian noise with a Signal-to-Noise Ratio (SNR) of 70 dB is applied to each PMU. When employing the multi-estimator based algorithm, considering the redundancy of information and economic factors, we have installed three estimators at each critical bus. Each estimator comprises a PMU, a Kalman filter, and a KL-divergence detector.</p>
      <sec id="S4.SS1">
        <label>4.1</label>
        <title>Kalman Filter</title>
        <p id="S4.SS1.p1">First we conducted a test on the Kalman Filter(KF) estimation. The system's initial parameters are set as follows: <inline-formula><mml:math alttext="x_{1}(0)=0" display="inline"><mml:mrow><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>⁢</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mn>0</mml:mn><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math alttext="x_{2}(0)=0" display="inline"><mml:mrow><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mn>2</mml:mn></mml:msub><mml:mo>⁢</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mn>0</mml:mn><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:mrow></mml:math></inline-formula>, and the covariance matrix <inline-formula><mml:math alttext="P" display="inline"><mml:mi>P</mml:mi></mml:math></inline-formula> is set to the identity matrix (these initial conditions were maintained consistent throughout the subsequent experiments). Matlab function <inline-formula><mml:math alttext="randn()" display="inline"><mml:mrow><mml:mi>r</mml:mi><mml:mo>⁢</mml:mo><mml:mi>a</mml:mi><mml:mo>⁢</mml:mo><mml:mi>n</mml:mi><mml:mo>⁢</mml:mo><mml:mi>d</mml:mi><mml:mo>⁢</mml:mo><mml:mi>n</mml:mi><mml:mo>⁢</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> is used to produce normally distributed noise. We define the sinusoidal voltage signal with noise as the input and the resulting signal from the state estimation is taken as the output. The experimental results are presented in Figure <xref ref-type="fig" rid="F2">2</xref>. The red curve denotes the input signal, while the blue one indicates the output. It can be seen that the output curve from the state estimation closely matches the input signal, which sufficiently meets the typical requirements of the power system.</p>
        <p>
          <fig id="F2">
            <label>Figure 2.</label>
            <caption>
              <p>Kalman Filter estimation when there is no attack.</p>
            </caption>
            <graphic xlink:href="figures/kalman.png"/>
          </fig>
        </p>
      </sec>
      <sec id="S4.SS2">
        <label>4.2</label>
        <title>Estimation under DoS attack</title>
        <p id="S4.SS2.p1">Subsequently, we consider the state estimation under DoS attack. The attacker applies the attack in a manner that maximizes their attacking capability, which means that each estimator is subject to an attack with equal probability. As mentioned before, the difference between the probability distributions only related to the probability of each estimator being attacked. Consequently, in such circumstances, there is no distinction between two different weighting methods. Therefore we only focus on the discrepancies between KF estimation and multi-estimator based estimation.</p>
        <p>
          <fig id="F3">
            <label>Figure 3.</label>
            <caption>
              <p>Kalman filter estimation under DoS attack.</p>
            </caption>
            <graphic xlink:href="figures/dos2.png"/>
          </fig>
        </p>
        <p id="S4.SS2.p2">When an attacker is unable to target all estimators within a system, multi-estimator based estimation invariably outperforms KF estimation. The advantage is apparent because there are estimators within the system that remain unaffected by the attacks, which can offer data compensation for those estimators that are under attack during the estimation process, thereby reducing the attack's influence. Consequently, in our experiments, we assume that all estimators are subjected to the attacker's assault with an equal probability of <inline-formula><mml:math alttext="1-p" display="inline"><mml:mrow><mml:mn>1</mml:mn><mml:mo>−</mml:mo><mml:mi>p</mml:mi></mml:mrow></mml:math></inline-formula>. Referring to [<xref rid="ref016" ref-type="bibr">16</xref>], we select <inline-formula><mml:math alttext="1-p=0.6" display="inline"><mml:mrow><mml:mrow><mml:mn>1</mml:mn><mml:mo>−</mml:mo><mml:mi>p</mml:mi></mml:mrow><mml:mo>=</mml:mo><mml:mn>0.6</mml:mn></mml:mrow></mml:math></inline-formula> as the probability of a successful attack. Upon a successful attack, the communication channels transmitting data will be severed, rendering estimators incapable of receiving measurements from the sensors.</p>
        <p id="S4.SS2.p3">The results obtained from the KF estimator are depicted in Figure <xref ref-type="fig" rid="F3">3</xref>. The experimental outcomes reveal that the KF estimation exhibits noticeable errors, demonstrating the impact of data loss on state estimation. The results of the Multi-estimators estimation are presented in Figure <xref ref-type="fig" rid="F4">4</xref>. Even when all estimators are under attack, the output signal from the state estimation closely resembles the input signal, which is significantly superior to the KF estimation. The Multi-estimator based estimation has a probability of only <inline-formula><mml:math alttext="(1-p)^{3}" display="inline"><mml:msup><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mn>1</mml:mn><mml:mo>−</mml:mo><mml:mi>p</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mn>3</mml:mn></mml:msup></mml:math></inline-formula> for complete data loss, whereas the single estimator has a probability of <inline-formula><mml:math alttext="p" display="inline"><mml:mi>p</mml:mi></mml:math></inline-formula>, thus being more markedly affected by DoS attack.</p>
        <p id="S4.SS2.p4">Experiments have demonstrated that in the presence of DoS attacks within the system, Multi-estimator based estimation exhibits superior robustness, yielding more precise estimation results .In next subsection we will consider the performance of different estimation methods when confronted with FDI attacks.</p>
        <p>
          <fig id="F4">
            <label>Figure 4.</label>
            <caption>
              <p>Multi-estimators based estimation under DoS attack.</p>
            </caption>
            <graphic xlink:href="figures/dos1.png"/>
          </fig>
        </p>
      </sec>
      <sec id="S4.SS3">
        <label>4.3</label>
        <title>Estimation under Linear FDI attack</title>
        <p id="S4.SS3.p1">In this subsection we simulate the linear FDI attack targeting single estimator. Initially, we test an attack that triggers the detector alarm, which means the FDI attack does not possess stealthiness. When the detection result exceeds the threshold, the detector status turns to abnormal, and the communication channel transmitting information from the corresponding estimator is severed. The estimated state of the bus will be provided by other estimators. Furthermore, obtaining the KL-divergence requires sufficient data to determine the probability distribution, which is easily obtainable in power systems. We reset the sampling time to 1s, with the first 0.9 s dedicated to data collection, and estimation of the state commences from 0.9 second. We apply an attack on Estimator 1, and according to Equation <xref rid="S2.E8">8</xref>, we set <inline-formula><mml:math alttext="T_{i}" display="inline"><mml:msub><mml:mi>T</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:math></inline-formula> to 1.7 and the constant <inline-formula><mml:math alttext="b_{i}" display="inline"><mml:msub><mml:mi>b</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:math></inline-formula> to 0.08. Under this simple attack, the detector will trigger an alarm, while the other estimators will not be affected by the attack's influence. The state of the detector at 0.9s is abnormal. The results from three different estimators are presented in Figure <xref ref-type="fig" rid="F5">5</xref>.</p>
        <p>
          <fig id="F5">
            <label>Figure 5.</label>
            <caption>
              <p>Comparison of three estimation methods under linear FDI attack.</p>
            </caption>
            <graphic xlink:href="figures/1.png"/>
          </fig>
        </p>
        <p id="S4.SS3.p2">The experimental outcomes clearly demonstrate that the KF estimator exhibits the least favorable performance. This deficiency stems from the absence of extra estimators within its system to counteract the effects of the attack on single estimator. Multi-estimator based method yields estimation results that markedly outperform those of the KF estimator. This enhancement is attributed to the presence of two estimators within the system that are impervious to the attack. Despite equal weighting of the estimation states from all three estimators, the two uncompromisable estimators contribute precise data, thereby substantially diminishing the detrimental effects of the FDI attack.</p>
        <p id="S4.SS3.p3">The estimation method based on KL-divergence yields the best results, which is quite understandable. At the beginning of state estimation, the attacked estimator is marked as abnormal, its communication channel is severed, and the results it yields no longer impact the entire system; the remaining state estimation is accomplished solely by the unaffected estimators. In other words, the detector can effectively block FDI attacks that do not possess stealthiness, and the system will remain unaffected by such attacks. This experiment only serves to demonstrate the effectiveness of the KL-divergence detector, but it does not indicate the advantages of the weighted strategy. We will proceed to illustrate the superiority of the new estimation method through stealthy attacks.</p>
        <p>
          <fig id="F6">
            <label>Figure 6.</label>
            <caption>
              <p>Comparison of three estimation methods under stealth linear FDI attack.</p>
            </caption>
            <graphic xlink:href="figures/2.png"/>
          </fig>
        </p>
        <p id="S4.SS3.p4">Next we take the stealth FDI attack into consideration. According to [<xref rid="ref024" ref-type="bibr">24</xref>], we can obtain the attack parameters that yield the most effective results without being detected. We reset parameter <inline-formula><mml:math alttext="T_{i}" display="inline"><mml:msub><mml:mi>T</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:math></inline-formula> to 1.3 and <inline-formula><mml:math alttext="b_{i}" display="inline"><mml:msub><mml:mi>b</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:math></inline-formula> to 0.06, which will have the greatest impact on the estimator while maintaining stealth. The attack is still applied to Estimator 1.The experimental results are shown in Figure <xref ref-type="fig" rid="F6">6</xref>.</p>
        <p id="S4.SS3.p5">The estimation performance of the KF estimator remains the poorest, with its output signal being affected to a similar extent as the one in Figure <xref ref-type="fig" rid="F5">5</xref>, which indicates that the modified FDI attack not only has stealth characteristics but also achieves significant disruptive effects. The Multi-estimator based method yields better results than the KF estimator but falls short compared to the KL-divergence based method. However, due to the stealthiness of the attack in this experiment, the detector fails to trigger an alarm and sever the communication channel of Estimator 1.Consequently, the KL divergence based method cannot produce a signal entirely unaffected by the attack as seen in Figure <xref ref-type="fig" rid="F5">5</xref>.It can only rely on the weighted strategy to assign a lower weight to the more severely affected estimation results, thereby reducing the estimation error.</p>
        <p id="S4.SS3.p6">To better demonstrate the advantages of the new weighting strategy, we compare the absolute errors between the results obtained from the KL-divergence based method and the Multi-estimator based method with the input signal. The errors <inline-formula><mml:math alttext="{|e_{i}|}" display="inline"><mml:mrow><mml:mo stretchy="false">|</mml:mo><mml:msub><mml:mi>e</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo stretchy="false">|</mml:mo></mml:mrow></mml:math></inline-formula> can be obtained by: <inline-formula><mml:math alttext="|e_{i}|=|{\hat{z_{i}}-{z_{i}}}|" display="inline"><mml:mrow><mml:mrow><mml:mo stretchy="false">|</mml:mo><mml:msub><mml:mi>e</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo stretchy="false">|</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mo stretchy="false">|</mml:mo><mml:mrow><mml:mover accent="true"><mml:msub><mml:mi>z</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>^</mml:mo></mml:mover><mml:mo>−</mml:mo><mml:msub><mml:mi>z</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mo stretchy="false">|</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>.The comparison results are presented in Figure <xref ref-type="fig" rid="F7">7</xref>.</p>
        <p>
          <fig id="F7">
            <label>Figure 7.</label>
            <caption>
              <p>Comparison of estimation errors under linear FDI attacks with different weighting strategy.</p>
            </caption>
            <graphic xlink:href="figures/22.png"/>
          </fig>
        </p>
        <p id="S4.SS3.p7">In Figure <xref ref-type="fig" rid="F8">8</xref>, the horizontal axis represents time, and the vertical axis represents the absolute value of the estimation error. Blue curve represents the error of the Multi-estimators based method, and the red one represents the error of the KL-divergence based method. It is evident that for the majority of the time, the blue curve is above the red curve, indicating that the method employing the new weighting strategy yields better estimation results.</p>
        <p id="S4.SS3.p8">The outcomes illustrated in Figures <xref ref-type="fig" rid="F5">5</xref> and <xref ref-type="fig" rid="F6">6</xref> indicate that in the presence of undetectable stealthy attacks within the system, the novel weighting strategy effectively enhances the estimation's robustness and precision. Despite the detector's inability to trigger an alarm or sever the communication channels, this strategy mitigates the influence of the attacked estimation results by apportioning varying weights. Consequently, it elevates the significance of the unaffected estimation outcomes, bolstering the system's resilience against such stealth attack.</p>
      </sec>
      <sec id="S4.SS4">
        <label>4.4</label>
        <title>Estimation under Stochastic Stealth FDI attack</title>
        <p id="S4.SS4.p1">Finally, we will test the system's estimation performance under Stochastic Stealth FDI attack. According to Equation <xref rid="S2.E9">9</xref>, we set the intensity of <inline-formula><mml:math alttext="\zeta_{i}" display="inline"><mml:msub><mml:mi>ζ</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:math></inline-formula> to three times the level of the system noise. Referring to reference [<xref rid="ref023" ref-type="bibr">23</xref>], we set <inline-formula><mml:math alttext="p" display="inline"><mml:mi>p</mml:mi></mml:math></inline-formula> to 0.6, which that the probability of each estimator under attack is <inline-formula><mml:math alttext="p=0.6" display="inline"><mml:mrow><mml:mi>p</mml:mi><mml:mo>=</mml:mo><mml:mn>0.6</mml:mn></mml:mrow></mml:math></inline-formula> . When an estimator is attacked, a stronger Gaussian noise is superimposed on the innovation <inline-formula><mml:math alttext="z_{i}" display="inline"><mml:msub><mml:mi>z</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:math></inline-formula>.The output signals estimated by three different methods are displayed in Figure <xref ref-type="fig" rid="F8">8</xref>:</p>
        <p>
          <fig id="F8">
            <label>Figure 8.</label>
            <caption>
              <p>Comparison of three estimation methods under stochastic stealthy FDI attack.</p>
            </caption>
            <graphic xlink:href="figures/3.png"/>
          </fig>
        </p>
        <p id="S4.SS4.p2">Unlike the previous experimental results, in this experiment, the estimation effect of the KF estimator is not significantly worse than that of the Multi-estimators based method. Upon reviewing the experimental data, we analyzed the cause of this outcome: when attacking all estimators with a probability of 0.6, two estimators in the Multi-estimators based method were attacked. With two estimators simultaneously under attack, the single normal estimation result could not offset the influence of the two abnormal results, leading to an estimation accuracy similar to that of the KF estimation. In contrast to these two methods, the results obtained by the KL-divergence based method were largely unaffected by the attacks, as the abnormal results were assigned a sufficiently small weight, while the normal results had a higher weight, which dominated in the final outcome. Therefore, as long as there are estimators in the system that are not under attack, the estimation method employing the new weighting strategy will maintain a high level of estimation accuracy. As mentioned earlier, the attacker's capabilities are greatly limited, and it is essentially impossible to launch simultaneous attacks on all estimators in the system (usually 3 to 4).Thus, the methods proposed in this manuscript essentially meet the needs of state estimation in power systems.</p>
        <p>
          <fig id="F9">
            <label>Figure 9.</label>
            <caption>
              <p>Comparison of estimation errors under stochastic stealth FDI attacks with different weighting strategy.</p>
            </caption>
            <graphic xlink:href="figures/32.png"/>
          </fig>
        </p>
        <p id="S4.SS4.p3">Similar to the previous subsection, in this experiment, we again compared the estimation errors of two methods. The results are displayed in Figure <xref ref-type="fig" rid="F9">9</xref>, where blue still represents the Multi-estimators based method and red one represents the KL-divergence based method. It is evident that the blue curve is significantly higher than the red one, which indicates that the new weighting strategy yields a smaller estimation error and higher precision.</p>
        <p id="S4.SS4.p4">It is noticed that the Figure <xref ref-type="fig" rid="F9">9</xref> reveals a representative phenomenon: when the estimation errors of both methods are relatively small, the difference in height between the two curves is not significant. However, when the blue curve rises prominently, the difference in height between the curves becomes markedly evident. The explanation for this phenomenon is that the noise added to the estimators follows a normal distribution with a mean of zero so that the intensity of the attack on the innovation <inline-formula><mml:math alttext="z_{i}" display="inline"><mml:msub><mml:mi>z</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:math></inline-formula> varies at different time. Although the new weighting strategy assigns higher weights to the correct results, it does not fully demonstrate its advantage when the attack is weak, leading to minimal differences between the two curves. In contrast, when the attack is strong, the new method reduces the weight of the abnormal results sufficiently, effectively mitigating the impact of the attack, which results in a significant difference between the two curves.</p>
        <p>
          <fig id="F10">
            <label>Figure 10.</label>
            <caption>
              <p>Comparison of estimation errors under different mitigation attack algorithms.</p>
            </caption>
            <graphic xlink:href="figures/new.png"/>
          </fig>
        </p>
        <p id="S4.SS4.p5">Furthermore, to demonstrate the superiority of the approach outlined in our manuscript, we have conducted comparative experiments between the algorithm presented in our work and the method described in [<xref rid="ref030" ref-type="bibr">30</xref>]. The results of these experiments are depicted in Figure <xref ref-type="fig" rid="F10">10</xref>, where the red line corresponds to the KL divergence-based method. The experimental findings indicate that, in the vast majority of instances, our method provides more precise estimation outcomes. This is readily understandable, as a meticulously crafted attack vector does not significantly alter the covariance but substantially affects the KL divergence of the innovation. Consequently, our method outperforms in such scenarios.</p>
        <p id="S4.SS4.p6">Through the experiments conducted in the four subsections above, we have demonstrated that our method can effectively maintain the normal operation of state estimation under no attack, DoS attacks, regular FDI attacks, and stealthy FDI attacks.Additionally, we have proven the superiority of the new weighting strategy in terms of robustness and estimation accuracy when facing attacks.</p>
      </sec>
    </sec>
    <sec id="S5">
      <label>5.</label>
      <title>Conclusion</title>
      <p id="S5.p1">This manuscripts introduces an estimation algorithm based on the fusion of data from estimators to address the state estimation problem at critical buses in power systems. By deploying multiple estimators at key buses and incorporating a KL divergence-based detector, the proposed algorithm can effectively detect linear FDI attacks and maintain the normal operation of power systems under both DoS and FDI attacks. Furthermore, to mitigate the impact of undetectable stealthy attacks, a novel weighting strategy is employed to reduce the influence of noise and attacks on the estimation results. The robustness and superiority of the proposed algorithm are demonstrated through numerical experiments.</p>
    </sec>
  </body>
  <back>
    <ack>
      <title>Acknowledgments</title>
      <p id="ack.p1">This work was supported in part by the National Key R&D Program of China under Grant 2023YFF1204805; in part by the National Natural Science Foundation of China under Grant 62336005 and Grant 62122026; in part by the Projects Sponsored by the Programme of Introducing Talents of Discipline to Universities (the 111 Project) under Grant B17017; and in part by the Shuguang Program supported by Shanghai Education Development Foundation and Shanghai Municipal Education Commission.</p>
    </ack>
    <sec id="sec0100" sec-type="COI-statement">
      <title>Conflict of interest</title>
      <p>The authors declare no conflicts of interest.</p>
    </sec>
    <ref-list>
      <title>References</title>
      <ref id="ref001">
        <label>[1]</label>
        <mixed-citation> Abdelkader, S., Amissah, J., Kinga, S., Mugerwa, G., Emmanuel, E., Mansour, D. E. A., … &amp; Prokop, L. (2024). Securing modern power systems: Implementing comprehensive strategies to enhance resilience and reliability against cyber-attacks. <italic>Results in engineering</italic>, 102647. [<uri>https://doi.org/10.1016/j.rineng.2024.102647</uri>] </mixed-citation>
      </ref>
      <ref id="ref002">
        <label>[2]</label>
        <mixed-citation> Li, F., Yan, X., Xie, Y., Sang, Z., &amp; Yuan, X. (2019, October). A review of cyber-attack methods in cyber-physical power system. In <italic>2019 IEEE 8th International Conference on Advanced Power System Automation and Protection (APAP)</italic> (pp. 1335-1339). IEEE. [<uri>https://doi.org/10.1109/APAP47170.2019.9225126</uri>] </mixed-citation>
      </ref>
      <ref id="ref003">
        <label>[3]</label>
        <mixed-citation> Irfan, M., Sadighian, A., Tanveer, A., Al-Naimi, S. J., &amp; Oligeri, G. (2023). False data injection attacks in smart grids: State of the art and way forward. <italic>arXiv preprint arXiv:2308.10268</italic>. [<uri>https://doi.org/10.48550/arXiv.2308.10268</uri>] </mixed-citation>
      </ref>
      <ref id="ref004">
        <label>[4]</label>
        <mixed-citation> Reda, H. T., Anwar, A., &amp; Mahmood, A. (2022). Comprehensive survey and taxonomies of false data injection attacks in smart grids: attack models, targets, and impacts. <italic>Renewable and Sustainable Energy Reviews, 163</italic>, 112423. [<uri>https://doi.org/10.1016/j.rser.2022.112423</uri>] </mixed-citation>
      </ref>
      <ref id="ref005">
        <label>[5]</label>
        <mixed-citation> Musleh, A. S., Chen, G., &amp; Dong, Z. Y. (2019). A survey on the detection algorithms for false data injection attacks in smart grids. <italic>IEEE Transactions on Smart Grid, 11</italic>(3), 2218-2234. [<uri>https://doi.org/10.1109/TSG.2019.2949998</uri>] </mixed-citation>
      </ref>
      <ref id="ref006">
        <label>[6]</label>
        <mixed-citation> Husnoo, M. A., Anwar, A., Hosseinzadeh, N., Islam, S. N., Mahmood, A. N., &amp; Doss, R. (2023). False data injection threats in active distribution systems: A comprehensive survey. <italic>Future Generation Computer Systems, 140</italic>, 344-364. [<uri>https://doi.org/10.1016/j.future.2022.10.021</uri>] </mixed-citation>
      </ref>
      <ref id="ref007">
        <label>[7]</label>
        <mixed-citation> Salehghaffari, H., &amp; Khorrami, F. (2018, February). Resilient power grid state estimation under false data injection attacks. In <italic>2018 IEEE Power &amp; Energy Society Innovative Smart Grid Technologies Conference (ISGT)</italic> (pp. 1-5). IEEE. [<uri>https://doi.org/10.1109/ISGT.2018.8403396</uri>] </mixed-citation>
      </ref>
      <ref id="ref008">
        <label>[8]</label>
        <mixed-citation> Jafari, M., Rahman, M. A., &amp; Paudyal, S. (2022). Optimal false data injection attacks against power system frequency stability. <italic>IEEE Transactions on Smart Grid, 14</italic>(2), 1276-1288. [<uri>https://doi.org/10.1109/TSG.2022.3206717</uri>] </mixed-citation>
      </ref>
      <ref id="ref009">
        <label>[9]</label>
        <mixed-citation> Tian, M., Dong, Z., &amp; Wang, X. (2021). Analysis of false data injection attacks in power systems: A dynamic Bayesian game-theoretic approach. <italic>ISA transactions, 115</italic>, 108-123. [<uri>https://doi.org/10.1016/j.isatra.2021.01.011</uri>] </mixed-citation>
      </ref>
      <ref id="ref010">
        <label>[10]</label>
        <mixed-citation> Zhang, Z., Deng, R., Cheng, P., &amp; Chow, M. Y. (2021). Strategic protection against FDI attacks with moving target defense in power grids. <italic>IEEE Transactions on Control of Network Systems, 9</italic>(1), 245-256. [<uri>https://doi.org/10.1109/TCNS.2021.3100411</uri>] </mixed-citation>
      </ref>
      <ref id="ref011">
        <label>[11]</label>
        <mixed-citation> Liu, B., &amp; Wu, H. (2020). Optimal D-FACTS placement in moving target defense against false data injection attacks. <italic>IEEE Transactions on Smart Grid, 11</italic>(5), 4345-4357. [<uri>https://doi.org/10.1109/TSG.2020.2977207</uri>] </mixed-citation>
      </ref>
      <ref id="ref012">
        <label>[12]</label>
        <mixed-citation> Xu, W., Jaimoukha, I. M., &amp; Teng, F. (2022). Robust moving target defence against false data injection attacks in power grids. <italic>IEEE Transactions on Information Forensics and Security, 18</italic>, 29-40. [<uri>https://doi.org/10.1109/TIFS.2022.3210864</uri>] </mixed-citation>
      </ref>
      <ref id="ref013">
        <label>[13]</label>
        <mixed-citation> Liu, M., Zhao, C., Zhang, Z., &amp; Deng, R. (2022). Explicit analysis on effectiveness and hiddenness of moving target defense in AC power systems. <italic>IEEE Transactions on Power Systems, 37</italic>(6), 4732-4746. [<uri>https://doi.org/10.1109/TPWRS.2022.3152801</uri>] </mixed-citation>
      </ref>
      <ref id="ref014">
        <label>[14]</label>
        <mixed-citation> Lakshminarayana, S., Belmega, E. V., &amp; Poor, H. V. (2021). Moving-target defense against cyber-physical attacks in power grids via game theory. <italic>IEEE Transactions on Smart Grid, 12</italic>(6), 5244-5257. [<uri>https://doi.org/10.1109/TSG.2021.3095083</uri>] </mixed-citation>
      </ref>
      <ref id="ref015">
        <label>[15]</label>
        <mixed-citation> Shafei, H., Farhangi, M., Aguilera, R. P., &amp; Alhelou, H. H. (2024). A Novel Cyber-Attack Detection and Mitigation for Coupled Power and Information Networks in Microgrids Using Distributed Sliding Mode Unknown Input Observer. <italic>IEEE Transactions on Smart Grid</italic>. [<uri>https://doi.org/10.1109/TSG.2024.3475468</uri>] </mixed-citation>
      </ref>
      <ref id="ref016">
        <label>[16]</label>
        <mixed-citation> Garza, L., &amp; Mandal, P. (2023, October). Detection and Classification of False Data Injection Attacks in Power Grids Using Machine Learning and Hyperparameter Optimization Methods. In <italic>2023 IEEE Industry Applications Society Annual Meeting (IAS)</italic> (pp. 1-8). IEEE. [<uri>https://doi.org/10.1109/IAS54024.2023.10406838</uri>] </mixed-citation>
      </ref>
      <ref id="ref017">
        <label>[17]</label>
        <mixed-citation> Kumar, A., Saxena, N., &amp; Choi, B. J. (2021, January). Machine learning algorithm for detection of false data injection attack in power system. In <italic>2021 International Conference on Information Networking (ICOIN)</italic> (pp. 385-390). IEEE. [<uri>https://doi.org/10.1109/ICOIN50884.2021.9333913</uri>] </mixed-citation>
      </ref>
      <ref id="ref018">
        <label>[18]</label>
        <mixed-citation> Tebianian, H., &amp; Jeyasurya, B. (2013, August). Dynamic state estimation in power systems using Kalman filters. In <italic>2013 IEEE electrical power &amp; energy conference</italic> (pp. 1-5). IEEE. [<uri>https://doi.org/10.1109/EPEC.2013.6802979</uri>] </mixed-citation>
      </ref>
      <ref id="ref019">
        <label>[19]</label>
        <mixed-citation> Li, C., &amp; Zhang, J. (2023, October). Dynamic State Estimation of Power Systems Based on Extended Kalman Particle Filter. In <italic>2023 3rd International Conference on Intelligent Power and Systems (ICIPS)</italic> (pp. 638-644). IEEE. [<uri>https://doi.org/10.1109/ICIPS59254.2023.10405341</uri>] </mixed-citation>
      </ref>
      <ref id="ref020">
        <label>[20]</label>
        <mixed-citation> Zhu, M., Liu, H., &amp; Bi, T. (2021, July). Dynamic State Estimation of Power System Based on a Robust H-infinity Cubature Kalman Filter. In <italic>2021 IEEE Power &amp; Energy Society General Meeting (PESGM)</italic> (pp. 1-5). IEEE. [<uri>https://doi.org/10.1109/PESGM46819.2021.9638185</uri>] </mixed-citation>
      </ref>
      <ref id="ref021">
        <label>[21]</label>
        <mixed-citation> Zhao, J., &amp; Mili, L. (2017). Robust unscented Kalman filter for power system dynamic state estimation with unknown noise statistics. <italic>IEEE Transactions on Smart Grid, 10</italic>(2), 1215-1224. [<uri>https://doi.org/10.1109/TSG.2017.2761452</uri>] </mixed-citation>
      </ref>
      <ref id="ref022">
        <label>[22]</label>
        <mixed-citation> Zhang, Z., &amp; Feng, X. (2023, July). Performance Analysis of Chi-square Detection for False Data Injection Attack. In <italic>2023 3rd International Conference on Electrical Engineering and Mechatronics Technology (ICEEMT)</italic> (pp. 560-564). IEEE. [<uri>https://doi.org/10.1109/ICEEMT59522.2023.10263144</uri>] </mixed-citation>
      </ref>
      <ref id="ref023">
        <label>[23]</label>
        <mixed-citation> Ye, D., &amp; Wang, J. (2019, May). False data injection attack design in multi-sensor systems based on KL divergence theory. In <italic>2019 IEEE 8th Data Driven Control and Learning Systems Conference (DDCLS)</italic> (pp. 333-337). IEEE. [<uri>https://doi.org/10.1109/DDCLS.2019.8908983</uri>] </mixed-citation>
      </ref>
      <ref id="ref024">
        <label>[24]</label>
        <mixed-citation> Guo, Z., Shi, D., Johansson, K. H., &amp; Shi, L. (2018). Worst-case stealthy innovation-based linear attack on remote state estimation. <italic>Automatica, 89</italic>, 117-124. [<uri>https://doi.org/10.1016/j.automatica.2017.11.018</uri>] </mixed-citation>
      </ref>
      <ref id="ref025">
        <label>[25]</label>
        <mixed-citation> Hu, K., Li, L., Tao, X., Velásquez, J. D., &amp; Delaney, P. (2023). Information fusion in crime event analysis: A decade survey on data, features and models. <italic>Information Fusion, 100</italic>, 101904. [<uri>https://doi.org/10.1016/j.inffus.2023.101904</uri>] </mixed-citation>
      </ref>
      <ref id="ref026">
        <label>[26]</label>
        <mixed-citation> Li, T., Liang, H., Xiao, B., Pan, Q., &amp; He, Y. (2023). Finite mixture modeling in time series: A survey of Bayesian filters and fusion approaches. <italic>Information Fusion, 98</italic>, 101827. [<uri>https://doi.org/10.1016/j.inffus.2023.101827</uri>] </mixed-citation>
      </ref>
      <ref id="ref027">
        <label>[27]</label>
        <mixed-citation> Hu, L., Zhang, J., Zhang, J., Cheng, S., Wang, Y., Zhang, W., &amp; Yu, N. (2025). Security analysis and adaptive false data injection against multi-sensor fusion localization for autonomous driving. <italic>Information Fusion, 117</italic>, 102822. [<uri>https://doi.org/10.1016/j.inffus.2024.102822</uri>] </mixed-citation>
      </ref>
      <ref id="ref028">
        <label>[28]</label>
        <mixed-citation> Bhalla, V., &amp; Prajapat, G. P. (2024, June). Proficiency Analysis of Unscented Kalman Filter for Bad Data Detection During State Estimation. In <italic>2024 IEEE 3rd International Conference on Electrical Power and Energy Systems (ICEPES)</italic> (pp. 1-5). IEEE. [<uri>https://doi.org/10.1109/ICEPES60647.2024.10653527</uri>] </mixed-citation>
      </ref>
      <ref id="ref029">
        <label>[29]</label>
        <mixed-citation> Yang, Q., Min, R., An, D., Yu, W., &amp; Yang, X. (2016, March). Towards optimal pmu placement against data integrity attacks in smart grid. In <italic>2016 Annual Conference on Information Science and Systems (CISS)</italic> (pp. 54-58). IEEE. [<uri>https://doi.org/10.1109/CISS.2016.7460476</uri>] </mixed-citation>
      </ref>
      <ref id="ref030">
        <label>[30]</label>
        <mixed-citation> Hao, J., &amp; Zhang, Y. (2020, December). Consensus Kalman filtering for sensor networks based on FDI attack detection. In <italic>2020 16th International Conference on Control, Automation, Robotics and Vision (ICARCV)</italic> (pp. 160-165). IEEE. [<uri>https://doi.org/10.1109/ICARCV50220.2020.9305496.</uri>] </mixed-citation>
      </ref>
      <ref id="ref031">
        <label>[31]</label>
        <mixed-citation> Li, T., Song, Y., Song, E., &amp; Fan, H. (2024). Arithmetic average density fusion-Part I: Some statistic and information-theoretic results. <italic>Information Fusion, 104</italic>, 102199. [<uri>https://doi.org/10.1016/j.inffus.2023.102199</uri>] </mixed-citation>
      </ref>
      <ref id="ref032">
        <label>[32]</label>
        <mixed-citation> Wang, G., Zhu, Z., Yang, C., Ma, L., Dai, W., &amp; Chen, X. (2024). Distributed Multi-Kernel Maximum Correntropy State-Constrained Kalman Filter Under Deception Attacks. <italic>IEEE Transactions on Network Science and Engineering</italic>. [<uri>https://doi.org/10.1109/TNSE.2024.3506553</uri>] </mixed-citation>
      </ref>
      <ref id="ref033">
        <label>[33]</label>
        <mixed-citation> Li, T., Corchado, J. M., &amp; Sun, S. (2018). Partial consensus and conservative fusion of Gaussian mixtures for distributed PHD fusion. <italic>IEEE Transactions on Aerospace and Electronic Systems, 55</italic>(5), 2150-2163. [<uri>https://doi.org/10.1109/TAES.2018.2882960</uri>] </mixed-citation>
      </ref>
      <ref id="ref034">
        <label>[34]</label>
        <mixed-citation> Yang, H., Li, T., Yan, J., &amp; Elvira, V. (2024). Hierarchical Average Fusion With GM-PHD Filters Against FDI and DoS Attacks. <italic>IEEE Signal Processing Letters</italic>. [<uri>https://doi.org/10.1109/LSP.2024.3356823.</uri>] </mixed-citation>
      </ref>
      <ref id="ref035">
        <label>[35]</label>
        <mixed-citation> Bi, T., Liu, H., Zhang, D., &amp; Yang, Q. (2012, July). The PMU dynamic performance evaluation and the comparison of PMU standards. In <italic>2012 IEEE Power and Energy Society General Meeting</italic> (pp. 1-5). IEEE. [<uri>https://doi.org/10.1109/PESGM.2012.6345328</uri>] </mixed-citation>
      </ref>
      <ref id="ref036">
        <label>[36]</label>
        <mixed-citation> IEEE. (2013). IEEE guide for synchronization, calibration, testing, and installation of phasor measurement units (PMUs) for power system protection and control (IEEE Std C37.242-2013, pp. 1–107). [<uri>https://doi.org/10.1109/IEEESTD.2013.6475134</uri>] </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>
