Constrained Optimization of Critical Node Detection with Cost Model in Communication Networks

Communication network plays an indispensable role in society, and its security has also received more and more attention. This paper combines the protection of nodes and detects critical nodes under the constraints of network connectivity. First, three types of stochastic, normal, and degree cost models are proposed according to the characteristics of node cost. Then, this paper designs an efficient two-dimensional search algorithm to search for the optimal node set. The algorithm uses the principle to search under the premise of classifying the network, which significantly increases the search efficiency. Finally, we conducted simulation experiments in three types of simulations and real networks to prove the algorithm’s effectiveness and found that with the increase of constraints, the cost first increased linearly and then increased explosively.