Opportunistic resource scheduling for a wireless network with relay stations

Jeong Ahn Kwon, Jang-Won Lee

Research output: Contribution to journalArticle

Abstract

In this paper, we study an opportunistic scheduling scheme for the TDMA wireless network with relay stations. We model the time-varying channel condition of a wireless link as a stochastic process. Based on this model, we formulate an optimization problem for the opportunistic scheduling scheme that maximizes the expected system throughput while satisfying the QoS constraint of each user. In the opportunistic scheduling scheme for the system without relay stations, each user has only one communication path between the base station and itself, and thus only user selection is considered. However, in our opportunistic scheduling scheme for the system with relay stations, since there may exist multiple paths between the base station and a user, not only user selection but also path selection for the scheduled user is considered. In addition, we also propose an opportunistic time-sharing method for time-slot sharing between base station and relay stations. With the opportunistic time-sharing method, our opportunistic scheduling provides opportunistic resource sharing in three places in the system: user selection in a time-slot, path selection for the selected user, and time-slot sharing between base station and relay stations. Simulation results show that as the number of places that opportunistic resource sharing is applied to increases, the performance improvement also increases.

Original languageEnglish
Pages (from-to)2097-2103
Number of pages7
JournalIEICE Transactions on Communications
VolumeE93-B
Issue number8
DOIs
Publication statusPublished - 2010 Jan 1

Fingerprint

Wireless networks
Base stations
Scheduling
Time division multiple access
Random processes
Telecommunication links
Quality of service
Throughput
Communication

All Science Journal Classification (ASJC) codes

  • Software
  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Cite this

@article{34d4d7351da74eedb4a8b8f12c7e908e,
title = "Opportunistic resource scheduling for a wireless network with relay stations",
abstract = "In this paper, we study an opportunistic scheduling scheme for the TDMA wireless network with relay stations. We model the time-varying channel condition of a wireless link as a stochastic process. Based on this model, we formulate an optimization problem for the opportunistic scheduling scheme that maximizes the expected system throughput while satisfying the QoS constraint of each user. In the opportunistic scheduling scheme for the system without relay stations, each user has only one communication path between the base station and itself, and thus only user selection is considered. However, in our opportunistic scheduling scheme for the system with relay stations, since there may exist multiple paths between the base station and a user, not only user selection but also path selection for the scheduled user is considered. In addition, we also propose an opportunistic time-sharing method for time-slot sharing between base station and relay stations. With the opportunistic time-sharing method, our opportunistic scheduling provides opportunistic resource sharing in three places in the system: user selection in a time-slot, path selection for the selected user, and time-slot sharing between base station and relay stations. Simulation results show that as the number of places that opportunistic resource sharing is applied to increases, the performance improvement also increases.",
author = "Kwon, {Jeong Ahn} and Jang-Won Lee",
year = "2010",
month = "1",
day = "1",
doi = "10.1587/transcom.E93.B.2097",
language = "English",
volume = "E93-B",
pages = "2097--2103",
journal = "IEICE Transactions on Communications",
issn = "0916-8516",
publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",
number = "8",

}

Opportunistic resource scheduling for a wireless network with relay stations. / Kwon, Jeong Ahn; Lee, Jang-Won.

In: IEICE Transactions on Communications, Vol. E93-B, No. 8, 01.01.2010, p. 2097-2103.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Opportunistic resource scheduling for a wireless network with relay stations

AU - Kwon, Jeong Ahn

AU - Lee, Jang-Won

PY - 2010/1/1

Y1 - 2010/1/1

N2 - In this paper, we study an opportunistic scheduling scheme for the TDMA wireless network with relay stations. We model the time-varying channel condition of a wireless link as a stochastic process. Based on this model, we formulate an optimization problem for the opportunistic scheduling scheme that maximizes the expected system throughput while satisfying the QoS constraint of each user. In the opportunistic scheduling scheme for the system without relay stations, each user has only one communication path between the base station and itself, and thus only user selection is considered. However, in our opportunistic scheduling scheme for the system with relay stations, since there may exist multiple paths between the base station and a user, not only user selection but also path selection for the scheduled user is considered. In addition, we also propose an opportunistic time-sharing method for time-slot sharing between base station and relay stations. With the opportunistic time-sharing method, our opportunistic scheduling provides opportunistic resource sharing in three places in the system: user selection in a time-slot, path selection for the selected user, and time-slot sharing between base station and relay stations. Simulation results show that as the number of places that opportunistic resource sharing is applied to increases, the performance improvement also increases.

AB - In this paper, we study an opportunistic scheduling scheme for the TDMA wireless network with relay stations. We model the time-varying channel condition of a wireless link as a stochastic process. Based on this model, we formulate an optimization problem for the opportunistic scheduling scheme that maximizes the expected system throughput while satisfying the QoS constraint of each user. In the opportunistic scheduling scheme for the system without relay stations, each user has only one communication path between the base station and itself, and thus only user selection is considered. However, in our opportunistic scheduling scheme for the system with relay stations, since there may exist multiple paths between the base station and a user, not only user selection but also path selection for the scheduled user is considered. In addition, we also propose an opportunistic time-sharing method for time-slot sharing between base station and relay stations. With the opportunistic time-sharing method, our opportunistic scheduling provides opportunistic resource sharing in three places in the system: user selection in a time-slot, path selection for the selected user, and time-slot sharing between base station and relay stations. Simulation results show that as the number of places that opportunistic resource sharing is applied to increases, the performance improvement also increases.

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

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

U2 - 10.1587/transcom.E93.B.2097

DO - 10.1587/transcom.E93.B.2097

M3 - Article

VL - E93-B

SP - 2097

EP - 2103

JO - IEICE Transactions on Communications

JF - IEICE Transactions on Communications

SN - 0916-8516

IS - 8

ER -