Subcarrier allocation for OFDMA wireless channels using Lagrangian relaxation methods

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

doi:10.1109/GLOCOM.2006.770

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 proceeding › Conference proceeding contribution › peer-review

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 language	English
Title of host publication	IEEE GLOBECOM 2006 - 2006 Global Telecommunications Conference
Place of Publication	Piscataway, NJ
Publisher	Institute of Electrical and Electronics Engineers (IEEE)
Pages	1-5
Number of pages	5
ISBN (Print)	142440357X, 9781424403578
DOIs	https://doi.org/10.1109/GLOCOM.2006.770
Publication status	Published - 2006
Externally published	Yes
Event	IEEE GLOBECOM 2006 - 2006 Global Telecommunications Conference - San Francisco, CA, United States Duration: 27 Nov 2006 → 1 Dec 2006

Other

Other	IEEE GLOBECOM 2006 - 2006 Global Telecommunications Conference
Country/Territory	United States
City	San Francisco, CA
Period	27/11/06 → 1/12/06

Access to Document

10.1109/GLOCOM.2006.770

Cite this

@inproceedings{6795f3f9c12b4bdaad2a3942cf643af5,

title = "Subcarrier allocation for OFDMA wireless channels using Lagrangian relaxation methods",

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.",

author = "Gengfa Fang and Yi Sun and Jihua Zhou and Jinglin Shi and Zhongcheng Li and Eryk Dutkiewicz",

year = "2006",

doi = "10.1109/GLOCOM.2006.770",

language = "English",

isbn = "142440357X",

pages = "1--5",

booktitle = "IEEE GLOBECOM 2006 - 2006 Global Telecommunications Conference",

publisher = "Institute of Electrical and Electronics Engineers (IEEE)",

address = "United States",

note = "IEEE GLOBECOM 2006 - 2006 Global Telecommunications Conference ; Conference date: 27-11-2006 Through 01-12-2006",

}

Fang, G, Sun, Y, Zhou, J, Shi, J, Li, Z & Dutkiewicz, E 2006, Subcarrier allocation for OFDMA wireless channels using Lagrangian relaxation methods. in IEEE GLOBECOM 2006 - 2006 Global Telecommunications Conference., 4151400, Institute of Electrical and Electronics Engineers (IEEE), Piscataway, NJ, pp. 1-5, IEEE GLOBECOM 2006 - 2006 Global Telecommunications Conference, San Francisco, CA, United States, 27/11/06. https://doi.org/10.1109/GLOCOM.2006.770

Subcarrier allocation for OFDMA wireless channels using Lagrangian relaxation methods. / Fang, Gengfa; Sun, Yi; Zhou, Jihua et al.
IEEE GLOBECOM 2006 - 2006 Global Telecommunications Conference. Piscataway, NJ: Institute of Electrical and Electronics Engineers (IEEE), 2006. p. 1-5 4151400.

Research output: Chapter in Book/Report/Conference proceeding › Conference proceeding contribution › peer-review

TY - GEN

T1 - Subcarrier allocation for OFDMA wireless channels using Lagrangian relaxation methods

AU - Fang, Gengfa

AU - Sun, Yi

AU - Zhou, Jihua

AU - Shi, Jinglin

AU - Li, Zhongcheng

AU - Dutkiewicz, Eryk

PY - 2006

Y1 - 2006

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=50949083471&partnerID=8YFLogxK

U2 - 10.1109/GLOCOM.2006.770

DO - 10.1109/GLOCOM.2006.770

M3 - Conference proceeding contribution

AN - SCOPUS:50949083471

SN - 142440357X

SN - 9781424403578

SP - 1

EP - 5

BT - IEEE GLOBECOM 2006 - 2006 Global Telecommunications Conference

PB - Institute of Electrical and Electronics Engineers (IEEE)

CY - Piscataway, NJ

T2 - IEEE GLOBECOM 2006 - 2006 Global Telecommunications Conference

Y2 - 27 November 2006 through 1 December 2006

ER -

Subcarrier allocation for OFDMA wireless channels using Lagrangian relaxation methods

Abstract

Other

Access to Document

Other files and links

Fingerprint

Cite this