异构网络中用户关联与时频域调度的联合优化方法

Yuto Wakai, K. Tateishi, K. Higuchi
{"title":"异构网络中用户关联与时频域调度的联合优化方法","authors":"Yuto Wakai, K. Tateishi, K. Higuchi","doi":"10.23919/APCC.2017.8304038","DOIUrl":null,"url":null,"abstract":"This paper proposes a jointly optimized user association and time/frequency-domain scheduling method that maximizes the downlink system throughput defined based on (p, «)-proportional fairness. A previously reported user association method by members of our research group maximizes the downlink system throughput considering the base station (BS) distribution, user distribution, and the average channel conditions between each of the BSs and user terminals. However, the overall performance of the user association and subsequent time/frequency-domain scheduling conducted at each BS against the connected users taking into account the instantaneous channel variation due to multipath fading is not sufficient, although this approach can be actualized without relying on inter-BS cooperation. The proposed method assumes the centralized radio access network (C-RAN) architecture and achieves joint optimization of the user association and time/frequency-domain scheduling with regard to the achievable system throughput defined based on (p, «)-proportional fairness. Computer simulation results show that the proposed method significantly enhances the achievable system throughput compared to the user association method based on the average channel conditions, especially when the number of pico BSs is large and the system throughput prioritizes the fairness among users.","PeriodicalId":320208,"journal":{"name":"2017 23rd Asia-Pacific Conference on Communications (APCC)","volume":"244 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Joint optimization method for user association and time/frequency-domain scheduling to maximize system throughput in heterogeneous networks\",\"authors\":\"Yuto Wakai, K. Tateishi, K. Higuchi\",\"doi\":\"10.23919/APCC.2017.8304038\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper proposes a jointly optimized user association and time/frequency-domain scheduling method that maximizes the downlink system throughput defined based on (p, «)-proportional fairness. A previously reported user association method by members of our research group maximizes the downlink system throughput considering the base station (BS) distribution, user distribution, and the average channel conditions between each of the BSs and user terminals. However, the overall performance of the user association and subsequent time/frequency-domain scheduling conducted at each BS against the connected users taking into account the instantaneous channel variation due to multipath fading is not sufficient, although this approach can be actualized without relying on inter-BS cooperation. The proposed method assumes the centralized radio access network (C-RAN) architecture and achieves joint optimization of the user association and time/frequency-domain scheduling with regard to the achievable system throughput defined based on (p, «)-proportional fairness. Computer simulation results show that the proposed method significantly enhances the achievable system throughput compared to the user association method based on the average channel conditions, especially when the number of pico BSs is large and the system throughput prioritizes the fairness among users.\",\"PeriodicalId\":320208,\"journal\":{\"name\":\"2017 23rd Asia-Pacific Conference on Communications (APCC)\",\"volume\":\"244 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 23rd Asia-Pacific Conference on Communications (APCC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.23919/APCC.2017.8304038\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 23rd Asia-Pacific Conference on Communications (APCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.23919/APCC.2017.8304038","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

本文提出了一种基于(p,«)比例公平性定义的使用户关联和时频域调度联合优化方法,使下行系统吞吐量最大化。我们研究小组成员先前报告的用户关联方法考虑基站(BS)分布、用户分布以及每个BSs和用户终端之间的平均信道条件,最大限度地提高了下行链路系统吞吐量。然而,考虑到多径衰落导致的瞬时信道变化,在每个BS上针对连接用户进行的用户关联和随后的时频域调度的总体性能是不够的,尽管这种方法可以在不依赖于BS间合作的情况下实现。该方法采用集中式无线接入网(C-RAN)架构,根据(p,«)比例公平性定义的可实现系统吞吐量,实现用户关联和时频域调度的联合优化。计算机仿真结果表明,与基于平均信道条件的用户关联方法相比,该方法显著提高了可实现的系统吞吐量,特别是在pico BSs数量较大且系统吞吐量优先考虑用户间公平性的情况下。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Joint optimization method for user association and time/frequency-domain scheduling to maximize system throughput in heterogeneous networks
This paper proposes a jointly optimized user association and time/frequency-domain scheduling method that maximizes the downlink system throughput defined based on (p, «)-proportional fairness. A previously reported user association method by members of our research group maximizes the downlink system throughput considering the base station (BS) distribution, user distribution, and the average channel conditions between each of the BSs and user terminals. However, the overall performance of the user association and subsequent time/frequency-domain scheduling conducted at each BS against the connected users taking into account the instantaneous channel variation due to multipath fading is not sufficient, although this approach can be actualized without relying on inter-BS cooperation. The proposed method assumes the centralized radio access network (C-RAN) architecture and achieves joint optimization of the user association and time/frequency-domain scheduling with regard to the achievable system throughput defined based on (p, «)-proportional fairness. Computer simulation results show that the proposed method significantly enhances the achievable system throughput compared to the user association method based on the average channel conditions, especially when the number of pico BSs is large and the system throughput prioritizes the fairness among users.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信