2013
DOI: 10.1109/lcomm.2012.112812.121744
|View full text |Cite
|
Sign up to set email alerts
|

A Unified Energy Efficiency and Spectral Efficiency Tradeoff Metric in Wireless Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
47
0

Year Published

2014
2014
2020
2020

Publication Types

Select...
4
2
1

Relationship

1
6

Authors

Journals

citations
Cited by 94 publications
(47 citation statements)
references
References 9 publications
0
47
0
Order By: Relevance
“…More specifically, we can regard (w i , 1−w i ) as a priori articulation of preferences for SE and EE, which captures EE-SE tradeoff in a unified way [13]. Second, we consider the fairness among all N users.…”
Section: B Problem Formulationmentioning
confidence: 99%
See 1 more Smart Citation
“…More specifically, we can regard (w i , 1−w i ) as a priori articulation of preferences for SE and EE, which captures EE-SE tradeoff in a unified way [13]. Second, we consider the fairness among all N users.…”
Section: B Problem Formulationmentioning
confidence: 99%
“…• We construct a utility function of all users which not only captures the user diversity for EE-SE tradeoff in a unified way, similar to [13], but also guarantees fairness among all users. Then we maximize the utility function.…”
Section: Introductionmentioning
confidence: 99%
“…Similar to [4], we utilize the ratio of bandwidth budget and power budget as the unit normalizer for frame SE and frame EE, which is modeled as…”
Section: Ee-se Adaptive Tradeoff Metricmentioning
confidence: 99%
“…By utilizing a transformation and a two-part linearization method, a sequence of traditional programming relaxations of the initial nonconvex programming problem can be derived which are embedded in a branch-and-bound algorithm. In addition, we can also solve the offline problem (13) by using Lagrange dual decomposition as in [4], where the problem is transformed to the dual problem with the given energy consumption of BS. Then the dual problem can be solved iteratively where the BS solves L subproblems as inner loop in parallel and solves the master problem as outer loop with the gradient method.…”
Section: The Problem Presentationmentioning
confidence: 99%
See 1 more Smart Citation