Joint User-Centric Clustering and Frequency Allocation in Ultra-Dense C-RAN

Qiang Liu, Songlin Sun, Hui Gao
{"title":"Joint User-Centric Clustering and Frequency Allocation in Ultra-Dense C-RAN","authors":"Qiang Liu, Songlin Sun, Hui Gao","doi":"10.1109/WCNC45663.2020.9120743","DOIUrl":null,"url":null,"abstract":"This paper considers the downlink ultra-dense cloud radio access network (C-RAN), which employs multiple radio remote head (RRH) cooperation to guarantee the minimum achievable transmission rate for each user equipment (UE). However, due to the limited orthogonal frequency resources, it is difficult to achieve this goal. To maximize the coverage probability of the system, we focus on the joint user-centric clustering and frequency allocation problem. To reduce the computational complexity, this problem is split into two sub-problems: user-centric clustering and frequency allocation. Firstly, we propose a novel binary user-centric clustering strategy, which includes serving clusters and silent clusters. This strategy determines the acceptable combination of serving clusters and silent clusters to guarantee the minimum transmission rate for each UE and simplify the complexity of the subsequent frequency allocation. Then based on the generated clusters, a new graph generation method is proposed. The advantage of this graph is that we can allocate frequency resources by simply judging the relationship between the serving clusters in the graph without complicated calculations. Numerical simulation results show that the joint binary user-centric clustering and location-based frequency allocation scheme is superior to the benchmark solutions in terms of the coverage probability.","PeriodicalId":415064,"journal":{"name":"2020 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 IEEE Wireless Communications and Networking Conference (WCNC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WCNC45663.2020.9120743","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

This paper considers the downlink ultra-dense cloud radio access network (C-RAN), which employs multiple radio remote head (RRH) cooperation to guarantee the minimum achievable transmission rate for each user equipment (UE). However, due to the limited orthogonal frequency resources, it is difficult to achieve this goal. To maximize the coverage probability of the system, we focus on the joint user-centric clustering and frequency allocation problem. To reduce the computational complexity, this problem is split into two sub-problems: user-centric clustering and frequency allocation. Firstly, we propose a novel binary user-centric clustering strategy, which includes serving clusters and silent clusters. This strategy determines the acceptable combination of serving clusters and silent clusters to guarantee the minimum transmission rate for each UE and simplify the complexity of the subsequent frequency allocation. Then based on the generated clusters, a new graph generation method is proposed. The advantage of this graph is that we can allocate frequency resources by simply judging the relationship between the serving clusters in the graph without complicated calculations. Numerical simulation results show that the joint binary user-centric clustering and location-based frequency allocation scheme is superior to the benchmark solutions in terms of the coverage probability.
超密集C-RAN中以用户为中心的联合聚类与频率分配
本文研究了下行超密集云无线接入网(C-RAN),该网络采用多个无线电远程头(RRH)合作,以保证每个用户设备(UE)的最小可达传输速率。然而,由于正交频率资源有限,这一目标很难实现。为了使系统的覆盖概率最大化,我们重点研究了以用户为中心的联合聚类和频率分配问题。为了降低计算复杂度,将该问题分为两个子问题:以用户为中心的聚类和频率分配。首先,我们提出了一种新的以用户为中心的二元集群策略,包括服务集群和静默集群。该策略确定服务集群和静默集群的可接受组合,以保证每个终端的最小传输速率,并简化后续频率分配的复杂性。然后基于生成的聚类,提出了一种新的图生成方法。该图的优点是,我们可以通过简单地判断图中服务集群之间的关系来分配频率资源,而无需进行复杂的计算。数值模拟结果表明,以用户为中心的二元聚类和基于位置的频率分配联合方案在覆盖概率方面优于基准方案。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信