Fair resource allocation under an unknown jamming attack: a Bayesian game

A. Garnaev, W. Trappe
{"title":"Fair resource allocation under an unknown jamming attack: a Bayesian game","authors":"A. Garnaev, W. Trappe","doi":"10.1109/WIFS.2014.7084332","DOIUrl":null,"url":null,"abstract":"The goal of this paper is to investigate the problem how a base station (BS), facing an unknown jamming attack, should decide to allocate scarce communication resources so as to maintain fair and reliable communication for its users. In order to obtain insight into this problem, we examine a Bayesian game using α- fairness utility, which allows the problem to be treated in a universal framework involving maximizing the total user SNR and minimizing the total user delay in transmission. The solution is a maxmin strategy (i.e. it is the optimal resource allocation under expected worst conditions), and is obtained explicitly, and thereby allows for interesting properties associated with the problem to be established.","PeriodicalId":220523,"journal":{"name":"2014 IEEE International Workshop on Information Forensics and Security (WIFS)","volume":"120 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"14","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 IEEE International Workshop on Information Forensics and Security (WIFS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WIFS.2014.7084332","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 14

Abstract

The goal of this paper is to investigate the problem how a base station (BS), facing an unknown jamming attack, should decide to allocate scarce communication resources so as to maintain fair and reliable communication for its users. In order to obtain insight into this problem, we examine a Bayesian game using α- fairness utility, which allows the problem to be treated in a universal framework involving maximizing the total user SNR and minimizing the total user delay in transmission. The solution is a maxmin strategy (i.e. it is the optimal resource allocation under expected worst conditions), and is obtained explicitly, and thereby allows for interesting properties associated with the problem to be established.
未知干扰攻击下的公平资源分配:贝叶斯博弈
本文的目的是研究基站在面对未知干扰攻击时,如何决定分配稀缺的通信资源,以保证用户通信的公平可靠。为了深入了解这个问题,我们使用α-公平实用程序检查贝叶斯博弈,它允许在涉及最大化总用户信噪比和最小化总用户传输延迟的通用框架中处理问题。解决方案是一个maxmin策略(即,它是预期最坏条件下的最佳资源分配),并且是显式获得的,因此允许建立与问题相关的有趣属性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信