首页> 外文期刊>Computer Communications >Energy efficiency maximization oriented resource allocation in 5G ultra-dense network: Centralized and distributed algorithms
【24h】

Energy efficiency maximization oriented resource allocation in 5G ultra-dense network: Centralized and distributed algorithms

机译:5G超密集网络中面向能效最大化的资源分配:集中式和分布式算法

获取原文
获取原文并翻译 | 示例
           

摘要

Spurred by both economic and environmental concerns, energy efficiency (EE) has now become one of the key pillars for the fifth generation (5G) mobile communication networks. To maximize the downlink EE of the 5G ultra dense network (UDN), we formulate a constrained EE maximization problem and translate it into a convex representation based on the fractional programming theory. To solve this problem, we first adopt a centralized algorithm to reach the optimum based on Dinkelbach's procedure. To improve the efficiency and reduce the computational complexity, we further propose a distributed iteration resource allocation algorithm based on alternating direction method of multipliers (ADMM). For the proposed distributed algorithm, the local and dual variables are updated by each base station (BS) in parallel and independently, and the global variables are updated through the coordination and information exchange among BSs. Moreover, as the noise may lead to imperfect information exchange among BSs, the global variables update may be subject to failure. To cope with this problem, we propose a robust distributed algorithm, for which the global variable only updates as the information exchange is successful. We prove that this modified robust distributed algorithm converges to the optimal solution of the primal problem almost surely. Simulation results validate our proposed centralized and distributed algorithms. Especially, the proposed robust distributed algorithm can effectively eliminate the impact of noise and converge to the optimal value at the cost of a little increase of computational complexity.
机译:在经济和环境问题的推动下,能源效率(EE)现在已成为第五代(5G)移动通信网络的关键支柱之一。为了最大化5G超密集网络(UDN)的下行链路EE,我们根据分数规划理论制定了一个受约束的EE最大化问题并将其转换为凸表示。为了解决这个问题,我们首先采用基于Dinkelbach程序的集中算法来达到最优。为了提高效率并降低计算复杂度,我们进一步提出了一种基于交替方向乘数法(ADMM)的分布式迭代资源分配算法。对于所提出的分布式算法,本地变量和对偶变量由每个基站(BS)并行且独立地更新,而全局变量通过BS之间的协调和信息交换来更新。此外,由于噪声可能导致BS之间的信息交换不完善,因此全局变量更新可能会失败。为了解决这个问题,我们提出了一种鲁棒的分布式算法,该全局算法仅在信息交换成功时才更新全局变量。我们证明了这种改进的鲁棒分布式算法几乎可以肯定地收敛到原始问题的最优解。仿真结果验证了我们提出的集中式和分布式算法。特别地,所提出的鲁棒的分布式算法可以有效地消除噪声的影响并且以稍微增加计算复杂度为代价收敛到最优值。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号