Next Article in Journal
Forensic Support for Abraham et al.’s BB Protocol
Next Article in Special Issue
Integrating Human Mobility Models with Epidemic Modeling: A Framework for Generating Synthetic Temporal Contact Networks
Previous Article in Journal
2024 ‘Key Reflections’ on Sadi Carnot’s 1824 ‘Réflexions’ and 200 Year Legacy
Previous Article in Special Issue
LOMDP: Maximizing Desired Opinions in Social Networks by Considering User Expression Intentions
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Resilient Topology Reconfiguration for Industrial Internet of Things: A Feature-Driven Approach Against Heterogeneous Attacks

1
State Key Laboratory of Robotics, Shenyang Institute of Automation, Chinese Academy of Sciences, Shenyang 110016, China
2
Key Laboratory of Networked Control Systems, Chinese Academy of Sciences, Shenyang 110016, China
3
School of Electronic and Communication Engineering, Guangzhou University, Guangzhou 510006, China
*
Author to whom correspondence should be addressed.
Entropy 2025, 27(5), 503; https://doi.org/10.3390/e27050503
Submission received: 1 April 2025 / Revised: 27 April 2025 / Accepted: 6 May 2025 / Published: 7 May 2025
(This article belongs to the Special Issue Spreading Dynamics in Complex Networks)

Abstract

:
This paper proposes a feature-driven topology reconfiguration framework to enhance the resilience of Industrial Internet of Things (IIoT) systems against heterogeneous attacks. By dynamically partitioning IIoT into subnetworks based on localized attack features and reconstructing each subnetwork with tailored topologies, our framework significantly improves connectivity and communication efficiency. Evaluations on a real-world dataset (Tech-Routers-RF) characterizing IIoT topologies with 2113 nodes show that under diverse attack scenarios, connectivity and communication efficiency improve by more than 70% and 50%, respectively. Leveraging information entropy to quantify the trade-off between structural diversity and connection predictability, our work bridges adaptive network design with real-world attack dynamics, offering a scalable solution for securing large-scale IIoT deployments.

1. Introduction

The Industrial Internet of Things (IIoT) serves as the backbone of modern smart manufacturing, interconnecting sensors, controllers, and machinery to enable autonomous decision-making and real-time data exchange [1,2,3,4]. However, the inherent heterogeneity and distributed nature of IIoT systems expose them to multifaceted cyber-physical threats, ranging from degree-targeted attacks (e.g., DNS spoofing) to betweenness-exploiting disruptions (e.g., ransomware). While existing studies have explored topology optimization for IIoT robustness, most approaches rely on static network configurations, overlooking the dynamic interplay between attack patterns and structural vulnerabilities [5,6,7].
A critical challenge lies in designing adaptive topologies that dynamically reconfigure in response to evolving attack features. Traditional methods, such as genetic algorithms for node deployment or blockchain-based security protocols, often lack granularity in addressing localized attack characteristics. For instance, scale-free networks exhibit resilience against random failures but collapse under hub-targeted attacks, whereas small-world topologies resist intentional disruptions at the cost of reduced efficiency [8,9,10]. This dichotomy highlights the need for a hybrid approach that integrates domain-specific attack analysis with distributed reconfiguration strategies. The Shannon entropy of network topologies [11], for instance, provides a natural metric to evaluate the trade-off between robustness and efficiency under heterogeneous attacks. By integrating entropy-driven adaptability, our approach bridges the gap between static configurations and dynamic threat mitigation.
Static strategies (e.g., predefined scale-free designs) fix topology rules regardless of attack evolution, while dynamic attacks (e.g., adaptive node targeting) require real-time structural adaptations. In this paper, we propose a feature-driven topology reconfiguration framework to enhance IIoT resilience. Our contributions are threefold:
  • Distributed Subnetwork Segmentation: We classify IIoT nodes into subnetworks based on localized attack features (degree, betweenness, or random), enabling targeted structural adaptations.
  • Differentiated Topology Design: Small-world and scale-free configurations are tailored to subnetworks under intentional and random attacks, respectively, balancing robustness and efficiency.
  • Real-World Validation: Experiments on a real-world datasets of radio frequency sensor networks (2113 nodes, 21 subnetworks) demonstrate significant improvements in connectivity and communication efficiency under four attack scenarios.
The remainder of this paper is organized as follows: Section 2 formalizes the problem and reviews related work. Section 3 details our methodology, followed by experimental validation in Section 4. Section 5 concludes with future directions.

2. Problem Statement and Related Work

2.1. Topology Reconfiguration Problem Description

The Industrial Internet of Things (IIoT) constitutes a cyber-physical ecosystem that integrates heterogeneous devices—including sensors, controllers, and intelligent analyzers—through advanced communication protocols to achieve seamless interoperability across industrial production systems. As illustrated in Figure 1, a typical IIoT architecture comprises distributed nodes (representing smart devices) interconnected via dynamic communication links. Such systems inherently exhibit complex network properties, where topological characteristics (e.g., connectivity patterns, path efficiency) critically determine functional resilience against external attacks.
Formally, the IIoT is modeled as a graph G = ( V , E ) , where V denotes the set of nodes (devices) and E represents edges (communication links). The topology reconfiguration problem aims to dynamically adjust E in response to evolving attack features (e.g., degree-targeted, betweenness-exploiting, or random disruptions) while preserving two core functionalities:
  • Connectivity Integrity: Measured by the giant component size ( G C s i z e ), defined as the largest connected subgraph post-attack. A larger G C s i z e ensures sustained data interoperability among functional nodes.
  • Communication Efficiency: Quantified via network average efficiency E ( G ) , which inversely correlates with path lengths between node pairs.
In complex network science, researchers have quantitatively defined network robustness based on connectivity. The same network system exhibits different robustness under different external attacks, and the robustness strength of the network under certain kinds of attacks is defined as follows  [12]:
R = 1 N × Q = 1 | N | G C s i z e ( Q )
where Q represents the size of the attacked node in the network, and G C s i z e ( Q ) measures the surviving giant component. The giant component, defined as the largest connected subgraph encompassing the majority of nodes in a network, holds critical importance in IIoT network topology. Its existence signifies a percolation threshold, beyond which the network transitions from fragmented clusters to a dominant interconnected structure. In IIoT systems, the giant component ensures global connectivity, enabling efficient information dissemination and resource sharing across the network. Its size and stability directly reflect the network’s resilience to failures—if the giant component persists despite node or link disruptions, the network retains functional coherence, even under partial damage. This paper will also use this network robustness strength definition to evaluate the topology robustness of IIoT systems.
Network average efficiency is another important network performance metric. Because the shortest path in a network is defined between interconnected nodes, it is not accurate enough to describe network functions. As an extension of the shortest path, the average network efficiency can be expressed as follows [13]:
E ( G ) = 1 N ( N 1 ) × i j G 1 d i j
where d i j represents the shortest path length between nodes i and j. According to this definition expression, when the overall shortest path length in a network is small, the network has a greater average efficiency, and thus the network is more efficient in transmitting information.
Based on the above introduction, this paper uses robustness strength and network average efficiency as evaluation indicators for the effectiveness of the proposed topology reconfiguration method.
Information entropy is utilized as a metric to quantify the trade-off between structural diversity and connection predictability in this paper, and the information entropy is defined as follows [11]:
H ( G ) = i = 1 n p ( k i ) log p ( k i )
where p ( k i ) is the node degree distribution probability. High entropy represents structural diversity, which enhances security by making the network harder to predict and attack. Conversely, low entropy implies high connection predictability, which is beneficial for communication efficiency. The stability of entropy values in our experiments reflects the balance achieved between these two competing factors. During attacks, entropy changes can indicate shifts in network behavior, with decreasing entropy potentially signaling increased vulnerability. By monitoring entropy, network administrators can gain insights into the system’s resilience and make informed decisions about further reconfigurations.

2.2. Related Work

The Internet of Things (IoT) fundamentally operates as a network of interconnected devices (nodes) and communication links, making complex network theory a natural framework for modeling and analysis. Existing research on IoT robustness enhancement can be categorized into four paradigms, each with distinct limitations in addressing dynamic attack scenarios:
  • Topology Optimization:
    Chen et al. [14] pioneered scale-free network designs for IoT systems, demonstrating enhanced resilience against random attacks through hub node redundancy. However, their static approach fails to adapt to targeted attacks on critical nodes.
    Buesser et al. [15] employed simulated annealing to rewire edges in Barabási–Albert networks, preserving degree distributions while marginally improving intentional attack resistance. This method, however, restricts structural adaptability to predefined configurations.
  • Node Deployment Strategies:
    Basu et al. [16] optimized mobile multirobot IoT systems via linear programming, dynamically relocating nodes to mitigate localized failures. While effective for physical disruptions, their method neglects cyber-attack vectors like betweenness exploitation.
    Tan et al. [17] introduced multihop neighbor-aware algorithms for mobile sensor networks, balancing coverage and robustness. Their energy-centric design lacks mechanisms to counter evolving attack patterns.
  • Efficiency-Driven Architectures:
    Peng et al. [18] developed self-organizing wireless IoT schemes using neighbor overlap metrics, achieving energy efficiency gains of 18% over traditional models. Nevertheless, their topology prioritizes low latency over security considerations.
    Sohn [19] hybridized small-world and scale-free principles for IoT optimization but retained fixed network partitions, limiting responsiveness to heterogeneous threats.
  • Security-Centric Enhancements:
    Musleh et al. [20] proposed multisensor time-prediction models for smart grids, reducing attack success rates by 22% in wide-area control systems. Their cryptographic focus, however, overlooks structural vulnerabilities.
    Fu et al. [21] augmented wireless sensor networks with “super nodes” and “super links”, improving robustness by 31% against random failures. Sitanayah et al. [22] further advanced reliability through GRASP-ARP algorithms, minimizing relay deployment while ensuring k-vertex connectivity.
Recent advances in robust influence maximization provide novel perspectives for network adaptability  [23,24,25]. Studies address directional network robustness by designing a memetic algorithm that optimizes seed selection through genetic operators tailored for directed information propagation. These works establish numerical frameworks for balancing influence robustness against structural vulnerabilities.
While these studies advance IoT robustness, they predominantly rely on static or monolithic designs. For instance, scale-free networks excel against random failures [14,26] but collapse under hub-targeted attacks, while small-world configurations resist intentional disruptions at the cost of increased latency [19,27]. Additionally, existing studies largely ignore entropy-driven adaptability, which could provide a unified metric to balance robustness and efficiency under heterogeneous attacks. None dynamically reconfigure topologies based on real-time attack features—a limitation exacerbated in IIoT environments where subnetworks face simultaneous, heterogeneous threats.
Our work addresses this gap through feature-driven distributed reconfiguration. Unlike prior static approaches, we segment IIoT systems into attack-specific subnetworks (degree-targeted, betweenness-exploited, random) and apply tailored topology rules (small-world for intentional attacks, scale-free for random disruptions). This paradigm shift enables localized adaptability while preserving global efficiency, effectively bridging the divide between structural optimization and dynamic threat landscapes.

3. Methodology

3.1. Attack Feature Taxonomy and Reconfiguration Framework

Based on the analysis of attack features of typical IIoT, we can roughly classify the security risks faced into three categories: degree-based attacks (for network connectivity attacks), betweenness-based attacks (for network data transmission path attacks), and random attacks (no target attacks or natural damage, etc.). The behavior of these attack types on an example network is shown in Figure 2. Typical IIoT systems face three categories of security risks:
  • Degree-based attacks: These attacks leverage the degree centrality principle in network theory, targeting nodes with the highest number of connections (degree). By compromising these hub nodes (e.g., core routers, authentication servers), attackers maximize network fragmentation through minimum effort. Behavior mechanism: Attackers first perform network reconnaissance to identify high-degree nodes, then deploy targeted exploits. For instance, DNS spoofing redirects traffic by compromising highly connected DNS servers, while SQL injection attacks frequently accessed database nodes to breach entire web ecosystems.
  • Betweenness-based attacks: Focusing on nodes with maximum betweenness centrality—the bridges controlling shortest paths between node pairs—these attacks strategically disrupt critical communication channels. Behavior pattern: Attackers use flow analysis algorithms to identify bottleneck nodes, then launch precision strikes. For example, DDoS attacks flood border gateways (high-betweenness nodes) to collapse inter-subnet traffic, while ransomware encryption specifically targets file servers mediating departmental data exchange.
  • Random attacks: Employing stochastic strategies independent of network topology, these attacks exploit systemic vulnerabilities through non-selective penetration attempts. Behavior characteristics: Attackers use automated scanning tools for blind probing without target profiling. The zero-day exploits randomly test unpatched vulnerabilities across all nodes, while phishing campaigns blast generic deceptive messages network-wide.
The distributed nature of IIoT systems exposes them to simultaneous multi-vector attacks. Traditional monolithic reconfiguration strategies prove inadequate for such heterogeneous threats. We address this through distributed feature-driven reconfiguration—partitioning the IIoT into attack-specific subnetworks and applying tailored topology rules. As illustrated in Figure 3, this approach enables localized structural adaptations while preserving global functionality.

3.2. General Model of IIoT Topology Reconfiguration

The IIoT is modeled as a complex network G = ( V , E ) , where node set V represents industrial devices and edge set E denotes communication links. Two foundational network types guide our reconfiguration strategy:
  • Scale-free networks: Characterized by power-law degree distribution P ( k ) k γ ( γ [ 2 , 3 ] ); resilient to random failures but vulnerable to hub-targeted attacks [28].
  • Small-world networks: Feature short average path lengths ( L log N ) and high clustering ( C C random ); robust against targeted disruptions [29].
Since the scale-free model and small-world model can have strong robustness to the types of external attacks (random attacks, deliberate attacks, degree-based attacks, and betweenness-based attacks) faced by the real-world IIoT systems considered in this paper, we naturally use these two network models as the basic models for the proposed topology reconstruction method. Constructing different network topologies in areas with different attack features can effectively improve the overall ability of the IIoT to resist external security risks and attacks. The methodology proposed in this section designs a network topology reconfiguration approach for IIoT based on the above two network topology models. By preventing network connections from exhibiting excessive heterogeneity, this method achieves a balanced optimization between network resilience and operational efficiency.

3.3. Proposed Feature-Driven Reconfiguration Method

3.3.1. Phase 1: Attack-Aware Subnetwork Classification

Input: IIoT network G, attack detection reports Output: Disjoint subnetworks { S d 1 , S d 2 , , S d s d , S b 1 , S b 2 , , S b s b , S d s d , S r 1 , S r 2 , , S r s r }
  • Degree-attack subnets:
    S d 1 S d 2 S d s d = { v i degree - based attack on v i } N ( v i , 2 ) ( { v j betweenness - based attack on v j } { v q random attack on v q } )
    where N ( v i , 2 ) denotes 2-hop neighbors.
  • Betweenness-attack subnets:
    S b 1 S b 2 S b s b = { v j betweenness - based attack on v j } N ( v j , 2 ) { v q random attack on v q }
  • Random-attack subnets:
    S r 1 S r 2 S r s r = V ( ( S d 1 S d 2 S d s d ) ( S b 1 S b 2 S b s b ) )
Spatial constraints enforce max v p , v q S k d ( v p , v q ) 2 d th , where d th is the IIoT node spacing threshold. Violating subnets undergo centroid-based node redistribution.

3.3.2. Phase 2: Subnetwork-Specific Topology Optimization

Strategy 1: Small-world construction for S d i a n d S b j
  • Generate initial regular network with n 1 nodes, e 1 edges.
  • Validate edges: Remove invalid connections ( d x 1 x 2 > 3 ) and reconnect to lowest-degree valid nodes. (If the shortest path between nodes x 1 and x 2 in the original network G exceeds 3 steps, the edge is invalid and is reconnected to the node x 1 with the lowest degree in subnet A within the valid range.)
  • Rewire edges with probability p (in this study, we set p = 0.15 , empirically selected to preserve local clustering) within the valid connection range to create shortcuts.
Strategy 2: Scale-free construction for S 3
  • Initialize with n 0 nodes ( n 0 = 0.1 n 1 ) and e 0 edges ( e 0 = e 1 e 1 n 1 ( n 1 n 0 ) ).
  • Add nodes incrementally with preferential attachment:
    p ( v i ) = k i + 1 j ( k j + 1 )
  • Prune invalid edges and regenerate via same mechanism

3.3.3. Phase 3: Inter-Subnetwork Connection Optimization

Global density preservation requires inter-subnet edges E inter satisfying the following:
| E inter | = | E original | k = 1 s d | E S k | k = 1 s b | E S k | k = 1 s r | E S k |
Connection allocation between subnets S i and S j follows:
w i j | S i | 2 + | S j | 2 p < q ( | S p | 2 + | S q | 2 )
Node selection adheres to attack-resilience principles:
  • Intentional-attack subnets: Random selection from perimeter nodes.
  • Random-attack subnets: Preferential attachment based on k i / k j .
The output of Phase 3 is the final reconstructed IIoT network, with topological characteristics including the following: global density strictly consistent with the original network; integrity of each subnet’s defensive structure preserved; inter-subnet connections meet capacity-driven dynamic allocation. The complete process is detailed in Algorithm 1.
Algorithm 1 Feature-Driven IIoT Reconfiguration
Require: IIoT network G ( V , E ) , attack signatures
Ensure: Reconfigured network G ( V , E )
 Classify V into { S d 1 , S d 2 , , S d s d , S b 1 , S b 2 , , S b s b , S d s d , S r 1 , S r 2 , , S r s r } via Section 3.3
for each subnet S k  do
   if  S k is intentional-attacked then
    Apply small-world construction (Strategy 1)
   else
    Apply scale-free construction (Strategy 2)
   end if
end for
Compute E inter using Equations (3) and (4)
Connect subnets via load-balanced node selection
By minimizing the entropy loss during inter-subnetwork connection optimization, this three-phase methodology enables IIoT systems to maintain >55% connectivity under 40% node failures, as demonstrated in Section 4.

3.4. Computational Complexity Analysis

The computational complexity of the proposed feature-driven topology reconfiguration method is analyzed as follows:
  • Phase 1: This stage utilizes the Louvain community detection algorithm to partition the IIoT network into sub-networks. The time complexity of the Louvain algorithm primarily depends on the number of nodes ( | V | ) and edges ( | E | ) in the network, yielding an asymptotic bound of O ( | V | + | E | ) .
  • Phase 2–3: These stages involve greedy optimization-based topology refinement within and between subnetworks, including edge rewiring and node selection. The greedy strategy iteratively selects locally optimal solutions, resulting in a time complexity dominated by O ( | E | l o g | V | ) .
The overall computational complexity of the algorithm remains low, characterized by linear and logarithmic scaling, ensuring efficiency for large-scale IIoT networks.

4. Evaluations

4.1. Datasets

This study employs the Tech-Routers-RF dataset for experimental validation, comprising 2113 router devices and 6632 wireless communication links that effectively characterize the topological features of large-scale radio frequency sensor networks. Guided by complex network community detection theory, we partition the original network into 21 topological subnets using the Louvain algorithm [30], with statistical characteristics detailed in Table 1. Table 1 includes the following metrics: Network Name (Networks), Number of Nodes (Node Num.), Number of Links (Link Num.), Average Degree (Ave. Deg), Average Betweenness Centrality (Ave. Betw), Average Shortest Path Length (Ave. SPL), Clustering Coefficient (CC), and Modularity (Q). Modularity is a core metric in complex network analysis for evaluating the quality of community partitioning, whose fundamental principle lies in comparing the actual number of intra-community edges in a network with the expected value under a random connection scenario, defined as
Q = 1 2 m i , j A i j k i k j 2 m δ ( c i , c j )
where δ ( c i , c j ) represents Kronecker delta function (1 if nodes i and j belong to the same community, 0 otherwise). The community division adheres to three critical principles:
  • Physical proximity constraint: Nodes within the same community predominantly reside in contiguous spatial regions (e.g., under identical base station coverage), where spatial coupling increases vulnerability to homogeneous external attacks (e.g., directed electromagnetic interference or physical intrusions).
  • Functional correlation intensity: A high average modularity score ( Q = 0.69 ) reveals significantly denser intra-community connections than inter-community links, confirming functional consistency in subnet partitioning.
  • Attack surface homogenization: Topologically clustered device groups frequently share identical communication protocol stacks and security vulnerabilities, forming coordinated domains for attack propagation.
Table 2 presents the topological metrics of each subnet, where subnet 8 (110 nodes) exhibits scale-free characteristics (degree distribution skewness γ = 2.37 ). Global network parameters in Table 2 reveal an average path length ( APL = 4.61 ) and clustering coefficient ( CC = 0.25 ) consistent with small-world properties in wireless ad hoc networks. The visualization in Figure 4 further confirms the 21-tier clustered architecture, with node sizes proportional to degree centrality and color coding corresponding to Louvain-identified communities.
The experimental framework is grounded in the core hypothesis that attackers will prioritize coordinated assaults on physically/functionally correlated device clusters. By modeling the 21 topological communities as attack response units, we effectively simulate systemic risk propagation mechanisms in real-world attack-defense scenarios. The testbed architecture of this paper is shown in Figure 5. Subsequent sections will validate the robustness enhancement of our community-based topology reconfiguration method through comparative experiments.
All experiments were executed on a workstation with the following hardware and software specifications:
  • Processor: 11th Gen Intel Core i7-11700F @ 2.50 GHz.
  • System Memory: 32.0 GB RAM.
  • Operating System: Windows 10 Pro (64-bit) version 22H2 (build 19045.5737).
Due to the low computational complexity of the proposed algorithm (primarily linear time scaling), all computations completed within 1 s on this platform. This demonstrates the practical feasibility of our method for real-time IIoT applications.

4.2. Experimental Results

This section aims to present the effectiveness of the IIoT topology reconfiguration method based on attack features proposed in this paper against the background of a real-world dataset.

4.2.1. Attack Simulation Protocol

To address empirical attack data deficiency, our experimental framework establishes the following premise: topologically cohesive communities identified through complex network analysis inherently exhibit attack surface homogeneity. Consequently, Phase 1 network partitioning directly utilizes the Louvain-derived community structure as attack simulation units, where each community (subnet) is subjected to homogeneous attack patterns. This operationalizes three key assumptions from complex network theory: intra-community vulnerability correlation, cross-community attack independence, and propagation boundary effects.
The subsequent Phases 2–3 maintain their original algorithmic procedures (Algorithm 1), implementing topology reconfiguration and resilience evaluation respectively. This substitution paradigm enables rigorous validation of community-aware defense mechanisms under controlled yet realistic attack conditions.
This paper sets four different attack scenarios (virtual scenarios constructed based on daily operation characteristics) in the typical IIoT system operating environment of router radio networks according to different subnet regions. The specific attack features for these four scenarios are shown in Table 3. Through the attack features faced by each scenario in this table, it can be found that the four scenarios differ greatly, indicating the effectiveness and persuasiveness of the experimental simulation verification in this section.
The proposed framework enables dynamic topology reconfiguration in router-based IIoT systems through feature-driven adaptations, demonstrating scalability across four heterogeneous deployment scenarios. Table 4 presents a comparative analysis of five critical network metrics: average degree, betweenness centrality, shortest path length, clustering coefficient, and information entropy across attack scenarios. The dynamic topology reconfiguration achieves enhanced attack resistance while maintaining balanced information propagation efficiency, as evidenced by the stable information entropy across all scenarios (3.68→3.63–3.71). Although link regeneration elongates critical communication paths (shortest path length: 4.61→4.63–4.75) and modifies clustering patterns (clustering coefficient: 0.25→0.029–0.038), the information entropy exhibits minimal variation ( Δ H 2.2 % ). This stability indicates that the algorithm preserves the network’s inherent information dissemination capacity while reconfiguring connectivity to resist attacks.
From an information-theoretic perspective, the near-constant entropy values ( H 3.6–3.7 bits) suggest two concurrent effects:
  • Attack resistance enhancement through diversified path creation (manifested in extended shortest paths).
  • Information efficiency preservation via controlled structural modifications (reflected in entropy consistency).
The entropy equilibrium originates from the framework’s feature-driven adaptations: While deliberately redistributing betweenness centrality (0.0017→0.0017–0.0018) to mitigate attack impacts, it sustains node-degree distributions (fixed average degree: 6.28) and global connection randomness. This dual mechanism aligns with Shannon’s entropy principle, where structural diversity (security enhancement) and connection predictability (efficiency maintenance) achieve non-conflicting optimization when their probabilistic distributions remain complementary.
This section evaluates the topology reconfiguration framework by testing its resilience in preserving connectivity and communication efficiency (defined in Section 2) under adversarial conditions. We simulate subnet-specific attacks targeting 0–50% of nodes per region, tracking two metrics post-node failure: Connectivity (giant component size: ratio of largest subgraph nodes to initial total); Communication Efficiency (average network efficiency: reciprocal of harmonic mean path lengths).
Results are visualized as follows:
  • Connectivity plots: y-axis = giant component ratio; x-axis = failed node ratio.
  • Efficiency plots: y-axis = network efficiency; x-axis = failed node ratio.
To validate generalization, attacks align with Table 3, including degree-based, betweenness-based, and random modes. The consistent outperformance of our method across these scenarios underscores its adaptability to external threats.

4.2.2. Connectivity

As illustrated in Figure 6, our topology reconfiguration method demonstrates consistent robustness enhancement across four distinct attack scenarios. The optimized IIoT networks maintain significantly larger giant component (GC) sizes than original topologies under equivalent attack scales, particularly when the proportion of attacked nodes exceeds critical thresholds.
In Scenarios 1, 2, and 4, the optimized networks demonstrate high robustness against connectivity loss. Even when up to 40% of nodes are compromised during simulated attacks, the remaining nodes retain full interconnectivity, with the giant component (GC) size consistently close to 100% throughout the disruption. In contrast, original topologies display progressive vulnerability: their GC-sizes decline moderately below 20 % node failure (e.g., 85 % 72 % in Scenario 1), then collapse catastrophically beyond 30 % node loss (GC-size < 40% at 40 % attack scale).
Scenario 3 reveals differentiated behavior: While the original network suffers rapid connectivity erosion (GC size plunges to 20% at 40% node failure), the optimized topology demonstrates phased resilience. Its GC-size maintains >60% until 25% node loss, then gradually declines to 45% at maximum attack intensity—a 125% improvement over baseline.
To validate the superiority of our feature-driven approach against conventional topology design paradigms, we compared our method with two widely adopted baseline models: static scale-free and small-world configurations. These static methods, while foundational in network robustness research, lack dynamic adaptability to heterogeneous attacks. As shown in Table 5, our framework consistently outperforms both baselines across all attack scenarios. For instance, in Scenario 1, our method achieves a 129.4% resilience gain over the original topology, whereas static scale-free and small-world designs yield only 74.5% and 125.9% improvements, respectively. This gap underscores the necessity of attack-aware subnetwork segmentation and hybrid topology optimization.
The inflection point at 40% node failure universally indicates system phase transitions, suggesting our method extends critical thresholds by 15–20% across scenarios. These results confirm that strategic topology diversification effectively decouples local node failures from global connectivity loss.
Table 5 compares the giant component (GC) size preservation before and after topology reconfiguration under four distinct attack scenarios. The resilience gain is calculated as Optimized Original Original × 100 % . Experimental results demonstrate that the proposed reconfiguration method achieves substantial connectivity improvements across all attack scenarios, with resilience gains ranging from 78.0% to 129.4%. The variance in resilience gains among scenarios suggests that the effectiveness of topology reconfiguration is closely related to attack types and their spatial distribution patterns.

4.2.3. Communication Effeciency

Figure 7 illustrates the effectiveness of the proposed topology reconfiguration method in maintaining communication efficiency under external attacks across four scenarios. Similar to the connectivity evaluation, the reconfigured IIoT topology demonstrates strong robustness, with minimal efficiency degradation even when up to 50% of nodes are attacked.
In Scenario 1, both the original and reconfigured networks exhibit a linear decline in efficiency under attack. However, the slope of decline for the reconfigured network is significantly gentler. For instance, when 50% of nodes are attacked, the reconfigured network retains an average efficiency of approximately 0.03, compared to the original network’s efficiency of nearly 0.01. In Scenario 2, when 40% of nodes are attacked, the reconfigured network’s efficiency decreases from 0.24 to 0.22 (a 8% drop), while the original network’s efficiency drops sharply from 0.24 to 0.06 (a 75% decline). In Scenario 3, under a 40% attack, the reconfigured network’s efficiency reduces from 0.24 to 0.21 (12.5% decrease), whereas the original network’s efficiency plummets from 0.24 to 0.06 (75% decrease). In Scenario 4, when 40% of nodes are attacked, the reconfigured network’s efficiency decreases from 0.24 to 0.20 (17% drop), while the original network’s efficiency falls from 0.24 to 0.11 (54% decrease).
Table 6 quantitatively compares the communication efficiency metrics before and after topology reconfiguration across different attack scenarios. The results demonstrate that the proposed reconfiguration method achieves significant performance enhancement, with relative improvement ratios ranging from 55.9% to 67.2% when comparing post-reconfiguration metrics to baseline values. Specifically, Scenario 1 exhibits the most substantial improvement at 67.2% (0.019→0.058), while Scenario 4 shows the minimum enhancement of 55.9% (0.026→0.059). Recent studies have proposed static optimization strategies for IIoT robustness, yet their reliance on fixed topologies limits adaptability to evolving attack dynamics. Our dynamic reconfiguration framework addresses this limitation by integrating localized threat classification with differentiated subnet designs. As demonstrated in Table 6, our method achieves up to 67.2% efficiency improvement, surpassing static scale-free (105.3% gain) and small-world (55.2% gain) approaches. The ability to balance entropy preservation and structural diversity enables superior performance under heterogeneous attacks, a capability absent in conventional methods. This systematic improvement pattern confirms that our topology reconfiguration strategy can effectively maintain communication capability even under adversarial conditions, outperforming traditional connectivity-focused approaches in IIoT resilience enhancement.
Overall, the results demonstrate that the proposed attack-feature-based topology reconfiguration method significantly enhances the IIoT’s resilience against external attacks, maintaining higher communication efficiency across all scenarios compared to the original network.

4.2.4. Ablation Study

To gain a deeper understanding of the contribution of each component in our proposed feature-driven topology reconfiguration framework, we conducted an ablation study in Scenario 1. The study was designed to assess the efficacy of different configurations of our framework by systematically disabling certain phases. The configurations under evaluation are as follows:
  • Configuration A: Original Topology. This configuration represents the baseline, with no topology reconfiguration applied.
  • Configuration B: Phase 1 + Phase 2 (Subnet Optimization) + Random Inter-Subnet Connections. In this configuration, we apply attack-aware subnetwork classification (Phase 1) and subnetwork-specific topology optimization (Phase 2). However, inter-subnetwork connections are established randomly without following the load-balanced node selection strategy described in Phase 3.
  • Configuration C: Phase 1 + Construction of Scale-Free Network Subnets + Phase 3 (Inter-Subnet Connections). Here, we apply attack-aware subnetwork classification (Phase 1) and construct all subnetworks using the scale-free topology model, regardless of the attack type. Subsequently, we apply the inter-subnetwork connection optimization (Phase 3).
  • Configuration D: Complete Framework (Phase 1–3). This is the full implementation of our proposed framework, including attack-aware subnetwork classification (Phase 1), subnetwork-specific topology optimization (Phase 2), and inter-subnetwork connection optimization (Phase 3).
To validate the contributions of each component in the proposed framework, we conducted an ablation study under Scenario 1, comparing connectivity (GC-size%) and communication efficiency (Average network efficiency) across four configurations (A–D), as shown in Figure 8. The results demonstrate that the full framework (Configuration D) achieves significant resilience improvements through phased optimizations.
As demonstrated in Figure 8’s ablation analysis, network resilience under node attacks varies significantly across configurations: Configuration A’s static topology exhibits cascading vulnerability with GC-size collapsing to 18% at 40% attacks, while Configuration B’s random inter-subnet connections preserve 65% local connectivity at 20% attacks yet suffer global degradation to 45% at 40% attacks due to unbalanced load distribution. Configuration C’s homogeneous scale-free subnets demonstrate 70% GC-size retention against random 30% attacks but collapse to 35% under degree-targeted 40% attacks, revealing limitations of uniform architectures. The proposed full framework (Configuration D) achieves superior robustness through dynamic subnet classification and inter-subnetwork connections, maintaining 78% GC-size at 40% attacks—a 330% improvement over baseline topology—thereby validating the necessity of adaptive hybrid network design.
Figure 8’s ablation also analysis reveals distinct efficiency degradation patterns under node attacks: Configuration A exhibits catastrophic sensitivity with efficiency collapsing from 0.24 (0% attacks) to 0.01 (50% attacks), while Configuration B’s small-world subnets maintain localized efficiency (0.15 at 20% attacks) but suffer global performance collapse to 0.04 at 50% attacks due to unoptimized inter-subnet links. Configuration C demonstrates inherent limitations with scale-free architectures, showing reduced baseline efficiency (0.18) and accelerated decay (0.02 at 50% attacks) from elongated path dependencies. The proposed framework (Configuration D) significantly outperforms others, sustaining 0.06 efficiency at 50% attacks—a 500% improvement over Configuration A—through inter-subnetwork mechanisms that effectively mitigate exponential decay beyond 30% attack intensity.
The ablation study confirms synergistic effects among framework components. These findings validate that subnetwork classification, differentiated topologies, and inter-subnetwork connections collectively enable IIoT resilience. Omitting any component degrades robustness, underscoring the framework’s holistic design.

5. Conclusions

This study addresses the critical challenge of enhancing IIoT resilience against heterogeneous cyber-physical attacks through feature-driven topology reconfiguration. By dynamically segmenting IIoT systems into attack-specific subnetworks and applying hybrid small-world and scale-free topologies, our framework achieves adaptive structural optimization tailored to localized threats. Experimental validation on a real-world radio frequency sensor network (2113 nodes, 21 subnetworks) demonstrates robust performance under entropy-preserving constraints: While maintaining system information entropy within 3.63–3.71 bits ( Δ H 2.2 % ), connectivity and communication efficiency improve by up to 129.4% and 67.2%, respectively, under diverse attack scenarios. These results underscore the effectiveness of integrating attack-aware subnetwork classification with differentiated topology design, offering a practical solution for real-world IIoT deployments.
Our experiments validate that the proposed framework significantly outperforms traditional static topologies (scale-free and small-world) under heterogeneous attack scenarios. While recent works focus on monolithic optimization, our hybrid approach achieves a 70–130% improvement in connectivity and 55–67% gain in efficiency by dynamically adapting to localized attack features. This demonstrates that real-world IIoT resilience requires not only structural optimization but also context-aware adaptability.
Future work will focus on the following:
  • Real-time attack classification: Enhancing segmentation accuracy by incorporating dynamic communication patterns and node-specific vulnerabilities and integrate Graph Neural Networks (GNNs) for real-time detection of attack characteristics, superseding the current Louvain-based offline segmentation approach.
  • Node capability-aware design: Integrating heterogeneous node properties (e.g., computational power, energy constraints) into topology optimization and proposing a multi-objective optimization model to jointly optimize robustness, energy consumption, and computational load during topology reconfiguration (as exemplified by m i n α R + β E + γ C ).
This approach advances IIoT security by aligning network resilience with evolving threat landscapes, paving the way for safer and more adaptive industrial automation systems.

Author Contributions

Conceptualization, T.W. and D.L.; methodology, T.W. and B.Z.; software, T.W. and B.Z.; validation, T.W., D.L., and B.Z.; formal analysis, B.Z.; investigation, T.W. and D.L.; resources, D.L.; data curation, T.W.; writing—original draft preparation, T.W. and B.Z.; writing—review and editing, W.S. and X.L.; visualization, B.Z. and X.L.; supervision, D.L. and W.S.; project administration, D.L.; funding acquisition, D.L. All authors have read and agreed to the published version of the manuscript.

Funding

This research was funded by the National Key Research and Development Program of China (2024YFB4709000), the National Industrial Internet Innovation and Development Program Project “Development of Endogenous Security Industrial Switch Equipment”, the National Natural Science Foundation of China under Grant 62173101, and the Key Laboratory of Computing Power Network and Information Security, Ministry of Education, under Grant 2024ZD018.

Data Availability Statement

The datasets analyzed in this study are openly available in the Network Data Repository [31], a comprehensive platform for network science research. All supporting data can be accessed through the official repository website at https://networkrepository.com (accessed on 1 March 2025), which provides persistent identifiers and standardized metadata for academic citation. The data acquisition and usage comply with MDPI’s research data policies as outlined at https://www.mdpi.com/ethics (accessed on 30 March 2025).

Conflicts of Interest

The authors declare no conflicts of interest.

References

  1. Choo, K.K.R.; Gritzalis, S.; Park, J.H. Cryptographic Solutions for Industrial Internet-of-Things: Research Challenges and Opportunities. IEEE Trans. Ind. Inform. 2018, 14, 3567–3569. [Google Scholar] [CrossRef]
  2. Jeong, Y.S. Secure IIoT Information Reinforcement Model Based on IIoT Information Platform Using Blockchain. Sensors 2022, 22, 4645. [Google Scholar] [CrossRef] [PubMed]
  3. Gulati, N.; Kaur, P.D. Towards socially enabled internet of industrial things: Architecture, semantic model and relationship management. Hoc Netw. 2019, 91, 101869. [Google Scholar] [CrossRef]
  4. Chai, H.; Jin, X.; Xu, C.; Xia, C. Review of Machine Learning-based 5G for Industrial Internet of Things. Inf. Control 2023, 52, 257–276. [Google Scholar] [CrossRef]
  5. Alrumaih, T.N.; Alenazi, M.J. GENIND: An industrial network topology generator. Alex. Eng. J. 2023, 79, 56–71. [Google Scholar] [CrossRef]
  6. Cheng, C.F.; Dong, Y.C.; Hsu, M.H.; Chang, H.Y. The Carrier-Based Sensor Deployment Problem in Industrial Internet of Things With Mesh Topologies. IEEE Internet Things J. 2024, 11, 41137–41150. [Google Scholar] [CrossRef]
  7. An, H.; Wang, L. Robust Topology Generation of Internet of Things Based on PPO Algorithm Using Discrete Action Space. IEEE Trans. Ind. Inform. 2024, 20, 5406–5414. [Google Scholar] [CrossRef]
  8. Ge, M.; Hong, J.B.; Yusuf, S.E.; Kim, D.S. Proactive defense mechanisms for the software-defined Internet of Things with non-patchable vulnerabilities. Future Gener. Comput. Syst. 2018, 78, 568–582. [Google Scholar] [CrossRef]
  9. Li, Z.; Wan, H.; Pang, Z.; Chen, Q.; Deng, Y.; Zhao, X.; Gao, Y.; Song, X.; Gu, M. An Enhanced Reconfiguration for Deterministic Transmission in Time-Triggered Networks. IEEE/ACM Trans. Netw. 2019, 27, 1124–1137. [Google Scholar] [CrossRef]
  10. Sekiyama, K.; Tkada, I.; Araki, H. Robustness Enhancement with Network Topology Reconfiguration Against Targeted and Random Attack. In Proceedings of the 2006 SICE-ICASE International Joint Conference, Busan, Republic of Korea, 18–21 October 2006; pp. 2746–2751. [Google Scholar] [CrossRef]
  11. Shannon, C.E. A mathematical theory of communication. Bell Syst. Tech. J. 1948, 27, 379–423. [Google Scholar] [CrossRef]
  12. Schneider, C.M.; Moreira, A.A.; Andrade, J.S.; Havlin, S.; Herrmann, H.J. Mitigation of malicious attacks on networks. Proc. Natl. Acad. Sci. USA 2011, 108, 3838–3841. [Google Scholar] [CrossRef]
  13. Latora, V.; Marchiori, M. A measure of centrality based on network efficiency. New J. Phys. 2007, 9, 188. [Google Scholar] [CrossRef]
  14. Chen, N.; Qiu, T.; Mu, C.; Han, M.; Zhou, P. Deep Actor-Critic Learning-Based Robustness Enhancement of Internet of Things. IEEE Internet Things J. 2020, 7, 6191–6200. [Google Scholar] [CrossRef]
  15. Buesser, P.; Daolio, F.; Tomassini, M. Optimizing the Robustness of Scale-Free Networks with Simulated Annealing. In Proceedings of the Adaptive and Natural Computing Algorithms, Ljubljana, Slovenia, 14–16 April 2011; Dobnikar, A., Lotrič, U., Šter, B., Eds.; Springer: Berlin/Heidelberg, Germany, 2011; pp. 167–176. [Google Scholar]
  16. Basu, P.; Redi, J. Movement control algorithms for realization of fault-tolerant ad hoc robot networks. IEEE Netw. 2004, 18, 36–44. [Google Scholar] [CrossRef]
  17. Tan, G.; Jarvis, S.A.; Kermarrec, A.M. Connectivity-Guaranteed and Obstacle-Adaptive Deployment Schemes for Mobile Sensor Networks. In Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems, Beijing, China, 17–20 June 2008; pp. 429–437. [Google Scholar] [CrossRef]
  18. Peng, H.; Si, S.; Awad, M.K.; Zhang, N.; Zhao, H.; Shen, X.S. Toward Energy-Efficient and Robust Large-Scale WSNs: A Scale-Free Network Approach. IEEE J. Sel. Areas Commun. 2016, 34, 4035–4047. [Google Scholar] [CrossRef]
  19. Sohn, I. Small-World and Scale-Free Network Models for IoT Systems. Mob. Inf. Syst. 2017, 2017, 6752048. [Google Scholar] [CrossRef]
  20. Musleh, A.S.; Khalid, H.M.; Muyeen, S.M.; Al-Durra, A. A Prediction Algorithm to Enhance Grid Resilience Toward Cyber Attacks in WAMCS Applications. IEEE Syst. J. 2019, 13, 710–719. [Google Scholar] [CrossRef]
  21. Fu, X.; Li, W.; Fortino, G. Empowering the Invulnerability of Wireless Sensor Networks through Super Wires and Super Nodes. In Proceedings of the 2013 13th IEEE/ACM International Symposium on Cluster, Cloud, and Grid Computing, Delft, The Netherlands, 13–16 May 2013; pp. 561–568. [Google Scholar] [CrossRef]
  22. Sitanayah, L.; Brown, K.N.; Sreenan, C.J. A fault-tolerant relay placement algorithm for ensuring k vertex-disjoint shortest paths in wireless sensor networks. Hoc Netw. 2014, 23, 145–162. [Google Scholar] [CrossRef]
  23. Ou, Z.; Wang, S. Finding robust and influential nodes on directed networks using a memetic algorithm. Swarm Evol. Comput. 2024, 87, 101542. [Google Scholar] [CrossRef]
  24. Wang, S.; Tan, X. Finding robust influential seeds from networked systems against structural failures using a niching memetic algorithm. Appl. Soft Comput. 2023, 136, 110134. [Google Scholar] [CrossRef]
  25. Wang, T.; Zeng, P.; Zhao, J.; Liu, X.; Zhang, B. Identification of Influential Nodes in Industrial Networks Based on Structure Analysis. Symmetry 2022, 14, 211. [Google Scholar] [CrossRef]
  26. Andria, J.; di Tollo, G.; Kalda, J. Propagation of Bankruptcy Risk over Scale-Free Economic Networks. Entropy 2022, 24, 1713. [Google Scholar] [CrossRef] [PubMed]
  27. Roveri, N.; Carcaterra, A.; Molinari, L.; Pepe, G. Safe and Secure Control of Swarms of Vehicles by Small-World Theory. Energies 2020, 13, 1043. [Google Scholar] [CrossRef]
  28. Zhu, Y.; Li, W.; Cai, X. Opinion evolution on a BA scaling network. Phys. A Stat. Mech. Its Appl. 2013, 392, 6596–6602. [Google Scholar] [CrossRef]
  29. Latora, V.; Marchiori, M. Efficient Behavior of Small-World Networks. Phys. Rev. Lett. 2001, 87, 198701. [Google Scholar] [CrossRef]
  30. Blondel, V.D.; Guillaume, J.L.; Lambiotte, R.; Lefebvre, E. Fast unfolding of communities in large networks. J. Stat. Mech. Theory Exp. 2008, 2008, P10008. [Google Scholar] [CrossRef]
  31. Rossi, R.A.; Ahmed, N.K. The Network Data Repository with Interactive Graph Analytics and Visualization. In Proceedings of the AAAI Conference on Artificial Intelligence, Austin, TX, USA, 25–30 January 2015. [Google Scholar]
Figure 1. Structural diagram of Industrial Internet of Things.
Figure 1. Structural diagram of Industrial Internet of Things.
Entropy 27 00503 g001
Figure 2. The behavior of these attack types on an example network. (a) Original network. (b) Attack on the node with the largest degree. (c) Attack on the node with the largest betweenness. (d) Attack on a random node.
Figure 2. The behavior of these attack types on an example network. (a) Original network. (b) Attack on the node with the largest degree. (c) Attack on the node with the largest betweenness. (d) Attack on a random node.
Entropy 27 00503 g002
Figure 3. Dynamic reconfiguration framework: (A) original IIoT topology; (B) attack feature classification; (C) subnetwork-specific topology optimization; (D) global connection restoration.
Figure 3. Dynamic reconfiguration framework: (A) original IIoT topology; (B) attack feature classification; (C) subnetwork-specific topology optimization; (D) global connection restoration.
Entropy 27 00503 g003
Figure 4. Multi-scale topological architecture with community partitioning in Tech-Routers-RF network.
Figure 4. Multi-scale topological architecture with community partitioning in Tech-Routers-RF network.
Entropy 27 00503 g004
Figure 5. Testbed architecture of the real-world dataset.
Figure 5. Testbed architecture of the real-world dataset.
Entropy 27 00503 g005
Figure 6. Effect of connectivity topology reconfiguration in different scenarios.
Figure 6. Effect of connectivity topology reconfiguration in different scenarios.
Entropy 27 00503 g006
Figure 7. Effect of communication efficiency topology reconfiguration in different scenarios.
Figure 7. Effect of communication efficiency topology reconfiguration in different scenarios.
Entropy 27 00503 g007
Figure 8. Results of ablation study in Scenario 1.
Figure 8. Results of ablation study in Scenario 1.
Entropy 27 00503 g008
Table 1. Basic statistics for overall network.
Table 1. Basic statistics for overall network.
NetworksNode Num.Link Num.Ave. DegAve. BetwAve. SPLCCQ
Total network211366326.280.0024.610.250.69
Table 2. Basic statistics for subnet networks.
Table 2. Basic statistics for subnet networks.
NetworksNode Num.Link Num.Ave. DegAve. BetAve. SPLCC
Subnet 12135054.740.0133.740.24
Subnet 22004444.440.0143.680.25
Subnet 31733413.940.0163.730.20
Subnet 41472052.790.0264.740.19
Subnet 51432693.760.0173.380.20
Subnet 61373014.390.0234.050.26
Subnet 71312293.500.0223.780.22
Subnet 811063611.560.0132.430.47
Subnet 91071823.400.0294.040.23
Subnet 101013326.570.0202.990.38
Subnet 11973767.750.0162.520.58
Subnet 12931763.780.0313.810.29
Subnet 137348813.370.0202.430.55
Subnet 1468922.710.0524.470.17
Subnet 15641775.530.0363.250.38
Subnet 1662862.770.0333.010.14
Subnet 1759652.200.0463.620.07
Subnet 1857782.740.0584.200.28
Subnet 1937432.320.0593.080.27
Subnet 2035362.060.0813.660.04
Subnet 21682.670.1331.530.58
Table 3. Different attack scenarios faced by the typical IIoT systems.
Table 3. Different attack scenarios faced by the typical IIoT systems.
Attack ScenariosScenario 1Scenario 2Scenario 3Scenario 4
Subnet 1DegRandDegDeg
Subnet 2BetwDegDegBetw
Subnet 3DegDegDegRand
Subnet 4BetwBetwBetwDeg
Subnet 5DegBetwBetwBetw
Subnet 6BetwBetwBetwRand
Subnet 7RandRandRandDeg
Subnet 8DegRandRandBetw
Subnet 9BetwDegRandRand
Subnet 10DegDegDegDeg
Subnet 11BetwBetwDegBetw
Subnet 12DegBetwDegRand
Subnet 13BetwBetwBetwDeg
Subnet 14RandRandBetwBetw
Subnet 15DegRandBetwRand
Subnet 16BetwDegRandDeg
Subnet 17DegDegRandBetw
Subnet 18BetwBetwRandRand
Subnet 19DegBetwDegDeg
Subnet 20BetwBetwDegBetw
Subnet 21RandRandDegRand
Table 4. Comparison of metrics before and after reconfiguration in different scenarios.
Table 4. Comparison of metrics before and after reconfiguration in different scenarios.
ScenariosMetricsBefore ReconfigurationAfter Reconfiguration
Scenario 1Ave. Deg6.286.28
Ave. Betw0.00170.0018
Ave. SPL4.614.75
CC0.250.029
Information Entropy3.683.63
Scenario 2Ave. Deg6.286.28
Ave. Betw0.00170.0017
Ave. SPL4.614.61
CC0.250.037
Information Entropy3.683.65
Scenario 3Ave. Deg6.286.28
Ave. Betw0.00170.0017
Ave. SPL4.614.67
CC0.250.0372
Information Entropy3.683.70
Scenario 4Ave. Deg6.286.28
Ave. Betw0.00170.0017
Ave. SPL4.614.63
CC0.250.038
Information Entropy3.683.71
Table 5. Cumulative impact of connectivity resilience performance under different attack scenarios.
Table 5. Cumulative impact of connectivity resilience performance under different attack scenarios.
ScenarioOriginalOursScale-FreeSmall-WorldImprovement
Scenario 116.3037.3928.4536.83+129.4%
Scenario 220.7737.2930.7436.75+79.5%
Scenario 319.2737.0233.0637.48+92.1%
Scenario 420.8837.1532.0637.17+78.0%
Table 6. Cumulative impact of communication efficiency resilience performance under different attack scenarios.
Table 6. Cumulative impact of communication efficiency resilience performance under different attack scenarios.
ScenarioOriginalOursScale-FreeSmall-WorldImprovement
Scenario 10.0190.0580.0390.036+67.2%
Scenario 20.0250.0600.0440.037+58.3%
Scenario 30.0230.0580.0490.038+60.3%
Scenario 40.0260.0590.0460.038+55.9%
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Wang, T.; Li, D.; Zhang, B.; Liu, X.; Shang, W. Resilient Topology Reconfiguration for Industrial Internet of Things: A Feature-Driven Approach Against Heterogeneous Attacks. Entropy 2025, 27, 503. https://doi.org/10.3390/e27050503

AMA Style

Wang T, Li D, Zhang B, Liu X, Shang W. Resilient Topology Reconfiguration for Industrial Internet of Things: A Feature-Driven Approach Against Heterogeneous Attacks. Entropy. 2025; 27(5):503. https://doi.org/10.3390/e27050503

Chicago/Turabian Style

Wang, Tianyu, Dong Li, Bowen Zhang, Xianda Liu, and Wenli Shang. 2025. "Resilient Topology Reconfiguration for Industrial Internet of Things: A Feature-Driven Approach Against Heterogeneous Attacks" Entropy 27, no. 5: 503. https://doi.org/10.3390/e27050503

APA Style

Wang, T., Li, D., Zhang, B., Liu, X., & Shang, W. (2025). Resilient Topology Reconfiguration for Industrial Internet of Things: A Feature-Driven Approach Against Heterogeneous Attacks. Entropy, 27(5), 503. https://doi.org/10.3390/e27050503

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop