Cascading failures in coupled map lattices with sustained attack

Er-Shen Wang, Hong-Fan Ren, Chen Hong, Chang Liu and Ning He
Additional contact information
Er-Shen Wang: School of Electronic and Information Engineering, Shenyang Aerospace University, Shenyang 110136, P. R. China
Hong-Fan Ren: School of Electronic and Information Engineering, Shenyang Aerospace University, Shenyang 110136, P. R. China
Chen Hong: Beijing Key Laboratory of Information Service Engineering, Beijing Union University, Beijing 100101, P. R. China3College of Robotics, Beijing Union University, Beijing 100101, P. R. China
Chang Liu: Beijing Key Laboratory of Information Service Engineering, Beijing Union University, Beijing 100101, P. R. China3College of Robotics, Beijing Union University, Beijing 100101, P. R. China
Ning He: College of Smart City, Beijing Union University, Beijing 100101, P. R. China

International Journal of Modern Physics C (IJMPC), 2021, vol. 32, issue 09, 1-15

Abstract: Many realistic networked systems may face sustained attack over a sequence of time. In this paper, we propose a cascading failure model in coupled map lattices (CMLs) with sustained attack, where a number of crucial nodes will be attacked one by one at each time step. The effects of four attacking strategies: high-degree strategy (HDS), high-clustering coefficient strategy, high-closeness strategy and high-betweenness strategy are compared. This shows that the performance of HDS is better than that of other attacking strategies when the value of the outside attack is small. The effectiveness of HDS on Watts–Strogatz (WS) small-world networks and two real-world networks is extensively investigated. The results indicate that increasing the value of the rewiring probability of WS networks can make the network more robust to resist sustained attack. The sparser the network structure is, the faster the diffusion velocity of cascading failures is. A smaller coupling strength in CMLs can restrain the diffusion velocity of cascades. We also extend our CML-based model with sustained attack from one node strategy (ONS) to two nodes strategy (TNS) and compare the effect of ONS and TNS with different values of the outside attack. It is found that ONS outperforms TNS for small values of the outside attack, but TNS would be a better choice when the outside attack and the time step are all large. Our work will provide new insights into the problem of protecting complex networks against cascading failures with respect to malicious attack.

Keywords: Cascading failures; complex networks; network robustness; coupled map lattices (search for similar items in EconPapers)
Date: 2021
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.worldscientific.com/doi/abs/10.1142/S0129183121501266
Access to full text is restricted to subscribers

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wsi:ijmpcx:v:32:y:2021:i:09:n:s0129183121501266

Ordering information: This journal article can be ordered from

DOI: 10.1142/S0129183121501266

Access Statistics for this article

International Journal of Modern Physics C (IJMPC) is currently edited by H. J. Herrmann

More articles in International Journal of Modern Physics C (IJMPC) from World Scientific Publishing Co. Pte. Ltd.
Bibliographic data for series maintained by Tai Tone Lim ().