Subcarrier allocation for OFDMA wireless channels using Lagrangian relaxation methods

Gengfa Fang*, Yi Sun, Jihua Zhou, Jinglin Shi, Zhongcheng Li, Eryk Dutkiewicz

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference proceeding contribution

5 Citations (Scopus)

Abstract

In this paper, we propose a practically efficient Subcarrier Allocation scheme based on Lagrangian relaxation to solve the problem of subcarrier allocation in OFDMA wireless channels. The problem of subcarrier allocation is formulated into an Integer Programming (IP) problem, which is relaxed by replacing complicating constraints with Lagrange multipliers using Lagrangian Relaxation. A subgradient method is used to optimize the Lagrangian dual function and a heuristic is designed to obtain the feasible solution. Lagrangian Relaxation Subcarrier Allocation (LRSA) is proven to be of polynomial complexity and it provides bounds on the value of channel efficiency. Numerical results show that compared with other algorithms proposed in the literature, LRSA can result in a significant improvement in channel efficiency, while at the same time guaranteeing minimum data rates of users.

Original languageEnglish
Title of host publicationIEEE GLOBECOM 2006 - 2006 Global Telecommunications Conference
Place of PublicationPiscataway, NJ
PublisherInstitute of Electrical and Electronics Engineers (IEEE)
Pages1-5
Number of pages5
ISBN (Print)142440357X, 9781424403578
DOIs
Publication statusPublished - 2006
Externally publishedYes
EventIEEE GLOBECOM 2006 - 2006 Global Telecommunications Conference - San Francisco, CA, United States
Duration: 27 Nov 20061 Dec 2006

Other

OtherIEEE GLOBECOM 2006 - 2006 Global Telecommunications Conference
CountryUnited States
CitySan Francisco, CA
Period27/11/061/12/06

Fingerprint Dive into the research topics of 'Subcarrier allocation for OFDMA wireless channels using Lagrangian relaxation methods'. Together they form a unique fingerprint.

Cite this