Maximizing the effective capacity for wireless cooperative relay networks with QoS guarantees

Shaolei Ren, Khaled Letaief

Research output: Contribution to journalArticle

24 Citations (Scopus)

Abstract

In this paper, we propose a resource allocation scheme to increase the effective capacity subject to the queueoverflow statistical Quality-of-Service (QoS) requirement for a multi-relay cooperative wireless network. Firstly, we consider the block fading channels and derive an algorithm in which each relay is allocated a time slot of optimal length during the cooperation phase, based on the channel statistics. Our analysis indicates that when the QoS requirement is loose, only the relay with the best average channel condition should be selected for cooperation. On the other hand, when the QoS requirement becomes more stringent, more relays should participate in cooperation. The asymptotic case when either the transmit power or the number of relays goes to infinity is discussed, and we shall reveal a tradeoff between the transmit power and the number of relays, given a target effective capacity. By modeling the channel correlation by a two-state Markov model, we will develop two sub-optimal time-slot allocation algorithms which can substantially increase the effective capacity compared with the opportunistic and equal allocation schemes. Our results will show that the channel correlation can sharply decrease the effective capacity and that applying the optimal time-slot allocation result obtained in block fading channels directly to correlated fading channels is no longer optimal.

Original languageEnglish
Pages (from-to)2148-2159
Number of pages12
JournalIEEE Transactions on Communications
Volume57
Issue number7
DOIs
Publication statusPublished - 2009
Externally publishedYes

Fingerprint

Fading channels
Quality of service
Resource allocation
Wireless networks
Statistics

Keywords

  • Channel correlation
  • Cooperative relay networks
  • Effective capacity
  • Markov model
  • Quality-of-service
  • Time-slot allocation

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this

Maximizing the effective capacity for wireless cooperative relay networks with QoS guarantees. / Ren, Shaolei; Letaief, Khaled.

In: IEEE Transactions on Communications, Vol. 57, No. 7, 2009, p. 2148-2159.

Research output: Contribution to journalArticle

@article{7d37057eda5f45fa8d0b184bfa869686,
title = "Maximizing the effective capacity for wireless cooperative relay networks with QoS guarantees",
abstract = "In this paper, we propose a resource allocation scheme to increase the effective capacity subject to the queueoverflow statistical Quality-of-Service (QoS) requirement for a multi-relay cooperative wireless network. Firstly, we consider the block fading channels and derive an algorithm in which each relay is allocated a time slot of optimal length during the cooperation phase, based on the channel statistics. Our analysis indicates that when the QoS requirement is loose, only the relay with the best average channel condition should be selected for cooperation. On the other hand, when the QoS requirement becomes more stringent, more relays should participate in cooperation. The asymptotic case when either the transmit power or the number of relays goes to infinity is discussed, and we shall reveal a tradeoff between the transmit power and the number of relays, given a target effective capacity. By modeling the channel correlation by a two-state Markov model, we will develop two sub-optimal time-slot allocation algorithms which can substantially increase the effective capacity compared with the opportunistic and equal allocation schemes. Our results will show that the channel correlation can sharply decrease the effective capacity and that applying the optimal time-slot allocation result obtained in block fading channels directly to correlated fading channels is no longer optimal.",
keywords = "Channel correlation, Cooperative relay networks, Effective capacity, Markov model, Quality-of-service, Time-slot allocation",
author = "Shaolei Ren and Khaled Letaief",
year = "2009",
doi = "10.1109/TCOMM.2009.07.070585",
language = "English",
volume = "57",
pages = "2148--2159",
journal = "IEEE Transactions on Communications",
issn = "0096-1965",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "7",

}

TY - JOUR

T1 - Maximizing the effective capacity for wireless cooperative relay networks with QoS guarantees

AU - Ren, Shaolei

AU - Letaief, Khaled

PY - 2009

Y1 - 2009

N2 - In this paper, we propose a resource allocation scheme to increase the effective capacity subject to the queueoverflow statistical Quality-of-Service (QoS) requirement for a multi-relay cooperative wireless network. Firstly, we consider the block fading channels and derive an algorithm in which each relay is allocated a time slot of optimal length during the cooperation phase, based on the channel statistics. Our analysis indicates that when the QoS requirement is loose, only the relay with the best average channel condition should be selected for cooperation. On the other hand, when the QoS requirement becomes more stringent, more relays should participate in cooperation. The asymptotic case when either the transmit power or the number of relays goes to infinity is discussed, and we shall reveal a tradeoff between the transmit power and the number of relays, given a target effective capacity. By modeling the channel correlation by a two-state Markov model, we will develop two sub-optimal time-slot allocation algorithms which can substantially increase the effective capacity compared with the opportunistic and equal allocation schemes. Our results will show that the channel correlation can sharply decrease the effective capacity and that applying the optimal time-slot allocation result obtained in block fading channels directly to correlated fading channels is no longer optimal.

AB - In this paper, we propose a resource allocation scheme to increase the effective capacity subject to the queueoverflow statistical Quality-of-Service (QoS) requirement for a multi-relay cooperative wireless network. Firstly, we consider the block fading channels and derive an algorithm in which each relay is allocated a time slot of optimal length during the cooperation phase, based on the channel statistics. Our analysis indicates that when the QoS requirement is loose, only the relay with the best average channel condition should be selected for cooperation. On the other hand, when the QoS requirement becomes more stringent, more relays should participate in cooperation. The asymptotic case when either the transmit power or the number of relays goes to infinity is discussed, and we shall reveal a tradeoff between the transmit power and the number of relays, given a target effective capacity. By modeling the channel correlation by a two-state Markov model, we will develop two sub-optimal time-slot allocation algorithms which can substantially increase the effective capacity compared with the opportunistic and equal allocation schemes. Our results will show that the channel correlation can sharply decrease the effective capacity and that applying the optimal time-slot allocation result obtained in block fading channels directly to correlated fading channels is no longer optimal.

KW - Channel correlation

KW - Cooperative relay networks

KW - Effective capacity

KW - Markov model

KW - Quality-of-service

KW - Time-slot allocation

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

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

U2 - 10.1109/TCOMM.2009.07.070585

DO - 10.1109/TCOMM.2009.07.070585

M3 - Article

VL - 57

SP - 2148

EP - 2159

JO - IEEE Transactions on Communications

JF - IEEE Transactions on Communications

SN - 0096-1965

IS - 7

ER -