arrow
返回

Distributed Resilient Initialization-Free Jacobi Descent Algorithm for Constrained Optimization Against DoS Attacks

delete2024-07-01
delete6
PRE
AI
Y
Yushuai Li
B
Bonan Huang *
J
Jing Dai
W
Wenzhong Gao
Q
Qiuye Sun
张化光 封面图
张化光 (Huaguang Zhang)
DOI:10.1109/TASE.2023.3278865delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
This paper investigates one type of distributed constrained optimization problem, e.g., the economic dispatch problem, in the presence of DoS attacks. Therein, multiple DoS attackers are collaborative to impede the communication transmission and change the communication topology at will. Consequently, the convergence and/or optimality of distributed algorithm may be compromised. To reduce the effect of this kind of DoS attacks, a distributed resilient initialization-free Jacobi descent algorithm is proposed. It is designed with three switched control protocols which enable the proposed algorithm reasonably employing the estimations to replace the missing information when attacks occur. Meanwhile, the proposed method is embedded with second order information, resulting in faster convergence speed. Moreover, theoretical analysis results are provided to show that the proposed algorithm can exponentially converge to the global optimal solution of the studied problem. Finally, simulation results tested in IEEE 30-bus system validate its effectiveness and flexibility. Note to Practitioners-The economic dispatch is a key issue in smart grid, which can be formulated as a kind of distributed constrained optimization problem. Since the distributed algorithms work under distributed sensor networks, they are easier to undergo DoS attacks. To address this issue, this paper presents a distributed resilient initialization-free Jacobi descent algorithm, which features strong robustness to resist DoS attacks and faster convergence. Meanwhile, the proposed method is shaped for common constrained optimization problem with better expansibility. We conduct the global convergence and optimality proofs, which benefits the practitioners to estimate the convergence performance, e.g., the convergence rate. Simulations further show the correctness and effectiveness of the proposed method. In future, we will pay more attention on the non-convex constrained optimization problem.
Keyword:
Optimization
Convergence
Denial-of-service attack
Jacobian matrices
Economics
Distributed algorithms
Smart grids
Constrained optimization
economic dispatch
cyber attacks
initialization free

期刊

IEEE Transactions on Automation Science and Engineering 封面图
IEEE Transactions on Automation Science and Engineering
IF:
6.4
论文数:
5.1K
被引数:
1.6W

机构

T
tsinghua university
学者数:
11.9W
论文数: 10.0W
被引数: 137
U
University of Denver
学者数:
2.5K
论文数: 2.5K
被引数: 4.4K
U
university of oslo
学者数:
4.2W
论文数: 3.5W
被引数: 53
N
northeastern university - china
学者数:
3.2W
论文数: 2.7W
被引数: 37
学者 查看更多机构
引用论文

引用论文

err分享
err收藏
Distributed Optimization Under Adversarial Nodes
err2019-03-01
err164
errOAAI
errSundaram, Shreyas; Gharesifard, Bahman
err分享
err收藏
err分享
err收藏
err分享
err收藏
err分享
err收藏
Stability analysis of distributed convex optimization under persistent attacks: A hybrid systems approach
err2020-01-01
err36
errOAAI
errWang, Xue-Fang; Teel, Andrew R.; Liu, Kun-Zhi; Sun, Xi-Ming
err分享
err收藏
学者 查看更多内容