Performance of greedy policies for downlink scheduling in networks with relay stations

Seung Jun Baek, JaeSheung Shin

Research output: Contribution to journalArticle

Abstract

We investigate a greedy policy for delay-optimal scheduling in broadband wireless networks using relay stations (RS). The key idea behind the policy is that users should greedily exploit opportunism from time varying channels, while the basestation should prioritize balancing queues at RS. A fluid model is presented to show that such policy is optimal in the fluid regime. By simulation we show that the proposed scheme reduces mean delay by up to 73% compared to backpressure algorithm.

Original languageEnglish
Pages (from-to)175-181
Number of pages7
JournalIEICE Electronics Express
Volume8
Issue number3
DOIs
Publication statusPublished - 2011 Feb 10

Fingerprint

scheduling
relay
stations
Scheduling
Fluids
Wireless networks
fluids
broadband
simulation

Keywords

  • Heterogeneous networks
  • Optimization
  • Relay station
  • Scheduling

ASJC Scopus subject areas

  • Electronic, Optical and Magnetic Materials
  • Condensed Matter Physics
  • Electrical and Electronic Engineering

Cite this

Performance of greedy policies for downlink scheduling in networks with relay stations. / Baek, Seung Jun; Shin, JaeSheung.

In: IEICE Electronics Express, Vol. 8, No. 3, 10.02.2011, p. 175-181.

Research output: Contribution to journalArticle

@article{97af7e50717d4c7ba68fbdb35fc614b0,
title = "Performance of greedy policies for downlink scheduling in networks with relay stations",
abstract = "We investigate a greedy policy for delay-optimal scheduling in broadband wireless networks using relay stations (RS). The key idea behind the policy is that users should greedily exploit opportunism from time varying channels, while the basestation should prioritize balancing queues at RS. A fluid model is presented to show that such policy is optimal in the fluid regime. By simulation we show that the proposed scheme reduces mean delay by up to 73{\%} compared to backpressure algorithm.",
keywords = "Heterogeneous networks, Optimization, Relay station, Scheduling",
author = "Baek, {Seung Jun} and JaeSheung Shin",
year = "2011",
month = "2",
day = "10",
doi = "10.1587/elex.8.175",
language = "English",
volume = "8",
pages = "175--181",
journal = "IEICE Electronics Express",
issn = "1349-2543",
publisher = "The Institute of Electronics, Information and Communication Engineers (IEICE)",
number = "3",

}

TY - JOUR

T1 - Performance of greedy policies for downlink scheduling in networks with relay stations

AU - Baek, Seung Jun

AU - Shin, JaeSheung

PY - 2011/2/10

Y1 - 2011/2/10

N2 - We investigate a greedy policy for delay-optimal scheduling in broadband wireless networks using relay stations (RS). The key idea behind the policy is that users should greedily exploit opportunism from time varying channels, while the basestation should prioritize balancing queues at RS. A fluid model is presented to show that such policy is optimal in the fluid regime. By simulation we show that the proposed scheme reduces mean delay by up to 73% compared to backpressure algorithm.

AB - We investigate a greedy policy for delay-optimal scheduling in broadband wireless networks using relay stations (RS). The key idea behind the policy is that users should greedily exploit opportunism from time varying channels, while the basestation should prioritize balancing queues at RS. A fluid model is presented to show that such policy is optimal in the fluid regime. By simulation we show that the proposed scheme reduces mean delay by up to 73% compared to backpressure algorithm.

KW - Heterogeneous networks

KW - Optimization

KW - Relay station

KW - Scheduling

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

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

U2 - 10.1587/elex.8.175

DO - 10.1587/elex.8.175

M3 - Article

AN - SCOPUS:79951470181

VL - 8

SP - 175

EP - 181

JO - IEICE Electronics Express

JF - IEICE Electronics Express

SN - 1349-2543

IS - 3

ER -