Unlock instant, AI-driven research and patent intelligence for your innovation.

A method and system for selecting key nodes in a communication network

A key node and communication network technology, applied in the field of network management, can solve the problems of small comprehensive influence of nodes, overlapping influence ranges, and large overlapping influence of key nodes, so as to improve the comprehensive influence, prevent virus or information dissemination, The effect of controlling the spread of viruses or information

Active Publication Date: 2022-04-15
CETC BIGDATA RES INST CO LTD +1
View PDF5 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0015] Based on the heuristic algorithm, the results and the optimal value are quite different, and the heuristic algorithm only selects according to the influence of a single node, ignoring the coupling effect between nodes. For example, in the K-kernel algorithm, a single high K-shell Nodes have great influence, but the combined influence of nodes with multiple high K-shells is small. The main reason is that these highly influential nodes have similar neighbors, and the influence range has a large overlap
The matrix-based comprehensive influence algorithm can achieve the optimal value in the model network, but the effect is poor in some actual networks, because there are many loops in the actual network and have complex internal structures, such as clustering characteristics, degree correlation properties, rich club characteristics, etc., resulting in the formation of local dense sub-networks in the actual network, ignoring the loop characteristics of information transmission in the network, resulting in a large overlapping influence between the selected key nodes, while the key nodes’ Comprehensive influence is small

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • A method and system for selecting key nodes in a communication network
  • A method and system for selecting key nodes in a communication network
  • A method and system for selecting key nodes in a communication network

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0061] Embodiment 1 of the present invention provides a method for selecting key nodes in a communication network.

[0062] Such as figure 1 As shown, the selection method includes the following steps:

[0063] Step 101, determine the adjacency matrix of the original network; step 102, calculate the influence of each node in the original network according to the adjacency matrix and the overlapping influence algorithm based on Rayleigh entropy; step 103, select the most influential node as a key node, and add the key node to the set of key nodes; step 104, judge whether the number of key nodes is less than a preset threshold; step 105, if the number of key nodes is less than a preset threshold, delete the original The edge passing through the key node in the network is obtained the updated original network, and according to the updated original network, the adjacency matrix is ​​updated; the return step "according to the adjacency matrix, the overlap influence based on Raylei...

Embodiment 2

[0065] Embodiment 2 of the present invention provides a preferred implementation manner of a method for selecting a key node in a communication network, but the implementation of the present invention is not limited to the implementation manner defined in Embodiment 2 of the present invention.

[0066] Such as figure 2 as shown,

[0067] The data preprocessing of the original network is preferred. If it is a directed weighted graph, the direction and weight of the edge are ignored. Since the nodes in different subgraphs do not transmit information to each other, the isolated nodes and isolated clusters in the network are deleted at the same time. .

[0068] Then, the determination of the adjacency matrix of the original network specifically includes

[0069] The input original network is expressed as an adjacency matrix A={a ij} N×N , where a ij is the element value of the position of the adjacency matrix A(i, j), indicating the weight between node i and node j, when the...

Embodiment 3

[0085] Embodiment 3 of the present invention provides a method for verifying the effectiveness of a method for selecting key nodes in a communication network.

[0086] Take the key node selection algorithm based on node degree as an example:

[0087] Calculate the degree of each node separately.

[0088] Sort the degree of each node.

[0089] Select the first two nodes as key nodes, such as image 3 b According to the algorithm, we can know that the key nodes are 4 and 6.

[0090] Take the key node selection algorithm based on Rayleigh entropy as an example:

[0091] According to the node importance formula S m = d m ∑ j,k a mj a jk d k +∑ j,k a jm a mk d j d k Calculate the importance of each node.

[0092] Select the node with the highest node importance and delete the edges connected to this node.

[0093] Repeat (1), (2) until two key nodes are selected. Such as image 3 a According to the algorithm, it can be known that the key nodes are 1, 6;

[0094] ...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

The invention discloses a method and system for selecting key nodes in a communication network. The selection method of the present invention is based on the overlapping influence algorithm of Rayleigh entropy, calculates the influence between key nodes, and improves the comprehensive influence of key nodes. The invention uses the overlapping influence algorithm of Rayleigh entropy to describe the mixed behavior of information transfer in the network, and has a better performance in the actual network, and the invention removes the key nodes, so that the entire network will be hashed into many In practical applications, groups that are not connected to each other can better control the spread of viruses or information.

Description

technical field [0001] The invention relates to the field of network management, in particular to a method and system for selecting key nodes in a communication network. Background technique [0002] The structure of a large number of natural and artificial systems can be abstracted as a network composed of points and lines, including food chain networks, social networks, etc. These networks have similar topological networks, and secondly, these networks also have some similar dynamical behaviors. Information dissemination and diffusion is a common dynamic behavior in the network. In the network, information is transmitted from one node to another with a certain probability. Generally, there is a critical threshold for the propagation probability. If the propagation probability is higher than the critical threshold, The initial small amount of information will quickly spread to the entire network; otherwise, the information will perish during the transmission process. In t...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
Patent Type & Authority Patents(China)
IPC IPC(8): H04L41/0803H04L41/12H04L41/14H04L41/28
Inventor 周明洋吴向阳曹杨罗燎廖好陆克中毛睿
Owner CETC BIGDATA RES INST CO LTD