Ad Hoc network key node identification method fused with deletion method

Abstract

The invention discloses a dynamic Ad Hoc network key node identification method. The dynamic Ad Hoc network key node identification method comprises the following steps of: constructing an Ad Hoc network model, defining the connectivity of an Ad Hoc network, defining the connectivity of the Ad Hoc network after nodes are deleted, defining the key degree of Ad Hoc network nodes, dynamically identifying Ad Hoc network key nodes, and determining the key performance sequence of the Ad Hoc network nodes. The dynamic Ad Hoc network key node identification method disclosed by the invention solves the following problems in the existing algorithm: key nodes of a network are difficultly given; the key performances of the identified key nodes cannot be distinguished; the existing algorithm is not suitable for key node identification of a large-scale network or a dynamic network, etc. Thereby, the identification efficiency of the Ad Hoc network key nodes is further increased; and the security and the reliability of the Ad Hoc network are improved.

Description

technical field [0001] The invention belongs to the technical field of network security, in particular to an Ad Hoc network key node identification method based on a fusion deletion method. Background technique [0002] Ad Hoc network is a kind of self-organizing network, and its topology structure will change with the movement of communication nodes. Therefore, when identifying key nodes, a fast and effective method is needed to adapt to its dynamically changing topology structure. . At present, the methods of network key node identification are mainly divided into two categories: the first category is social network analysis method: including: degree value method, betweenness method, k-shell decomposition method, eigenvector method, semi-local centrality method, etc., these The method is to equate the criticality of the nodes with the salience, and the research on the indicators does not destroy the integrity of the network; although the intermediary method can accurately...

AI Technical Summary

Problems solved by technology

At present, the methods of network key node identification are mainly divided into two categories: the first category is social network analysis method: including: degree value method, betweenness method, k-shell decomposition method, eigenvector method, semi-local centrality method, etc., these The method is to equate the criticality of the nodes with the salience, and the research on the indicators does not destroy the integrity of the network; although the intermediary method can accurately grasp the overall topology information of the network, it seems to have a good effect on the identification of key nodes, but its The time complexity of the algorithm is relatively high, and it is not suitable for large-scale dynamic Ad Hoc networks; although the semi-local centrality method can quickly identify the key nodes of large-scale networks, this method only considers the degree of nodes within the range of four hops. relationship, and cannot accurately give the key nodes of the network

The second type is the node deletion method, which is the destructiveness of the network after the key equivalent of the node is deleted, and the research on the index destroys the integrity of the network

Although the node contraction method can identify the key nodes of the network by measuring the degree of network cohesion after node contraction, when multiple nodes have the same network topology after contraction, the criticality of these nodes is difficult to distinguish

Although the node deletion method based on the k-hop range can quickly identify the key nodes of a large-scale Ad Hoc network, if there are too many segmentation points in the network itself, the identified key nodes will be unable to distinguish because of the large number. criticality

Images