Low complexity resource allocation algorithms for chunk based OFDMA multi-user networks with max–min fairness

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 impleme...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Computer communications Jg. 163; S. 51 - 64
Hauptverfasser: Shen, Yanyan, Huang, Xiaoxia, Yang, Bo, Wang, Shuqiang
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Elsevier B.V 01.11.2020
Schlagworte:
Max–min fairness
Orthogonal frequency division multiple access
Resource allocation
Orthogonal frequency division multiple access
Max–min fairness
Resource allocation
ISSN:0140-3664, 1873-703X
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:0140-3664
1873-703X
DOI:10.1016/j.comcom.2020.09.003