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

Seung Jun Baek, Jae Sheung 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

Keywords

  • Heterogeneous networks
  • Optimization
  • Relay station
  • Scheduling

ASJC Scopus subject areas

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

Fingerprint Dive into the research topics of 'Performance of greedy policies for downlink scheduling in networks with relay stations'. Together they form a unique fingerprint.

  • Cite this