相关干扰下有限功率博弈的最大-最小策略

S. Farahmand, G. Giannakis, Xin Wang
{"title":"相关干扰下有限功率博弈的最大-最小策略","authors":"S. Farahmand, G. Giannakis, Xin Wang","doi":"10.1109/CISS.2007.4298317","DOIUrl":null,"url":null,"abstract":"In tactical (or commercial) wireless communication systems, a jammer (or hacker) may be present to disrupt the link of legitimate users with an access point (AP). In this context, we introduce a game-theoretic max-min formulation for multiple access in the presence of the correlated jamming, replacing the mutual information game setup that has been studied so far. The novel formulation is well-suited for power-limited systems. Specifically, the AP strives to maximize the network's lifetime by minimizing sum-power while guaranteeing a minimum sum-rate for the users. We show that the AP's optimal strategy is a greedy one which allocates power to the strongest user, while the jammer's best response is to reduce the aggregate channel gain of the strongest user as much as possible. Hence, the multiuser game with a sum-rate constraint is equivalent to a single-user game where only the strongest user is present. Numerical results verify the correlated jammer's improved capability to inflict severe disruption in low data rate and low user channel gain settings. However, in a high data rate regime, generating white noise is the jammer's best strategy.","PeriodicalId":151241,"journal":{"name":"2007 41st Annual Conference on Information Sciences and Systems","volume":"56 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"15","resultStr":"{\"title\":\"Max-Min Strategies for Power-Limited Games in the Presence of Correlated Jamming\",\"authors\":\"S. Farahmand, G. Giannakis, Xin Wang\",\"doi\":\"10.1109/CISS.2007.4298317\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In tactical (or commercial) wireless communication systems, a jammer (or hacker) may be present to disrupt the link of legitimate users with an access point (AP). In this context, we introduce a game-theoretic max-min formulation for multiple access in the presence of the correlated jamming, replacing the mutual information game setup that has been studied so far. The novel formulation is well-suited for power-limited systems. Specifically, the AP strives to maximize the network's lifetime by minimizing sum-power while guaranteeing a minimum sum-rate for the users. We show that the AP's optimal strategy is a greedy one which allocates power to the strongest user, while the jammer's best response is to reduce the aggregate channel gain of the strongest user as much as possible. Hence, the multiuser game with a sum-rate constraint is equivalent to a single-user game where only the strongest user is present. Numerical results verify the correlated jammer's improved capability to inflict severe disruption in low data rate and low user channel gain settings. However, in a high data rate regime, generating white noise is the jammer's best strategy.\",\"PeriodicalId\":151241,\"journal\":{\"name\":\"2007 41st Annual Conference on Information Sciences and Systems\",\"volume\":\"56 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-03-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"15\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2007 41st Annual Conference on Information Sciences and Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CISS.2007.4298317\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 41st Annual Conference on Information Sciences and Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CISS.2007.4298317","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 15

摘要

在战术(或商业)无线通信系统中,可能存在干扰者(或黑客)来破坏合法用户与接入点(AP)的链接。在这种情况下,我们引入了一个博弈论的最大最小公式,用于存在相关干扰的多址,取代了迄今为止研究的互信息博弈设置。这种新颖的配方非常适合于功率有限的系统。具体来说,AP通过最小化和功率来最大化网络的生命周期,同时保证用户的最小和速率。结果表明,AP的最优策略是将功率分配给最强用户的贪婪策略,而干扰者的最佳响应是尽可能降低最强用户的信道总增益。因此,带有求和速率约束的多用户游戏等同于只存在最强用户的单用户游戏。数值结果验证了相关干扰器在低数据速率和低用户信道增益设置下造成严重干扰的改进能力。然而,在高数据速率下,产生白噪声是干扰器的最佳策略。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Max-Min Strategies for Power-Limited Games in the Presence of Correlated Jamming
In tactical (or commercial) wireless communication systems, a jammer (or hacker) may be present to disrupt the link of legitimate users with an access point (AP). In this context, we introduce a game-theoretic max-min formulation for multiple access in the presence of the correlated jamming, replacing the mutual information game setup that has been studied so far. The novel formulation is well-suited for power-limited systems. Specifically, the AP strives to maximize the network's lifetime by minimizing sum-power while guaranteeing a minimum sum-rate for the users. We show that the AP's optimal strategy is a greedy one which allocates power to the strongest user, while the jammer's best response is to reduce the aggregate channel gain of the strongest user as much as possible. Hence, the multiuser game with a sum-rate constraint is equivalent to a single-user game where only the strongest user is present. Numerical results verify the correlated jammer's improved capability to inflict severe disruption in low data rate and low user channel gain settings. However, in a high data rate regime, generating white noise is the jammer's best strategy.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术官方微信