...
首页> 外文期刊>IEEE Transactions on Communications >Toward Optimal Remote Radio Head Activation, User Association, and Power Allocation in C-RANs Using Benders Decomposition and ADMM
【24h】

Toward Optimal Remote Radio Head Activation, User Association, and Power Allocation in C-RANs Using Benders Decomposition and ADMM

机译:使用Benders分解和ADMM在C-RAN中实现最佳的远程无线电头激活,用户关联和功率分配

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

摘要

To satisfy the rapidly growing demands of wireless communications, new structures have been proposed for the fifth-generation (5G) mobile communication networks, such as cloud radio access networks (C-RANs), which have advantages including high energy efficiency, large network capacity, and high flexibility. This paper concentrates on the problem of remote radio head (RRH) activation, user association, and power allocation in C-RANs. To tackle the problem with l(0) norm, we transform it into a mixed-integer nonlinear programming (MINLP) problem. Instead of solving it by centralized solvers, we propose a novel algorithm based on Benders decomposition, which can obtain the optimal solution of the MINLP problem. To solve the primal problem in Benders decomposition efficiently, we adopt the alternating direction method of multipliers (ADMM) to achieve a parallel implementation. To further reduce the complexity of solving the MINLP problem, a distributed two-stage iterative algorithm combining the ADMM and the max-sum algorithm is also proposed. The simulation results demonstrate that the first proposed algorithm can obtain the optimal solution, and the second proposed algorithm outperforms conventional algorithms significantly.
机译:为了满足快速增长的无线通信需求,已经为诸如云无线电接入网(C-RAN)的第五代(5G)移动通信网提出了新的结构,其具有包括高能效,大网络容量的优点。 ,灵活性高。本文着重于C-RAN中的远程无线电头(RRH)激活,用户关联和功率分配问题。为了解决l(0)范数的问题,我们将其转换为混合整数非线性规划(MINLP)问题。提出了一种基于Benders分解的新算法,而不是使用集中式求解器来求解该算法,该算法可以获得MINLP问题的最优解。为了有效解决Benders分解中的原始问题,我们采用乘数交替方向方法(ADMM)来实现并行实现。为了进一步降低求解MINLP问题的复杂性,还提出了一种结合ADMM和最大和算法的分布式两阶段迭代算法。仿真结果表明,第一种算法能够获得最优解,第二种算法明显优于传统算法。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号