The Invulnerability of Traffic Networks under New Attack Strategies

Xin-Ling GUO  Zhe-Ming LU  Hui LI  

Publication
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E100-A   No.10   pp.2106-2112
Publication Date: 2017/10/01
Online ISSN: 1745-1337
Type of Manuscript: PAPER
Category: Graphs and Networks
Keyword: 
complex network,  traffic network,  directed weighted network,  attack strategy,  invulnerability,  

Full Text: PDF(2.1MB)
>>Buy this Article


Summary: 
In this paper, invulnerability and attack strategies are discussed for the undirected unweighted urban road networks and the directed weighted taxi networks of Beijing. Firstly, five new attack strategies, i.e., Initial All Degree (IAD), Initial All Strength (IAS), Recalculated Closeness (RC), Recalculated All Degree (RAD) and Recalculated All Strength (RAS) and five traditional attack strategies, i.e., Initial Degree (ID), Initial Betweenness (IB), Initial Closeness (IC), Recalculated Degree (RD) and Recalculated Betweenness (RB) are adopted to provoke the nodes failure. Secondly, we assess the impacts of these attack strategies using two invulnerability metrics, i.e., S (the relative size of the giant component) and E (the average network efficiency) through simulation experiments by MATLAB. Furthermore, we obtain some conclusions on the basis of the simulation results. Firstly, we discover that IB is more efficient than others for the undirected unweighted 5th ring Beijing road network based on S, and IB is more efficient than others at the beginning while ID is more efficient than IB at last based on E, while IAD causes a greater damage than IAS for the directed weighted 5th ring Beijing taxi network no matter with metrics S or E. Secondly, we find that dynamic attacks are more efficient than their corresponding static attacks, and RB is more destructive than others in all attack graphs while RAD is more destructive than RAS in all attack graphs. Moreover, we propose some suggestions to advance the reliability of the networks according to the simulation results. Additionally, we notice that the damage between ID (RD) and IAD (RAD) is similar due to the large proportion of two-way roads, and we realize that global measures should be employed to estimate the best attack strategy on the basis of that we find the best attack strategy changes with the nodes failure.