A node robust enhancing algorithm based on graph theory

An enhancing node-robustness algorithm using node diversity is proposed. According to node vulnerabilities, this algorithm can mitigate the exploitation of these vulnerabilities and the propagation of concerning attacks, because the correlativity of nodes is decreased via a way of using node diversities. Moreover, all steps and relative definitions are given about this algorithm. In the end, the experimental results demonstrate its effectiveness.