| Popis: |
Many networks in the real-world have spatial attributes, such as the location of nodes and the 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 recovering which the network performance can be recovered the most. In this paper, we propose two key recovering node identification methods for spatial networks, which are the Euclidean-distance (ED) recovery method and route-length (RL) recovery method, respectively. Simulations on homogeneous and heterogeneous spatial networks show that the proposed methods can significantly recover the network performance. |
