2018
DOI: 10.1007/s40565-018-0432-2
|View full text |Cite
|
Sign up to set email alerts
|

Graph theoretical defense mechanisms against false data injection attacks in smart grids

Abstract: This paper addresses false data injection, which is one of the most significant security challenges in smart grids. Having an accurately estimated state is of great importance for maintaining a stable running condition of smart grids. To preserve the accuracy of the estimated state, bad data detection (BDD) mechanisms are utilized to remove erroneous measurements due to meter failures or outsider attacks. In this paper we use a graph-theoretical formulation for false data injection attacks in smart grids and p… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
8
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
6
2
1

Relationship

0
9

Authors

Journals

citations
Cited by 27 publications
(8 citation statements)
references
References 47 publications
0
8
0
Order By: Relevance
“…Maximise the average attack cost ρm=truemaxρthinmathspacethinmathspace1mfalse∑kMαk To minimise the protection cost, Bi and Zhang [79] framed the protection problem as a variant of the Steiner tree problem in a graph. Given an undirected graph with non‐negative edges and a set of vertices, which represent transmission lines and buses in the power network, the Steiner tree problem entails finding a tree with minimum weights, which contains all the vertices [92]. To select the minimum set of meters to be protected, they propose two algorithms: a Steiner vertex enumeration algorithm and MILP.…”
Section: Defences Against Fdiasmentioning
confidence: 99%
“…Maximise the average attack cost ρm=truemaxρthinmathspacethinmathspace1mfalse∑kMαk To minimise the protection cost, Bi and Zhang [79] framed the protection problem as a variant of the Steiner tree problem in a graph. Given an undirected graph with non‐negative edges and a set of vertices, which represent transmission lines and buses in the power network, the Steiner tree problem entails finding a tree with minimum weights, which contains all the vertices [92]. To select the minimum set of meters to be protected, they propose two algorithms: a Steiner vertex enumeration algorithm and MILP.…”
Section: Defences Against Fdiasmentioning
confidence: 99%
“…In order to minimize the protection cost, Bi et al frame the protection problem as a variant of the Steiner tree problem in a graph [85]. Given an undirected graph with non-negative edges and a set of vertices which represent transmission lines and buses in the power network, the Steiner tree problem entails finding a tree with minimum weights which contains all the vertices [98]. To select the minimum set of meters to be protected, they propose two algorithms: a Steiner vertex enumeration algorithm and MILP.…”
Section: Defenses Against False Data Injection Attacksmentioning
confidence: 99%
“…False data injection attack (FDIA) is a relatively common cyber attack, and it is highly challenging [7]. FDIAs fight the LFC system and bypass the error data detection of SCADA, and then lead to the state estimation bias and the wrong decisions of SCADA [8], which makes the system unstable and affects power economic dispatch [9]. Many research works have been devoted to studying the possible means of constructing FDIAs.…”
Section: Introductionmentioning
confidence: 99%