2 research outputs found
Vulnerability Assessment of Power Grids Based on Both Topological and Electrical Properties
In modern power grids, a local failure or attack can trigger catastrophic
cascading failures, which make it challenging to assess the attack
vulnerability of power grids. In this Brief, we define the -link attack
problem and study the attack vulnerability of power grids under cascading
failures. Particularly, we propose a link centrality measure based on both
topological and electrical properties of power grids. According to this
centrality, we propose a greedy attack algorithm and an optimal attack
algorithm. Simulation results on standard IEEE bus test data show that the
optimal attack is better than the greedy attack and the traditional PSO-based
attack in fracturing power grids. Moreover, the greedy attack has smaller
computational complexity than the optimal attack and the PSO-based attack with
an adequate attack efficiency. Our work helps to understand the vulnerability
of power grids and provides some clues for securing power grids.Comment: 5 page
Cost Restrained Hybrid Attacks in Power Grids
The frequent occurrences of cascading failures in power grids have been
receiving continuous attention in recent years. An urgent task for us is to
understand the cascading failure vulnerability of power grids against various
kinds of attacks. We consider a cost restrained hybrid attack problem in power
grids, in which both nodes and links are targeted with a limited total attack
cost. We propose an attack centrality metric for a component (node or link)
based on the consequence and cost of the removal of the component. Depending on
the width of cascading failures considered, the attack centrality can be a
local or global attack centrality. With the attack centrality, we further
provide a greedy hybrid attack, and an optimal hybrid attack with the Particle
Swarm Optimization (PSO) framework. Simulation results on IEEE bus test data
show that the optimal hybrid attack is more efficient than the greedy hybrid
attack. Furthermore, we find counterintuitively that the local centrality based
algorithms are better than the global centrality based ones when the cost
constraint is considered in the attack problem.Comment: 5 pages, 3 figure