多信道无线网络的机会反馈报告与调度方案

M. Deghel, M. Assaad, M. Debbah
{"title":"多信道无线网络的机会反馈报告与调度方案","authors":"M. Deghel, M. Assaad, M. Debbah","doi":"10.1109/GLOCOM.2016.7842075","DOIUrl":null,"url":null,"abstract":"This work studies the problems of feedback allocation and scheduling for a multichannel downlink cellular network under limited and delayed feedback. We consider a realistic scenario where a fixed and small number $\\bar{F}$ of link states can be reported to the base- station (BS) per time-slot. We study the trade- off between knowing at the BS a small number of accurate link states (i.e. that can be reported within one time-slot) and a larger but outdated number of link states (i.e. number of link states $> \\bar{F}$ that requires more than one slot to be reported). We propose an efficient algorithm that selects the link states that should be reported to the base-station. A novelty here is that this feedback allocation algorithm is performed at the users side. We show that this algorithm combined with the Max-Weight scheduling achieves at least a fraction $\\eta$ of the stability region achieved under the ideal system (i.e. with full and perfect feedback at no cost). We then provide numerical results that show the best aforementioned trade-off under various system setups.","PeriodicalId":425019,"journal":{"name":"2016 IEEE Global Communications Conference (GLOBECOM)","volume":"265 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Opportunistic Feedback Reporting and Scheduling Scheme for Multichannel Wireless Networks\",\"authors\":\"M. Deghel, M. Assaad, M. Debbah\",\"doi\":\"10.1109/GLOCOM.2016.7842075\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This work studies the problems of feedback allocation and scheduling for a multichannel downlink cellular network under limited and delayed feedback. We consider a realistic scenario where a fixed and small number $\\\\bar{F}$ of link states can be reported to the base- station (BS) per time-slot. We study the trade- off between knowing at the BS a small number of accurate link states (i.e. that can be reported within one time-slot) and a larger but outdated number of link states (i.e. number of link states $> \\\\bar{F}$ that requires more than one slot to be reported). We propose an efficient algorithm that selects the link states that should be reported to the base-station. A novelty here is that this feedback allocation algorithm is performed at the users side. We show that this algorithm combined with the Max-Weight scheduling achieves at least a fraction $\\\\eta$ of the stability region achieved under the ideal system (i.e. with full and perfect feedback at no cost). We then provide numerical results that show the best aforementioned trade-off under various system setups.\",\"PeriodicalId\":425019,\"journal\":{\"name\":\"2016 IEEE Global Communications Conference (GLOBECOM)\",\"volume\":\"265 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 IEEE Global Communications Conference (GLOBECOM)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/GLOCOM.2016.7842075\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 IEEE Global Communications Conference (GLOBECOM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GLOCOM.2016.7842075","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

本文研究了有限反馈和延迟反馈条件下多通道下行蜂窝网络的反馈分配和调度问题。我们考虑一个现实的场景,其中每个时隙可以向基站(BS)报告固定的少量链路状态$\bar{F}$。我们研究了在BS上知道少量准确的链路状态(即可以在一个时隙内报告的链路状态)和大量但过时的链路状态(即链路状态数)之间的权衡。\bar{F}$需要报告多个槽位)。我们提出了一种有效的算法来选择应该报告给基站的链路状态。这里的新颖之处在于,这种反馈分配算法是在用户端执行的。结果表明,该算法与Max-Weight调度相结合,在理想系统下(即在无成本的情况下具有充分和完美的反馈)至少达到了稳定区域的一小部分$\eta$。然后,我们提供了在各种系统设置下显示上述最佳权衡的数值结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Opportunistic Feedback Reporting and Scheduling Scheme for Multichannel Wireless Networks
This work studies the problems of feedback allocation and scheduling for a multichannel downlink cellular network under limited and delayed feedback. We consider a realistic scenario where a fixed and small number $\bar{F}$ of link states can be reported to the base- station (BS) per time-slot. We study the trade- off between knowing at the BS a small number of accurate link states (i.e. that can be reported within one time-slot) and a larger but outdated number of link states (i.e. number of link states $> \bar{F}$ that requires more than one slot to be reported). We propose an efficient algorithm that selects the link states that should be reported to the base-station. A novelty here is that this feedback allocation algorithm is performed at the users side. We show that this algorithm combined with the Max-Weight scheduling achieves at least a fraction $\eta$ of the stability region achieved under the ideal system (i.e. with full and perfect feedback at no cost). We then provide numerical results that show the best aforementioned trade-off under various system setups.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信