| 摘要: |
| 由于在超密集网络中小基站密集的部署，用户数据量空前增加，对数据速率的要求不断提高，所以在有限的资源下如何高效地将资源分配给用户尤为重要。提出了一种小区分簇算法，根据小区簇的通信业务、通信负载量等条件将各个小区分为不同的优先级，引入二分图，以小区簇的优先级为依据建立频谱资源与小区簇之间的匹配关系，并提出一种低复杂度的贪婪算法。仿真结果表明所提算法能够有效提高系统性能，并且有效完成频谱资源的分配。 |
| 关键词: 5G 超密集网络 频谱资源分配 二分图 贪婪算法 |
| DOI： |
|
| 基金项目:国家科技重大专项（2018ZX03001007-004） |
|
| A bipartite graph priority resource allocation algorithm in ultra-dense cells |
| HUANG Junwei,YANG Zhiming |
| (Communication Core Chip,Protocols and Application Innovation Team,School of Communication and Information Engineering，Chongqing University of Posts and Telecommunications，Chongqing 400065，China) |
| Abstract: |
| Due to the large number of small base stations deployed in ultra-dense networks,with the ever-increasing volume of users' communication data,the demand for data rates continues to increase.Therefore,it is particularly important to efficiently allocate resources to users under limited resources.In this paper,a small cell clustering algorithm is proposed,and each cell is divided into different priorities according to the conditions such as communication service and communication load of the cell cluster,and a bipartite graph is introduced.The spectrum resource is established based on the priority of the cell cluster.The matching relationship with cell clusters is presented and a low-complexity greedy algorithm is proposed.Simulation results show that the performance of the proposed algorithm in this paper can effectively improve system performance and effectively complete the allocation of spectrum resources. |
| Key words: 5G ultra-dense network spectrum resource allocation bipartite graph greedy algorithm |
