论文部分内容阅读
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.
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. size this 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.