首页> 外文会议>International Symposium on Wireless Communication Systems >Greedy Algorithm for Dynamic Resource Allocation in Downlink of OFDMA System
【24h】

Greedy Algorithm for Dynamic Resource Allocation in Downlink of OFDMA System

机译:OFDMA系统下行中的动态资源分配贪婪算法

获取原文

摘要

This paper investigates the problem of dynamic multiuser resource allocation in the downlink of OFDMA system. To overcome the users'buffer overflow, a greedy algorithm is proposed in order to minimize the total power consumption subject to user's traffic requirement. The optimization problem is split into two steps. In the first step, we perform subchannel allocation based on the buffer size and channel condition for every user. In the second step, we optimize power allocation for each user based on a single "Water-filling" approach. Simulation results show that the proposed algorithm outperforms classical ones, since it offers a reduced total power consumption. We note a 10 dB gain when the number of users exceeds 4.
机译:本文研究了OFDMA系统下行链路中动态多用户资源分配问题。为了克服用户缓冲区溢出,提出了一种贪婪算法,以最大限度地减少用户流量需求的总功耗。优化问题分为两个步骤。在第一步中,我们基于每个用户的缓冲区大小和信道条件执行子信道分配。在第二步中,我们基于单个“水填充”方法优化每个用户的功率分配。仿真结果表明,该算法优于经典的算法,因为它提供了减少的总功耗。当用户数量超过4时,我们注意到10 dB的增益。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号