Multicast Scheduling for Relay-Based Heterogeneous Networks Using Rateless Codes

Chao Chen, Seung Jun Baek

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

We consider the multicast scheduling problem in the heterogeneous network using a half-duplex relay station (RS). Our goal is to minimize the delay of transmitting a block of packets to users over time-varying channels using rateless codes. Due to half-duplex operation, at each time slot, the RS can choose to either multicast a packet to the users, or fetch a packet from the macro base station. We formulate a fluid relaxation for the optimal decision problem, and reveal that the optimal policy has a threshold-based structure so as to exploit the opportunism of multicast channel: the RS should multicast only when the channel quality is sufficiently "high". We propose an online policy based on the relaxation which does not require the knowledge of channel distribution. When the channel distribution is symmetric across users, we provide a closed-form expression of the asymptotic performance of our policy. For two-user systems, we prove that our scheme is asymptotically optimal. When the users' channels are independent, we derive a performance bound based on water-filling rate allocation which approximates the optimal policy well. Simulation results show that our scheme performs close to theoretical bounds, under correlated as well as independent fading channels.

Original languageEnglish
Article number7887748
Pages (from-to)3142-3155
Number of pages14
JournalIEEE Transactions on Mobile Computing
Volume16
Issue number11
DOIs
Publication statusPublished - 2017 Nov 1

Fingerprint

Heterogeneous networks
Base stations
Fading channels
Macros
Scheduling
Fluids
Water

Keywords

  • asymptotic optimality
  • fluid approximation
  • opportunistic scheduling
  • rateless codes
  • Relay networks

ASJC Scopus subject areas

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

Cite this

Multicast Scheduling for Relay-Based Heterogeneous Networks Using Rateless Codes. / Chen, Chao; Baek, Seung Jun.

In: IEEE Transactions on Mobile Computing, Vol. 16, No. 11, 7887748, 01.11.2017, p. 3142-3155.

Research output: Contribution to journalArticle

@article{50c70fd667844f918216cbb723f1a113,
title = "Multicast Scheduling for Relay-Based Heterogeneous Networks Using Rateless Codes",
abstract = "We consider the multicast scheduling problem in the heterogeneous network using a half-duplex relay station (RS). Our goal is to minimize the delay of transmitting a block of packets to users over time-varying channels using rateless codes. Due to half-duplex operation, at each time slot, the RS can choose to either multicast a packet to the users, or fetch a packet from the macro base station. We formulate a fluid relaxation for the optimal decision problem, and reveal that the optimal policy has a threshold-based structure so as to exploit the opportunism of multicast channel: the RS should multicast only when the channel quality is sufficiently {"}high{"}. We propose an online policy based on the relaxation which does not require the knowledge of channel distribution. When the channel distribution is symmetric across users, we provide a closed-form expression of the asymptotic performance of our policy. For two-user systems, we prove that our scheme is asymptotically optimal. When the users' channels are independent, we derive a performance bound based on water-filling rate allocation which approximates the optimal policy well. Simulation results show that our scheme performs close to theoretical bounds, under correlated as well as independent fading channels.",
keywords = "asymptotic optimality, fluid approximation, opportunistic scheduling, rateless codes, Relay networks",
author = "Chao Chen and Baek, {Seung Jun}",
year = "2017",
month = "11",
day = "1",
doi = "10.1109/TMC.2017.2687928",
language = "English",
volume = "16",
pages = "3142--3155",
journal = "IEEE Transactions on Mobile Computing",
issn = "1536-1233",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "11",

}

TY - JOUR

T1 - Multicast Scheduling for Relay-Based Heterogeneous Networks Using Rateless Codes

AU - Chen, Chao

AU - Baek, Seung Jun

PY - 2017/11/1

Y1 - 2017/11/1

N2 - We consider the multicast scheduling problem in the heterogeneous network using a half-duplex relay station (RS). Our goal is to minimize the delay of transmitting a block of packets to users over time-varying channels using rateless codes. Due to half-duplex operation, at each time slot, the RS can choose to either multicast a packet to the users, or fetch a packet from the macro base station. We formulate a fluid relaxation for the optimal decision problem, and reveal that the optimal policy has a threshold-based structure so as to exploit the opportunism of multicast channel: the RS should multicast only when the channel quality is sufficiently "high". We propose an online policy based on the relaxation which does not require the knowledge of channel distribution. When the channel distribution is symmetric across users, we provide a closed-form expression of the asymptotic performance of our policy. For two-user systems, we prove that our scheme is asymptotically optimal. When the users' channels are independent, we derive a performance bound based on water-filling rate allocation which approximates the optimal policy well. Simulation results show that our scheme performs close to theoretical bounds, under correlated as well as independent fading channels.

AB - We consider the multicast scheduling problem in the heterogeneous network using a half-duplex relay station (RS). Our goal is to minimize the delay of transmitting a block of packets to users over time-varying channels using rateless codes. Due to half-duplex operation, at each time slot, the RS can choose to either multicast a packet to the users, or fetch a packet from the macro base station. We formulate a fluid relaxation for the optimal decision problem, and reveal that the optimal policy has a threshold-based structure so as to exploit the opportunism of multicast channel: the RS should multicast only when the channel quality is sufficiently "high". We propose an online policy based on the relaxation which does not require the knowledge of channel distribution. When the channel distribution is symmetric across users, we provide a closed-form expression of the asymptotic performance of our policy. For two-user systems, we prove that our scheme is asymptotically optimal. When the users' channels are independent, we derive a performance bound based on water-filling rate allocation which approximates the optimal policy well. Simulation results show that our scheme performs close to theoretical bounds, under correlated as well as independent fading channels.

KW - asymptotic optimality

KW - fluid approximation

KW - opportunistic scheduling

KW - rateless codes

KW - Relay networks

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

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

U2 - 10.1109/TMC.2017.2687928

DO - 10.1109/TMC.2017.2687928

M3 - Article

AN - SCOPUS:85032294068

VL - 16

SP - 3142

EP - 3155

JO - IEEE Transactions on Mobile Computing

JF - IEEE Transactions on Mobile Computing

SN - 1536-1233

IS - 11

M1 - 7887748

ER -