具有任意树状拓扑结构的 CPS 中 DoS 攻击下的远程状态估计:贝叶斯堆栈博弈方法

IF 3 3区 计算机科学 Q2 ENGINEERING, ELECTRICAL & ELECTRONIC IEEE Transactions on Signal and Information Processing over Networks Pub Date : 2024-03-17 DOI:10.1109/TSIPN.2024.3394776
Yuhan Wang;Wei Xing;Junfeng Zhang;Le Liu;Xudong Zhao
{"title":"具有任意树状拓扑结构的 CPS 中 DoS 攻击下的远程状态估计:贝叶斯堆栈博弈方法","authors":"Yuhan Wang;Wei Xing;Junfeng Zhang;Le Liu;Xudong Zhao","doi":"10.1109/TSIPN.2024.3394776","DOIUrl":null,"url":null,"abstract":"In this paper, we consider remote state estimation for an arbitrary tree topology in cyber-physical systems (CPSs) subject to Denial-of-Service (DoS) attacks. A sensor transmits its local estimation to the root node of the tree, and the root node transmits the optimal estimation to its child nodes until the leaf nodes are reached. In the meanwhile, a malicious attacker can jam all communication channels strategically connected to the attacked node. With the energy constraints in mind, both the defender and attacker adopt strategies that involve allocating energy to determine which nodes to protect or attack at each time step. A Bayesian Stackelberg game (BSG) framework with incomplete information is implemented, where the defender has no access to the available energy of the attacker exactly except for its probability distribution. In addition, a Markov decision process (MDP) and a Stackelberg Q-learning algorithm are presented to obtain the Stackelberg equilibrium (SE) policy over a finite time horizon. Finally, a numerical example is provided to demonstrate our main results.","PeriodicalId":56268,"journal":{"name":"IEEE Transactions on Signal and Information Processing over Networks","volume":"10 ","pages":"527-538"},"PeriodicalIF":3.0000,"publicationDate":"2024-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Remote State Estimation Under DoS Attacks in CPSs With Arbitrary Tree Topology: A Bayesian Stackelberg Game Approach\",\"authors\":\"Yuhan Wang;Wei Xing;Junfeng Zhang;Le Liu;Xudong Zhao\",\"doi\":\"10.1109/TSIPN.2024.3394776\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we consider remote state estimation for an arbitrary tree topology in cyber-physical systems (CPSs) subject to Denial-of-Service (DoS) attacks. A sensor transmits its local estimation to the root node of the tree, and the root node transmits the optimal estimation to its child nodes until the leaf nodes are reached. In the meanwhile, a malicious attacker can jam all communication channels strategically connected to the attacked node. With the energy constraints in mind, both the defender and attacker adopt strategies that involve allocating energy to determine which nodes to protect or attack at each time step. A Bayesian Stackelberg game (BSG) framework with incomplete information is implemented, where the defender has no access to the available energy of the attacker exactly except for its probability distribution. In addition, a Markov decision process (MDP) and a Stackelberg Q-learning algorithm are presented to obtain the Stackelberg equilibrium (SE) policy over a finite time horizon. Finally, a numerical example is provided to demonstrate our main results.\",\"PeriodicalId\":56268,\"journal\":{\"name\":\"IEEE Transactions on Signal and Information Processing over Networks\",\"volume\":\"10 \",\"pages\":\"527-538\"},\"PeriodicalIF\":3.0000,\"publicationDate\":\"2024-03-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Transactions on Signal and Information Processing over Networks\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/10533844/\",\"RegionNum\":3,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"ENGINEERING, ELECTRICAL & ELECTRONIC\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Signal and Information Processing over Networks","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10533844/","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"ENGINEERING, ELECTRICAL & ELECTRONIC","Score":null,"Total":0}
引用次数: 0

摘要

本文考虑了网络物理系统(CPS)中受拒绝服务(DoS)攻击的任意树状拓扑的远程状态估计。传感器将其本地估计值传输给树的根节点,根节点将最优估计值传输给其子节点,直到到达叶节点。与此同时,恶意攻击者可以干扰所有与被攻击节点策略连接的通信信道。考虑到能量限制,防御者和攻击者都采取了分配能量的策略,以决定在每个时间步骤保护或攻击哪个节点。我们采用了一个具有不完全信息的贝叶斯-斯塔克尔伯格博弈(BSG)框架,在这个框架中,防御方除了知道攻击方的概率分布外,无法准确获得攻击方的可用能量。此外,还介绍了马尔可夫决策过程(MDP)和斯塔克尔伯格 Q-learning 算法,以获得有限时间跨度内的斯塔克尔伯格均衡(SE)策略。最后,我们提供了一个数值示例来证明我们的主要结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Remote State Estimation Under DoS Attacks in CPSs With Arbitrary Tree Topology: A Bayesian Stackelberg Game Approach
In this paper, we consider remote state estimation for an arbitrary tree topology in cyber-physical systems (CPSs) subject to Denial-of-Service (DoS) attacks. A sensor transmits its local estimation to the root node of the tree, and the root node transmits the optimal estimation to its child nodes until the leaf nodes are reached. In the meanwhile, a malicious attacker can jam all communication channels strategically connected to the attacked node. With the energy constraints in mind, both the defender and attacker adopt strategies that involve allocating energy to determine which nodes to protect or attack at each time step. A Bayesian Stackelberg game (BSG) framework with incomplete information is implemented, where the defender has no access to the available energy of the attacker exactly except for its probability distribution. In addition, a Markov decision process (MDP) and a Stackelberg Q-learning algorithm are presented to obtain the Stackelberg equilibrium (SE) policy over a finite time horizon. Finally, a numerical example is provided to demonstrate our main results.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
IEEE Transactions on Signal and Information Processing over Networks
IEEE Transactions on Signal and Information Processing over Networks Computer Science-Computer Networks and Communications
CiteScore
5.80
自引率
12.50%
发文量
56
期刊介绍: The IEEE Transactions on Signal and Information Processing over Networks publishes high-quality papers that extend the classical notions of processing of signals defined over vector spaces (e.g. time and space) to processing of signals and information (data) defined over networks, potentially dynamically varying. In signal processing over networks, the topology of the network may define structural relationships in the data, or may constrain processing of the data. Topics include distributed algorithms for filtering, detection, estimation, adaptation and learning, model selection, data fusion, and diffusion or evolution of information over such networks, and applications of distributed signal processing.
期刊最新文献
Reinforcement Learning-Based Event-Triggered Constrained Containment Control for Perturbed Multiagent Systems Finite-Time Performance Mask Function-Based Distributed Privacy-Preserving Consensus: Case Study on Optimal Dispatch of Energy System Discrete-Time Controllability of Cartesian Product Networks Generalized Simplicial Attention Neural Networks A Continuous-Time Algorithm for Distributed Optimization With Nonuniform Time-Delay Under Switching and Unbalanced Digraphs
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1