Joint opportunistic scheduling and network coding for bidirectional relay channel

Mohammad Shaqfeh, Ammar Zafar, Hussein Alnuweiri, Mohamed Slim Alouini

Research output: Chapter in Book/Report/Conference proceedingConference contribution

15 Citations (Scopus)

Abstract

In this paper, we consider a two-way communication system in which two users communicate with each other through an intermediate relay over block-fading channels. We investigate the optimal opportunistic scheduling scheme in order to maximize the long-term average transmission rate in the system assuming symmetric information flow between the two users. Based on the channel state information, the scheduler decides that either one of the users transmits to the relay, or the relay transmits to a single user or broadcasts to both users a combined version of the two users' transmitted information by using linear network coding. We obtain the optimal scheduling scheme by using the Lagrangian dual problem. Furthermore, in order to characterize the gains of network coding and opportunistic scheduling, we compare the achievable rate of the system versus suboptimal schemes in which the gains of network coding and opportunistic scheduling are partially exploited.

Original languageEnglish
Title of host publication2013 IEEE International Symposium on Information Theory, ISIT 2013
Pages1327-1331
Number of pages5
DOIs
Publication statusPublished - 2013
Event2013 IEEE International Symposium on Information Theory, ISIT 2013 - Istanbul, Turkey
Duration: 7 Jul 201312 Jul 2013

Other

Other2013 IEEE International Symposium on Information Theory, ISIT 2013
CountryTurkey
CityIstanbul
Period7/7/1312/7/13

Fingerprint

Opportunistic Scheduling
Relay Channel
Network coding
Network Coding
Scheduling
Relay
Optimal Scheduling
Linear networks
Channel state information
Fading channels
Communication systems
Channel State Information
Dual Problem
Information Flow
Fading Channels
Scheduler
Broadcast
Communication Systems
Maximise

Keywords

  • Bidirectional relay
  • block-fading
  • linear network coding
  • multi-user diversity
  • opportunistic scheduling

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Information Systems
  • Modelling and Simulation
  • Applied Mathematics

Cite this

Shaqfeh, M., Zafar, A., Alnuweiri, H., & Alouini, M. S. (2013). Joint opportunistic scheduling and network coding for bidirectional relay channel. In 2013 IEEE International Symposium on Information Theory, ISIT 2013 (pp. 1327-1331). [6620442] https://doi.org/10.1109/ISIT.2013.6620442

Joint opportunistic scheduling and network coding for bidirectional relay channel. / Shaqfeh, Mohammad; Zafar, Ammar; Alnuweiri, Hussein; Alouini, Mohamed Slim.

2013 IEEE International Symposium on Information Theory, ISIT 2013. 2013. p. 1327-1331 6620442.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Shaqfeh, M, Zafar, A, Alnuweiri, H & Alouini, MS 2013, Joint opportunistic scheduling and network coding for bidirectional relay channel. in 2013 IEEE International Symposium on Information Theory, ISIT 2013., 6620442, pp. 1327-1331, 2013 IEEE International Symposium on Information Theory, ISIT 2013, Istanbul, Turkey, 7/7/13. https://doi.org/10.1109/ISIT.2013.6620442
Shaqfeh M, Zafar A, Alnuweiri H, Alouini MS. Joint opportunistic scheduling and network coding for bidirectional relay channel. In 2013 IEEE International Symposium on Information Theory, ISIT 2013. 2013. p. 1327-1331. 6620442 https://doi.org/10.1109/ISIT.2013.6620442
Shaqfeh, Mohammad ; Zafar, Ammar ; Alnuweiri, Hussein ; Alouini, Mohamed Slim. / Joint opportunistic scheduling and network coding for bidirectional relay channel. 2013 IEEE International Symposium on Information Theory, ISIT 2013. 2013. pp. 1327-1331
@inproceedings{e3b9e612970f4039b5600f267835e6c9,
title = "Joint opportunistic scheduling and network coding for bidirectional relay channel",
abstract = "In this paper, we consider a two-way communication system in which two users communicate with each other through an intermediate relay over block-fading channels. We investigate the optimal opportunistic scheduling scheme in order to maximize the long-term average transmission rate in the system assuming symmetric information flow between the two users. Based on the channel state information, the scheduler decides that either one of the users transmits to the relay, or the relay transmits to a single user or broadcasts to both users a combined version of the two users' transmitted information by using linear network coding. We obtain the optimal scheduling scheme by using the Lagrangian dual problem. Furthermore, in order to characterize the gains of network coding and opportunistic scheduling, we compare the achievable rate of the system versus suboptimal schemes in which the gains of network coding and opportunistic scheduling are partially exploited.",
keywords = "Bidirectional relay, block-fading, linear network coding, multi-user diversity, opportunistic scheduling",
author = "Mohammad Shaqfeh and Ammar Zafar and Hussein Alnuweiri and Alouini, {Mohamed Slim}",
year = "2013",
doi = "10.1109/ISIT.2013.6620442",
language = "English",
isbn = "9781479904464",
pages = "1327--1331",
booktitle = "2013 IEEE International Symposium on Information Theory, ISIT 2013",

}

TY - GEN

T1 - Joint opportunistic scheduling and network coding for bidirectional relay channel

AU - Shaqfeh, Mohammad

AU - Zafar, Ammar

AU - Alnuweiri, Hussein

AU - Alouini, Mohamed Slim

PY - 2013

Y1 - 2013

N2 - In this paper, we consider a two-way communication system in which two users communicate with each other through an intermediate relay over block-fading channels. We investigate the optimal opportunistic scheduling scheme in order to maximize the long-term average transmission rate in the system assuming symmetric information flow between the two users. Based on the channel state information, the scheduler decides that either one of the users transmits to the relay, or the relay transmits to a single user or broadcasts to both users a combined version of the two users' transmitted information by using linear network coding. We obtain the optimal scheduling scheme by using the Lagrangian dual problem. Furthermore, in order to characterize the gains of network coding and opportunistic scheduling, we compare the achievable rate of the system versus suboptimal schemes in which the gains of network coding and opportunistic scheduling are partially exploited.

AB - In this paper, we consider a two-way communication system in which two users communicate with each other through an intermediate relay over block-fading channels. We investigate the optimal opportunistic scheduling scheme in order to maximize the long-term average transmission rate in the system assuming symmetric information flow between the two users. Based on the channel state information, the scheduler decides that either one of the users transmits to the relay, or the relay transmits to a single user or broadcasts to both users a combined version of the two users' transmitted information by using linear network coding. We obtain the optimal scheduling scheme by using the Lagrangian dual problem. Furthermore, in order to characterize the gains of network coding and opportunistic scheduling, we compare the achievable rate of the system versus suboptimal schemes in which the gains of network coding and opportunistic scheduling are partially exploited.

KW - Bidirectional relay

KW - block-fading

KW - linear network coding

KW - multi-user diversity

KW - opportunistic scheduling

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

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

U2 - 10.1109/ISIT.2013.6620442

DO - 10.1109/ISIT.2013.6620442

M3 - Conference contribution

AN - SCOPUS:84890344911

SN - 9781479904464

SP - 1327

EP - 1331

BT - 2013 IEEE International Symposium on Information Theory, ISIT 2013

ER -