中国物理B ›› 2023, Vol. 32 ›› Issue (6): 68901-068901.doi: 10.1088/1674-1056/acb75f

• • 上一篇    下一篇

Identification of key recovering node for spatial networks

Zijian Yan(严子健)1, Yongxiang Xia(夏永祥)1,†, Lijun Guo(郭丽君)2, Lingzhe Zhu(祝令哲)1, Yuanyuan Liang(梁圆圆)1, and Haicheng Tu(涂海程)1   

  1. 1 School of Communication Engineering, Hangzhou Dianzi University, Hangzhou 310018, China;
    2 China Intelligent Transportation Systems Association, Beijing 100160, China
  • 收稿日期:2022-10-12 修回日期:2023-01-19 接受日期:2023-01-31 出版日期:2023-05-17 发布日期:2023-05-24
  • 通讯作者: Yongxiang Xia E-mail:xiayx@hdu.edu.cn
  • 基金资助:
    Project supported by Zhejiang Provincial Natural Science Foundation of China (Grant No. LQ23F030012), and the Fundamental Research Funds for the Provincial Universities of Zhejiang (Grant No. GK229909299001-018).

Identification of key recovering node for spatial networks

Zijian Yan(严子健)1, Yongxiang Xia(夏永祥)1,†, Lijun Guo(郭丽君)2, Lingzhe Zhu(祝令哲)1, Yuanyuan Liang(梁圆圆)1, and Haicheng Tu(涂海程)1   

  1. 1 School of Communication Engineering, Hangzhou Dianzi University, Hangzhou 310018, China;
    2 China Intelligent Transportation Systems Association, Beijing 100160, China
  • Received:2022-10-12 Revised:2023-01-19 Accepted:2023-01-31 Online:2023-05-17 Published:2023-05-24
  • Contact: Yongxiang Xia E-mail:xiayx@hdu.edu.cn
  • Supported by:
    Project supported by Zhejiang Provincial Natural Science Foundation of China (Grant No. LQ23F030012), and the Fundamental Research Funds for the Provincial Universities of Zhejiang (Grant No. GK229909299001-018).

摘要: 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.

关键词: complex networks, spatial networks, congestion, key recovering node

Abstract: 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.

Key words: complex networks, spatial networks, congestion, key recovering node

中图分类号:  (Complex systems)

  • 89.75.-k
89.75.Fb (Structures and organization in complex systems) 89.75.Hc (Networks and genealogical trees) 89.40.-a (Transportation)