陈榕, 曹型兵, 唐宏, 刘小洁. 基于混合分簇的超密集网络资源分配算法[J]. 微电子学与计算机, 2022, 39(12): 60-68. DOI: 10.19304/J.ISSN1000-7180.2022.0291
引用本文: 陈榕, 曹型兵, 唐宏, 刘小洁. 基于混合分簇的超密集网络资源分配算法[J]. 微电子学与计算机, 2022, 39(12): 60-68. DOI: 10.19304/J.ISSN1000-7180.2022.0291
CHEN Rong, CAO Xingbing, TANG Hong, LIU Xiaojie. Resource allocation algorithm for ultra-dense network based on Hybrid Clustering[J]. Microelectronics & Computer, 2022, 39(12): 60-68. DOI: 10.19304/J.ISSN1000-7180.2022.0291
Citation: CHEN Rong, CAO Xingbing, TANG Hong, LIU Xiaojie. Resource allocation algorithm for ultra-dense network based on Hybrid Clustering[J]. Microelectronics & Computer, 2022, 39(12): 60-68. DOI: 10.19304/J.ISSN1000-7180.2022.0291

基于混合分簇的超密集网络资源分配算法

Resource allocation algorithm for ultra-dense network based on Hybrid Clustering

  • 摘要: 超密集网络(Ultra-dense network)通过密集部署微基站满足了爆炸式的流量需求,但是干扰严重,合理进行资源分配尤为重要.为减少干扰和进行资源分配,本文提出一种基于混合分簇的资源分配算法.首先,为解决传统K-means算法簇个数和簇中心点难以确定的问题,采用Canopy算法先进行预处理.同时,在用Canopy算法进行预处理时,没有直接设置距离阈值,引入加权平均值公式进行阈值选择,可以实现根据现实场景动态改变簇的大小和个数.然后,最大化吞吐量的同时考虑用户的服务质量,根据优化目标和约束条件,本文提出用拉格朗日对偶算法准确计算出微基站给用户分配的子信道,且采用次梯度更新算法不断更新拉格朗日乘子,得到子信道的最终分配结果.最后,为减少能耗,没有随机地给用户分户分配功率,采用注水算法给用户分配功率.仿真结果表明,所提分簇算法更加准确、均匀地将小基站分布在每个簇中,在完成分簇的前提下,所提资源分配算法不但保障了用户服务质量,而且显著提高了系统吞吐量.

     

    Abstract: Ultra-dense networks meet the explosive traffic demand by densely deploying micro base stations, but at the same time, the interference is severe, so it is particularly important to allocate resources reasonably. In order to reduce interference and perform resource allocation, this paper proposes a resource allocation algorithm based on hybrid clustering. First, in order to solve the problem that the number of clusters and the center points of the clusters are difficult to determine in the traditional K-means algorithm, the Canopy algorithm is used for preprocessing. At the same time, when using the Canopy algorithm for preprocessing, the distance threshold is not directly set, and the weighted average formula is introduced to select the threshold, which can dynamically change the size and number of clusters according to the actual scene. Then, considering the user's service quality while maximizing the throughput, according to the optimization objectives and constraints, this paper proposes to use the Lagrangian dual algorithm to accurately calculate the sub-channels allocated by the micro base station to the user, and use the sub-gradient update algorithm to continuously update Lagrange multipliers to get the final assignment result of the sub-channels. Finally, in order to reduce energy consumption, instead of randomly assigning power to users, a water injection algorithm is used to assign power to users. The simulation results show that the proposed clustering algorithm distributes small cells in each cluster more accurately and evenly. On the premise of completing the clustering, the proposed resource allocation algorithm not only guarantees the user service quality, but also significantly improves the system throughput. quantity.

     

/

返回文章
返回