Joint Sub-Channel Assignment and Power Allocation in Heterogeneous Networks: An Efficient Optimization Method

This letter is concerned with joint sub-channel and power allocation in a heterogeneous network. We consider the uplink of a co-channel framework where a macrocell shares the orthogonal frequency division multiple access (OFDMA) sub-channels with a number of small cells (SCs). We maximize the weight...

Full description

Saved in:
Bibliographic Details
Published in:IEEE communications letters Vol. 20; no. 12; pp. 2490 - 2493
Main Authors: Khamidehi, Behzad, Rahmati, Ali, Sabbaghian, Maryam
Format: Journal Article
Language:English
Published: New York IEEE 01.12.2016
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:
Approximation
D.C. programming
Frequency division multiple access
Heterogeneous networks
Interference
Linear programming
Mathematical analysis
Mixed integer
mixed integer non-linear problem
OFDMA heterogeneous networks
Optimization
Programming
resource allocation
Resource management
Uplink
User satisfaction
ISSN:1089-7798, 1558-2558
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This letter is concerned with joint sub-channel and power allocation in a heterogeneous network. We consider the uplink of a co-channel framework where a macrocell shares the orthogonal frequency division multiple access (OFDMA) sub-channels with a number of small cells (SCs). We maximize the weighted sum-rate of the OFDMA SC network, while a target constraint on the cross-tier interference and a minimum data rate requirement for the high data rate SC users are satisfied. The optimization problem is a highly non-convex mixed integer non-linear problem. We first reformulate the problem into a more mathematically tractable form. Then, we relax the integer variables by adding a penalty term to the objective function. Finally, we rewrite the objective function as the difference of two concave (D.C.) functions and solve this problem using the successive convex approximation method. We show that our method outperforms the state-of-the-art schemes.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1089-7798
1558-2558
DOI:10.1109/LCOMM.2016.2597147