Opportunistic scheduling for an OFDMA system with multi-class services

Jeong Ahn Kwon, Jang-Won Lee

Research output: Contribution to journalArticle

5 Citations (Scopus)

Abstract

In this paper, we study an opportunistic scheduling problem in an OFDMA system, in which sub-carriers of the system are allocated to each user in each time slot considering the time-varying channel condition and QoS requirement of each user. We consider two different classes of services that are represented with different types of utility functions. The utility function for a user in one class is defined as a function of its average data rate, which can be applicable to best-effort services and the utility function for a user in the other class is defined as a function of its instantaneous data rate, which can be applicable to rate-sensitive services. Those two types of utility functions have been extensively considered in opportunistic scheduling in wireless networks. However, in most of the previous work, they are considered separately in different problems. In this paper, we formulate a stochastic optimization problem that can treat those two types of utility functions in a single problem, which enables us to implement an opportunistic scheduling algorithm that can consider those two classes of services in a single system in a unified way. Through simulations, we first show that our algorithm provides a good approximation to the optimal solution. In addition, we also verify the appropriateness of our utility models.

Original languageEnglish
Pages (from-to)1104-1114
Number of pages11
JournalWireless Communications and Mobile Computing
Volume12
Issue number12
DOIs
Publication statusPublished - 2012 Aug 25

Fingerprint

Scheduling
Scheduling algorithms
Wireless networks
Quality of service

All Science Journal Classification (ASJC) codes

  • Information Systems
  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Cite this

@article{c7cf954ab2694c2bae480fb0eecc351f,
title = "Opportunistic scheduling for an OFDMA system with multi-class services",
abstract = "In this paper, we study an opportunistic scheduling problem in an OFDMA system, in which sub-carriers of the system are allocated to each user in each time slot considering the time-varying channel condition and QoS requirement of each user. We consider two different classes of services that are represented with different types of utility functions. The utility function for a user in one class is defined as a function of its average data rate, which can be applicable to best-effort services and the utility function for a user in the other class is defined as a function of its instantaneous data rate, which can be applicable to rate-sensitive services. Those two types of utility functions have been extensively considered in opportunistic scheduling in wireless networks. However, in most of the previous work, they are considered separately in different problems. In this paper, we formulate a stochastic optimization problem that can treat those two types of utility functions in a single problem, which enables us to implement an opportunistic scheduling algorithm that can consider those two classes of services in a single system in a unified way. Through simulations, we first show that our algorithm provides a good approximation to the optimal solution. In addition, we also verify the appropriateness of our utility models.",
author = "Kwon, {Jeong Ahn} and Jang-Won Lee",
year = "2012",
month = "8",
day = "25",
doi = "10.1002/wcm.1039",
language = "English",
volume = "12",
pages = "1104--1114",
journal = "Wireless Communications and Mobile Computing",
issn = "1530-8669",
publisher = "John Wiley and Sons Ltd",
number = "12",

}

Opportunistic scheduling for an OFDMA system with multi-class services. / Kwon, Jeong Ahn; Lee, Jang-Won.

In: Wireless Communications and Mobile Computing, Vol. 12, No. 12, 25.08.2012, p. 1104-1114.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Opportunistic scheduling for an OFDMA system with multi-class services

AU - Kwon, Jeong Ahn

AU - Lee, Jang-Won

PY - 2012/8/25

Y1 - 2012/8/25

N2 - In this paper, we study an opportunistic scheduling problem in an OFDMA system, in which sub-carriers of the system are allocated to each user in each time slot considering the time-varying channel condition and QoS requirement of each user. We consider two different classes of services that are represented with different types of utility functions. The utility function for a user in one class is defined as a function of its average data rate, which can be applicable to best-effort services and the utility function for a user in the other class is defined as a function of its instantaneous data rate, which can be applicable to rate-sensitive services. Those two types of utility functions have been extensively considered in opportunistic scheduling in wireless networks. However, in most of the previous work, they are considered separately in different problems. In this paper, we formulate a stochastic optimization problem that can treat those two types of utility functions in a single problem, which enables us to implement an opportunistic scheduling algorithm that can consider those two classes of services in a single system in a unified way. Through simulations, we first show that our algorithm provides a good approximation to the optimal solution. In addition, we also verify the appropriateness of our utility models.

AB - In this paper, we study an opportunistic scheduling problem in an OFDMA system, in which sub-carriers of the system are allocated to each user in each time slot considering the time-varying channel condition and QoS requirement of each user. We consider two different classes of services that are represented with different types of utility functions. The utility function for a user in one class is defined as a function of its average data rate, which can be applicable to best-effort services and the utility function for a user in the other class is defined as a function of its instantaneous data rate, which can be applicable to rate-sensitive services. Those two types of utility functions have been extensively considered in opportunistic scheduling in wireless networks. However, in most of the previous work, they are considered separately in different problems. In this paper, we formulate a stochastic optimization problem that can treat those two types of utility functions in a single problem, which enables us to implement an opportunistic scheduling algorithm that can consider those two classes of services in a single system in a unified way. Through simulations, we first show that our algorithm provides a good approximation to the optimal solution. In addition, we also verify the appropriateness of our utility models.

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

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

U2 - 10.1002/wcm.1039

DO - 10.1002/wcm.1039

M3 - Article

VL - 12

SP - 1104

EP - 1114

JO - Wireless Communications and Mobile Computing

JF - Wireless Communications and Mobile Computing

SN - 1530-8669

IS - 12

ER -