2020
DOI: 10.1109/lwc.2020.2970696
|View full text |Cite
|
Sign up to set email alerts
|

Joint User Association and Resource Allocation in the Uplink of Heterogeneous Networks

Abstract: This letter considers the problem of joint user association (UA), sub-channel assignment, antenna selection (AS), and power control in the uplink (UL) of a heterogeneous network such that the data rate of small cell users can be maximized while the macro-cell users are protected by imposing a threshold on the cross-tier interference. The considered problem is a non-convex mixed integer non-linear programming (MINLP). To tackle the problem, we decompose the original problem into two sub-problems:(i) joint UA, s… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
30
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
6
1
1

Relationship

2
6

Authors

Journals

citations
Cited by 56 publications
(30 citation statements)
references
References 14 publications
0
30
0
Order By: Relevance
“…Then, an EEmax problem was solved for optimal power allocation using Lagrangian duality. The authors of [36] have considered the problem of joint user association, carrier allocation, antenna selection, and power control in the uplink of a MIMO HetNet to maximize the data rate of small cell users, by imposing a maximum threshold on the cross-tier interference. By decomposing the original problem into two subproblems and finding an iterative solution, a locally optimal solution has been obtained.…”
Section: A Related Workmentioning
confidence: 99%
“…Then, an EEmax problem was solved for optimal power allocation using Lagrangian duality. The authors of [36] have considered the problem of joint user association, carrier allocation, antenna selection, and power control in the uplink of a MIMO HetNet to maximize the data rate of small cell users, by imposing a maximum threshold on the cross-tier interference. By decomposing the original problem into two subproblems and finding an iterative solution, a locally optimal solution has been obtained.…”
Section: A Related Workmentioning
confidence: 99%
“…This binary variable turns (15) into a MINLP, which is difficult to solve in an acceptable time span. To address this issue, we take an approach similar to [21], [22], and replace constraint C 6 with the following inequalities:…”
Section: Equivalent Reformulation Of Binary Constraintsmentioning
confidence: 99%
“…Content may change prior to final publication. Citation information: DOI 10.1109/ACCESS.2020.3032661, IEEE Access restate this constraint as the intersection of the two following regions [38], [43]:…”
Section: Proposed Solutionmentioning
confidence: 99%
“…But, R 2 is still non-convex and is a reverse convex function which makes the optimization problem nonconvex form. To tackle it, we adopt Abstract Lagrangian model and we restate the objective function [38], [43], [44]. Next, we handle the non-convex constraint C 7 via introducing scalar slack variable ξ n j,k,i .…”
Section: Proposed Solutionmentioning
confidence: 99%
See 1 more Smart Citation