Fast Convergence Resource Allocation in IEEE 802.16 OFDMA Systems with Minimum Rate Guarantee

作     者：Mohammad Mostafavi Javad Musevi Niya Hosein Mohammadi Behzad Mozaffari Tazehkand 

作者机构：Faculty of Electrical and Computer EngineeringUniversity of Tabriz Faculty of Electrical and Computer EngineeringUniversity of Zanjan 

出 版 物：《China Communications》 (中国通信（英文版）)

年 卷 期：2016年第13卷第12期

页      面：120-131页

核心收录：

学科分类：080904[工学-电磁场与微波技术] 0810[工学-信息与通信工程] 0809[工学-电子科学与技术（可授工学、理学学位）] 08[工学] 080402[工学-测试计量技术及仪器] 0804[工学-仪器科学与技术] 081001[工学-通信与信息系统] 

主　　题：burst pack channel aware la grangian function OFDMA power allocation sub-channel allocation 

摘      要：Resource allocation in the context of OFDMA-based systems is challenging, given a combinatorial nature of the problem. In the context of IEEE 802.16 systems this problem is further exacerbated by additional constraints that are faced with its two dimensional frame nature. The main challenges associated with resource allocation in these systems are: mapping the allocated bandwidth resources to users in this two dimensional frame, power and frequency allocation, and Qo S guarantee. This optimization problem can usually be solved by an iterative algorithm. The solutions proposed have a constant step size in iterations which causes a long convergence time. For this reason, the solutions proposed are not applicable in IEEE 802.16 systems. In this paper we propose a novel resource allocation algorithm in IEEE 802.16 systems which has an adaptive step size in iterations while taking into account the minimum rate guarantee for users.