A two-stage cluster-based resource management scheme in ultra-dense networks

Rong Wei, Ying Wang, Y. Zhang
{"title":"A two-stage cluster-based resource management scheme in ultra-dense networks","authors":"Rong Wei, Ying Wang, Y. Zhang","doi":"10.1109/ICCCHINA.2014.7008373","DOIUrl":null,"url":null,"abstract":"As the demand for mobile data services skyrockets and the scarcity of spectrum increasing, femtocell networks overlaying with macrocell networks becomes a promising solution. However, the dense and random deployment of femto-cells and their uncoordinated operations cause severe inter-cell interference. This paper studies cluster-based wireless resource management issues in ultra-dense networks (UDN). Firstly, a modified K-means algorithm is performed in the clustering process. A reasonable number of clusters is derived instead of the predefined value as the input parameter. The wireless resource management is investigated to maximize the sum-throughput in UDN. Specifically, this paper propose a two-stage resource management scheme to solve this problem. In the first stage, primary resource allocation is performed by using a greedy search algorithm in each cluster. In the second stage, a supplementary allocation algorithm (SAA) is presented to assign the remainder subchannels. Finally, numerical results show that the proposed scheme achieves a satisfying performance in terms of average SINR, the system throughput, and the spatial spectrum efficiency, which provides guidelines for the practical dense deployment of femtocells.","PeriodicalId":353402,"journal":{"name":"2014 IEEE/CIC International Conference on Communications in China (ICCC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"31","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 IEEE/CIC International Conference on Communications in China (ICCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCCHINA.2014.7008373","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 31

Abstract

As the demand for mobile data services skyrockets and the scarcity of spectrum increasing, femtocell networks overlaying with macrocell networks becomes a promising solution. However, the dense and random deployment of femto-cells and their uncoordinated operations cause severe inter-cell interference. This paper studies cluster-based wireless resource management issues in ultra-dense networks (UDN). Firstly, a modified K-means algorithm is performed in the clustering process. A reasonable number of clusters is derived instead of the predefined value as the input parameter. The wireless resource management is investigated to maximize the sum-throughput in UDN. Specifically, this paper propose a two-stage resource management scheme to solve this problem. In the first stage, primary resource allocation is performed by using a greedy search algorithm in each cluster. In the second stage, a supplementary allocation algorithm (SAA) is presented to assign the remainder subchannels. Finally, numerical results show that the proposed scheme achieves a satisfying performance in terms of average SINR, the system throughput, and the spatial spectrum efficiency, which provides guidelines for the practical dense deployment of femtocells.
一种基于两阶段集群的超密集网络资源管理方案
随着移动数据业务需求的急剧增长和频谱的日益稀缺,飞蜂窝网络与宏蜂窝网络的叠加成为一种很有前途的解决方案。然而,飞蜂窝的密集和随机部署及其不协调的操作造成了严重的蜂窝间干扰。研究了超密集网络中基于集群的无线资源管理问题。首先,在聚类过程中使用改进的K-means算法;得到一个合理的簇数,而不是预定义的值作为输入参数。为了使UDN的总吞吐量最大化,对无线资源管理进行了研究。具体来说,本文提出了一个两阶段的资源管理方案来解决这一问题。在第一阶段,通过在每个集群中使用贪婪搜索算法进行主资源分配。在第二阶段,提出了一种补充分配算法(SAA)来分配剩余子信道。最后,数值计算结果表明,该方案在平均信噪比、系统吞吐量和空间频谱效率方面都取得了令人满意的性能,为实际密集部署飞基站提供了指导。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信