Please use this identifier to cite or link to this item:
http://bura.brunel.ac.uk/handle/2438/22580
Title: | Enhancing Robustness and Resilience of Multiplex Networks against Node-community Cascading Failures |
Authors: | Ma, L Zhang, X Li, J Lin, Q Gong, M Coello Coello, CA Nandi, A |
Keywords: | multiplex networks;robustness and resilience;cascading failures;community structures;simulated annealing |
Issue Date: | 26-Apr-2021 |
Publisher: | Institute of Electrical and Electronics Engineers (IEEE) |
Citation: | Ma, L. et al. (2021) 'Enhancing Robustness and Resilience of Multiplex Networks against Node-community Cascading Failures', IEEE Transactions on Systems, Man, and Cybernetics: Systems, 52 (6), pp. 3808 - 3821. doi: 10.1109/TSMC.2021.3073212. |
Abstract: | Many real systems are represented in form of multiplex networks composed of a set of nodes, multiple layers of links, and coupling node relationships across all layers. These systems are very vulnerable to damages during both attacks and recoveries due to potential node cascading failures (NCFs). Although some progress has recently been made in studying network robustness and resilience, the comprehensive impacts of coupling node relationships and community structures on NCFs remain unclear. Accordingly, in this article, we study the robustness and resilience of multiplex networks in the presence of NCFs caused by coupling node relationships and community structures. We first model the failure processes of multiplex networks during both attacks and recoveries as node-community cascading failures (called NCCFs), and then theoretically demonstrate the fragility of multiplex networks to random node damages under NCCFs. Subsequently, to improve network robustness and resilience, we adopt a node protection strategy and propose a cost-aware constrained optimization problem. Finally, we devise a degree-based simulated annealing algorithm for solving this optimization problem. Extensive experiments on both simulated and real multiplex networks show that NCCFs make networks more vulnerable to unpredictable damage than classical NCFs. The results also show the superiority of the proposed algorithm over the state-of-the-art algorithms in improving network robustness and resilience. |
Description: | Supplemental items are available online at: https://ieeexplore.ieee.org/document/9415463/media . |
URI: | https://bura.brunel.ac.uk/handle/2438/22580 |
DOI: | https://doi.org/10.1109/TSMC.2021.3073212 |
ISSN: | 2168-2216 |
Other Identifiers: | ORCiD: Lijia Ma https://orcid.org/0000-0002-1201-8051 ORCiD: Xiao Zhang https://orcid.org/0000-0001-7644-9697 ORCiD: Jianqiang Li https://orcid.org/0000-0002-2208-962X ORCiD: Qiuzhen Lin https://orcid.org/0000-0003-2415-0401 ORCiD: Maoguo Gong https://orcid.org/0000-0002-0415-8556 ORCiD: Carlos A. Coello Coello https://orcid.org/0000-0002-8435-680X ORCiD: Asoke K. Nandi https://orcid.org/0000-0001-6248-2875 |
Appears in Collections: | Dept of Electronic and Electrical Engineering Research Papers |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
FullText.pdf | Copyright © 2021 Institute of Electrical and Electronics Engineers (IEEE). Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works by sending a request to pubs-permissions@ieee.org. For more information, see https://www.ieee.org/publications/rights/rights-policies.html | 2.72 MB | Adobe PDF | View/Open |
Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.