Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Yanling Yuan

dblp:56/10727 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 2013
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 1 · 1 first-authorComputer networks · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
2 papers
Mathematical optimization · 80% Algorithmic game theory and mechanism design · 20%
Interdisciplinary, comprehensive, and emerging computing
2 papers
Energy systems and smart grids · 100%
Network and information security
1 paper
Cyber-physical and IoT security · 100%

Topics — the 9 heaviest of 9, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Energy systems and smart grids
power grid security
0.212013
Optimal budget deployment strategy against power grid interdiction · INFOCOM 2013
Mathematical optimization › continuous optimization
nonlinear optimization
0.212013
Optimal budget deployment strategy against power grid interdiction · INFOCOM 2013
Mathematical optimization › numerical computation › numerical optimization › second-order methods › interior point methods
primal-dual interior-point method
0.212013
Optimal budget deployment strategy against power grid interdiction · INFOCOM 2013
Energy systems and smart grids › power system monitoring
power system state estimation
0.112012
Quantitative Analysis of Load Redistribution Attacks in Power Systems · IEEE Trans. Parallel Distributed Syst. 2012
Cyber-physical and IoT security › deception attacks
false data injection attack
0.112012
Quantitative Analysis of Load Redistribution Attacks in Power Systems · IEEE Trans. Parallel Distributed Syst. 2012
Cyber-physical and IoT security
smart grid security
0.112012
Quantitative Analysis of Load Redistribution Attacks in Power Systems · IEEE Trans. Parallel Distributed Syst. 2012
Algorithmic game theory and mechanism design
security games
0.012013
Optimal budget deployment strategy against power grid interdiction · INFOCOM 2013
Algorithmic game theory and mechanism design › security games
attack-defense game
0.012012
Quantitative Analysis of Load Redistribution Attacks in Power Systems · IEEE Trans. Parallel Distributed Syst. 2012
Mathematical optimization
bilevel optimization
0.012012
Quantitative Analysis of Load Redistribution Attacks in Power Systems · IEEE Trans. Parallel Distributed Syst. 2012

Methods — techniques the papers use, named apart from their topics

mixed-integer programming · 0.4karush-kuhn-tucker conditions · 0.4benders decomposition · 0.4primal-dual interior-point method · 0.3nonlinear optimization · 0.3
YearPublicationVenuePosition
2013 Optimal budget deployment strategy against power grid interdiction
abstract
Power network is one of the most critical infrastructures in a nation and is always a target of attackers. Recently, many schemes are proposed to protect the security of power systems. However, most of existing works did not consider the component attacking cost and ignored the relationship between the budget deployed on the component and its attacking cost. To address this problem, in this paper we introduce the concept of budget-cost function, which describes the dynamic characteristics of component attacking cost, and propose a new model to protect power grid against intentional attacks. In our model, the attackers have limited attacking capacity and aim to maximize the damage of attacks. On the other hand, the defenders aim to find the optimal strategy of the budget deployment to limit the damage to an expected level. We formulate the above problem as a nonlinear optimization problem and solve it by employing the primal-dual interior-point method. To the author's best knowledge, this is the first work which analyzes the optimal budget deployment strategy based on budget-cost function. Simulations on the IEEE 5-bus system demonstrate the correctness and effectiveness of the proposed model and algorithms. The results provide a basis of budget investment for power systems.
Xuan Liu 0003, Kui Ren 0001, Yanling Yuan, Zuyi Li, Qian Wang 0002
INFOCOM3
2012 Quantitative Analysis of Load Redistribution Attacks in Power Systems
abstract
Cyber security is becoming an area of growing concern in the electric power industry with the development of smart grid. False data injection attack, which is against state estimation through SCADA network, has recently attracted wide research interests. This paper further develops the concept of load redistribution (LR) attack, a special type of false data injection attack. The damage of LR attacks to power system operations can manifest in an immediate or a delayed fashion. For the immediate attacking goal, we show in this paper that the most damaging attack can be identified through a max-min attacker-defender model. Benders decomposition within a restart framework is used to solve the bilevel immediate LR attack problem with a moderate computational effort. Its effectiveness has been validated by the Karush-Kuhn-Tucker (KKT)-based method solution in our previous work. For the delayed attacking goal, we propose a trilevel model to identify the most damaging attack and transform the model into an equivalent single-level mixed-integer problem for final solution. In summary, this paper enables quantitative analysis of the damage of LR attacks to power system operations and security, and hence provides an in-depth insight on effective attack prevention when resource budgets are limited. A 14-bus system is used to test the correctness of the proposed model and algorithm.
Yanling Yuan, Zuyi Li, Kui Ren 0001
IEEE Trans. Parallel Distributed Syst.1