<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.1 20151215//EN" "http://jats.nlm.nih.gov/publishing/1.1/JATS-journalpublishing1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mml="http://www.w3.org/1998/Math/MathML" xml:lang="en" article-type="research-article" dtd-version="1.1">
<front>
<journal-meta>
<journal-id journal-id-type="pmc">CMC</journal-id>
<journal-id journal-id-type="nlm-ta">CMC</journal-id>
<journal-id journal-id-type="publisher-id">CMC</journal-id>
<journal-title-group>
<journal-title>Computers, Materials &#x0026; Continua</journal-title>
</journal-title-group>
<issn pub-type="epub">1546-2226</issn>
<issn pub-type="ppub">1546-2218</issn>
<publisher>
<publisher-name>Tech Science Press</publisher-name>
<publisher-loc>USA</publisher-loc>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="publisher-id">81224</article-id>
<article-id pub-id-type="doi">10.32604/cmc.2026.081224</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Article</subject>
</subj-group>
</article-categories>
<title-group>
<article-title>Cascading Failure Dynamics and Edge-Intelligent Defense in Space-Air-Ground Integrated Networks for Internet of Things</article-title>
<alt-title alt-title-type="left-running-head">Cascading Failure Dynamics and Edge-Intelligent Defense in Space-Air-Ground Integrated Networks for Internet of Things</alt-title>
<alt-title alt-title-type="right-running-head">Cascading Failure Dynamics and Edge-Intelligent Defense in Space-Air-Ground Integrated Networks for Internet of Things</alt-title>
</title-group>
<contrib-group>
<contrib id="author-1" contrib-type="author">
<name name-style="western"><surname>Zhang</surname><given-names>Peiying</given-names></name><xref ref-type="aff" rid="aff-1">1</xref><xref ref-type="aff" rid="aff-2">2</xref></contrib>
<contrib id="author-2" contrib-type="author">
<name name-style="western"><surname>Yu</surname><given-names>Yihong</given-names></name><xref ref-type="aff" rid="aff-1">1</xref><xref ref-type="aff" rid="aff-2">2</xref></contrib>
<contrib id="author-3" contrib-type="author" corresp="yes">
<name name-style="western"><surname>Tan</surname><given-names>Lizhuang</given-names></name><xref ref-type="aff" rid="aff-3">3</xref><xref ref-type="aff" rid="aff-4">4</xref><email>tanlzh@sdas.org</email></contrib>
<contrib id="author-4" contrib-type="author">
<name name-style="western"><surname>He</surname><given-names>Shuqing</given-names></name><xref ref-type="aff" rid="aff-5">5</xref></contrib>
<contrib id="author-5" contrib-type="author">
<name name-style="western"><surname>Wang</surname><given-names>Jian</given-names></name><xref ref-type="aff" rid="aff-6">6</xref></contrib>
<contrib id="author-6" contrib-type="author">
<name name-style="western"><surname>El-Sayed</surname><given-names>Ameer</given-names></name><xref ref-type="aff" rid="aff-7">7</xref></contrib>
<aff id="aff-1"><label>1</label><institution>Qingdao Institute of Software, College of Computer Science and Technology, China University of Petroleum (East China)</institution>, <addr-line>Qingdao</addr-line>, <country>China</country></aff>
<aff id="aff-2"><label>2</label><institution>Shandong Key Laboratory of Intelligent Oil &#x0026; Gas Industrial Software</institution>, <addr-line>Qingdao</addr-line>, <country>China</country></aff>
<aff id="aff-3"><label>3</label><institution>Key Laboratory of Computing Power Network and Information Security, Ministry of Education</institution>, Shandong Computer Science Center (National Supercomputer Center in Jinan), Qilu University of Technology (Shandong Academy of Sciences), <addr-line>Jinan</addr-line>, <country>China</country></aff>
<aff id="aff-4"><label>4</label><institution>Shandong Provincial Key Laboratory of Computing Power Internet and Service Computing, Shandong Fundamental Research Center for Computer Science</institution>, <addr-line>Jinan</addr-line>, <country>China</country></aff>
<aff id="aff-5"><label>5</label><institution>School of Information Science and Engineering</institution>, Linyi University, <addr-line>Linyi</addr-line>, <country>China</country></aff>
<aff id="aff-6"><label>6</label><institution>College of Science, China University of Petroleum</institution> (East China), <addr-line>Qingdao</addr-line>, <country>China</country></aff>
<aff id="aff-7"><label>7</label><institution>Department of Information Technology, Faculty of Computers and Informatics</institution>, Zagazig University, <addr-line>Zagazig</addr-line>, <country>Egypt</country></aff>
</contrib-group>
<author-notes>
<corresp id="cor1"><label>&#x002A;</label>Corresponding Author: Lizhuang Tan. Email: <email>tanlzh@sdas.org</email></corresp>
</author-notes>
<pub-date date-type="collection" publication-format="electronic">
<year>2026</year>
</pub-date>
<pub-date date-type="pub" publication-format="electronic">
<day>15</day><month>06</month><year>2026</year>
</pub-date>
<volume>88</volume>
<issue>2</issue>
<elocation-id>33</elocation-id>
<history>
<date date-type="received">
<day>26</day>
<month>02</month>
<year>2026</year>
</date>
<date date-type="accepted">
<day>21</day>
<month>04</month>
<year>2026</year>
</date>
</history>
<permissions>
<copyright-statement>&#x00A9; 2026 The Authors. Published by Tech Science Press.</copyright-statement>
<copyright-year>2026</copyright-year>
<copyright-holder>The Authors</copyright-holder>
<license xlink:href="https://creativecommons.org/licenses/by/4.0/">
<license-p>This work is licensed under a <ext-link ext-link-type="uri" xlink:type="simple" xlink:href="https://creativecommons.org/licenses/by/4.0/">Creative Commons Attribution 4.0 International License</ext-link>, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.</license-p>
</license>
</permissions>
<self-uri content-type="pdf" xlink:href="TSP_CMC_81224.pdf"></self-uri>
<abstract>
<p>As a core information infrastructure in the 6G era, the Space-Air-Ground Integrated Network (SAGIN) integrates space-based, air-based, and ground-based network resources to achieve seamless communication across all domains. However, its characteristics such as heterogeneous node coupling and dynamic topology changes make it prone to cascading failures, severely threatening critical business continuity in Internet of Things (IoT) applications spanning smart cities, healthcare, transportation, and industrial automation. This paper conducts systematic research addressing challenges including modeling difficulties in SAGIN cascading failure propagation, insufficient coordination of defense strategies, and poor resource adaptability. First, a multi-factor coupled dynamic model of cascading failure propagation is established to quantify the synergistic effects of node heterogeneity, link dynamics, and load redistribution. Second, a closed-loop collaborative defense system integrating &#x201C;early warning-isolation-self-healing&#x201D; is designed. The system incorporates a lightweight greedy-based self-healing algorithm and uses multi-criteria decision-making (Analytic Hierarchy Process) for resource optimization. These approaches ensure real-time performance and energy efficiency on resource-constrained edge nodes. Third, a joint simulation platform combining NS-3 and MATLAB is built to validate the model and strategies across diverse IoT application scenarios. Experimental results show that the proposed propagation model maintains prediction error within 10%, the defense strategies increase failure recovery rates to 85%&#x2013;90%, reduce communication interruption duration by over 60%, and lower resource overhead by 20%&#x2013;25%, providing theoretical support and technical guarantees for stable SAGIN operation in security and resiliency-critical environments.</p>
</abstract>
<kwd-group kwd-group-type="author">
<kwd>Space-Air-Ground Integrated Network</kwd>
<kwd>cascading failure</kwd>
<kwd>defense strategy</kwd>
<kwd>edge intelligence</kwd>
<kwd>Internet of Things</kwd>
<kwd>resource allocation and optimization</kwd>
<kwd>real-time and energy efficiency</kwd>
<kwd>security and resiliency</kwd>
<kwd>network reliability</kwd>
</kwd-group><funding-group>
<award-group id="awg1">
<funding-source>National Natural Science Foundation of China</funding-source>
<award-id>62471493</award-id>
<award-id>62402257</award-id>
</award-group>
<award-group id="awg2">
<funding-source>Natural Science Foundation of Shandong Province</funding-source>
<award-id>ZR2023LZH017</award-id>
<award-id>ZR2024MF066</award-id>
</award-group>
<award-group id="awg3">
<funding-source>Qilu University</funding-source>
<award-id>2023ZD010</award-id>
</award-group>
</funding-group></article-meta>
</front>
<body>
<sec id="s1">
<label>1</label>
<title>Introduction</title>
<p>The Space-Air-Ground Integrated Network (SAGIN) has emerged as a foundational infrastructure for 6th-Generation (6G) mobile communications, enabling global coverage and ubiquitous connectivity [<xref ref-type="bibr" rid="ref-1">1</xref>&#x2013;<xref ref-type="bibr" rid="ref-3">3</xref>]. By integrating satellite, aerial, and terrestrial networks, SAGIN delivers intelligent services with extensive coverage, high bandwidth, and ultra-low latency [<xref ref-type="bibr" rid="ref-4">4</xref>]. Its convergence with IoT enables smart cities, healthcare, and industrial automation, where service disruptions could lead to catastrophic consequences [<xref ref-type="bibr" rid="ref-5">5</xref>,<xref ref-type="bibr" rid="ref-6">6</xref>]. However, SAGIN&#x2019;s inherent heterogeneity, dynamic topology, and resource constraints introduce significant cascading failure risks that existing reliability research has not adequately addressed&#x2014;a gap this paper aims to fill.</p>
<p>Analysis of existing literature reveals four critical limitations that hinder effective analysis and defense:</p>
<p>(1) Limited adaptability to structural heterogeneity. Conventional cascading failure models rely on static, isomorphic topology assumptions derived from ground network studies. They fail to capture how differences in physical attributes, resource capacities, and load thresholds across space, air, and ground nodes shape fault propagation paths in SAGIN.</p>
<p>(2) Inadequate modeling of dynamic topology evolution. Frequent reconfigurations from satellite motion, aerial platform repositioning, and mobile terrestrial users render static frameworks ineffective. While dynamic models exist for single-layer networks [<xref ref-type="bibr" rid="ref-7">7</xref>,<xref ref-type="bibr" rid="ref-8">8</xref>], they do not extend to multi-layer SAGIN scenarios.</p>
<p>(3) Absence of coordinated defense mechanisms. Current mitigation strategies target isolated faults or adopt fragmented countermeasures [<xref ref-type="bibr" rid="ref-9">9</xref>]. They lack an integrated framework for early warning, adaptive isolation, and self-healing. Recent satellite network defenses focus on single-layer protection without cross-layer coordination.</p>
<p>(4) Neglect of onboard resource constraints. Satellites and aerial platforms operate under strict resource limits. Most intelligent defense approaches assume unlimited computational resources, leading to excessive complexity and poor deployability.</p>
<p>To address these limitations, this paper proposes a resource-aware adaptive defense paradigm. Building upon foundational load-capacity coupling models [<xref ref-type="bibr" rid="ref-10">10</xref>,<xref ref-type="bibr" rid="ref-11">11</xref>] and extending them to heterogeneous SAGIN environments, this work makes four contributions:</p>
<p>(1) A multi-factor coupled dynamic cascading failure propagation model. Unlike static models, our model defines node load as a composite of computational, transmission, and energy demands, and incorporates link-type dependent propagation probabilities to capture SAGIN-specific heterogeneity.</p>
<p>(2) A hierarchically collaborative closed-loop defense system. Integrating early warning, adaptive isolation, and lightweight self-healing, it formulates resource allocation as a linear programming problem solved via greedy approximation, ensuring deployability on resource-constrained platforms&#x2014;contrasting with computationally intensive approaches.</p>
<p>(3) A high-fidelity co-simulation platform combining NS-3 and MATLAB to validate the proposed model and strategies.</p>
<p>(4) Systematic experimental validation benchmarking six defense strategies across typical failure scenarios, providing quantitative comparisons and deployment guidelines.</p>
<p>The rest of the paper is structured as follows: <xref ref-type="sec" rid="s2">Section 2</xref> reviews related work; <xref ref-type="sec" rid="s3">Section 3</xref> presents the architecture and cascading failure model; <xref ref-type="sec" rid="s4">Section 4</xref> details the defense mechanism; <xref ref-type="sec" rid="s5">Section 5</xref> discusses experiments; <xref ref-type="sec" rid="s6">Section 6</xref> concludes.</p>
</sec>
<sec id="s2">
<label>2</label>
<title>Related Work</title>
<sec id="s2_1">
<label>2.1</label>
<title>Cascading Failure Models for Heterogeneous Networks</title>
<p>Research on cascading failure mechanisms has long been a focal point in complex network reliability. Percolation models rely on network topology to analyze connectivity changes but neglect dynamic factors such as node load. Avalanche models simulate rapid local-to-global failure spread through chain-reaction rules but inadequately account for network heterogeneity. Load-capacity coupling models assume nodes have finite capacity; when load exceeds capacity, nodes fail and redistribute load to neighbors. The seminal work by Motter and Lai [<xref ref-type="bibr" rid="ref-12">12</xref>] established the foundation for this class of models, with subsequent extensions incorporating tunable parameters for load redistribution.</p>
<p>However, these models assume static, homogeneous nodes, failing to capture SAGIN&#x2019;s cross-layer heterogeneity. Recent studies address this but remain single-layer focused: Liu et al. [<xref ref-type="bibr" rid="ref-13">13</xref>] analyzed satellite failures; Zhang and Du [<xref ref-type="bibr" rid="ref-14">14</xref>] developed a low Earth orbit (LEO) satellite dynamic model; Wang et al. [<xref ref-type="bibr" rid="ref-15">15</xref>] investigated Unmanned Aerial Vehicle (UAV) failures due to energy limits. These single-layer approaches cannot capture how failures propagate across space, air, and ground domains&#x2014;a gap our multi-factor coupled model addresses by integrating computational, transmission, and energy loads across all layers with link-type dependent propagation probabilities.</p>
</sec>
<sec id="s2_2">
<label>2.2</label>
<title>Dynamic Topology Evolution Modeling</title>
<p>Frequent reconfigurations from satellite motion and user mobility challenge cascading failure analysis. Valdez et al. [<xref ref-type="bibr" rid="ref-16">16</xref>] reviewed cascading failures in dynamic networks; Xiao et al. [<xref ref-type="bibr" rid="ref-17">17</xref>] emphasized need for time-varying SAGIN models.</p>
<p>Zhang et al. [<xref ref-type="bibr" rid="ref-18">18</xref>] proposed a LEO satellite dynamic model incorporating orbital mechanics. Xu et al. [<xref ref-type="bibr" rid="ref-19">19</xref>] examined cascading effects in UAV swarms. However, these address dynamics within single layers only. While advance single-layer dynamics, they do not extend to multi-layer SAGIN where space, air, and ground dynamics interact and amplify cascading effects&#x2014;motivating our time-varying topology modeling across all layers.</p>
</sec>
<sec id="s2_3">
<label>2.3</label>
<title>Coordinated Defense Mechanisms</title>
<p>In recent years, intelligent methods have been increasingly applied to network fault management. Cui et al. [<xref ref-type="bibr" rid="ref-20">20</xref>] employed multi-agent reinforcement learning for resource allocation in UAV networks, achieving dynamic optimization of communication and computation resources. Chen et al. [<xref ref-type="bibr" rid="ref-21">21</xref>] proposed a node collaborative defense mechanism based on game theory, formulating fault propagation as a non-cooperative game between attackers and defenders. However, these target isolated measures without integrated early warning, isolation, and self-healing. The fragmentation in existing defenses limits system-wide resilience&#x2014;directly motivating our closed-loop &#x201C;early warning-isolation-self-healing&#x201D; framework that coordinates prevention, suppression, and recovery phases.</p>
</sec>
<sec id="s2_4">
<label>2.4</label>
<title>Resource-Constrained Defense Optimization</title>
<p>Satellites operate under strict resource limits, often overlooked. Dakic et al. [<xref ref-type="bibr" rid="ref-22">22</xref>] analyzed vehicle-to-everything (V2X) reliability. Fang et al. [<xref ref-type="bibr" rid="ref-23">23</xref>] proposed DRL-driven resource allocation. Al-Zahrani et al. [<xref ref-type="bibr" rid="ref-24">24</xref>] reviewed 5th-Generation (5G) optimization. However, these prioritize performance over resilience, and AI-based methods remain computationally intensive. The impracticality of complex approaches on resource-constrained platforms motivates our lightweight linear programming formulation solved via greedy approximation, ensuring deployability on satellites and aerial platforms.</p>
<p>As summarized in <xref ref-type="table" rid="table-1">Table 1</xref>, existing research lacks a unified approach to SAGIN&#x2019;s heterogeneity, dynamism, and resource constraints. These gaps directly motivate our four contributions: a multi-factor cascading model addressing heterogeneity, a time-varying topology framework addressing dynamics, a closed-loop defense addressing coordination, and a lightweight optimization addressing resource constraints&#x2014;all building upon and extending prior work to the SAGIN context.</p>
<table-wrap id="table-1">
<label>Table 1</label>
<caption>
<title>Comparison of related work.</title>
</caption>
<table>
<colgroup>
<col align="center"/>
<col align="center"/>
<col align="center"/>
<col align="center"/>
</colgroup>
<thead>
<tr>
<th>Category</th>
<th>Representative Works</th>
<th>Key Limitations</th>
<th>This Paper</th>
</tr>
</thead>
<tbody>
<tr>
<td>Heterogeneous Modeling</td>
<td>Liu et al. [<xref ref-type="bibr" rid="ref-13">13</xref>], Zhang and Du [<xref ref-type="bibr" rid="ref-14">14</xref>], Wang et al. [<xref ref-type="bibr" rid="ref-15">15</xref>]</td>
<td>Single-layer focus, no cross-layer integration</td>
<td>Multi-factor coupled model with cross-layer heterogeneity</td>
</tr>
<tr>
<td>Dynamic Topology</td>
<td>Valdez et al. [<xref ref-type="bibr" rid="ref-16">16</xref>], Zhang et al. [<xref ref-type="bibr" rid="ref-18">18</xref>], Xu et al. [<xref ref-type="bibr" rid="ref-19">19</xref>]</td>
<td>Dynamics within single layers only</td>
<td>Time-varying topology modeling across all layers</td>
</tr>
<tr>
<td>Coordinated Defense</td>
<td>Cui et al. [<xref ref-type="bibr" rid="ref-20">20</xref>], Chen et al. [<xref ref-type="bibr" rid="ref-21">21</xref>], Zhang et al. [<xref ref-type="bibr" rid="ref-18">18</xref>]</td>
<td>Fragmented measures, no closed-loop integration</td>
<td>&#x201C;Early warning-isolation-self-healing&#x201D; closed-loop defense</td>
</tr>
<tr>
<td>Resource Constraints</td>
<td>Fang et al. [<xref ref-type="bibr" rid="ref-23">23</xref>], Al-Zahrani et al. [<xref ref-type="bibr" rid="ref-24">24</xref>]</td>
<td>Performance-focused, computationally intensive</td>
<td>Lightweight linear programming with greedy approximation</td>
</tr>
</tbody>
</table>
</table-wrap>
</sec>
</sec>
<sec id="s3">
<label>3</label>
<title>Architecture and Topology</title>
<p>As show in the <xref ref-type="fig" rid="fig-1">Fig. 1</xref>, the architecture of the SAGIN can be divided into three core levels, each level collaboratively achieving resource scheduling and service delivery.</p>
<fig id="fig-1">
<label>Figure 1</label>
<caption>
<title>SAGIN hierarchical architecture with heterogeneous node types and link connections.</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_81224-fig-1.tif"/>
</fig>
<sec id="s3_1">
<label>3.1</label>
<title>SAGIN Resilience Modeling</title>
<p>The space layer comprises LEO, medium Earth orbit (MEO), and high Earth orbit (HEO) satellites delivering wide-area coverage and long-distance communications. LEO satellites offer low latency and high bandwidth but require constellation networking for global coverage; MEO satellites balance coverage and latency for regional needs; HEO satellites provide extensive regional coverage with higher latency and limited bandwidth. Satellite nodes face challenges including frequent link handovers and power constraints due to orbital mechanics.</p>
<p>The aerial layer consists of drones and high-altitude airships acting as relay hubs between space and ground layers, enhancing regional communication and supporting edge computing. Drones offer flexible deployment and rapid repositioning, while airships provide extended endurance and wide coverage. Both face reliability fluctuations due to weather and energy constraints. Inter-layer communication is enabled by gateway nodes such as satellite ground stations and multi-mode UAVs, explicitly modeled in our simulation. The ground layer comprises 5G base stations, core network equipment, and end-user devices. Base stations provide ample computing power, stable links, and low latency; core network equipment manages resource allocation and data routing as the operational hub [<xref ref-type="bibr" rid="ref-25">25</xref>], end-user devices&#x2014;IoT devices, smartphones, and vehicles&#x2014;act as service initiators and recipients. Due to limited ground coverage, wide-area coordination depends on the space-air layer.</p>
</sec>
<sec id="s3_2">
<label>3.2</label>
<title>Topological Dynamism and Heterogeneity</title>
<p>Topological Dynamism: Satellite motion, aerial platform repositioning, and mobile ground users cause frequent link handovers and topology reconfigurations, creating a highly dynamic SAGIN topology characterized by time-varying connectivity [<xref ref-type="bibr" rid="ref-26">26</xref>].</p>
<p>Topological Heterogeneity: Space, air, and ground nodes differ significantly in physical characteristics, resource capabilities [<xref ref-type="bibr" rid="ref-27">27</xref>], and communication protocols. Satellite links suffer from free-space loss and rain fade, causing fluctuations in delay, bandwidth, and loss rate; air links are affected by weather and platform vibrations; ground links operate in stable environments with ample bandwidth and low latency. These disparities across link types increase the complexity of network coordination and fault propagation analysis. The topology is a hybrid of three-layer hierarchical architecture with intra-layer mesh connectivity.</p>
</sec>
<sec id="s3_3">
<label>3.3</label>
<title>Improved Cascading Fault Model Based on Load Balancing</title>
<p>Building upon foundational load-capacity coupling models, we extend the classical framework to accommodate SAGIN heterogeneity. The classical model defines node failure when load exceeds capacity, triggering load redistribution to neighbors. However, this model assumes static topology and homogeneous nodes, limiting its applicability to SAGIN. Our improved model incorporates multi-dimensional load definitions, link-type dependent propagation probabilities, and dynamic load evolution to capture SAGIN-specific characteristics. Node load is defined as the weighted sum of computational task load, data transmission load, and energy consumption load, calculated as
<disp-formula id="eqn-1"><label>(1)</label><mml:math id="mml-eqn-1" display="block"><mml:msub><mml:mi>L</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:msub><mml:mi>w</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:msub><mml:mi>L</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>c</mml:mi><mml:mi>o</mml:mi><mml:mi>m</mml:mi><mml:mi>p</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>w</mml:mi><mml:mn>2</mml:mn></mml:msub><mml:msub><mml:mi>L</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi><mml:mi>r</mml:mi><mml:mi>a</mml:mi><mml:mi>n</mml:mi><mml:mi>s</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>w</mml:mi><mml:mn>3</mml:mn></mml:msub><mml:msub><mml:mi>L</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:mi>e</mml:mi><mml:mi>r</mml:mi><mml:mi>g</mml:mi><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></disp-formula>based on SAGIN node resource characteristics. The coefficients <inline-formula id="ieqn-1"><mml:math id="mml-ieqn-1"><mml:msub><mml:mi>w</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:math></inline-formula>, <inline-formula id="ieqn-2"><mml:math id="mml-ieqn-2"><mml:msub><mml:mi>w</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:math></inline-formula>, and <inline-formula id="ieqn-3"><mml:math id="mml-ieqn-3"><mml:msub><mml:mi>w</mml:mi><mml:mn>3</mml:mn></mml:msub></mml:math></inline-formula> are determined by node type and application scenarios using the Analytic Hierarchy Process (AHP), a multi-criteria decision-making method that systematically combines expert knowledge and network operational objectives. For instance, satellite nodes, with limited power budgets, are assigned higher energy consumption load coefficients (<inline-formula id="ieqn-4"><mml:math id="mml-ieqn-4"><mml:msub><mml:mi>w</mml:mi><mml:mn>3</mml:mn></mml:msub><mml:mo>&#x003E;</mml:mo><mml:msub><mml:mi>w</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>w</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:math></inline-formula>), while ground base stations, with stable power supply, prioritize computational and data transmission loads (<inline-formula id="ieqn-5"><mml:math id="mml-ieqn-5"><mml:msub><mml:mi>w</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>w</mml:mi><mml:mn>2</mml:mn></mml:msub><mml:mo>&#x003E;</mml:mo><mml:msub><mml:mi>w</mml:mi><mml:mn>3</mml:mn></mml:msub></mml:math></inline-formula>). This approach ensures that weight selection is grounded in domain expertise rather than arbitrary assignment. Node capacity, representing the maximum load a node can handle, is defined as the minimum of computational capacity, transmission capacity, and energy capacity,
<disp-formula id="eqn-2"><label>(2)</label><mml:math id="mml-eqn-2" display="block"><mml:msub><mml:mi>C</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mo movablelimits="true" form="prefix">min</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>C</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>c</mml:mi><mml:mi>o</mml:mi><mml:mi>m</mml:mi><mml:mi>p</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>C</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi><mml:mi>r</mml:mi><mml:mi>a</mml:mi><mml:mi>n</mml:mi><mml:mi>s</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>C</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:mi>e</mml:mi><mml:mi>r</mml:mi><mml:mi>g</mml:mi><mml:mi>y</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">)</mml:mo></mml:math></disp-formula></p>
<p><inline-formula id="ieqn-6"><mml:math id="mml-ieqn-6"><mml:msub><mml:mi>C</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>c</mml:mi><mml:mi>o</mml:mi><mml:mi>m</mml:mi><mml:mi>p</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> denotes the computational capacity of node <inline-formula id="ieqn-7"><mml:math id="mml-ieqn-7"><mml:mi>i</mml:mi></mml:math></inline-formula>, measured by its maximum supported CPU utilization; <inline-formula id="ieqn-8"><mml:math id="mml-ieqn-8"><mml:msub><mml:mi>C</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi><mml:mi>r</mml:mi><mml:mi>a</mml:mi><mml:mi>n</mml:mi><mml:mi>s</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> represents the transmission capacity of node <inline-formula id="ieqn-9"><mml:math id="mml-ieqn-9"><mml:mi>i</mml:mi></mml:math></inline-formula>, quantified by its maximum supported bandwidth occupancy; <inline-formula id="ieqn-10"><mml:math id="mml-ieqn-10"><mml:msub><mml:mi>C</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:mi>e</mml:mi><mml:mi>r</mml:mi><mml:mi>g</mml:mi><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> indicates the energy capacity of node <inline-formula id="ieqn-11"><mml:math id="mml-ieqn-11"><mml:mi>i</mml:mi></mml:math></inline-formula>, defined by the load threshold corresponding to the minimum remaining energy ratio.</p>
<p>The initial failure node is selected based on a node failure probability model. The failure probability <inline-formula id="ieqn-12"><mml:math id="mml-ieqn-12"><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>f</mml:mi><mml:mi>a</mml:mi><mml:mi>i</mml:mi><mml:mi>l</mml:mi><mml:mo>,</mml:mo><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> of a node depends on its operational time <inline-formula id="ieqn-13"><mml:math id="mml-ieqn-13"><mml:mi>t</mml:mi></mml:math></inline-formula>, resource consumption rate <inline-formula id="ieqn-14"><mml:math id="mml-ieqn-14"><mml:msub><mml:mi>r</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:math></inline-formula>, and external environmental interference intensity <inline-formula id="ieqn-15"><mml:math id="mml-ieqn-15"><mml:msub><mml:mi>s</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:math></inline-formula>, defined as
<disp-formula id="eqn-3"><label>(3)</label><mml:math id="mml-eqn-3" display="block"><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>f</mml:mi><mml:mi>a</mml:mi><mml:mi>i</mml:mi><mml:mi>l</mml:mi><mml:mo>,</mml:mo><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>&#x2212;</mml:mo><mml:msup><mml:mi>e</mml:mi><mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mi>&#x03B1;</mml:mi><mml:mi>t</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mi>&#x03B2;</mml:mi><mml:msub><mml:mi>r</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>&#x2212;</mml:mo><mml:mi>&#x03B3;</mml:mi><mml:msub><mml:mi>s</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:msup></mml:math></disp-formula>where <inline-formula id="ieqn-16"><mml:math id="mml-ieqn-16"><mml:mi>&#x03B1;</mml:mi></mml:math></inline-formula>, <inline-formula id="ieqn-17"><mml:math id="mml-ieqn-17"><mml:mi>&#x03B2;</mml:mi></mml:math></inline-formula>, and <inline-formula id="ieqn-18"><mml:math id="mml-ieqn-18"><mml:mi>&#x03B3;</mml:mi></mml:math></inline-formula> are scaling factors. Through random sampling, the initial failure node set is determined according to each node&#x2019;s failure probability. When node <inline-formula id="ieqn-19"><mml:math id="mml-ieqn-19"><mml:mi>i</mml:mi></mml:math></inline-formula> fails, its load <inline-formula id="ieqn-20"><mml:math id="mml-ieqn-20"><mml:msub><mml:mi>L</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:math></inline-formula> migrates to adjacent healthy nodes following these rules: First, adjacent nodes are ranked by link priority coefficient <inline-formula id="ieqn-21"><mml:math id="mml-ieqn-21"><mml:msub><mml:mi>p</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> (which correlates with link bandwidth, transmission delay, and reliability). Then, the load is evenly distributed to adjacent healthy nodes in descending order of priority, with the allocation ratio to node <inline-formula id="ieqn-22"><mml:math id="mml-ieqn-22"><mml:mi>j</mml:mi></mml:math></inline-formula> calculated as
<disp-formula id="eqn-4"><label>(4)</label><mml:math id="mml-eqn-4" display="block"><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>/</mml:mo></mml:mrow><mml:munder><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>j</mml:mi><mml:mo>&#x2208;</mml:mo><mml:msub><mml:mi>N</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:munder><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:math></disp-formula></p>
<p>If the remaining capacity of adjacent healthy nodes is insufficient to handle the migrated load, the remaining load continues to migrate to the next-level adjacent nodes.</p>
<p>To account for inter-layer link attenuation, the fault propagation probability <inline-formula id="ieqn-23"><mml:math id="mml-ieqn-23"><mml:msub><mml:mi>P</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> is defined as the probability of a node <inline-formula id="ieqn-24"><mml:math id="mml-ieqn-24"><mml:mi>i</mml:mi></mml:math></inline-formula>&#x2019;s fault propagating to node <inline-formula id="ieqn-25"><mml:math id="mml-ieqn-25"><mml:mi>j</mml:mi></mml:math></inline-formula>, given by<disp-formula id="eqn-5"><label>(5)</label><mml:math id="mml-eqn-5" display="block"><mml:msub><mml:mi>P</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:msub><mml:mi>L</mml:mi><mml:mrow><mml:mi>j</mml:mi><mml:mo>,</mml:mo><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>c</mml:mi><mml:mi>e</mml:mi><mml:mi>i</mml:mi><mml:mi>v</mml:mi><mml:mi>e</mml:mi><mml:mi>d</mml:mi></mml:mrow></mml:msub><mml:msub><mml:mi>C</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:mfrac><mml:mo>&#x22C5;</mml:mo><mml:msub><mml:mi>&#x03B7;</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:math></disp-formula>where, <inline-formula id="ieqn-26"><mml:math id="mml-ieqn-26"><mml:msub><mml:mi>L</mml:mi><mml:mrow><mml:mi>j</mml:mi><mml:mo>,</mml:mo><mml:mtext>received</mml:mtext></mml:mrow></mml:msub></mml:math></inline-formula> represents the received migration load at node <inline-formula id="ieqn-27"><mml:math id="mml-ieqn-27"><mml:mi>j</mml:mi></mml:math></inline-formula>, while <inline-formula id="ieqn-28"><mml:math id="mml-ieqn-28"><mml:msub><mml:mi>&#x03B7;</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> is the link attenuation coefficient, which varies with the link type. The attenuation coefficients decrease progressively from inter-satellite links to space-ground links, with terrestrial links exhibiting the lowest attenuation.</p>
<p>To describe the dynamic changes of load over time (reflecting business growth or sudden traffic surges), the load dynamic evolution formula is introduced:<disp-formula id="eqn-6"><label>(6)</label><mml:math id="mml-eqn-6" display="block"><mml:msub><mml:mi>L</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:msub><mml:mi>L</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>+</mml:mo><mml:mi mathvariant="normal">&#x0394;</mml:mi><mml:msub><mml:mi>L</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mrow><mml:mtext>external</mml:mtext></mml:mrow></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>+</mml:mo><mml:munder><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>j</mml:mi><mml:mo>&#x2208;</mml:mo><mml:msub><mml:mi>N</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:munder><mml:mi mathvariant="normal">&#x0394;</mml:mi><mml:msub><mml:mi>L</mml:mi><mml:mrow><mml:mi>j</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></disp-formula>where <inline-formula id="ieqn-29"><mml:math id="mml-ieqn-29"><mml:mi>D</mml:mi><mml:mi>e</mml:mi><mml:mi>l</mml:mi><mml:mi>t</mml:mi><mml:mi>a</mml:mi><mml:msub><mml:mi>L</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mtext>external</mml:mtext></mml:mrow></mml:msub></mml:math></inline-formula> denotes the externally added load, and <inline-formula id="ieqn-30"><mml:math id="mml-ieqn-30"><mml:mi>s</mml:mi><mml:mi>u</mml:mi><mml:msub><mml:mi>m</mml:mi><mml:mrow><mml:mi>j</mml:mi><mml:mo>&#x2208;</mml:mo><mml:msub><mml:mi>N</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:msub><mml:mi mathvariant="normal">&#x0394;</mml:mi><mml:msub><mml:mi>L</mml:mi><mml:mrow><mml:mi>j</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> represents the migrated load from neighboring node <inline-formula id="ieqn-31"><mml:math id="mml-ieqn-31"><mml:mi>j</mml:mi></mml:math></inline-formula>, load transfer during fault propagation.</p>
<p>The recovery process of faulty nodes can be described by a time and resource-based recovery probability model:<disp-formula id="eqn-7"><label>(7)</label><mml:math id="mml-eqn-7" display="block"><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mrow><mml:mtext>recover</mml:mtext></mml:mrow><mml:mo>,</mml:mo><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>&#x2212;</mml:mo><mml:mi>exp</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>&#x03BB;</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></disp-formula>where <inline-formula id="ieqn-32"><mml:math id="mml-ieqn-32"><mml:msub><mml:mi>&#x03BB;</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:math></inline-formula> is the recovery rate coefficient positively correlated with node resources (e.g., computing power, energy), and <inline-formula id="ieqn-33"><mml:math id="mml-ieqn-33"><mml:mi>t</mml:mi></mml:math></inline-formula> is the fault duration.</p>
<p>Early warning threshold formula provides a quantitative early warning trigger condition for fault prediction based on multi-source information fusion.<disp-formula id="eqn-8"><label>(8)</label><mml:math id="mml-eqn-8" display="block"><mml:mrow><mml:mtext>Alert if:&#xA0;</mml:mtext></mml:mrow><mml:msub><mml:mrow><mml:mover><mml:mi>L</mml:mi><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow><mml:mi>i</mml:mi></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo>+</mml:mo><mml:mi mathvariant="normal">&#x0394;</mml:mi><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>&#x003E;</mml:mo><mml:mi>&#x03B8;</mml:mi><mml:mo>&#x22C5;</mml:mo><mml:msub><mml:mi>C</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mspace width="1em" /><mml:mrow><mml:mtext>or</mml:mtext></mml:mrow><mml:mspace width="1em" /><mml:msub><mml:mrow><mml:mover><mml:mi>Q</mml:mi><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo>+</mml:mo><mml:mi mathvariant="normal">&#x0394;</mml:mi><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>&#x003C;</mml:mo><mml:msub><mml:mi>Q</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mi>h</mml:mi></mml:mrow></mml:msub></mml:math></disp-formula>where <inline-formula id="ieqn-34"><mml:math id="mml-ieqn-34"><mml:msub><mml:mrow><mml:mover><mml:mi>L</mml:mi><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow><mml:mi>i</mml:mi></mml:msub></mml:math></inline-formula> is the predicted load, <inline-formula id="ieqn-35"><mml:math id="mml-ieqn-35"><mml:mi>&#x03B8;</mml:mi></mml:math></inline-formula> is the safety factor, <inline-formula id="ieqn-36"><mml:math id="mml-ieqn-36"><mml:msub><mml:mrow><mml:mover><mml:mi>Q</mml:mi><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> is the predicted link quality, and <inline-formula id="ieqn-37"><mml:math id="mml-ieqn-37"><mml:msub><mml:mi>Q</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mi>h</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> is the quality threshold. A summary of the key variables and their notations is provided in <xref ref-type="table" rid="table-2">Table 2</xref>.</p>
<table-wrap id="table-2">
<label>Table 2</label>
<caption>
<title>Summary of key variables and notations.</title>
</caption>
<table>
<colgroup>
<col align="center"/>
<col align="center"/>
<col align="center"/>
<col align="center"/>
<col align="center"/>
<col align="center"/>
</colgroup>
<thead>
<tr>
<th>Variable</th>
<th>Definition</th>
<th>Physical Meaning</th>
<th>Variable</th>
<th>Definition</th>
<th>Physical Meaning</th>
</tr>
</thead>
<tbody>
<tr>
<td><inline-formula id="ieqn-38"><mml:math id="mml-ieqn-38"><mml:msub><mml:mi>L</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:math></inline-formula></td>
<td>Node load</td>
<td>Weighted sum of comp/<break/>trans/energy load of node <inline-formula id="ieqn-39"><mml:math id="mml-ieqn-39"><mml:mi>i</mml:mi></mml:math></inline-formula></td>
<td><inline-formula id="ieqn-40"><mml:math id="mml-ieqn-40"><mml:msub><mml:mi>L</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>c</mml:mi><mml:mi>o</mml:mi><mml:mi>m</mml:mi><mml:mi>p</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula></td>
<td>Computational load</td>
<td>CPU utilization of node <inline-formula id="ieqn-41"><mml:math id="mml-ieqn-41"><mml:mi>i</mml:mi></mml:math></inline-formula></td>
</tr>
<tr>
<td><inline-formula id="ieqn-42"><mml:math id="mml-ieqn-42"><mml:msub><mml:mi>L</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi><mml:mi>r</mml:mi><mml:mi>a</mml:mi><mml:mi>n</mml:mi><mml:mi>s</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula></td>
<td>Transmission load</td>
<td>Bandwidth occupancy of node <inline-formula id="ieqn-43"><mml:math id="mml-ieqn-43"><mml:mi>i</mml:mi></mml:math></inline-formula></td>
<td><inline-formula id="ieqn-44"><mml:math id="mml-ieqn-44"><mml:msub><mml:mi>L</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:mi>e</mml:mi><mml:mi>r</mml:mi><mml:mi>g</mml:mi><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula></td>
<td>Energy load</td>
<td>Reciprocal of remaining energy ratio of node <inline-formula id="ieqn-45"><mml:math id="mml-ieqn-45"><mml:mi>i</mml:mi></mml:math></inline-formula></td>
</tr>
<tr>
<td><inline-formula id="ieqn-46"><mml:math id="mml-ieqn-46"><mml:msub><mml:mi>w</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>w</mml:mi><mml:mn>2</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>w</mml:mi><mml:mn>3</mml:mn></mml:msub></mml:math></inline-formula></td>
<td>Load weights</td>
<td>Coefficients for node type/scenario</td>
<td><inline-formula id="ieqn-47"><mml:math id="mml-ieqn-47"><mml:msub><mml:mi>C</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:math></inline-formula></td>
<td>Node capacity</td>
<td>Max load node <inline-formula id="ieqn-48"><mml:math id="mml-ieqn-48"><mml:mi>i</mml:mi></mml:math></inline-formula> can handle (min of comp/trans/energy)</td>
</tr>
<tr>
<td><inline-formula id="ieqn-49"><mml:math id="mml-ieqn-49"><mml:msub><mml:mi>C</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>c</mml:mi><mml:mi>o</mml:mi><mml:mi>m</mml:mi><mml:mi>p</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula></td>
<td>Computational capacity</td>
<td>Max supported CPU utilization of node <inline-formula id="ieqn-50"><mml:math id="mml-ieqn-50"><mml:mi>i</mml:mi></mml:math></inline-formula></td>
<td><inline-formula id="ieqn-51"><mml:math id="mml-ieqn-51"><mml:msub><mml:mi>C</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi><mml:mi>r</mml:mi><mml:mi>a</mml:mi><mml:mi>n</mml:mi><mml:mi>s</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula></td>
<td>Transmission capacity</td>
<td>Max supported bandwidth occupancy of node <inline-formula id="ieqn-52"><mml:math id="mml-ieqn-52"><mml:mi>i</mml:mi></mml:math></inline-formula></td>
</tr>
<tr>
<td><inline-formula id="ieqn-53"><mml:math id="mml-ieqn-53"><mml:msub><mml:mi>C</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:mi>e</mml:mi><mml:mi>r</mml:mi><mml:mi>g</mml:mi><mml:mi>y</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula></td>
<td>Energy capacity</td>
<td>Load threshold for min remaining energy</td>
<td><inline-formula id="ieqn-54"><mml:math id="mml-ieqn-54"><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>f</mml:mi><mml:mi>a</mml:mi><mml:mi>i</mml:mi><mml:mi>l</mml:mi><mml:mo>,</mml:mo><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula></td>
<td>Node failure probability</td>
<td>Probability node <inline-formula id="ieqn-55"><mml:math id="mml-ieqn-55"><mml:mi>i</mml:mi></mml:math></inline-formula> fails (time/resource/env)</td>
</tr>
<tr>
<td><inline-formula id="ieqn-56"><mml:math id="mml-ieqn-56"><mml:mi>&#x03B1;</mml:mi><mml:mo>,</mml:mo><mml:mi>&#x03B2;</mml:mi><mml:mo>,</mml:mo><mml:mi>&#x03B3;</mml:mi></mml:math></inline-formula></td>
<td>Scaling factors</td>
<td>Parameters scaling failure probability impact</td>
<td><inline-formula id="ieqn-57"><mml:math id="mml-ieqn-57"><mml:msub><mml:mi>p</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></td>
<td>Link priority coefficient</td>
<td>Priority of link <inline-formula id="ieqn-58"><mml:math id="mml-ieqn-58"><mml:mo stretchy="false">(</mml:mo><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> (bandwidth/delay/reliability)</td>
</tr>
<tr>
<td><inline-formula id="ieqn-59"><mml:math id="mml-ieqn-59"><mml:msub><mml:mi>P</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></td>
<td>Fault propagation probability</td>
<td>Probability failure of <inline-formula id="ieqn-60"><mml:math id="mml-ieqn-60"><mml:mi>i</mml:mi></mml:math></inline-formula> propagates to <inline-formula id="ieqn-61"><mml:math id="mml-ieqn-61"><mml:mi>j</mml:mi></mml:math></inline-formula></td>
<td><inline-formula id="ieqn-62"><mml:math id="mml-ieqn-62"><mml:msub><mml:mi>L</mml:mi><mml:mrow><mml:mi>j</mml:mi><mml:mo>,</mml:mo><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>c</mml:mi><mml:mi>o</mml:mi><mml:mi>v</mml:mi><mml:mi>e</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>d</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula></td>
<td>Received migration load</td>
<td>Load received by <inline-formula id="ieqn-63"><mml:math id="mml-ieqn-63"><mml:mi>j</mml:mi></mml:math></inline-formula> from failed nodes</td>
</tr>
<tr>
<td><inline-formula id="ieqn-64"><mml:math id="mml-ieqn-64"><mml:msub><mml:mi>&#x03B7;</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></td>
<td>Link attenuation coefficient</td>
<td>Attenuation factor for link <inline-formula id="ieqn-65"><mml:math id="mml-ieqn-65"><mml:mo stretchy="false">(</mml:mo><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> (sat/air/terr)</td>
<td><inline-formula id="ieqn-66"><mml:math id="mml-ieqn-66"><mml:mi mathvariant="normal">&#x0394;</mml:mi><mml:msub><mml:mi>L</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>e</mml:mi><mml:mi>x</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:mi>r</mml:mi><mml:mi>n</mml:mi><mml:mi>a</mml:mi><mml:mi>l</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula></td>
<td>External load addition</td>
<td>Load increase from business/traffic surge</td>
</tr>
<tr>
<td><inline-formula id="ieqn-67"><mml:math id="mml-ieqn-67"><mml:mi mathvariant="normal">&#x0394;</mml:mi><mml:msub><mml:mi>L</mml:mi><mml:mrow><mml:mi>j</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula></td>
<td>Migrated load</td>
<td>Load transferred from <inline-formula id="ieqn-68"><mml:math id="mml-ieqn-68"><mml:mi>j</mml:mi></mml:math></inline-formula> to <inline-formula id="ieqn-69"><mml:math id="mml-ieqn-69"><mml:mi>i</mml:mi></mml:math></inline-formula></td>
<td><inline-formula id="ieqn-70"><mml:math id="mml-ieqn-70"><mml:msub><mml:mi>P</mml:mi><mml:mrow><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>c</mml:mi><mml:mi>o</mml:mi><mml:mi>v</mml:mi><mml:mi>e</mml:mi><mml:mi>r</mml:mi><mml:mo>,</mml:mo><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula></td>
<td>Recovery probability</td>
<td>Probability <inline-formula id="ieqn-71"><mml:math id="mml-ieqn-71"><mml:mi>i</mml:mi></mml:math></inline-formula> recovers within time <inline-formula id="ieqn-72"><mml:math id="mml-ieqn-72"><mml:mi>t</mml:mi></mml:math></inline-formula></td>
</tr>
<tr>
<td><inline-formula id="ieqn-73"><mml:math id="mml-ieqn-73"><mml:msub><mml:mi>&#x03BB;</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:math></inline-formula></td>
<td>Recovery rate coefficient</td>
<td>Correlated with node resources (comp/energy)</td>
<td><inline-formula id="ieqn-74"><mml:math id="mml-ieqn-74"><mml:msub><mml:mrow><mml:mover><mml:mi>L</mml:mi><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow><mml:mi>i</mml:mi></mml:msub></mml:math></inline-formula></td>
<td>Predicted load</td>
<td>Load forecast for node <inline-formula id="ieqn-75"><mml:math id="mml-ieqn-75"><mml:mi>i</mml:mi></mml:math></inline-formula></td>
</tr>
<tr>
<td><inline-formula id="ieqn-76"><mml:math id="mml-ieqn-76"><mml:mi>&#x03B8;</mml:mi></mml:math></inline-formula></td>
<td>Safety factor</td>
<td>Threshold coefficient for early warning</td>
<td><inline-formula id="ieqn-77"><mml:math id="mml-ieqn-77"><mml:msub><mml:mrow><mml:mover><mml:mi>Q</mml:mi><mml:mo stretchy="false">&#x005E;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula></td>
<td>Predicted link quality</td>
<td>Quality forecast for link <inline-formula id="ieqn-78"><mml:math id="mml-ieqn-78"><mml:mo stretchy="false">(</mml:mo><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula></td>
</tr>
<tr>
<td><inline-formula id="ieqn-79"><mml:math id="mml-ieqn-79"><mml:msub><mml:mi>Q</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mi>h</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula></td>
<td>Quality threshold</td>
<td>Minimum acceptable link quality</td>
<td></td>
<td></td>
<td></td>
</tr>
</tbody>
</table>
</table-wrap>
</sec>
</sec>
<sec id="s4">
<label>4</label>
<title>Cascade Fault Defense and Self-Healing Algorithm Design</title>
<p>The proposed defense strategy establishes a prevention-inhibition-recovery framework. Prevention optimizes resource allocation and protects critical nodes to balance load and minimize initial failures. Upon fault detection, rapid detection, load diversion, and link isolation contain faults locally. Recovery restores failed nodes via fast localization, topology reconstruction, and redundant resource scheduling, minimizing service interruption. Resource allocation is optimized throughout to reduce overhead, ensuring engineering feasibility on resource-constrained platforms.</p>
<sec id="s4_1">
<label>4.1</label>
<title>Layered Cooperative Defense Mechanism</title>
<p>The prevention stage optimizes resource allocation according to the importance of the node, evaluated by means of a composite metric that combines centrality of the between, centrality of the degree and functional dependency. Blockchain-enabled collaborative frameworks have shown promise in securing resource coordination across distributed logistics networks [<xref ref-type="bibr" rid="ref-28">28</xref>], inspiring our trusted resource allocation design. Betweenness centrality reflects routing significance, degree centrality indicates connectivity density, and functional dependency quantifies inter-node functional reliance. The node importance index <inline-formula id="ieqn-80"><mml:math id="mml-ieqn-80"><mml:msub><mml:mi>I</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mi>a</mml:mi><mml:msub><mml:mi>B</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>+</mml:mo><mml:mi>b</mml:mi><mml:msub><mml:mi>D</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>+</mml:mo><mml:mi>c</mml:mi><mml:msub><mml:mi>F</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:math></inline-formula> uses weights <inline-formula id="ieqn-81"><mml:math id="mml-ieqn-81"><mml:mi>a</mml:mi></mml:math></inline-formula>, <inline-formula id="ieqn-82"><mml:math id="mml-ieqn-82"><mml:mi>b</mml:mi></mml:math></inline-formula>, and <inline-formula id="ieqn-83"><mml:math id="mml-ieqn-83"><mml:mi>c</mml:mi></mml:math></inline-formula> determined by the AHP, a multi-criteria decision method that quantifies the relative importance of different centrality metrics without introducing prohibitive computational overhead. Resources are allocated proportionally to these indices. High-importance hub nodes, including high-orbit satellites and core ground base stations, receive priority allocation of bandwidth, computing power, and energy to enhance capacity and fault tolerance, alongside dedicated redundant backups such as standby satellites and redundant links. Regular nodes have their resource ratios dynamically adjusted based on service demand and current load to maintain network load balancing.</p>
<p>The suppression stage implements proactive load diversion triggered by fault precursor detection. A multi-source fusion prediction model collects real-time node status, link performance, and topology evolution data. Long Short-Term Memory time-series analysis identifies precursor features, predicting potential faults and locating at-risk nodes and links ahead of occurrence. Upon detecting precursors, dynamic load diversion is activated. Partial loads from at-risk nodes are preemptively migrated to adjacent healthy nodes, with paths selected based on node capacity, link quality, and service priority. Idle unmanned aerial vehicles are deployed to fault-prone areas to establish temporary links, facilitating load offloading and coverage maintenance. A link priority mechanism prioritizes core services for bandwidth allocation; non-core services may be temporarily suspended to contain fault propagation and protect critical network functionality.</p>
</sec>
<sec id="s4_2">
<label>4.2</label>
<title>Lightweight Self-Healing Algorithm Implementation</title>
<p>The system achieves rapid fault identification via link quality monitoring and node heartbeat feedback. Link reliability is measured by transmission latency, bandwidth, and packet loss rate. Node failures are detected through periodic heartbeat exchanges with multi-node collaborative verification. Algorithm 1 formalizes this process.</p>
<fig id="fig-9">
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_81224-fig-9.tif"/>
</fig>
<p>Upon fault detection, the system reconstructs topology through a greedy strategy, prioritizing nearby healthy nodes with sufficient residual capacity. For satellite layers, pre-planned reconnection procedures based on orbital predictions are applied. Core link failures trigger redundant link activation with dynamic bandwidth adjustment. Algorithm 2 details the reconstruction process.</p>
<fig id="fig-10">
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_81224-fig-10.tif"/>
</fig>
<p>This reconstruction problem can be viewed as a linear program: maximize successfully rerouted flows subject to node capacity constraints. The greedy algorithm provides an approximate solution with significantly lower overhead than exact solvers.</p>
<p>Algorithm 1 has time complexity <inline-formula id="ieqn-108"><mml:math id="mml-ieqn-108"><mml:mi>O</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>N</mml:mi><mml:mo>+</mml:mo><mml:mi>E</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula>; Algorithm 2 achieves <inline-formula id="ieqn-109"><mml:math id="mml-ieqn-109"><mml:mi>O</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>N</mml:mi><mml:mi>log</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mi>N</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula>. Both have space complexity <inline-formula id="ieqn-110"><mml:math id="mml-ieqn-110"><mml:mi>O</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>N</mml:mi><mml:mo>+</mml:mo><mml:mi>E</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula>, meeting real-time requirements on resource-constrained platforms.</p>
</sec>
</sec>
<sec id="s5">
<label>5</label>
<title>Experimental Result</title>
<p>This section validates the proposed model and defense strategies through four experiments: cascading failure propagation analysis examining topology density and load threshold impacts, model prediction accuracy comparing our multi-factor model with the Cascading Failure Model (CASCADE), defense performance evaluation quantifying advantages of our closed-loop strategy over traditional approaches, and strategy differentiation analyzing performance differences among six specific defense schemes. The experimental environment settings, including simulation tools, network scale, node/link parameters, and fault scenarios, are detailed first. These six defense strategies are S1 (Proposed), a closed-loop approach integrating early warning, isolation, and self-healing; S2, static redundancy backup; S3, static load balancing; S4, early warning only; S5, adaptive isolation only; and S6, rule-based self-healing. This comparative assessment isolates the contribution of each individual component and substantiates the superiority of their integrated operation in the proposed S1 strategy. The following presents the detailed experimental process and results.</p>
<sec id="s5_1">
<label>5.1</label>
<title>Experimental Design and Results Verification</title>
<p>This experiment employs NS-3 as the primary simulation tool for network-level modeling, supporting heterogeneous node configuration, mobility patterns, and link-level performance simulation. MATLAB is integrated for offline data processing, model solving, and visualization. The co-simulation operates iteratively: NS-3 generates trace files containing link delays, packet loss rates, and throughput at each time step; MATLAB reads these traces, computes node loads and failure probabilities using <xref ref-type="disp-formula" rid="eqn-1">Eqs. (1)</xref>&#x2013;<xref ref-type="disp-formula" rid="eqn-8">(8)</xref>, and determines defense actions; updated configuration parameters are then fed back to NS-3 for the next simulation cycle. <xref ref-type="table" rid="table-3">Table 3</xref> shows the network scale settings. This modular approach requires no custom API-level interfacing, using standard file I/O for data exchange, ensuring ease of replicability. The combination of NS-3 and MATLAB ensures both authenticity and flexibility while meeting the experimental verification requirements.</p>
<table-wrap id="table-3">
<label>Table 3</label>
<caption>
<title>Network topology scale configuration (based on typical SAGIN testbed deployments).</title>
</caption>
<table>
<colgroup>
<col align="center"/>
<col align="center"/>
<col align="center"/>
</colgroup>
<thead>
<tr>
<th>Network Layer</th>
<th>Node Type</th>
<th>Node Quantity</th>
</tr>
</thead>
<tbody>
<tr>
<td rowspan="3">Satellite Layer</td>
<td>Low Earth Orbit (LEO) Satellite</td>
<td>10</td>
</tr>
<tr>

<td>Medium Earth Orbit (MEO) Satellite</td>
<td>5</td>
</tr>
<tr>

<td>Geostationary Earth Orbit (GEO) Satellite</td>
<td>2</td>
</tr>
<tr>
<td rowspan="2">Air Layer</td>
<td>UAV</td>
<td>20</td>
</tr>
<tr>

<td>High-Altitude Airship</td>
<td>5</td>
</tr>
<tr>
<td rowspan="2">Ground Layer</td>
<td>Ground Base Station</td>
<td>30</td>
</tr>
<tr>

<td>Terminal User Node</td>
<td>100</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>The node attribute parameter settings are shown in <xref ref-type="table" rid="table-4">Table 4</xref>.</p>
<table-wrap id="table-4">
<label>Table 4</label>
<caption>
<title>Node attribute parameter configuration (referencing operational data from Starlink and UAV networks [<xref ref-type="bibr" rid="ref-15">15</xref>]).</title>
</caption>
<table>
<colgroup>
<col align="center"/>
<col align="center"/>
<col align="center"/>
<col align="center"/>
</colgroup>
<thead>
<tr>
<th>Node Type</th>
<th>CPU Utilization</th>
<th>Bandwidth Utilization</th>
<th>Minimum Remaining Energy Ratio</th>
</tr>
</thead>
<tbody>
<tr>
<td>LEO Satellite</td>
<td>80%</td>
<td>90%</td>
<td>20%</td>
</tr>
<tr>
<td>MEO Satellite</td>
<td>70%</td>
<td>85%</td>
<td>25%</td>
</tr>
<tr>
<td>GEO Satellite</td>
<td>60%</td>
<td>80%</td>
<td>30%</td>
</tr>
<tr>
<td>UAV</td>
<td>50%</td>
<td>70%</td>
<td>15%</td>
</tr>
<tr>
<td>High-Altitude Airship</td>
<td>60%</td>
<td>75%</td>
<td>20%</td>
</tr>
<tr>
<td>Ground Base Station</td>
<td>90%</td>
<td>95%</td>
<td>Unrestricted (Stable Power Supply)</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>The link parameter settings are shown in <xref ref-type="table" rid="table-5">Table 5</xref>.</p>
<table-wrap id="table-5">
<label>Table 5</label>
<caption>
<title>Link parameter configuration (derived from 3GPP NTN standards and prior simulation studies [<xref ref-type="bibr" rid="ref-14">14</xref>]).</title>
</caption>
<table>
<colgroup>
<col align="center"/>
<col align="center"/>
<col align="center"/>
<col align="center"/>
</colgroup>
<thead>
<tr>
<th>Link Type</th>
<th>Transmission Delay</th>
<th>Bandwidth</th>
<th>Packet Loss Rate</th>
</tr>
</thead>
<tbody>
<tr>
<td>Inter-Satellite Link</td>
<td>50&#x2013;100 ms</td>
<td>100&#x2013;500 Mbps</td>
<td>0.1%&#x2013;0.5%</td>
</tr>
<tr>
<td>Satellite-Ground Link</td>
<td>100&#x2013;200 ms</td>
<td>50&#x2013;200 Mbps</td>
<td>0.5%&#x2013;1.0%</td>
</tr>
<tr>
<td>Air-Ground Link</td>
<td>50&#x2013;100 ms</td>
<td>30&#x2013;100 Mbps</td>
<td>1.0%&#x2013;2.0%</td>
</tr>
<tr>
<td>Ground Link</td>
<td>1&#x2013;10 ms</td>
<td>100&#x2013;1000 Mbps</td>
<td>0.01%&#x2013;0.1%</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>All experiments are based on three defined failure scenarios: LEO satellite node failure (simulated by disabling network interface), ground base station overload (CPU utilization exceeds threshold), and UAV swarm disconnection (introducing high path loss for air-ground links). These are implemented in NS-3 through custom modules that modify node status or environmental conditions at specified times. We conducted validation experiments on cascading failure propagation characteristics to analyze the relationship between topology density, load threshold, and both the propagation speed and impact scope of cascading failures. Different topology densities and load thresholds were configured, and multiple simulation experiments were performed across three typical failure scenarios. The time required for failure propagation to reach a stable state and the proportion of failed nodes were recorded.</p>
<p>For the density analysis in <xref ref-type="fig" rid="fig-2">Figs. 2</xref> and <xref ref-type="fig" rid="fig-3">3</xref>, we scaled this baseline by factors of 0.5, 1.0, and 1.5 to generate low (density &#x003D; 5), medium (density &#x003D; 10), and high (density &#x003D; 15) densities. This variable-controlling approach allows us to isolate the effect of network scale on fault propagation while preserving SAGIN&#x2019;s hierarchical structure.</p>
<fig id="fig-2">
<label>Figure 2</label>
<caption>
<title>Impact of topology density on fault propagation. Density values (5, 10, 15) correspond to 0.5&#x00D7;, 1.0&#x00D7;, and 1.5&#x00D7; scaling of baseline topology.</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_81224-fig-2.tif"/>
</fig><fig id="fig-3">
<label>Figure 3</label>
<caption>
<title>Impact of load threshold on fault propagation. Load thresholds delay propagation and reduce failure scope under fixed topology density.</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_81224-fig-3.tif"/>
</fig>
<p>As illustrated in <xref ref-type="fig" rid="fig-2">Fig. 2</xref>, under identical load thresholds, higher topology density accelerates failure propagation and expands its scope. For ground base station failure at load threshold 1.6, increasing density from 5 to 10 to 15 reduces stabilization time from 18 to 12 to 8 time units, while the failed node proportion rises from 35% to 55% to 70%. Tighter connectivity creates more propagation paths and accelerates load migration, facilitating rapid failure diffusion.</p>

<p>Conversely, as shown in <xref ref-type="fig" rid="fig-3">Fig. 3</xref>, under fixed topology density, higher load thresholds slow failure propagation and reduce its scope. For LEO satellite failure at density 10, raising the threshold from 1.2 to 1.6 to 2.0 increases stabilization time from 10 to 15 to 22 time units, while the failed node proportion drops from 65% to 45% to 25%. Higher thresholds enhance node bearing capacity, enabling nodes to absorb more migrated load and reduce secondary failures.</p>
<p>We validated our model against actual failure scenarios using LEO satellite failure. Our model achieved prediction errors of 5%&#x2013;8% for stabilization time and 4%&#x2013;7% for failed node proportion, compared to 20%&#x2013;25% and 15%&#x2013;20% for CASCADE. For an actual stabilization time of 15 time units, our model predicted 14&#x2013;16 units vs. CASCADE&#x2019;s 11&#x2013;19 units; for an actual failed node proportion of 45%, our model predicted 42%&#x2013;48% vs. CASCADE&#x2019;s 36%&#x2013;54%.</p>
<p>We further conducted comparative analyses between this model and CASCADE as well as Zhang and Du LEO-specific model [<xref ref-type="bibr" rid="ref-14">14</xref>], covering three scenarios (LEO satellites, ground base stations, and drone swarms). <xref ref-type="fig" rid="fig-4">Fig. 4</xref> presents a quantitative comparison of prediction errors among the three models. Building on the load-capacity framework, our model incorporates multi-dimensional loads and cross-layer propagation, capturing interdependencies across space, air, and ground. For LEO satellite failure, our model achieves errors of 5%&#x2013;8% (stabilization time) and 4%&#x2013;7% (failed node proportion), outperforming CASCADE (20%&#x2013;25%, 15%&#x2013;20%) and Zhang and Du [<xref ref-type="bibr" rid="ref-14">14</xref>] (12%&#x2013;15%, 10%&#x2013;12%). Similar improvements across all scenarios demonstrate generalizability.</p>
<fig id="fig-4">
<label>Figure 4</label>
<caption>
<title>Benchmark comparison of prediction errors across three failure scenarios.</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_81224-fig-4.tif"/>
</fig>
<p>We evaluated the performance of the Early Warning-Isolation-Self-Healing closed-loop collaborative defense strategy from three dimensions: failure recovery rate, communication interruption duration and resource overhead. Two experimental groups were set up for comparison, one adopting the proposed defense strategy and the other using traditional defense strategies of static redundancy backup and static load balancing. Simulation experiments were carried out across three typical failure scenarios, with all relevant performance metrics recorded for analysis.</p>
<p>As shown in <xref ref-type="fig" rid="fig-5">Figs. 5</xref> and <xref ref-type="fig" rid="fig-6">6</xref>, our strategy achieved failure recovery rates of 85%&#x2013;90%, compared to 60%&#x2013;65% for traditional strategies. For example, in the UAV cluster disconnection scenario, our strategy recovered 88% of failed nodes and links, whereas the traditional strategy recovered only 62%. Furthermore, as shown in <xref ref-type="fig" rid="fig-7">Fig. 7</xref>, our strategy achieved average communication interruption durations of 5&#x2013;8 time units, significantly outperforming the 15&#x2013;20 time units observed with traditional strategies. In telemedicine applications, for instance, our strategy constrained communication interruptions to within 6 time units, satisfying the stringent latency requirements for remote surgical guidance, whereas traditional strategies&#x2019; prolonged interruptions risked compromising healthcare service continuity. Regarding resource overhead, our strategy reduced bandwidth occupation and energy consumption by 20%&#x2013;25% compared to traditional approaches. Specifically, in satellite node failure scenarios, our strategy decreased satellite energy consumption by 22%, effectively enhancing satellite node endurance. The resource utilization rate are shown in <xref ref-type="fig" rid="fig-8">Fig. 8</xref>.</p>
<fig id="fig-5">
<label>Figure 5</label>
<caption>
<title>Failure recovery rate under three SAGIN failure scenarios.</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_81224-fig-5.tif"/>
</fig><fig id="fig-6">
<label>Figure 6</label>
<caption>
<title>Defense success rate across LEO, ground, and UAV failure scenarios.</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_81224-fig-6.tif"/>
</fig><fig id="fig-7">
<label>Figure 7</label>
<caption>
<title>Communication interruption duration in three failure scenarios.</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_81224-fig-7.tif"/>
</fig><fig id="fig-8">
<label>Figure 8</label>
<caption>
<title>Resource utilization efficiency under different failure scenarios.</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_81224-fig-8.tif"/>
</fig>
<p>These experimental results demonstrate that our designed defense and self-healing algorithms significantly outperform traditional strategies in terms of failure recovery capability, communication continuity assurance, and resource utilization efficiency, substantiating their marked performance advantages.</p>
</sec>
</sec>
<sec id="s6">
<label>6</label>
<title>Conclusion</title>
<p>This study investigates cascading fault propagation mechanisms and defense strategies in integrated space-air-ground networks. We innovatively developed a multi-factor coupled dynamic model that breaks through the static isomorphism assumption of traditional models by incorporating key factors like node heterogeneity and dynamic load shifting. Experimental validation shows the model reduces prediction errors for fault propagation stability time and faulty node proportion to 5%&#x2013;8% and 4%&#x2013;7%, respectively, significantly outperforming the classic CASCADE model with substantially improved fitting accuracy. Through multi-scenario simulations, we revealed the regulatory patterns of topology density and load thresholds: increasing topology density under the same load threshold accelerates fault propagation and expands impact scope, while raising load thresholds under the same topology density delays propagation and narrows impact range. The &#x201C;early warning-isolation-self-healing&#x201D; closed-loop defense achieves 85%&#x2013;90% recovery rates while reducing resource consumption by 20%&#x2013;25%, demonstrating practical deployability on resource-constrained platforms.</p>
<p>To further enhance the reliability and intelligence of integrated space-air-ground networks, future research will adopt a multi-directional approach. Key priorities include: expanding multi-fault concurrent scenarios by optimizing models and defense coordination mechanisms through consideration of initial fault nodes&#x2019; distribution, types, and temporal differences; calibrating models using operational data to refine parameters and thresholds for practical engineering applications; integrating AI with network control theory to develop adaptive defense strategies and multi-agent coordination mechanisms, thereby improving adaptability to dynamic environments and complex fault scenarios. Additionally, research outcomes will be extended to emerging fields like space internet and 6G communications, optimizing strategy designs to drive continuous advancements in reliability theory and technology.</p>
</sec>
</body>
<back>
<ack>
<p>None.</p>
</ack>
<sec>
<title>Funding Statement</title>
<p>This work is supported by the National Natural Science Foundation of China under Grants 62471493 and 62402257, and partially supported by the Natural Science Foundation of Shandong Province under Grants ZR2023LZH017, ZR2024MF066, and 2023QF025, and partially supported by the Open Foundation of Key Laboratory of Computing Power Network and Information Security, Ministry of Education, Qilu University of Technology (Shandong Academy of Sciences) under Grant 2023ZD010.</p>
</sec>
<sec>
<title>Author Contributions</title>
<p>The authors confirm their contribution to the paper as follows: Conceptualization and Design: Peiying Zhang, Yihong Yu; Methodology: Peiying Zhang; Software: Peiying Zhang, Lizhuang Tan, Shuqing He, Jian Wang, Ameer El-Sayed; Investigation: Yihong Yu; Data Curation: Yihong Yu; Funding Acquisition: Peiying Zhang; Project Administration: Peiying Zhang, Ameer El-Sayed, Lizhuang Tan; Writing&#x2014;Original Draft: Yihong Yu, Peiying Zhang; Writing&#x2014;Review &#x0026; Editing: Yihong Yu, Shuqing He; Supervision: Peiying Zhang, Lizhuang Tan, Jian Wang. All authors reviewed and approved the final version of the manuscript.</p>
</sec>
<sec sec-type="data-availability">
<title>Availability of Data and Materials</title>
<p>The general created dataset is available upon request.</p>
</sec>
<sec>
<title>Ethics Approval</title>
<p>This study did not involve any human or animal subjects, and therefore, ethical approval was not required.</p>
</sec>
<sec sec-type="COI-statement">
<title>Conflicts of Interest</title>
<p>The authors declare no conflicts of interest.</p>
</sec>
<ref-list content-type="authoryear">
<title>References</title>
<ref id="ref-1"><label>[1]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Cui</surname> <given-names>H</given-names></string-name>, <string-name><surname>Zhang</surname> <given-names>J</given-names></string-name>, <string-name><surname>Geng</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Xiao</surname> <given-names>Z</given-names></string-name>, <string-name><surname>Sun</surname> <given-names>T</given-names></string-name>, <string-name><surname>Zhang</surname> <given-names>N</given-names></string-name>, <etal>et al</etal></person-group>. <article-title>Space-air-ground integrated network (SAGIN) for 6G: requirements, architecture and challenges</article-title>. <source>China Commun</source>. <year>2022</year>;<volume>19</volume>(<issue>2</issue>):<fpage>90</fpage>&#x2013;<lpage>108</lpage>.</mixed-citation></ref>
<ref id="ref-2"><label>[2]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Haider</surname> <given-names>ZA</given-names></string-name>, <string-name><surname>Ullah</surname> <given-names>I</given-names></string-name>, <string-name><surname>Shareha</surname> <given-names>AA</given-names></string-name>, <string-name><surname>Nasimov</surname> <given-names>R</given-names></string-name>, <string-name><surname>Memon</surname> <given-names>SA</given-names></string-name></person-group>. <article-title>Artificial Intelligence (AI)-Enabled Unmanned Aerial Vehicle (UAV) systems for optimizing user connectivity in sixth-generation (6G) ubiquitous networks</article-title>. <source>Comput Mater Contin</source>. <year>2026</year>;<volume>86</volume>(<issue>1</issue>):<fpage>1</fpage>&#x2013;<lpage>16</lpage>. doi:<pub-id pub-id-type="doi">10.32604/cmc.2025.071042</pub-id>.</mixed-citation></ref>
<ref id="ref-3"><label>[3]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Cheng</surname> <given-names>N</given-names></string-name>, <string-name><surname>He</surname> <given-names>JC</given-names></string-name>, <string-name><surname>Yin</surname> <given-names>ZS</given-names></string-name>, <string-name><surname>Zhou</surname> <given-names>CH</given-names></string-name>, <string-name><surname>Wu</surname> <given-names>HQ</given-names></string-name>, <string-name><surname>Lyu</surname> <given-names>F</given-names></string-name>, <etal>et al</etal></person-group>. <article-title>6G service-oriented space-air-ground integrated network: a survey</article-title>. <source>Chin J Aeronaut</source>. <year>2022</year>;<volume>35</volume>(<issue>9</issue>):<fpage>1</fpage>&#x2013;<lpage>18</lpage>. doi:<pub-id pub-id-type="doi">10.1016/j.cja.2021.12.013</pub-id>.</mixed-citation></ref>
<ref id="ref-4"><label>[4]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Zhang</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Wang</surname> <given-names>X</given-names></string-name>, <string-name><surname>Gang</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Wang</surname> <given-names>J</given-names></string-name>, <string-name><surname>Wu</surname> <given-names>S</given-names></string-name>, <string-name><surname>Zhang</surname> <given-names>P</given-names></string-name>, <etal>et al</etal></person-group>. <article-title>6G SAGIN information transmission model</article-title>. <source>IEEE Commun Magaz</source>. <year>2025</year>;<volume>63</volume>(<issue>6</issue>):<fpage>98</fpage>&#x2013;<lpage>105</lpage>. doi:<pub-id pub-id-type="doi">10.1109/mcom.001.2400351</pub-id>.</mixed-citation></ref>
<ref id="ref-5"><label>[5]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Jia</surname> <given-names>Z</given-names></string-name>, <string-name><surname>Jin</surname> <given-names>F</given-names></string-name>, <string-name><surname>Xie</surname> <given-names>J</given-names></string-name>, <string-name><surname>He</surname> <given-names>Y</given-names></string-name></person-group>. <article-title>Recurrent MAPPO for joint UAV trajectory and traffic offloading in space-air-ground integrated networks</article-title>. <source>Comput Mater Contin</source>. <year>2026</year>;<volume>86</volume>(<issue>1</issue>):<fpage>1</fpage>&#x2013;<lpage>15</lpage>. doi:<pub-id pub-id-type="doi">10.32604/cmc.2025.069128</pub-id>.</mixed-citation></ref>
<ref id="ref-6"><label>[6]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>He</surname> <given-names>S</given-names></string-name>, <string-name><surname>Cheng</surname> <given-names>B</given-names></string-name>, <string-name><surname>Wang</surname> <given-names>H</given-names></string-name>, <string-name><surname>Huang</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Chen</surname> <given-names>J</given-names></string-name></person-group>. <article-title>Proactive personalized services through fog-cloud computing in large-scale IoT-based healthcare application</article-title>. <source>China Commun</source>. <year>2017</year>;<volume>14</volume>(<issue>11</issue>):<fpage>1</fpage>&#x2013;<lpage>16</lpage>. doi:<pub-id pub-id-type="doi">10.1109/cc.2017.8233646</pub-id>.</mixed-citation></ref>
<ref id="ref-7"><label>[7]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Zhao</surname> <given-names>G</given-names></string-name>, <string-name><surname>Kang</surname> <given-names>Z</given-names></string-name>, <string-name><surname>Huang</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Wu</surname> <given-names>S</given-names></string-name></person-group>. <article-title>A routing optimization method for LEO satellite networks with stochastic link failure</article-title>. <source>Aerospace</source>. <year>2022</year>;<volume>9</volume>(<issue>6</issue>):<fpage>322</fpage>. doi:<pub-id pub-id-type="doi">10.3390/aerospace9060322</pub-id>.</mixed-citation></ref>
<ref id="ref-8"><label>[8]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Zhang</surname> <given-names>L</given-names></string-name>, <string-name><surname>Du</surname> <given-names>Y</given-names></string-name></person-group>. <article-title>Cascading failure model and resilience enhancement scheme of space information networks</article-title>. <source>Reliab Eng Syst Safety</source>. <year>2023</year>;<volume>237</volume>(<issue>3</issue>):<fpage>109379</fpage>. doi:<pub-id pub-id-type="doi">10.1016/j.ress.2023.109379</pub-id>.</mixed-citation></ref>
<ref id="ref-9"><label>[9]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Xing</surname> <given-names>L</given-names></string-name></person-group>. <article-title>Cascading failures in Internet of Things: review and perspectives on reliability and resilience</article-title>. <source>IEEE Internet Things J</source>. <year>2020</year>;<volume>8</volume>(<issue>1</issue>):<fpage>44</fpage>&#x2013;<lpage>64</lpage>.</mixed-citation></ref>
<ref id="ref-10"><label>[10]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Guo</surname> <given-names>C</given-names></string-name>, <string-name><surname>Gong</surname> <given-names>C</given-names></string-name>, <string-name><surname>Guo</surname> <given-names>J</given-names></string-name>, <string-name><surname>Wei</surname> <given-names>Z</given-names></string-name>, <string-name><surname>Han</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Khan</surname> <given-names>SZ</given-names></string-name></person-group>. <article-title>Software-defined space-air-ground integrated network architecture with the multi-layer satellite backbone network</article-title>. <source>Comput Mater Contin</source>. <year>2020</year>;<volume>64</volume>(<issue>1</issue>):<fpage>527</fpage>&#x2013;<lpage>40</lpage>. doi:<pub-id pub-id-type="doi">10.32604/cmc.2020.09788</pub-id>.</mixed-citation></ref>
<ref id="ref-11"><label>[11]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Zhang</surname> <given-names>H</given-names></string-name>, <string-name><surname>Yao</surname> <given-names>X</given-names></string-name>, <string-name><surname>Xu</surname> <given-names>K</given-names></string-name>, <string-name><surname>Wu</surname> <given-names>Z</given-names></string-name>, <string-name><surname>Li</surname> <given-names>W</given-names></string-name>, <string-name><surname>Lu</surname> <given-names>Y</given-names></string-name>, <etal>et al</etal></person-group>. <article-title>Trustworthiness evaluation toward 6G support of space-air-ground integrated network</article-title>. <source>IEEE Wirel Commun</source>. <year>2025</year>;<volume>32</volume>(<issue>2</issue>):<fpage>34</fpage>&#x2013;<lpage>40</lpage>. doi:<pub-id pub-id-type="doi">10.1109/mwc.001.2400273</pub-id>.</mixed-citation></ref>
<ref id="ref-12"><label>[12]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Motter</surname> <given-names>AE</given-names></string-name>, <string-name><surname>Lai</surname> <given-names>YC</given-names></string-name></person-group>. <article-title>Cascade-based attacks on complex networks</article-title>. <source>Phys Rev E</source>. <year>2002</year>;<volume>66</volume>(<issue>6</issue>):<fpage>065102</fpage>. doi:<pub-id pub-id-type="doi">10.1103/physreve.66.065102</pub-id>; <pub-id pub-id-type="pmid">12513335</pub-id></mixed-citation></ref>
<ref id="ref-13"><label>[13]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Liu</surname> <given-names>Z</given-names></string-name>, <string-name><surname>Han</surname> <given-names>J</given-names></string-name>, <string-name><surname>Wang</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Li</surname> <given-names>X</given-names></string-name>, <string-name><surname>Chen</surname> <given-names>S</given-names></string-name></person-group>. <article-title>Performance analysis of routing algorithms in satellite network under node failure scenarios</article-title>. In: <conf-name>Proceedings of the 2014 IEEE Global Communications Conference; 2014 Dec 8&#x2013;12</conf-name>; <publisher-loc>Austin, TX, USA</publisher-loc>. p. <fpage>2838</fpage>&#x2013;<lpage>43</lpage>.</mixed-citation></ref>
<ref id="ref-14"><label>[14]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Zhang</surname> <given-names>L</given-names></string-name>, <string-name><surname>Du</surname> <given-names>Y</given-names></string-name></person-group>. <article-title>A dynamic cascading failure model for LEO satellite networks</article-title>. <source>IEEE Trans Netw Service Manag</source>. <year>2023</year>;<volume>21</volume>(<issue>2</issue>):<fpage>1672</fpage>&#x2013;<lpage>89</lpage>. doi:<pub-id pub-id-type="doi">10.1109/tnsm.2023.3343357</pub-id>.</mixed-citation></ref>
<ref id="ref-15"><label>[15]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Wang</surname> <given-names>H</given-names></string-name>, <string-name><surname>Cai</surname> <given-names>Z</given-names></string-name>, <string-name><surname>Liao</surname> <given-names>C</given-names></string-name>, <string-name><surname>Li</surname> <given-names>B</given-names></string-name></person-group>. <article-title>Energy-constrained UAV network topology recovery based on graph convolutional networks</article-title>. In: <conf-name>Advanced intelligent computing technology and applications</conf-name>. <publisher-loc>Singapor</publisher-loc>: <publisher-name>Springer</publisher-name>; <year>2025</year>. p. <fpage>74</fpage>&#x2013;<lpage>85</lpage>.</mixed-citation></ref>
<ref id="ref-16"><label>[16]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Valdez</surname> <given-names>LD</given-names></string-name>, <string-name><surname>Shekhtman</surname> <given-names>L</given-names></string-name>, <string-name><surname>La Rocca</surname> <given-names>CE</given-names></string-name>, <string-name><surname>Zhang</surname> <given-names>X</given-names></string-name>, <string-name><surname>Buldyrev</surname> <given-names>SV</given-names></string-name>, <string-name><surname>Trunfio</surname> <given-names>PA</given-names></string-name>, <etal>et al</etal></person-group>. <article-title>Cascading failures in complex networks</article-title>. <source>J Complex Netw</source>. <year>2020</year>;<volume>8</volume>(<issue>2</issue>):<fpage>cnaa013</fpage>. doi:<pub-id pub-id-type="doi">10.1093/comnet/cnaa022</pub-id>.</mixed-citation></ref>
<ref id="ref-17"><label>[17]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Xiao</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Ye</surname> <given-names>Z</given-names></string-name>, <string-name><surname>Wu</surname> <given-names>M</given-names></string-name>, <string-name><surname>Li</surname> <given-names>H</given-names></string-name>, <string-name><surname>Xiao</surname> <given-names>M</given-names></string-name>, <string-name><surname>Alouini</surname> <given-names>MS</given-names></string-name>, <etal>et al</etal></person-group>. <article-title>Space-air-ground integrated wireless networks for 6G: basics, key technologies and future trends</article-title>. <source>IEEE J Selected Areas Commun</source>. <year>2024</year>;<volume>42</volume>(<issue>12</issue>):<fpage>3327</fpage>&#x2013;<lpage>54</lpage>.</mixed-citation></ref>
<ref id="ref-18"><label>[18]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Zhang</surname> <given-names>L</given-names></string-name>, <string-name><surname>Du</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Li</surname> <given-names>A</given-names></string-name></person-group>. <article-title>Rapid cascading risk assessment and vulnerable satellite identification schemes for LEO satellite networks</article-title>. <source>Reliab Eng Syst Safety</source>. <year>2025</year>;<volume>256</volume>(<issue>4</issue>):<fpage>110699</fpage>. doi:<pub-id pub-id-type="doi">10.1016/j.ress.2024.110699</pub-id>.</mixed-citation></ref>
<ref id="ref-19"><label>[19]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Xu</surname> <given-names>B</given-names></string-name>, <string-name><surname>Bai</surname> <given-names>G</given-names></string-name>, <string-name><surname>Zhang</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Fang</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Tao</surname> <given-names>J</given-names></string-name></person-group>. <article-title>Failure analysis of unmanned autonomous swarm considering cascading effects</article-title>. <source>J Syst Eng Electron</source>. <year>2022</year>;<volume>33</volume>(<issue>3</issue>):<fpage>759</fpage>&#x2013;<lpage>70</lpage>. doi:<pub-id pub-id-type="doi">10.23919/jsee.2022.000069</pub-id>.</mixed-citation></ref>
<ref id="ref-20"><label>[20]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Cui</surname> <given-names>J</given-names></string-name>, <string-name><surname>Liu</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Nallanathan</surname> <given-names>A</given-names></string-name></person-group>. <article-title>Multi-agent reinforcement learning-based resource allocation for UAV networks</article-title>. <source>IEEE Trans Wirel Commun</source>. <year>2019</year>;<volume>19</volume>(<issue>2</issue>):<fpage>729</fpage>&#x2013;<lpage>43</lpage>. doi:<pub-id pub-id-type="doi">10.1109/twc.2019.2935201</pub-id>.</mixed-citation></ref>
<ref id="ref-21"><label>[21]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Chen</surname> <given-names>K</given-names></string-name>, <string-name><surname>Zhang</surname> <given-names>L</given-names></string-name>, <string-name><surname>Zhong</surname> <given-names>J</given-names></string-name></person-group>. <article-title>Space-air-ground integrated network (SAGIN) in disaster management: a survey</article-title>. <source>IEEE Trans Netw Service Manag</source>. <year>2025</year>;<volume>22</volume>(<issue>5</issue>):<fpage>4021</fpage>&#x2013;<lpage>49</lpage>. doi:<pub-id pub-id-type="doi">10.1109/tnsm.2025.3580965</pub-id>.</mixed-citation></ref>
<ref id="ref-22"><label>[22]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Daki&#x0107;</surname> <given-names>A</given-names></string-name>, <string-name><surname>Rainer</surname> <given-names>B</given-names></string-name>, <string-name><surname>Priller</surname> <given-names>P</given-names></string-name>, <string-name><surname>Nan</surname> <given-names>G</given-names></string-name>, <string-name><surname>Momi&#x0107;</surname> <given-names>A</given-names></string-name>, <string-name><surname>Ye</surname> <given-names>X</given-names></string-name>, <etal>et al</etal></person-group>. <article-title>Wireless V2X communication testbed for connected, cooperative and automated mobility</article-title>. In: <conf-name>Proceedings of the 2024 IEEE Vehicular Networking Conference (VNC); 2024 May 29&#x2013;31</conf-name>; <publisher-loc>Kobe, Japan</publisher-loc>. p. <fpage>9</fpage>&#x2013;<lpage>16</lpage>.</mixed-citation></ref>
<ref id="ref-23"><label>[23]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Fang</surname> <given-names>C</given-names></string-name>, <string-name><surname>Hu</surname> <given-names>Z</given-names></string-name>, <string-name><surname>Meng</surname> <given-names>X</given-names></string-name>, <string-name><surname>Tu</surname> <given-names>S</given-names></string-name>, <string-name><surname>Wang</surname> <given-names>Z</given-names></string-name>, <string-name><surname>Zeng</surname> <given-names>D</given-names></string-name>, <etal>et al</etal></person-group>. <article-title>DRL-driven joint task offloading and resource allocation for energy-efficient content delivery in cloud-edge cooperation networks</article-title>. <source>IEEE Trans Veh Technol</source>. <year>2023</year>;<volume>72</volume>(<issue>12</issue>):<fpage>16195</fpage>&#x2013;<lpage>207</lpage>. doi:<pub-id pub-id-type="doi">10.1109/tvt.2023.3297362</pub-id>.</mixed-citation></ref>
<ref id="ref-24"><label>[24]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Al-Zahrani</surname> <given-names>FA</given-names></string-name>, <string-name><surname>Khan</surname> <given-names>I</given-names></string-name>, <string-name><surname>Zareei</surname> <given-names>M</given-names></string-name>, <string-name><surname>Zeb</surname> <given-names>A</given-names></string-name>, <string-name><surname>Waheed</surname> <given-names>A</given-names></string-name></person-group>. <article-title>Resource allocation and optimization in device-to-device communication 5G networks</article-title>. <source>Comput Mater Contin</source>. <year>2021</year>;<volume>69</volume>(<issue>1</issue>):<fpage>1201</fpage>&#x2013;<lpage>14</lpage>. doi:<pub-id pub-id-type="doi">10.32604/cmc.2021.018386</pub-id>.</mixed-citation></ref>
<ref id="ref-25"><label>[25]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Fang</surname> <given-names>C</given-names></string-name>, <string-name><surname>Xu</surname> <given-names>H</given-names></string-name>, <string-name><surname>Yang</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Hu</surname> <given-names>Z</given-names></string-name>, <string-name><surname>Tu</surname> <given-names>S</given-names></string-name>, <string-name><surname>Ota</surname> <given-names>K</given-names></string-name>, <etal>et al</etal></person-group>. <article-title>Deep-reinforcement-learning-based resource allocation for content distribution in fog radio access networks</article-title>. <source>IEEE Internet Things J</source>. <year>2022</year>;<volume>9</volume>(<issue>18</issue>):<fpage>16874</fpage>&#x2013;<lpage>83</lpage>. doi:<pub-id pub-id-type="doi">10.1109/jiot.2022.3146239</pub-id>.</mixed-citation></ref>
<ref id="ref-26"><label>[26]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Lin</surname> <given-names>P</given-names></string-name>, <string-name><surname>Zhang</surname> <given-names>Z</given-names></string-name>, <string-name><surname>Liu</surname> <given-names>L</given-names></string-name></person-group>. <article-title>Research on space-air-ground integrated network application</article-title>. In: <conf-name>Proceedings of the 2024 IEEE International Symposium on Broadband Multimedia Systems and Broadcasting (BMSB); 2024 Jun 19&#x2013;21</conf-name>; <publisher-loc>Toronto, ON, Canada</publisher-loc>. p. <fpage>1</fpage>&#x2013;<lpage>6</lpage>.</mixed-citation></ref>
<ref id="ref-27"><label>[27]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Wang</surname> <given-names>X</given-names></string-name>, <string-name><surname>Shen</surname> <given-names>T</given-names></string-name>, <string-name><surname>Zhang</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Chen</surname> <given-names>X</given-names></string-name></person-group>. <article-title>An efficient topology emulation technology for the space-air-ground integrated network</article-title>. In: <conf-name>Proceedings of the IEEE INFOCOM 2023-IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS); 2023 May 20</conf-name>; <publisher-loc>Hoboken, NJ, USA</publisher-loc>. p. <fpage>1</fpage>&#x2013;<lpage>8</lpage>.</mixed-citation></ref>
<ref id="ref-28"><label>[28]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Fu</surname> <given-names>D</given-names></string-name>, <string-name><surname>Hu</surname> <given-names>S</given-names></string-name>, <string-name><surname>Zhang</surname> <given-names>L</given-names></string-name>, <string-name><surname>He</surname> <given-names>S</given-names></string-name>, <string-name><surname>Qiu</surname> <given-names>J</given-names></string-name></person-group>. <article-title>An intelligent cloud computing of trunk logistics alliance based on blockchain and big data</article-title>. <source>J Supercomput</source>. <year>2021</year>;<volume>77</volume>(<issue>12</issue>):<fpage>13863</fpage>&#x2013;<lpage>78</lpage>. doi:<pub-id pub-id-type="doi">10.1007/s11227-021-03800-w</pub-id>.</mixed-citation></ref>
</ref-list>
</back></article>