基于噪声的延迟通信多智能体系统在动态拒绝服务攻击下的一致性

IF 5.3 1区 数学 Q1 MATHEMATICS, INTERDISCIPLINARY APPLICATIONS
Sen Li , Yuhang Zheng , Junhao Hu , Wenxue Li
{"title":"基于噪声的延迟通信多智能体系统在动态拒绝服务攻击下的一致性","authors":"Sen Li ,&nbsp;Yuhang Zheng ,&nbsp;Junhao Hu ,&nbsp;Wenxue Li","doi":"10.1016/j.chaos.2025.116783","DOIUrl":null,"url":null,"abstract":"<div><div>This work formulates stochastic consensus with probability one (SC-PO) of multi-agent systems (MSs) by proposing noise-based delayed communication protocols under dynamic Denial-of-Service (D-DoS) attacks. The developed consensus protocols are composed of two cases: (1) interference attacker induces transmission defeats on full inter-agent communication; (2) the attacker interrupts a subset of communication links. During activation period, the communication from neighbors of each agent can be successfully jammed in a certain probability, that is, the Denial-of-Service attacker acts randomly, which fits better to the reality. Different from existing results about the SC-PO of MSs incorporating noise and time delays, this paper delves into the SC-PO through creating a delay-free companion system, which removes the underlying assumption of mean square consensus. By leveraging Lyapunov method, graph theory and stochastic analysis, SC-PO criteria are formulated, which is intricately connected with topology structure, noise intensity, D-DoS frequency and the probability of successful attack. Moreover, on the basis of the criterion, bounds on the attack parameters that can be tolerated and the communication delay are estimated. It is demonstrated that the noise in our work plays a positive role in consensus. Finally, a numerical simulation case for a specific class of robot manipulators is provided to authenticate the feasibility and validity of the theoretical derivations.</div></div>","PeriodicalId":9764,"journal":{"name":"Chaos Solitons & Fractals","volume":"199 ","pages":"Article 116783"},"PeriodicalIF":5.3000,"publicationDate":"2025-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Consensus of multi-agent systems with noise-based delayed communications under dynamic Denial-of-Service attacks\",\"authors\":\"Sen Li ,&nbsp;Yuhang Zheng ,&nbsp;Junhao Hu ,&nbsp;Wenxue Li\",\"doi\":\"10.1016/j.chaos.2025.116783\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>This work formulates stochastic consensus with probability one (SC-PO) of multi-agent systems (MSs) by proposing noise-based delayed communication protocols under dynamic Denial-of-Service (D-DoS) attacks. The developed consensus protocols are composed of two cases: (1) interference attacker induces transmission defeats on full inter-agent communication; (2) the attacker interrupts a subset of communication links. During activation period, the communication from neighbors of each agent can be successfully jammed in a certain probability, that is, the Denial-of-Service attacker acts randomly, which fits better to the reality. Different from existing results about the SC-PO of MSs incorporating noise and time delays, this paper delves into the SC-PO through creating a delay-free companion system, which removes the underlying assumption of mean square consensus. By leveraging Lyapunov method, graph theory and stochastic analysis, SC-PO criteria are formulated, which is intricately connected with topology structure, noise intensity, D-DoS frequency and the probability of successful attack. Moreover, on the basis of the criterion, bounds on the attack parameters that can be tolerated and the communication delay are estimated. It is demonstrated that the noise in our work plays a positive role in consensus. Finally, a numerical simulation case for a specific class of robot manipulators is provided to authenticate the feasibility and validity of the theoretical derivations.</div></div>\",\"PeriodicalId\":9764,\"journal\":{\"name\":\"Chaos Solitons & Fractals\",\"volume\":\"199 \",\"pages\":\"Article 116783\"},\"PeriodicalIF\":5.3000,\"publicationDate\":\"2025-07-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Chaos Solitons & Fractals\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0960077925007969\",\"RegionNum\":1,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"MATHEMATICS, INTERDISCIPLINARY APPLICATIONS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Chaos Solitons & Fractals","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0960077925007969","RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0

摘要

本文通过提出动态拒绝服务(D-DoS)攻击下基于噪声的延迟通信协议,构建了多智能体系统(MSs)概率为1 (SC-PO)的随机共识。所开发的共识协议由两种情况组成:(1)干扰攻击者在完全代理间通信中诱导传输失败;(2)攻击者中断通信链路的子集。在激活期间,每个代理的邻居之间的通信能够以一定的概率被成功干扰,即拒绝服务攻击者的行为是随机的,这更符合实际。与现有的包含噪声和时滞的MSs的SC-PO结果不同,本文通过创建无延迟的同伴系统来研究SC-PO,该系统消除了均方一致性的基本假设。利用李雅普诺夫方法、图论和随机分析,建立了与拓扑结构、噪声强度、D-DoS频率和攻击成功概率等复杂关系的SC-PO准则。在此基础上,对攻击参数的容忍度和通信时延进行了估计。研究表明,噪声在我们的工作中起到了促进共识的积极作用。最后,以某一类机器人为例进行了数值仿真,验证了理论推导的可行性和有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Consensus of multi-agent systems with noise-based delayed communications under dynamic Denial-of-Service attacks
This work formulates stochastic consensus with probability one (SC-PO) of multi-agent systems (MSs) by proposing noise-based delayed communication protocols under dynamic Denial-of-Service (D-DoS) attacks. The developed consensus protocols are composed of two cases: (1) interference attacker induces transmission defeats on full inter-agent communication; (2) the attacker interrupts a subset of communication links. During activation period, the communication from neighbors of each agent can be successfully jammed in a certain probability, that is, the Denial-of-Service attacker acts randomly, which fits better to the reality. Different from existing results about the SC-PO of MSs incorporating noise and time delays, this paper delves into the SC-PO through creating a delay-free companion system, which removes the underlying assumption of mean square consensus. By leveraging Lyapunov method, graph theory and stochastic analysis, SC-PO criteria are formulated, which is intricately connected with topology structure, noise intensity, D-DoS frequency and the probability of successful attack. Moreover, on the basis of the criterion, bounds on the attack parameters that can be tolerated and the communication delay are estimated. It is demonstrated that the noise in our work plays a positive role in consensus. Finally, a numerical simulation case for a specific class of robot manipulators is provided to authenticate the feasibility and validity of the theoretical derivations.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Chaos Solitons & Fractals
Chaos Solitons & Fractals 物理-数学跨学科应用
CiteScore
13.20
自引率
10.30%
发文量
1087
审稿时长
9 months
期刊介绍: Chaos, Solitons & Fractals strives to establish itself as a premier journal in the interdisciplinary realm of Nonlinear Science, Non-equilibrium, and Complex Phenomena. It welcomes submissions covering a broad spectrum of topics within this field, including dynamics, non-equilibrium processes in physics, chemistry, and geophysics, complex matter and networks, mathematical models, computational biology, applications to quantum and mesoscopic phenomena, fluctuations and random processes, self-organization, and social phenomena.
×
引用
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学术文献互助群
群 号:604180095
Book学术官方微信