Downlink scheduling and resource allocation for OFDM systems

Huang Jianwei*, Vijay Subramanian, Rajeev Agrawal, Randall Berry

*Corresponding author for this work

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

53 Scopus citations

Abstract

We consider scheduling and resource allocation for the downlink of a OFDM-based wireless network. During each time-slot the scheduling and resource allocation problem involves selecting a subset of users for transmission, determining the assignment of available subcarriers to selected users, and for each subcarrier determining the transmission power and the coding and modulation scheme used. We address this in the context of a utility-based scheduling and resource allocation scheme presented in earlier papers. Scheduling and resource allocation is determined by solving an optimization problem, which is convex for a reasonable model of the feasible rates. By exploiting the structure of this problem, we give optimal and sub-optimal algorithms for its solution. We provide simulation results comparing different algorithms and parameter settings.

Original languageEnglish (US)
Title of host publication2006 IEEE Conference on Information Sciences and Systems, CISS 2006 - Proceedings
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages1272-1279
Number of pages8
ISBN (Print)1424403502, 9781424403509
DOIs
StatePublished - Jan 1 2006
Event2006 40th Annual Conference on Information Sciences and Systems, CISS 2006 - Princeton, NJ, United States
Duration: Mar 22 2006Mar 24 2006

Publication series

Name2006 IEEE Conference on Information Sciences and Systems, CISS 2006 - Proceedings

Other

Other2006 40th Annual Conference on Information Sciences and Systems, CISS 2006
CountryUnited States
CityPrinceton, NJ
Period3/22/063/24/06

ASJC Scopus subject areas

  • Computer Science(all)

Fingerprint Dive into the research topics of 'Downlink scheduling and resource allocation for OFDM systems'. Together they form a unique fingerprint.

Cite this