{"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}
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.