Joint scheduling and resource allocation based on genetic algorithm for coordinated multi-point transmission using adaptive modulation
Joint scheduling and resource allocation based on genetic algorithm for coordinated multi-point transmission using adaptive modulation
复制标题
DOI：
10.1109/pimrc.2012.6362722
复制
发表时间：
2012-11
期刊：
影响因子：
--
通讯作者：
Da Wang;Xiaodong Xu;Xin Chen;Xiaofeng Tao
中科院分区：
文献类型：
--
作者：
Da Wang;Xiaodong Xu;Xin Chen;Xiaofeng Tao
研究了下行协同多点传输(CoMP)系统中采用自适应调制的调度和资源分配问题，其中多个协作基站(BS)同时通过迫零预编码为多个用户提供服务。将最大化总和速率的联合调度和资源分配问题描述为约束条件下的组合优化问题。针对该问题的搜索空间过大，难以进行穷举搜索的问题，提出了一种基于遗传算法的求解方法。特别地，设计了一种二维二进制染色体编码方案来表示跨多个子信道的潜在用户选择和比特加载策略。为了处理每个BS的功率约束，使用了基于惩罚的适应度函数，从而使遗传算法能够在更大的区域内搜索最优解。为了确保收敛，每个种群都增加了一个名为Elite的超级个体。仿真结果表明，与已有方案相比，该算法具有显著的和速率增益，且具有接近ES的性能，但计算复杂度大大降低。
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.