|
Abstract
|
Article Information:
Calculating Node Importance Considering Cascading Failure in Traffic Networks
Zhengwu Wang, Aiwu Kuang and Hejie Wang
Corresponding Author: Zhixiang Hou
Submitted: June 02, 2012
Accepted: June 21, 2012
Published: January 01, 2013 |
Abstract:
|
The traffic network is a scale-free network. In selective attack, invalidation of few key nodes may lead to
network failure so it is important to find these key nodes. In this study, the key nodes are determined by establishing
calculating methods of node importance based on cascading failure behaviors. First, a cascading failure model of
traffic network is posed. Its differences from current models are as follows: 1) The upper travel network and lower
road network are influenced each other, 2) Capacity of nodes and links are given at first but not in direct proportion
to initial flow that is related to initial capacity, 3) Travel time is used to describe status of links, 4) Capacity of links
may change. The evaluation method of node importance of traffic network considering cascading failure is proposed
then based on node deletion. It uses congestion status of cascading failure network to describe the node importance
and algorithm procedures are designed to estimate importance of all nodes. At the end, the experiment analysis
shows that network structure and traveler behaviors have in significant influence on node importance.
Key words: Bi-level network, cascading failure, node importance, traffic network, , ,
|
|
Abstract
|
PDF
|
HTML |
|
Cite this Reference:
Zhengwu Wang, Aiwu Kuang and Hejie Wang, . Calculating Node Importance Considering Cascading Failure in Traffic Networks. Research Journal of Applied Sciences, Engineering and Technology, (01): 264-269.
|
|
|
|
 |
ISSN (Online): 2040-7467
ISSN (Print): 2040-7459 |
 |
| Information |
|
|
|
|
| Sales & Services |
|
|
|
|
