Pang Wu

Pang Wu

Auto-generated profile, based on publicly available information

Pang Wu

School of Computer Science and Engineering, Nanjing University of Science and Technology, Nanjing, 210094, China

Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
9 December 2019 in IEEE Transactions on Circuits and Systems II: Express Briefs
Verified
Journal Article
Closed access
CPCun-Lai Pu
Cun-Lai Pu
PWPang Wu
Pang Wu
YXYongxiang Xia
Yongxiang Xia
In modern power grids, a local failure or attack can trigger catastrophic cascading failures, which makes it challenging to assess the attack vulnerability of power grids. In this Brief, we define the optimal K-link attack problem and study the attack vulnerability of power grids in cascading failures. We propose a link centrality measure based on both topological and electrical properties for power grids. According to this centrality measure, we propose a greedy attack algorithm and an optimal attack algorithm. Simulation results based 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 an adequate attack efficiency with a smaller computational cost. Our work aids in understanding the vulnerability of power grids and provides clues for securing power grids.