Byzantine Attack Resilient Bounded Consensus

IF 2.4 Q2 AUTOMATION & CONTROL SYSTEMS
Jinxin Miao;Zhenqian Wang;Xiwang Dong;Zhiqiang Zuo;Jinhu Lü
{"title":"Byzantine Attack Resilient Bounded Consensus","authors":"Jinxin Miao;Zhenqian Wang;Xiwang Dong;Zhiqiang Zuo;Jinhu Lü","doi":"10.1109/LCSYS.2024.3457851","DOIUrl":null,"url":null,"abstract":"Average consensus is a cornerstone of distributed systems, facilitating essential functionalities such as distributed information fusion, decision-making, and decentralized control. However, achieving the exact average consensus is challenging when partial nodes are compromised and act as Byzantine attackers by transmitting malicious messages using judiciously crafted patterns. Existing resilient consensus results can only guarantee that the consensus value under Byzantine attacks remains within the range defined by the maximum and minimum initial state values of all legitimate nodes. In addition, the consensus value is highly uncertain when attack strategies change. In this letter, we propose a new resilient consensus algorithm that ensures the consensus value falls within a much tighter bound. The bound contains the exact average consensus value and is solely determined by the initial states of legitimate nodes, regardless of the attack strategies employed by the Byzantine attackers. More interestingly, we demonstrate that the bound is the tightest achievable under our resilient consensus algorithm when the number of Byzantine attackers reaches the maximum threshold our algorithm can handle. Numerical simulations are given to validate the theoretical results.","PeriodicalId":37235,"journal":{"name":"IEEE Control Systems Letters","volume":null,"pages":null},"PeriodicalIF":2.4000,"publicationDate":"2024-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Control Systems Letters","FirstCategoryId":"1085","ListUrlMain":"https://ieeexplore.ieee.org/document/10677498/","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"AUTOMATION & CONTROL SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

Average consensus is a cornerstone of distributed systems, facilitating essential functionalities such as distributed information fusion, decision-making, and decentralized control. However, achieving the exact average consensus is challenging when partial nodes are compromised and act as Byzantine attackers by transmitting malicious messages using judiciously crafted patterns. Existing resilient consensus results can only guarantee that the consensus value under Byzantine attacks remains within the range defined by the maximum and minimum initial state values of all legitimate nodes. In addition, the consensus value is highly uncertain when attack strategies change. In this letter, we propose a new resilient consensus algorithm that ensures the consensus value falls within a much tighter bound. The bound contains the exact average consensus value and is solely determined by the initial states of legitimate nodes, regardless of the attack strategies employed by the Byzantine attackers. More interestingly, we demonstrate that the bound is the tightest achievable under our resilient consensus algorithm when the number of Byzantine attackers reaches the maximum threshold our algorithm can handle. Numerical simulations are given to validate the theoretical results.
拜占庭攻击弹性有界共识
平均共识是分布式系统的基石,有助于实现分布式信息融合、决策和分散控制等基本功能。然而,当部分节点被入侵并充当拜占庭攻击者,利用精心制作的模式传输恶意信息时,实现精确的平均共识就具有挑战性。现有的弹性共识结果只能保证拜占庭攻击下的共识值保持在所有合法节点的最大和最小初始状态值所定义的范围内。此外,当攻击策略发生变化时,共识值具有很大的不确定性。在这封信中,我们提出了一种新的弹性共识算法,它能确保共识值在一个更严格的范围内。该界限包含精确的平均共识值,并且完全由合法节点的初始状态决定,与拜占庭攻击者采用的攻击策略无关。更有趣的是,我们证明了当拜占庭攻击者的数量达到我们的算法所能处理的最大阈值时,该界限是我们的弹性共识算法所能达到的最严格界限。我们给出了数值模拟来验证理论结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
IEEE Control Systems Letters
IEEE Control Systems Letters Mathematics-Control and Optimization
CiteScore
4.40
自引率
13.30%
发文量
471
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信