Approximating the Controllability Robustness of Directed Random-graph Networks Against Random Edge-removal Attacks

Yang Lou*, Lin Wang, Shengli Xie, Guanrong Chen*

*此作品的通信作者

研究成果: Article同行評審

4 引文 斯高帕斯(Scopus)

摘要

Network controllability robustness reflects how well a networked system can maintain its controllability against destructive attacks. Its performance can be measured by a sequence of values that record the remaining controllability of the network after a sequential node-removal or edge-removal attacks. In this paper, a hybrid approximation (HyA) method is proposed to estimate the controllability robustness performance of large-scale directed random-graph (RG) networks under random edge-removal attacks. HyA sufficiently utilizes the similarity between the generation mechanism of the RG networks and the destructing process of random edge-removal attacks. Two threshold values are set to classify general RG networks as ‘dense’, ‘sparse’, or ‘median’, according to the average degree of each network. A two-phase approximation is applied to ‘sparse’ RG networks, while different three-phase approximations are applied to ‘dense’ and ‘median’ RG networks, respectively. Simulation results verify that 1) HyA is able to precisely approximate the controllability curves of RG networks under random edge-removal attacks; 2) HyA is time-efficient as compared to the conventional time-consuming attack simulations.

原文English
頁(從 - 到)376-388
頁數13
期刊International Journal of Control, Automation and Systems
21
發行號2
DOIs
出版狀態Published - 2月 2023

指紋

深入研究「Approximating the Controllability Robustness of Directed Random-graph Networks Against Random Edge-removal Attacks」主題。共同形成了獨特的指紋。

引用此