2011 IEEE Vehicular Technology Conference (VTC Fall) 2011
DOI: 10.1109/vetecf.2011.6092861
|View full text |Cite
|
Sign up to set email alerts
|

Energy-Efficient 2-D Resource Allocation with Fairness Constraints for OFDMA Networks

Abstract: In this paper, a 2-Dimension (2-D) resource allocation problem for energy efficiency maximization in the uplink of an OFDMA network is studied. Firstly, with the metric of energy efficiency, measured as bits-per-joule, we convert the complex problem of optimizing the system energy efficiency, defined as sum of users' bits-per-joule, into an optimal achievable rate comparison problem, and devise a low-complexity sub-optimal resource allocation scheme for maximizing it while satisfying each user's resource requi… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2012
2012
2013
2013

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(1 citation statement)
references
References 10 publications
0
1
0
Order By: Relevance
“…The algorithm stops when it reaches a local optimum, at which none of the neighbouring solutions leads to any improvement. Many other two-stage algorithms have been proposed recently, including sorting-and-assignment algorithms [11,12], subcarrier-and-power allocation algorithms [13] and userand-rate allocation algorithms [14]. The aforementioned heuristic algorithms, however, achieve loose gaps from the optimum, or their complexities are hard to predict as the number of iterations needed is a tuning parameter.…”
Section: Introductionmentioning
confidence: 99%
“…The algorithm stops when it reaches a local optimum, at which none of the neighbouring solutions leads to any improvement. Many other two-stage algorithms have been proposed recently, including sorting-and-assignment algorithms [11,12], subcarrier-and-power allocation algorithms [13] and userand-rate allocation algorithms [14]. The aforementioned heuristic algorithms, however, achieve loose gaps from the optimum, or their complexities are hard to predict as the number of iterations needed is a tuning parameter.…”
Section: Introductionmentioning
confidence: 99%