Vulnerability Analysis for Complex Networks under the Shortest Path-Attack Strategies

DOI

10.2991/cimns-16.2016.35How to use a DOI?

Keywords

vulnerability; complex network; shortest path-attack; degree; betweeness

Abstract

We proposed three shortest path-attack strategies and investigated the vulnerability of three complex model networks under these path-attack strategies. The experimental results indicate that the robustness of random network is the weakest, but small-world network is the strongest under the shortest path-attack strategies. We also obtain that the shortest path-attack strategies are more harmful than RPA(random augmenting approach) attack strategy. These findings supplement and extend the previous attack results and can thus help us to provide some insights into the design of more robust networks.

Copyright

© 2016, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Yaohui Hao
AU  - Jihong Han
AU  - Qinghua Cheng
AU  - Yongjin Hu
PY  - 2016/09
DA  - 2016/09
TI  - Vulnerability Analysis for Complex Networks under the Shortest Path-Attack Strategies
BT  - Proceedings of the 2016 International Conference on Communications, Information Management and Network Security
PB  - Atlantis Press
SP  - 138
EP  - 141
SN  - 2352-538X
UR  - https://doi.org/10.2991/cimns-16.2016.35
DO  - 10.2991/cimns-16.2016.35
ID  - Hao2016/09
ER  -