摘要
针对多个终端直通通信(D2D)用户共享多个蜂窝用户资源的公平性问题,在保证蜂窝用户速率的前提下,提出了基于最大最小公平性(max-min fairness)的功率分配算法。该算法首先将非凸优化问题转化为含凸函数的差(DC)规划问题,然后采用凸近似的全局优化算法和对分算法对D2D实现功率优化。仿真结果表明,与只采用凸近似的全局优化算法相比,所提算法收敛性更优,同时最大化了瓶颈用户的速率。
Concerning the fairness problem of multiple Device-to-Device(D2D) users reusing the spectrum resources allocated to cellular subscribers, a power allocation algorithm based on max-min fairness was proposed under the premise of guaranteeing the rate of cellular users. First, the nonconvex optimization problem was transformed into a Difference between Convex functions(DC) programming problem, then the global optimization algorithm of convex approximation and the bisection algorithm were used to achieve power optimization of D2D. Simulation results show that compared with the global optimization algorithm which only uses convex approximation, the proposed algorithm has better convergence and maximizes the bottleneck rate of D2D users.
出处
《计算机应用》
CSCD
北大核心
2017年第4期945-947,953,共4页
journal of Computer Applications
基金
国家自然科学基金资助项目(61302106)~~
关键词
终端直通通信
最大最小公平性
凸函数的差规划
功率优化
Device-to-Device(D2D)
max-min fairness
difference between convex functions programming
power optimization