Paper Info
Title
Low Complexity Resource Allocation Algorithms For Chunk Based Ofdma Multi-User Networks With Max-Min Fairness
Abstract
This paper investigates the resource allocation problem in orthogonal frequency division multiple access networks with multiple users. Different from most works that perform resource allocation based on each subcarrier, we consider the subcarriers are grouped into chunks due to simplicity of implementation. The objective is to maximize the users' minimal transmission rate by adjusting the transmission power allocation and chunk allocation while taking into account several important constraints. The problem is formulated as a mixed integer nonlinear programming problem, which is generally hard to solve. By binary relaxation, the problem is transformed to be a convex problem. By exploiting the special structure of the relaxed problem, a barrier method based fast algorithm is proposed. To achieve binary chunk allocation, a low complexity suboptimal algorithm is proposed further. When the number of chunks is less than the number of users, it is necessary to consider the joint admission control and resource allocation problem. To solve this problem, a fast algorithm based on bisection search and Hungarian method is designed. Simulations are carried out to validate the superior performance of the proposed algorithms in terms of the users' minimal transmission rate and running time comparing with benchmark algorithms under different conditions.
Year
DOI
Venue
2020
10.1016/j.comcom.2020.09.003
COMPUTER COMMUNICATIONS
Keywords
DocType
Volume
Orthogonal frequency division multiple access, Resource allocation, Max-min fairness
Journal
163
ISSN
Citations 
PageRank 
0140-3664
0
0.34
References 
Authors
0
4
Name
Order
Citations
PageRank
Yanyan Shen145749.77
Xiaoxia Huang29710.62
Bo Yang336140.37
Shu-Qiang Wang4239.89