Fair rate adaptation in multiuser interference channels

A. Tajer, N. Prasad, Xiaodong Wang
{"title":"Fair rate adaptation in multiuser interference channels","authors":"A. Tajer, N. Prasad, Xiaodong Wang","doi":"10.1109/ISIT.2010.5513395","DOIUrl":null,"url":null,"abstract":"Achievable rate regions of multiuser fading interference channels depend on their fading realizations. Motivated by this premise we consider the problem of adapting the users' rates to fading variations. Channel-dependent rate adjustments are accomplished after each transition of the fading channel from one state to another. Such rate adjustments (increments or decrements) are constrained to meet some notion of fairness among the users and are designed to ensure that all users remain decodable. Here, we employ the notions of symmetric fair and max-min fair rate adaptations and offer algorithms for computing such fair rate adaptations. Besides fairness, the two other major features of these algorithms are that they are amenable to distributed implementation with limited information exchange among the users, and their complexities scale polynomially in the number of users.","PeriodicalId":147055,"journal":{"name":"2010 IEEE International Symposium on Information Theory","volume":"35 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 IEEE International Symposium on Information Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.2010.5513395","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7

Abstract

Achievable rate regions of multiuser fading interference channels depend on their fading realizations. Motivated by this premise we consider the problem of adapting the users' rates to fading variations. Channel-dependent rate adjustments are accomplished after each transition of the fading channel from one state to another. Such rate adjustments (increments or decrements) are constrained to meet some notion of fairness among the users and are designed to ensure that all users remain decodable. Here, we employ the notions of symmetric fair and max-min fair rate adaptations and offer algorithms for computing such fair rate adaptations. Besides fairness, the two other major features of these algorithms are that they are amenable to distributed implementation with limited information exchange among the users, and their complexities scale polynomially in the number of users.
多用户干扰信道中的公平速率自适应
多用户衰落干扰信道的可达速率区域取决于信道的衰落实现。在这个前提的激励下,我们考虑了使用户速率适应衰落变化的问题。信道相关的速率调整在衰落信道从一种状态到另一种状态的每次转换之后完成。这种速率调整(增加或减少)受到约束,以满足用户之间的某种公平概念,并旨在确保所有用户保持可解码。在这里,我们采用对称公平和最大最小公平率自适应的概念,并提供了计算这种公平率自适应的算法。除了公平性之外,这些算法的另外两个主要特征是它们适合分布式实现,用户之间的信息交换有限,并且它们的复杂性随用户数量呈多项式增长。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信