Research on Theory and Application of Solving Central Node in Complex Networks

The research on centrality in complex networks is an important branch in network security field, and the importance of a network node can be measured by its centrality. Based on the introduction and classification of network centrality measures such as degree centrality, closeness centrality, betweenness centrality and eigenvector centrality, three concepts, i.e. Node Traversal Degree, Network Traversal Degree and Network Central Node are defined, and a theory of solving the central node in complex networks is proposed. Then an algorithm used to search the central node in complex networks and an algorithm for traversing the whole network through the central node are designed. Finally, the correctness of the theory is validated by a practical application. The theory solves the problem of searching the central node in complex networks quickly and effectively, providing both a solution for the precision timing in a LAN and a theoretical basis for the LAN defense. Finally, the practical application shows the feasibility and veracity of this appoach.