Energy-efficient 2-D resource allocation with fairness constraints for OFDMA networks

Chieh Yuan Ho*, Ching-Yao Huang

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Scopus citations


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 requirement. The proposed scheme implements both power allocation and Resource Unit (RU) assignment devised by exploiting the optimal achievable rate maximizing user's energy efficiency. The numerical result shows that the proposed scheme outperforms widely-used schemes with Equal Power Allocation (EPA), such as maximum SNR and Proportional Fair, in terms of performance of bits-per-joule with different resource requirement and can achieve similar results as the exhaustive search scheme in much lower complexity.

Original languageEnglish
Title of host publication2011 IEEE Vehicular Technology Conference Fall, VTC Fall 2011 - Proceedings
StatePublished - 23 Dec 2011
EventIEEE 74th Vehicular Technology Conference, VTC Fall 2011 - San Francisco, CA, United States
Duration: 5 Sep 20118 Sep 2011

Publication series

NameIEEE Vehicular Technology Conference
ISSN (Print)1550-2252


ConferenceIEEE 74th Vehicular Technology Conference, VTC Fall 2011
CountryUnited States
CitySan Francisco, CA


  • energy-efficient
  • OFDMA networks
  • power allocation
  • resource allocation

Fingerprint Dive into the research topics of 'Energy-efficient 2-D resource allocation with fairness constraints for OFDMA networks'. Together they form a unique fingerprint.

Cite this