Bayesian adversarial multi-node bandit for optimal smart grid protection against cyber attacks

Xu, Jianyu and Liu, Bin and Mo, Huadong and Dong, Daoyi (2021) Bayesian adversarial multi-node bandit for optimal smart grid protection against cyber attacks. Automatica, 128. 109551. ISSN 0005-1098 (https://doi.org/10.1016/j.automatica.2021.109551)

[thumbnail of Xu-etal-ATM-2021-Bayesian-adversarial-multi-node-bandit-for-optimal-smart-grid-protection]
Preview
 Text. Filename: Xu_etal_ATM_2021_Bayesian_adversarial_multi_node_bandit_for_optimal_smart_grid_protection.pdf
Accepted Author Manuscript
License: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 logo
Download (450kB)| Preview

Abstract

The cyber security of smart grids has become one of key problems in developing reliable modern power and energy systems. This paper introduces a non-stationary adversarial cost with a variation constraint for smart grids and enables us to investigate the problem of optimal smart grid protection against cyber attacks in a relatively practical scenario. In particular, a Bayesian multi-node bandit (MNB) model with adversarial costs is constructed and a new regret function is defined for this model. An algorithm called Thompson–Hedge algorithm is presented to solve the problem and the superior performance of the proposed algorithm is proven in terms of the convergence rate of the regret function. The applicability of the algorithm to real smart grid scenarios is verified and the performance of the algorithm is also demonstrated by numerical examples.

ORCID iDs

Xu, Jianyu, Liu, Bin ORCID logoORCID: https://orcid.org/0000-0002-3946-8124, Mo, Huadong and Dong, Daoyi;
CORE (COnnecting REpositories)