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

Antenna Selection Strategy for Energy Efficiency Maximization in Uplink OFDMA Networks: A Multi-Objective Approach

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
39
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
6

Relationship

3
3

Authors

Journals

citations
Cited by 39 publications
(39 citation statements)
references
References 41 publications
0
39
0
Order By: Relevance
“…Even though the MOOP (14) contains two competing objective functions, we can still find a solution for it that satisfies the predefined conditions of Pareto optimality. In contrast to the Dinkelbach method, which is only applicable to an optimization problem with fractional function, MOOP can be adopted for any optimization problem even if the number of objective function exceeds two [17], [18]. Moreover, MOOP provides a SE-EE trade-off with lower computational complexity compared to the Dinkelbach method.…”
Section: Proof Please See Appendix Amentioning
confidence: 99%
See 1 more Smart Citation
“…Even though the MOOP (14) contains two competing objective functions, we can still find a solution for it that satisfies the predefined conditions of Pareto optimality. In contrast to the Dinkelbach method, which is only applicable to an optimization problem with fractional function, MOOP can be adopted for any optimization problem even if the number of objective function exceeds two [17], [18]. Moreover, MOOP provides a SE-EE trade-off with lower computational complexity compared to the Dinkelbach method.…”
Section: Proof Please See Appendix Amentioning
confidence: 99%
“…where t 0 is the initial point, 0 ≤ 1 is the stopping criterion, and µ is used for updating the accuracy of the method [17], [25]. Path loss exponent 3…”
Section: B Computational Complexity Analysismentioning
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