arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1706.03330cs.ITmath.IT
收藏

用于大规模载波聚合的低复杂度资源分配

Low Complexity Resource Allocation for Massive Carrier Aggregation

Stelios Stefanatos, Fotis Foukalas, Theodoros A. Tsiftsis

摘要:

大规模载波聚合场景中的最优资源分配(RA)是一个具有挑战性的组合优化问题,其维度与用户、分量载波(CC)和每个CC的OFDMA资源块的数量成比例。为了在大规模CA环境下获得可扩展的、接近最优的RA,提出了一种用于CC和OFDMA资源块联合分配给用户的迭代RA算法。该算法是基于连续的几何规划近似的原则,并具有复杂性,规模仅与问题的尺寸线性。虽然它的推导是基于一个宽松的RA问题的制定,该算法收敛到整数值RA变量的概率为1,在温和的假设下,用户效用的分布。仿真结果表明,该算法的性能改善相比,通常认为启发式RA程序相当的复杂性。

英文摘要:

Optimal resource allocation (RA) in massive carrier aggregation scenarios is a challenging combinatorial optimization problem whose dimension is proportional to the number of users, component carriers (CCs), and OFDMA resource blocks per CC. Towards scalable, near-optimal RA in massive CA settings, an iterative RA algorithm is proposed for joint assignment of CCs and OFDMA resource blocks to users. The algorithm is based on the principle of successive geometric programming approximations and has a complexity that scales only linearly with the problem dimension. Although its derivation is based on a relaxed formulation of the RA problem, the algorithm is shown to converge to integer-valued RA variables with probability 1 under mild assumptions on the distribution of user utilities. Simulations demonstrate improved performance of the proposed algorithm compared to commonly considered heuristic RA procedures of comparable complexity.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑