多层异构蜂窝网络中一种快速最优资源分配算法  

A Fast Optimal Resource Allocation Algorithm for Multi-Layer Heterogeneous Cellular Networks

作　　者：朱翠涛[1] 孟帆[1] 

机构地区：[1]中南民族大学电子信息工程学院,武汉430074

出　　处：《中南民族大学学报（自然科学版）》2017年第2期91-96,共6页Journal of South-Central University for Nationalities：Natural Science Edition

基　　金：国家自然科学基金资助项目(61671483);湖北省自然科学基金资助项目(2016CFA089);中央高校基本科研业务费专项资金项目(CZW15046)

摘　　要：利用最大化系统下行链路总容量问题模型中隐含的单调结构,将由于干扰存在使得构建的最优资源分配为非线性非凸的问题转换为单调优化问题,提出了一种改进的Polyblock外逼近法对其进行求解.该算法针对Polyblock外逼近法在求解过程中顶点值的个数呈指数倍增长,导致计算量较大、收敛速度较慢等缺陷,改用分枝定界法划分可行域区域,并以最大利益优先的方式进行节点扩展和搜索,边分枝边剪除不符合条件的枝,使可行域范围越来越小,最终逼近最优解.实验结果表明:改进算法提高了收敛速度和逼近最优解的效果.By utilizing monotonic structure in the model of total capacity of downlink in maximum system,the optimal resource allocation problem is transformed into a nonlinear nonconvex problem due to the existence of the interference, and this paper puts forward an improved Polyblock outer approximation method to solve it.The outer approximation algorithm for Polyblock in the process of solving the number of vertices value exponentially increased, resulting in a large amount of computation, slowing down convergence and other defects.The improved algorithm uses the branch and bound method to divide the feasible region and in the best interests of the priority ways to expand and search nodes.By removing unnecessary branches that do not contain the optimal solution, the feasible region is getting smaller and smaller, and finally it is close to the optimal solution.The experimental results show that the improved algorithm can improve the convergence speed and the effect of approximating the optimal solution.

关 键 词：资源分配 单调优化 Polyblock外逼近法 分枝定界法 

分 类 号：TN911[电子电信—通信与信息系统]