2012
DOI: 10.1088/0031-8949/85/03/035803
|View full text |Cite
|
Sign up to set email alerts
|

A new way to improve the robustness of complex communication networks by allocating redundancy links

Abstract: We investigate the robustness of complex communication networks on allocating redundancy links. The protecting key nodes (PKN) strategy is proposed to improve the robustness of complex communication networks against intentional attack. Our numerical simulations show that allocating a few redundant links among key nodes using the PKN strategy will significantly increase the robustness of scale-free complex networks. We have also theoretically proved and demonstrated the effectiveness of the PKN strategy. We exp… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
5
0

Year Published

2013
2013
2023
2023

Publication Types

Select...
7

Relationship

0
7

Authors

Journals

citations
Cited by 12 publications
(5 citation statements)
references
References 11 publications
0
5
0
Order By: Relevance
“…In the aspect of network connectivity enhancement, Chen et al [2] proposed edge adding strategies based on degree centrality, proximity centrality, intermediate centrality and feature vector centrality respectively to deal with network attacks; Jiang et al [3] changed the network topology by randomly adding edges, low degree adding edges and low intermediate adding edges to enhance the network performance; Cao et al [4] comprehensively studied random edge adding strategy, high dielectric edge connecting strategy and low polarization edge connecting strategy, and considered the cost of network connection; Ghosh et al [5] proposed an edge adding method based on greedy strategy. The objective function is to maximize the second largest Laplacian eigenvalue, and each edge adding selects the edge that can maximize the eigenvalue; Kim et al [6] considered the second small eigenvalue of Laplace matrix and designed a more concise network edge adding strategy based on dichotomy; Shi et al [7] proposed a strategy to protect key nodes, adding redundant edges between key nodes of the network to improve the robustness of scale-free networks; Zhao et al proposed the random local reconnection method, which is used when the network reconnection requires edge addition.…”
Section: Research On Communication Network Topologymentioning
confidence: 99%
“…In the aspect of network connectivity enhancement, Chen et al [2] proposed edge adding strategies based on degree centrality, proximity centrality, intermediate centrality and feature vector centrality respectively to deal with network attacks; Jiang et al [3] changed the network topology by randomly adding edges, low degree adding edges and low intermediate adding edges to enhance the network performance; Cao et al [4] comprehensively studied random edge adding strategy, high dielectric edge connecting strategy and low polarization edge connecting strategy, and considered the cost of network connection; Ghosh et al [5] proposed an edge adding method based on greedy strategy. The objective function is to maximize the second largest Laplacian eigenvalue, and each edge adding selects the edge that can maximize the eigenvalue; Kim et al [6] considered the second small eigenvalue of Laplace matrix and designed a more concise network edge adding strategy based on dichotomy; Shi et al [7] proposed a strategy to protect key nodes, adding redundant edges between key nodes of the network to improve the robustness of scale-free networks; Zhao et al proposed the random local reconnection method, which is used when the network reconnection requires edge addition.…”
Section: Research On Communication Network Topologymentioning
confidence: 99%
“…In the experiment of random attack or intentional attack on scale-free network, Zhang et al (2011) designed a nonlinear integer programming scheme to improve the robustness of intermediate link failure in the network. When assigning redundant links to complex communication networks, some researchers have constructed a key node protection strategy, that is, assigning some redundant links between key nodes will significantly improve the robustness of scale-free network (Shi et al, 2012).…”
Section: Related Workmentioning
confidence: 99%
“…An end-to-end gene regulatory graph neural network method is proposed under the framework of supervised and semi-supervised. Xiao et al [29] proposed an attention-based convolutional neural network link prediction method that can effectively improve the performance by fusing and mining structural features and text features.…”
Section: Literature Reviewmentioning
confidence: 99%