ITM Web Conf.
Volume 7, 20163rd Annual International Conference on Information Technology and Applications (ITA 2016)
|Number of page(s)||6|
|Section||Session 1: Communication and Networking|
|Published online||21 November 2016|
Vulnerability of Complex Networks under Approximate Longest Chain Attack Strategies
1 ZhengZhou Institute of Information Science and technology, Zhengzhou 450001, China
2 State Key Laboratory of Mathematical Engineering and Advanced Computing, Zhengzhou 450001, China
a Corresponding author: email@example.com
We proposed three approximate longest chain-attack strategies and studied the vulnerability of complex networks under these intentional attack strategies. Experimental results indicate that when random network and small-world network are under any one of the three chain-attacks, the larger the <k> is, the smaller the iterative step T is. However, scale-free network shows different characteristics: the larger the <k> is, the larger the T is. These findings supplement and extend the previous attack results on nodes and edges, and can thus help us better explain the vulnerability of different complex networks.
© Owned by the authors, published by EDP Sciences, 2016
This is an Open Access article distributed under the terms of the Creative Commons Attribution License 4.0, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.