Coalition game for user association and bandwidth allocation in ultra-dense mmWave networks

Yanping Liu, X. Fang, Pei Zhou, Kaijun Cheng
{"title":"Coalition game for user association and bandwidth allocation in ultra-dense mmWave networks","authors":"Yanping Liu, X. Fang, Pei Zhou, Kaijun Cheng","doi":"10.1109/ICCChina.2017.8330377","DOIUrl":null,"url":null,"abstract":"In future layered fifth generation (5G) wireless networks, a large number of millimeter-wave (mmWave) small cells will be covered by a microwave macrocell, where radio access links to a small cell and the backhaul link to its macrocell share a common mmWave bandwidth, which is called wireless self-backhauling. One of the major challenges in self-backhauling ultra-dense networks (UDNs) is the optimization of user association and resource allocation between the radio access links and backhaul links, which is essential to improve the network performance. This paper proposes a coalition game based joint user association and bandwidth allocation algorithm for ultradense mmWave networks (UDMNs), in which users form a set of coalitions by playing coalition games to maximize network sum rate and make the downlink traffic of small cells in current cell association period be accommodated by their wireless backhaul. Simulation results show that, the proposed scheme improves the sum rate significantly compared to the traditional minimum-distance based user association scheme, and approximates the performance of immune optimization algorithm (IOA) in terms of sum rate and has much lower computational complexity.","PeriodicalId":418396,"journal":{"name":"2017 IEEE/CIC International Conference on Communications in China (ICCC)","volume":"70 3","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 IEEE/CIC International Conference on Communications in China (ICCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCChina.2017.8330377","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 11

Abstract

In future layered fifth generation (5G) wireless networks, a large number of millimeter-wave (mmWave) small cells will be covered by a microwave macrocell, where radio access links to a small cell and the backhaul link to its macrocell share a common mmWave bandwidth, which is called wireless self-backhauling. One of the major challenges in self-backhauling ultra-dense networks (UDNs) is the optimization of user association and resource allocation between the radio access links and backhaul links, which is essential to improve the network performance. This paper proposes a coalition game based joint user association and bandwidth allocation algorithm for ultradense mmWave networks (UDMNs), in which users form a set of coalitions by playing coalition games to maximize network sum rate and make the downlink traffic of small cells in current cell association period be accommodated by their wireless backhaul. Simulation results show that, the proposed scheme improves the sum rate significantly compared to the traditional minimum-distance based user association scheme, and approximates the performance of immune optimization algorithm (IOA) in terms of sum rate and has much lower computational complexity.
超密集毫米波网络中用户关联和带宽分配的联盟博弈
在未来的分层第五代(5G)无线网络中,微波宏小区将覆盖大量毫米波(mmWave)小小区,其中小小区的无线接入链路和其宏小区的回程链路共享一个公共毫米波带宽,这被称为无线自回程。自回程超密集网络(udn)面临的主要挑战之一是优化无线接入链路和回程链路之间的用户关联和资源分配,这对提高网络性能至关重要。提出了一种基于联盟博弈的超密集毫米波网络联合用户关联和带宽分配算法,用户通过联盟博弈形成一组联盟,以最大化网络和速率,使当前小区关联周期内的小小区下行流量由其无线回程承载。仿真结果表明,与传统的基于最小距离的用户关联方案相比,该方案的和速率显著提高,在和速率方面接近免疫优化算法(IOA)的性能,且计算复杂度大大降低。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信