5G异构云无线接入网中前端感知用户关联:匹配博弈视角

M. Elhattab, M. M. Elmesalawy, Tawfik Ismail
{"title":"5G异构云无线接入网中前端感知用户关联:匹配博弈视角","authors":"M. Elhattab, M. M. Elmesalawy, Tawfik Ismail","doi":"10.1109/ISNCC.2018.8531056","DOIUrl":null,"url":null,"abstract":"In this paper, the user association process in 5G Heterogeneous Cloud Radio Access Networks (H-CRAN) with wireless fronthaul links is developed. The association process is formulated as a combinatorial optimization problem to maximize the total network throughput while considering the users' QoS requirements as well as the capacity constraints of the wireless fronthaul links. Based on well-defined utility functions for users and Remote Radio Heads (RRHs) in H-CRAN, a two-sided matching game-based algorithm is developed to get the optimum user association solution. Following the association process, an additional radio channel distribution phase based on water-falling algorithm is developed to distribute the remaining radio channels on the associated users and hence improving their achieved throughput. Simulation results validate the superiority of the proposed association algorithm especially in terms of users' achievable data rate as well as the access rate performance.","PeriodicalId":313846,"journal":{"name":"2018 International Symposium on Networks, Computers and Communications (ISNCC)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Fronthaul-aware User Association in 5G Heterogeneous Cloud Radio Access Networks: A Matching Game Perspective\",\"authors\":\"M. Elhattab, M. M. Elmesalawy, Tawfik Ismail\",\"doi\":\"10.1109/ISNCC.2018.8531056\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, the user association process in 5G Heterogeneous Cloud Radio Access Networks (H-CRAN) with wireless fronthaul links is developed. The association process is formulated as a combinatorial optimization problem to maximize the total network throughput while considering the users' QoS requirements as well as the capacity constraints of the wireless fronthaul links. Based on well-defined utility functions for users and Remote Radio Heads (RRHs) in H-CRAN, a two-sided matching game-based algorithm is developed to get the optimum user association solution. Following the association process, an additional radio channel distribution phase based on water-falling algorithm is developed to distribute the remaining radio channels on the associated users and hence improving their achieved throughput. Simulation results validate the superiority of the proposed association algorithm especially in terms of users' achievable data rate as well as the access rate performance.\",\"PeriodicalId\":313846,\"journal\":{\"name\":\"2018 International Symposium on Networks, Computers and Communications (ISNCC)\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 International Symposium on Networks, Computers and Communications (ISNCC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISNCC.2018.8531056\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 International Symposium on Networks, Computers and Communications (ISNCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISNCC.2018.8531056","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

本文研究了具有无线前传链路的5G异构云无线接入网(H-CRAN)中的用户关联过程。在考虑用户QoS需求和无线前传链路容量约束的情况下,将关联过程描述为一个组合优化问题,以最大化网络总吞吐量。基于H-CRAN中用户和远程无线电头(RRHs)的效用函数定义,提出了一种基于双边匹配博弈的H-CRAN用户关联最优解算法。在关联过程之后,开发了基于瀑布算法的附加无线电信道分配阶段,将剩余的无线电信道分配给关联用户,从而提高其实现的吞吐量。仿真结果验证了所提出的关联算法在用户可实现的数据速率和访问速率性能方面的优越性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Fronthaul-aware User Association in 5G Heterogeneous Cloud Radio Access Networks: A Matching Game Perspective
In this paper, the user association process in 5G Heterogeneous Cloud Radio Access Networks (H-CRAN) with wireless fronthaul links is developed. The association process is formulated as a combinatorial optimization problem to maximize the total network throughput while considering the users' QoS requirements as well as the capacity constraints of the wireless fronthaul links. Based on well-defined utility functions for users and Remote Radio Heads (RRHs) in H-CRAN, a two-sided matching game-based algorithm is developed to get the optimum user association solution. Following the association process, an additional radio channel distribution phase based on water-falling algorithm is developed to distribute the remaining radio channels on the associated users and hence improving their achieved throughput. Simulation results validate the superiority of the proposed association algorithm especially in terms of users' achievable data rate as well as the access rate performance.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
TCP performance for Satellite M2M applications over Random Access links TCP Wave estimation of the optimal operating point using ACK trains Practical Approach of Fast-Data Architecture Applied to Alert Generation in Emergency Evacuation Systems Interference and Link Budget Analysis in Integrated Satellite and Terrestrial Mobile System Underdetermined Blind Separation Via Rough Equivalence Clustering for Satellite Communications
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1