Zero-determinant strategy for distributed state estimation against eavesdropping attacks.

IF 3.2 2区 数学 Q1 MATHEMATICS, APPLIED Chaos Pub Date : 2024-12-01 DOI:10.1063/5.0235693
Yan Yu, Wen Yang, Jialing Chen
{"title":"Zero-determinant strategy for distributed state estimation against eavesdropping attacks.","authors":"Yan Yu, Wen Yang, Jialing Chen","doi":"10.1063/5.0235693","DOIUrl":null,"url":null,"abstract":"<p><p>In distributed networks, the transmission of state estimates via wireless channels between neighbor nodes is susceptible to interception by eavesdroppers, leading to significant risks to data privacy. Given the substantial energy and bandwidth consumption of data encryption, sensors with limited energy must strategically decide when to encrypt data. Simultaneously, eavesdroppers with similar energy constraints must determine when to intercept transmissions. In this paper, we propose a game-theoretic approach to this security dilemma and introduce a defense strategy based on zero-determinant (ZD) policies. Initially, we model the interaction between sensors and malicious eavesdroppers in the distributed state estimation as an iterative game. Subsequently, we apply ZD strategies to protect both channel and node data, respectively. We further explore how, under these strategies, sensors can unilaterally set the expected payoff of eavesdroppers or coerce a positive correlation with the expected payoff of sensors. Moreover, we analyze how sensors can devise optimal strategies by maximizing their own utility while minimizing that of the opponent, regardless of the actions of the opponent. The feasibility and effectiveness of the proposed methods are validated through numerical simulations.</p>","PeriodicalId":9974,"journal":{"name":"Chaos","volume":"34 12","pages":""},"PeriodicalIF":3.2000,"publicationDate":"2024-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Chaos","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1063/5.0235693","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 0

Abstract

In distributed networks, the transmission of state estimates via wireless channels between neighbor nodes is susceptible to interception by eavesdroppers, leading to significant risks to data privacy. Given the substantial energy and bandwidth consumption of data encryption, sensors with limited energy must strategically decide when to encrypt data. Simultaneously, eavesdroppers with similar energy constraints must determine when to intercept transmissions. In this paper, we propose a game-theoretic approach to this security dilemma and introduce a defense strategy based on zero-determinant (ZD) policies. Initially, we model the interaction between sensors and malicious eavesdroppers in the distributed state estimation as an iterative game. Subsequently, we apply ZD strategies to protect both channel and node data, respectively. We further explore how, under these strategies, sensors can unilaterally set the expected payoff of eavesdroppers or coerce a positive correlation with the expected payoff of sensors. Moreover, we analyze how sensors can devise optimal strategies by maximizing their own utility while minimizing that of the opponent, regardless of the actions of the opponent. The feasibility and effectiveness of the proposed methods are validated through numerical simulations.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
针对窃听攻击的分布式状态估计零行列式策略。
在分布式网络中,状态估计通过无线信道在相邻节点之间传输,容易被窃听者截获,给数据隐私带来重大风险。考虑到数据加密的大量能量和带宽消耗,能量有限的传感器必须战略性地决定何时加密数据。同时,具有类似能量限制的窃听者必须决定何时拦截传输。在本文中,我们提出了一种博弈论的方法来解决这种安全困境,并引入了一种基于零行列式策略的防御策略。首先,我们将分布式状态估计中传感器与恶意窃听者之间的交互建模为迭代博弈。随后,我们应用ZD策略分别保护通道和节点数据。我们进一步探讨了在这些策略下,传感器如何单方面设定窃听者的预期收益或强制其与传感器的预期收益呈正相关。此外,我们分析了传感器如何通过最大化自己的效用而最小化对手的效用来设计最优策略,而不管对手的行动如何。通过数值仿真验证了所提方法的可行性和有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Chaos
Chaos 物理-物理:数学物理
CiteScore
5.20
自引率
13.80%
发文量
448
审稿时长
2.3 months
期刊介绍: Chaos: An Interdisciplinary Journal of Nonlinear Science is a peer-reviewed journal devoted to increasing the understanding of nonlinear phenomena and describing the manifestations in a manner comprehensible to researchers from a broad spectrum of disciplines.
期刊最新文献
A Bayesian framework for symmetry inference in chaotic attractors. Transient times and cycle-rich topology in reservoir computing. Noise-enhanced stickiness in the Harper map. Noise-induced transients in the propagation of epidemic with higher-order interactions. Introduction to Focus Issue: Nonautonomous dynamical systems: Theory, methods, and applications.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1