2018
DOI: 10.1109/tsg.2018.2865136
|View full text |Cite
|
Sign up to set email alerts
|

Severe Cyber Attack for Maximizing the Total Loadings of Large-Scale Attacked Branches

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
8
0

Year Published

2019
2019
2022
2022

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 19 publications
(8 citation statements)
references
References 5 publications
0
8
0
Order By: Relevance
“…Table II shows the number of overloading branches in the two systems. We can see that in the 14-bus system, our method overloads one branch, while both methods in [3], [4] overload two branches. However, in the 39-bus system, our method can obviously overload more branches than other two methods.…”
Section: A Destructiveness Analysis Of the Proposed Methodsmentioning
confidence: 84%
See 3 more Smart Citations
“…Table II shows the number of overloading branches in the two systems. We can see that in the 14-bus system, our method overloads one branch, while both methods in [3], [4] overload two branches. However, in the 39-bus system, our method can obviously overload more branches than other two methods.…”
Section: A Destructiveness Analysis Of the Proposed Methodsmentioning
confidence: 84%
“…However, in the 39-bus system, our method can obviously overload more branches than other two methods. Especially, the method in [4] does not cause any branch overload. Moreover, we give the space distribution of overloaded branches caused by our method in the IEEE 39-bus system, as shown in Fig.…”
Section: A Destructiveness Analysis Of the Proposed Methodsmentioning
confidence: 99%
See 2 more Smart Citations
“…On this basis, some studies explored how to maximize the effect and improve efficiency of the immediate attacks. A bilevel linear programming model was constructed to cause line overloading and maximize the total loadings in all overloaded lines [11]. A fast solution in determining the attack vectors by just solving one linear programing problem was presented in [12].…”
mentioning
confidence: 99%