首页> 外文会议>IEEE International Symposium on Personal, Indoor and Mobile Radio Communications >Joint scheduling and resource allocation based on genetic algorithm for coordinated multi-point transmission using adaptive modulation
【24h】

Joint scheduling and resource allocation based on genetic algorithm for coordinated multi-point transmission using adaptive modulation

机译:基于自适应调制基于协调多点传输遗传算法的联合调度与资源分配

获取原文

摘要

This paper considers the scheduling and resource allocation with adaptive modulation in downlink coordinated multi-point transmission (CoMP) systems, where multiple users are served via zero-forcing precoding simultaneously by several cooperative base stations (BSs). The joint scheduling and resource allocation to maximize the sum rate is formulated as a combinational optimization problem under constraints. As the searching space for this problem is extremely large, which prohibits an exhaustive search (ES), a genetic algorithm (GA) based solution is proposed. In particular, a two-dimension-binary chromosome coding scheme is designed to denote potential user selection and bit loading strategies across multiple subchannels. To handle per-BS power constraint, a penalty based fitness function is used, and in doing so GA can search for optimal solution in a larger region. To ensure convergence, a super individual named elite is added to each population. Simulation results indicate that the proposed algorithm leads to significant sum rate gain compared to existing schemes, and provides close to ES performance but with much lower computational complexity.
机译:本文考虑了下行链路协调多点传输(COMP)系统中的自适应调制的调度和资源分配,其中多个用户通过多个协作基站(BSS)同时使用零强制预编码。联合调度和资源分配最大化总和速率被制定为约束下的组合优化问题。由于该问题的搜索空间非常大,这禁止穷举搜索(ES),提出了一种基于遗传算法(GA)的解决方案。特别地,旨在表示多个子信道的潜在用户选择和位加载策略的两维二元染色体编码方案。为了处理PER-BS功率约束,使用基于惩罚的健身功能,因此GA可以在更大区域中搜索最佳解决方案。为确保收敛,将重新命名为精英的超级个人添加到每个人口中。仿真结果表明,与现有方案相比,该算法导致显着的总和率增益,并提供接近的ES性能,但计算复杂性更低。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号