有限前传H-CRAN中用户关联延迟和流量均衡敏感方案

Shaobo Liu, Biling Zhang, Jung-Lang Yu, Zhu Han
{"title":"有限前传H-CRAN中用户关联延迟和流量均衡敏感方案","authors":"Shaobo Liu, Biling Zhang, Jung-Lang Yu, Zhu Han","doi":"10.1109/ISWCS.2018.8491053","DOIUrl":null,"url":null,"abstract":"In order to fully exploit the potentials of the heterogeneous cloud radio access networks (H-CRANs), how to associate the user equipments (UEs) with the appropriate low power nodes (LPNs) is a very essential problem. However, when the fronthaul constraint is limited, the UEs are sensitive to delay, and the LPNs are concerned about the traffic balancing, such a problem has not gained enough attention. In this paper, the aforementioned user association problem is investigated and formulated as a bidirectional matching game, where the UEs are seeking to access the most preferred LPN while the LPNs are seeking to accept the most preferred UEs. To find the solution to the proposed game, an iteration algorithm is proposed, and its computational complexity and convergence are proved as well. Simulation results show that our proposed user association scheme is effective and outperforms the existing schemes-in terms of achieved data rates, delay, traffic balancing and overall utility.","PeriodicalId":272951,"journal":{"name":"2018 15th International Symposium on Wireless Communication Systems (ISWCS)","volume":"52 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Delay and Traffic Balancing Sensitive Scheme for User Association in Limited Fronthaul H-CRAN s\",\"authors\":\"Shaobo Liu, Biling Zhang, Jung-Lang Yu, Zhu Han\",\"doi\":\"10.1109/ISWCS.2018.8491053\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In order to fully exploit the potentials of the heterogeneous cloud radio access networks (H-CRANs), how to associate the user equipments (UEs) with the appropriate low power nodes (LPNs) is a very essential problem. However, when the fronthaul constraint is limited, the UEs are sensitive to delay, and the LPNs are concerned about the traffic balancing, such a problem has not gained enough attention. In this paper, the aforementioned user association problem is investigated and formulated as a bidirectional matching game, where the UEs are seeking to access the most preferred LPN while the LPNs are seeking to accept the most preferred UEs. To find the solution to the proposed game, an iteration algorithm is proposed, and its computational complexity and convergence are proved as well. Simulation results show that our proposed user association scheme is effective and outperforms the existing schemes-in terms of achieved data rates, delay, traffic balancing and overall utility.\",\"PeriodicalId\":272951,\"journal\":{\"name\":\"2018 15th International Symposium on Wireless Communication Systems (ISWCS)\",\"volume\":\"52 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-08-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 15th International Symposium on Wireless Communication Systems (ISWCS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISWCS.2018.8491053\",\"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 15th International Symposium on Wireless Communication Systems (ISWCS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISWCS.2018.8491053","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

为了充分发挥异构云无线接入网(H-CRANs)的潜力,如何将用户设备(ue)与合适的低功率节点(lpn)相关联是一个非常关键的问题。然而,在前传约束有限的情况下,ue对时延敏感,lpn关注流量均衡,这一问题没有得到足够的重视。本文研究了上述用户关联问题,并将其表述为一个双向匹配博弈,其中终端寻求访问最优选的LPN,而LPN寻求接受最优选的终端。为了求解所提出的博弈,提出了一种迭代算法,并证明了其计算复杂度和收敛性。仿真结果表明,我们提出的用户关联方案是有效的,并且在实现的数据速率、延迟、流量平衡和整体效用方面优于现有方案。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A Delay and Traffic Balancing Sensitive Scheme for User Association in Limited Fronthaul H-CRAN s
In order to fully exploit the potentials of the heterogeneous cloud radio access networks (H-CRANs), how to associate the user equipments (UEs) with the appropriate low power nodes (LPNs) is a very essential problem. However, when the fronthaul constraint is limited, the UEs are sensitive to delay, and the LPNs are concerned about the traffic balancing, such a problem has not gained enough attention. In this paper, the aforementioned user association problem is investigated and formulated as a bidirectional matching game, where the UEs are seeking to access the most preferred LPN while the LPNs are seeking to accept the most preferred UEs. To find the solution to the proposed game, an iteration algorithm is proposed, and its computational complexity and convergence are proved as well. Simulation results show that our proposed user association scheme is effective and outperforms the existing schemes-in terms of achieved data rates, delay, traffic balancing and overall utility.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信