Optimizing the topology of scale-free networks with redundant edges

With the enlargement of sizes of networks, scale-free property of networks is present. However, scale-free networks are fragile. If the nodes with most degree are attacked, the whole network will be devastated. This paper proposed an algorithm to optimize the topology of scale-free networks with redundant edges. Adjacent networks of key nodes will be linked as a rotary and junction structure, to ensure the communication between remaining nodes when critical nodes are attacked. A simulation was carried out to prove that the resilience of scale-free network to removal of key nodes could be enhanced using the proposed algorithm.