Scheduling for dual-hop block-fading channels with two source-user pairs sharing one relay

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

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

3 Citations (Scopus)

Abstract

In this paper, we maximize the achievable rate region of a dual-hop network with two sources serving two users independently through a single shared relay. We formulate the problem as maximizing the sum of the weighted long term average throughputs of the two users under stability constraints on the long term throughputs of the source-user pairs. In order to solve the problem, we propose a joint user-and-hop scheduling scheme, which schedules the first or second hop opportunistically based on instantaneous channel state information, in order to exploit multiuser diversity and multihop diversity gains. Numerical results show that the proposed joint scheduling scheme enhances the achievable rate region as compared to a scheme that employs multi-user scheduling on the second-hop alone.

Original languageEnglish
Title of host publication2013 IEEE 78th Vehicular Technology Conference, VTC Fall 2013
DOIs
Publication statusPublished - 2013
Event2013 IEEE 78th Vehicular Technology Conference, VTC Fall 2013 - Las Vegas, NV, United States
Duration: 2 Sep 20135 Sep 2013

Other

Other2013 IEEE 78th Vehicular Technology Conference, VTC Fall 2013
CountryUnited States
CityLas Vegas, NV
Period2/9/135/9/13

Fingerprint

Fading Channels
Fading channels
Relay
Sharing
Scheduling
Throughput
Channel state information
Multiuser Diversity
Diversity Gain
Channel State Information
Multi-hop
Term
Instantaneous
Schedule
Maximise
Numerical Results

Keywords

  • Dual-hop
  • Joint scheduling
  • Multi-hop diversity
  • Multi-user diversity
  • Shared relay

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Computer Science Applications
  • Applied Mathematics

Cite this

Zafar, A., Shaqfeh, M., Alouini, M. S., & Alnuweiri, H. (2013). Scheduling for dual-hop block-fading channels with two source-user pairs sharing one relay. In 2013 IEEE 78th Vehicular Technology Conference, VTC Fall 2013 [6692401] https://doi.org/10.1109/VTCFall.2013.6692401

Scheduling for dual-hop block-fading channels with two source-user pairs sharing one relay. / Zafar, Ammar; Shaqfeh, Mohammad; Alouini, Mohamed Slim; Alnuweiri, Hussein.

2013 IEEE 78th Vehicular Technology Conference, VTC Fall 2013. 2013. 6692401.

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

Zafar, A, Shaqfeh, M, Alouini, MS & Alnuweiri, H 2013, Scheduling for dual-hop block-fading channels with two source-user pairs sharing one relay. in 2013 IEEE 78th Vehicular Technology Conference, VTC Fall 2013., 6692401, 2013 IEEE 78th Vehicular Technology Conference, VTC Fall 2013, Las Vegas, NV, United States, 2/9/13. https://doi.org/10.1109/VTCFall.2013.6692401
Zafar, Ammar ; Shaqfeh, Mohammad ; Alouini, Mohamed Slim ; Alnuweiri, Hussein. / Scheduling for dual-hop block-fading channels with two source-user pairs sharing one relay. 2013 IEEE 78th Vehicular Technology Conference, VTC Fall 2013. 2013.
@inproceedings{5ad14ba2e09c4e3e8907a578b6f2341d,
title = "Scheduling for dual-hop block-fading channels with two source-user pairs sharing one relay",
abstract = "In this paper, we maximize the achievable rate region of a dual-hop network with two sources serving two users independently through a single shared relay. We formulate the problem as maximizing the sum of the weighted long term average throughputs of the two users under stability constraints on the long term throughputs of the source-user pairs. In order to solve the problem, we propose a joint user-and-hop scheduling scheme, which schedules the first or second hop opportunistically based on instantaneous channel state information, in order to exploit multiuser diversity and multihop diversity gains. Numerical results show that the proposed joint scheduling scheme enhances the achievable rate region as compared to a scheme that employs multi-user scheduling on the second-hop alone.",
keywords = "Dual-hop, Joint scheduling, Multi-hop diversity, Multi-user diversity, Shared relay",
author = "Ammar Zafar and Mohammad Shaqfeh and Alouini, {Mohamed Slim} and Hussein Alnuweiri",
year = "2013",
doi = "10.1109/VTCFall.2013.6692401",
language = "English",
isbn = "9781467361873",
booktitle = "2013 IEEE 78th Vehicular Technology Conference, VTC Fall 2013",

}

TY - GEN

T1 - Scheduling for dual-hop block-fading channels with two source-user pairs sharing one relay

AU - Zafar, Ammar

AU - Shaqfeh, Mohammad

AU - Alouini, Mohamed Slim

AU - Alnuweiri, Hussein

PY - 2013

Y1 - 2013

N2 - In this paper, we maximize the achievable rate region of a dual-hop network with two sources serving two users independently through a single shared relay. We formulate the problem as maximizing the sum of the weighted long term average throughputs of the two users under stability constraints on the long term throughputs of the source-user pairs. In order to solve the problem, we propose a joint user-and-hop scheduling scheme, which schedules the first or second hop opportunistically based on instantaneous channel state information, in order to exploit multiuser diversity and multihop diversity gains. Numerical results show that the proposed joint scheduling scheme enhances the achievable rate region as compared to a scheme that employs multi-user scheduling on the second-hop alone.

AB - In this paper, we maximize the achievable rate region of a dual-hop network with two sources serving two users independently through a single shared relay. We formulate the problem as maximizing the sum of the weighted long term average throughputs of the two users under stability constraints on the long term throughputs of the source-user pairs. In order to solve the problem, we propose a joint user-and-hop scheduling scheme, which schedules the first or second hop opportunistically based on instantaneous channel state information, in order to exploit multiuser diversity and multihop diversity gains. Numerical results show that the proposed joint scheduling scheme enhances the achievable rate region as compared to a scheme that employs multi-user scheduling on the second-hop alone.

KW - Dual-hop

KW - Joint scheduling

KW - Multi-hop diversity

KW - Multi-user diversity

KW - Shared relay

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

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

U2 - 10.1109/VTCFall.2013.6692401

DO - 10.1109/VTCFall.2013.6692401

M3 - Conference contribution

SN - 9781467361873

BT - 2013 IEEE 78th Vehicular Technology Conference, VTC Fall 2013

ER -