首页> 外文会议>International Conference on Electronics Information and Emergency Communication >Joint time-frequency-power resource allocation algorithm for OFDMA systems
【24h】

Joint time-frequency-power resource allocation algorithm for OFDMA systems

机译:OFDMA系统的时频功率资源联合分配算法

获取原文

摘要

This paper considers a joint radio resource allocation simultaneously at the frequency domain (sub-carriers) and the time domain (slot) and the power domain (power control) for downlink in OFDMA systems. The radio resource allocation problem is modeled as a cooperative game where a fairness criterion is enforced. Given a minimum rate requirement for each user, Nash bargaining model ensures all users to attain their minimum rate requirements, and to maximize the aggregate payoff of the users. To achieve the Nash bargaining solution (NBS) of the game, firstly, a time-frequency allocation algorithm is performed by assuming an equal power allocation. Secondly, using the Lagrange multiplier method and the adaptive modulation and coding (AMC) schemes, we can easily obtain an optimal allocation by estimating each user's signal-to-noise ratio. Thirdly, an optimal power allocation algorithm is proposed to maximize the sum payoff. Simulation results show that the cooperative game acquired a good tradeoff between the fairness and the overall system capacity, comparing with the other two typical resource allocation algorithms of the maximizing system capacity and the max-min fairness algorithm. Moreover the proposed algorithms have complexity O(K∗N∗T), where K is the number of users in Systems, N is the number of subcarriers, and T is the number of slots in a frame.
机译:本文考虑在OFDMA系统中同时在频域(子载波)和时域(时隙)和功率域(功率控制)同时进行联合无线资源分配。无线电资源分配问题被建模为一个合作博弈,其中强制执行公平性标准。给定每个用户的最低费率要求,纳什讨价还价模型可确保所有用户达到其最低费率要求,并使用户的总收益最大化。为了实现游戏的纳什讨价还价解决方案(NBS),首先,通过假设功率分配相等来执行时频分配算法。其次,使用拉格朗日乘数法和自适应调制和编码(AMC)方案,我们可以通过估计每个用户的信噪比轻松获得最佳分配。第三,提出了一种最优的功率分配算法,以使总收益最大化。仿真结果表明,与其他两种典型的资源分配算法最大化系统容量和最大最小公平算法相比,合作博弈在公平性和整体系统容量之间取得了良好的折衷。此外,所提出的算法具有复杂度O(K * N * T),其中K是系统中的用户数,N是子载波的数量,T是一帧中的时隙数。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号