Identification of key recovering node for spatial networks

• Published in: Chinese physics B Vol. 32; no. 6; pp. 68901 - 796
• Main Authors: Yan, Zijian, Xia, Yongxiang, Guo, Lijun, Zhu, Lingzhe, Liang, Yuanyuan, Tu, Haicheng
• Format: Journal Article
• Language: English
• Published: Chinese Physical Society and IOP Publishing Ltd 01.05.2023; School of Communication Engineering,Hangzhou Dianzi University,Hangzhou 310018,China%China Intelligent Transportation Systems Association,Beijing 100160,China
• Subjects: complex networks; congestion; key recovering node; spatial networks; key recovering node; complex networks; spatial networks; congestion
• ISSN: 1674-1056
• DOI: 10.1088/1674-1056/acb75f

Many networks in the real world have spatial attributes, such as location of nodes and length of edges, called spatial networks. When these networks are subject to some random or deliberate attacks, some nodes in the network fail, which causes a decline in the network performance. In order to make the network run normally, some of the failed nodes must be recovered. In the case of limited recovery resources, an effective key node identification method can find the key recovering node in the failed nodes, by which the network performance can be recovered most of the failed nodes. We propose two key recovering node identification methods for spatial networks, which are the Euclidean-distance recovery method and the route-length recovery method. Simulations on homogeneous and heterogeneous spatial networks show that the proposed methods can significantly recover the network performance.