A Method for Extracting Vulnerable Nodes in Cyber Space Confrontation of Complex Maritime Formations

By constructing node adjacency matrix and calculating degree cores, fragile nodes in complex maritime formations are identified and extracted, and the robustness of formations is solved under cyberspace attacks is improved.

CN116489663BActive Publication Date: 2025-08-01THE 724TH RESEARCH INSTITUTE OF CHINA STATE SHIPBUILDING CORP LTD +1
View PDF 2 Cites 0 Cited by

Patent Information

Application Number
CN202310426828.2
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2023-04-20
Publication Date
2025-08-01
Estimated Expiration
2043-04-20

AI Technical Summary

Technical Problem

In complex maritime formations, how to identify and extract the most vulnerable nodes attacked by enemy cyberspace to optimize the formation network topology and improve the formation's robustness and information domain advantages in a strong confrontation environment.

Method used

By constructing the adjacency matrix of each node in the formation, calculate the degrees and cores of the nodes, determine the most vulnerable nodes in the formation, and use the method of comprehensive judgment of cores and degrees to extract the cyberspace against the fragile nodes.

Benefits of technology

Effectively identify and extract cyberspace to fight vulnerable nodes, optimize the formation network configuration, and improve the formation's resistance in the electromagnetic domain and network domain.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN116489663B_ABST
    Figure CN116489663B_ABST
Patent Text Reader

Abstract

The present invention proposes a method for extracting vulnerable nodes in the cyber space confrontation of a complex maritime formation. By constructing the adjacency matrix of each node in the formation and calculating the degree and core number K of each node in the formation i , the vulnerable nodes in the cyber space confrontation are jointly determined according to the core number and degree of each node in the formation. The present invention can realize the discovery and extraction of vulnerable nodes in a complex dynamic formation, assist in optimizing the networking configuration of the formation, and effectively improve the ability of the formation to resist cyber space attacks in the electromagnetic domain and network domain.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The invention relates to a method for networking a maritime fleet. Background Art

[0002] During cyberspace operations, in the process of networking and coordination of complex maritime formations composed of drone clusters, large surface ship formations, air-based / space-based early warning and detection equipment, how to determine the nodes in the complex formation that are most affected by enemy cyberspace injection, so as to optimize the information transmission topology structure of the formation network nodes, improve the robustness of the formation's collaborative networking in a strong confrontation environment, and assist the formation in obtaining information domain advantages in cyberspace operations is an urgent problem to be solved.

[0003] (1) Radar network detection

[0004] Current radar networking detection is mainly based on the existing radar equipment through wired / wireless links to achieve formation radar networking, and adopts multi-radar collaborative information processing methods to achieve performance benefits in detection power, anti-stealth and anti-interference compared with single radar.

[0005] (2) Impact of networking nodes on maritime formations

[0006] As fleets grow in size and their coordination methods increase, the probability of complex maritime fleet network nodes being affected by enemy cyberspace operations has increased significantly. Enemies using electromagnetic and cyber domains to influence a single node within the fleet can cause information obstruction, bias, or falsification in that node's access. This information then propagates throughout the fleet's coordinated network, increasing the risk of mission failure. For example, with the maturation of unmanned swarm technology, a maritime fleet comprised a multi-platform coordinated fleet of sea-based, land-based, air-based, and space-based sensors, accompanied by multiple swarms of forward-looking early warning and reconnaissance drones performing surveillance missions. The enemy launched intensive decoy jamming with decoy targets against a single drone within the swarm, a drone that performed core tasks such as information relay and cluster situational analysis. The erroneous information injected by the enemy propagated through this node within the fleet network, reducing our information advantage through extremely low-cost cyberspace means. This, through a "faulty situation leading to faulty decision-making and command," put the fleet at a significant disadvantage in multi-domain confrontations.

[0007] (3) The importance of node propagation varies under different network topologies

[0008] Constrained by resource conditions such as space-time-frequency-energy calculation, etc., the large-scale complex maritime formation cluster network adopts a specific topological structure to achieve the connection of all formation nodes, and the network topological configuration changes dynamically with the formation merger and split, the addition and withdrawal of combat units. For example, in order to implement low-intercept nodes to communicate with a specified limited number of node beams by using narrow beams; under different network topological structures, the hub role or core role of a certain node in the network will change; in the future, the maritime formation composed of a large number of unmanned cluster nodes, shore-based / space-based / air-based nodes will result in a large number of network nodes and a complex network topological structure, and the merger and separation of large-scale friendly formations and the addition and withdrawal of large formation combat units will make the network topological structure time-varying, leading to a sharp increase in the difficulty of identifying the importance of each node within the formation.

[0009] Therefore, based on the above analysis of (1), (2), and (3), how to identify and extract vulnerable nodes in the cyber space confrontation through complex formation topological configurations is an urgent problem to be solved. Summary of the Invention

[0010] Current radar networking detection mainly realizes formation radar networking through wired / wireless links based on existing radar equipment, and adopts multi-radar collaborative information processing means to obtain performance benefits in terms of detection power, anti-stealth and anti-jamming compared with single radars. With the growth of the scale of the ship formation and the increase of collaborative methods, the probability that the nodes of the complex maritime formation network are affected by the enemy's cyber space operations has increased significantly. The enemy's influence on a certain node within the formation in the electromagnetic domain and network domain causes problems such as blockage / deviation / falsification in the information obtained by the single node, and the spread of the node information in the formation collaborative network exacerbates the risk of the formation's failure to perform combat tasks. Constrained by resource conditions such as space-time-frequency-energy calculation, etc., the large-scale complex maritime formation cluster network adopts a specific topological structure to achieve the connection of formation nodes, and the network topological configuration changes dynamically with the formation merger and split, the addition and withdrawal of combat units. How to extract vulnerable nodes in the cyber space confrontation of complex formation topological configurations is an urgent problem to be solved.

[0011] The present invention provides a method for extracting vulnerable nodes in the cyber space confrontation of complex maritime formations. First, construct the adjacency matrix of each node in the current formation; secondly, calculate the degree statistics of each node in the formation according to the adjacency matrix of the current formation; then, calculate the core number K of the i-th node in the formation according to the adjacency matrix of the current formation i ; finally, determine the vulnerable nodes in the cyber space confrontation of the formation according to the core numbers and degrees of each node in the maritime formation.

[0012] The present invention provides a method for discovering and extracting vulnerable nodes in a time-varying complex formation network that are most affected by cyber operations on formation coordination, which can assist in optimizing the formation networking configuration, thereby effectively enhancing the formation's ability to resist cyber attacks in the electromagnetic domain and network domain. Brief Description of the Drawings

[0013] Figure 1 It is a schematic diagram for the extraction method of vulnerable nodes in the cyber space confrontation of a maritime complex formation;

[0014] Figure 2 It is a detailed diagram for the specific implementation of the extraction method of vulnerable nodes in the cyber space confrontation of a maritime complex formation. Specific Embodiments

[0015] The present invention will be further explained below in conjunction with the drawings and embodiments.

[0016] The present invention proposes a method for extracting vulnerable nodes in the cyber space confrontation of a maritime complex formation, including the following steps:

[0017] Step 1: Construct the adjacency matrix of each node in the current formation:

[0018] Sub-step 1-1: Assume that the maritime formation includes n nodes, denoted as Node 1, Node 2, Node 3,... Node n. The current formation adjacency matrix A is initialized with an n*n order all-zero matrix, denoted as A = [0] n×n ;

[0019] Sub-step 1-2: Traverse all nodes in the current formation. If node i has a networking communication link with node j, then update the element A ij and the element A ji in the current formation adjacency matrix A to 1;

[0020] Step 2: According to the current formation adjacency matrix, generate the degree statistics of each node in the formation in the following manner. Denote the degree of the i-th node in the formation as D i :

[0021] Sub-step 2-1: Take the i-th row in the current formation adjacency matrix A to construct the i-th row vector A i of the current formation adjacency matrix A;

[0022] Sub-step 2-2: Construct the extraction vector Ones according to the following formula:

[0023] Ones = [1 1...1] 1×n ;

[0024] Sub-step 2-3: Calculate the degree of the i-th node in the formation according to the following formula

[0025] Di = A i ·Ones T ;

[0026] Step 3: Calculate the core number K of the i-th node of the formation according to the current formation adjacency matrix i :

[0027] Sub-step 3-1: Initially set k = 2, and initially set the adjacency matrix AK for core iterative search as A;

[0028] Sub-step 3-2: Starting from node i (i = 1), perform a loop search for each node according to the following method:

[0029] Sub-step 3-2-1: Initially set the current loop core number discovery label nextloop to 0; check whether the core numbers of all nodes in the formation have been counted. If the core numbers of all nodes in the formation have been recorded, execute Step 4; otherwise, execute Sub-step 3-2-2;

[0030] Sub-step 3-2-2: Calculate the degree of the i-th node corresponding to the adjacency matrix AK for core iterative search: Take the i-th row in the adjacency matrix AK for core iterative search to construct the i-th row vector AK of the adjacency matrix AK for core iterative search i ; Calculate the degree DK of the i-th node corresponding to the adjacency matrix AK for core iterative search i = AK i ·Ones T , and transfer to execute Sub-step 3-2-3;

[0031] Sub-step 3-2-3: Calculate the core number Ki of the i-th node corresponding to the adjacency matrix AK for core iterative search. If the degree DK of the i-th node in the adjacency matrix AK for core iterative search i < k, and the core number of this node has not been recorded, record the core number Ki = k - i, and transfer to execute Sub-step 3-2-4; otherwise, execute Sub-step 3-2-5;

[0032] Sub-step 3-2-4: Assign all elements in the i-th row of the adjacency matrix AK for core iterative search to 0, assign all elements in the i-th column of the adjacency matrix AK for core iterative search to 0, assign the current loop core number discovery label nextloop to 1, and transfer to execute Sub-step 3-2-5;

[0033] Sub-step 3-2-5: Loop search and judgment: If i < n, set i = i + 1 and transfer to execute Sub-step 3-2-2; if i = n and the value of the tag nextloop is found to be 1 for the current number of loop cores, set i = 1 and transfer to execute Sub-step 3-2-2; if i = n and the value of the tag nextloop is found to be 0 for the current number of loop cores, set i = 1, k = k + 1, and transfer to execute Sub-step 3-2-1.

[0034] Step 4: Determine the vulnerable nodes in the cyber space confrontation of the maritime formation according to the number of cores and degrees of each node in the maritime formation:

[0035] Search for the node m with the largest number of cores in the formation. If there is a unique node m with the largest number of cores, extract the node m as the vulnerable node in the cyber space confrontation of the complex maritime formation and output the node; if there are multiple nodes with the largest number of cores, select the node md with the largest degree among the multiple nodes with the largest number of cores, extract the node md as the vulnerable node in the cyber space confrontation of the complex maritime formation, and output the node.

Claims

1. A method for extracting vulnerable nodes in the cyber - space confrontation of a complex maritime formation, characterized in that: Step 1: Construct the adjacency matrix of each node in the current formation: Sub-step 1-1: Assume that the maritime formation contains n nodes, denoted as Node 1, Node 2, Node 3, ... Node n. The current formation adjacency matrix A is initialized with an n*n all-zero matrix, denoted as A = [0] n×n ; Sub-step 1-2: Traverse all nodes in the current formation. If node i and node j establish a networking communication link, then update the elements A ij and element A ji in the adjacency matrix A of the current formation to 1; Step 2: According to the current formation adjacency matrix, generate the degree statistics of each node in the formation according to the following method. Denote the degree of the \(i\)-th node in the formation as \(D\). i : Sub-step 2-1: Take the i-th row in the current formation adjacency matrix A to construct the i-th row vector A of the current formation adjacency matrix A i ; Sub - step 2 - 2: Construct the extraction vector Ones according to the following formula: Ones=[1 1 ... 1] 1×n ; Sub - step 2 - 3: Calculate the degree of the i - th node in the formation according to the following formula: D i = A i ·Ones T ; Step 3: Calculate the core number K of the i-th node of the formation according to the current formation adjacency matrix i : Sub - step 3 - 1: Initially set k = 2, and initially set the adjacency matrix AK for kernel iterative search as AK = A; Sub - step 3 - 2: Starting from node i = 1, perform a loop search for each node according to the following method: Sub - step 3 - 2 - 1: Initially set the current loop kernel discovery label nextloop to 0; check whether the kernel numbers of all nodes in the formation have been counted. If the kernel numbers of all nodes in the formation have been recorded, execute Step 4; otherwise, execute Sub - step 3 - 2 - 2; Sub-step 3-2-2: Calculate the degree of the $i$-th node corresponding to the adjacency matrix $A_K$ for kernel iterative search: Take the $i$-th row in the adjacency matrix $A_K$ for kernel iterative search to construct the $i$-th row vector $A_K$ of the adjacency matrix $A_K$ for kernel iterative search i ; Calculate the degree $D_K$ of the $i$-th node corresponding to the adjacency matrix $A_K$ for kernel iterative search i = $A_K$ i ·Ones T , and then proceed to execute Sub-step 3-2-3; Sub-step 3-2-3: Calculate the number of kernels Ki corresponding to the i-th node of the adjacency matrix AK for kernel iterative search. If the degree DK of the i-th node in the adjacency matrix AK for kernel iterative search i <is less than k, and the number of kernels of this node has no record, then record the number of kernels of this node as Ki = k - i, and transfer to execute sub-step 3-2-4; otherwise, execute sub-step 3-2-5; Sub - step 3 - 2 - 4: Assign all elements in the i - th row of the adjacency matrix AK for kernel iterative search to 0, assign all elements in the i - th column of the adjacency matrix AK for kernel iterative search to 0, assign the current loop kernel discovery label nextloop to 1, and transfer to execute Sub - step 3 - 2 - 5; Sub - step 3 - 2 - 5: Loop search judgment: If i < n, then set i = i + 1 and transfer to execute Sub - step 3 - 2 - 2; If i = n and the value of the current loop kernel discovery label nextloop is 1, then set i = 1 and transfer to execute Sub - step 3 - 2 - 2; If i = n and the value of the current loop kernel discovery label nextloop is 0, then set i = 1, k = k + 1, and transfer to execute Sub - step 3 - 2 - 1; Step 4: Determine the vulnerable nodes in the cyber - space confrontation of the formation according to the kernel numbers and degrees of each node in the maritime formation: Search for the node m with the largest kernel number in the formation. If there is a unique node m with the largest kernel number, extract node m as the vulnerable node in the cyber - space confrontation of the complex maritime formation and output this node; if there are multiple nodes with the largest kernel number, then select the node md with the largest degree among the above - mentioned multiple nodes with the largest kernel number, extract node md as the vulnerable node in the cyber - space confrontation of the complex maritime formation, and output this node.

Citation Information

Patent Citations

  • Smart power grid node vulnerability assessment method, system and device, and storage medium

    CN113094975A

  • Apparatus and method for detecting critical nodes and critical links in a multi-hop network

    US20130064139A1