Throughput improvement and its tradeoff with the queuing delay in the diamond relay networks

Qing Wang, Pingyi Fan, Khaled Letaief

Research output: Contribution to journalArticle

5 Citations (Scopus)

Abstract

Diamond relay network model, as a basic transmission model, has recently been attracting considerable attention in wireless ad hoc networks. Node cooperation and opportunistic scheduling scheme are two important techniques to improve the performance in wireless scenarios. In the paper we consider such a problem how to efficiently combine opportunistic scheduling and cooperative modes for the Rayleigh fading scenario in the diamond relay network. To do so, we first compare the throughput of SRP (Spatial Reused Pattern) and AFP (Amplify Forwarding Pattern) in the half-duplex case with the assumption that channel side information is known to all and then come up with a new scheduling scheme. It will be verified that only switching between SRP and AFP simply does little help to obtain an expected improvement because SRP is always superior to AFP on average due to its efficient spatial reuse. To improve the throughput further, we put forward a new processing strategy in which buffers are employed at both relays in SRP mode. By efficiently utilizing the links with relatively higher gains, the throughput can be greatly improved at a cost of queuing delay. Furthermore, we shall quantitatively evaluate the queuing delay and the tradeoff between the throughput and the additional queuing delay. Finally, to realize our developed strategy and make sure it always run at stable status, we present two criteria and an algorithm on the selection and adjustment of the switching thresholds.

Original languageEnglish
Pages (from-to)1140-1158
Number of pages19
JournalWireless Communications and Mobile Computing
Volume10
Issue number8
DOIs
Publication statusPublished - Aug 2010
Externally publishedYes

Fingerprint

Diamonds
Throughput
Scheduling
Wireless ad hoc networks
Rayleigh fading
Processing
Costs

Keywords

  • Block Rayleigh fading
  • Cooperative
  • Diamond relay networks
  • Finite state channel
  • G/G/1 queue
  • Tradeoff

ASJC Scopus subject areas

  • Information Systems
  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Cite this

Throughput improvement and its tradeoff with the queuing delay in the diamond relay networks. / Wang, Qing; Fan, Pingyi; Letaief, Khaled.

In: Wireless Communications and Mobile Computing, Vol. 10, No. 8, 08.2010, p. 1140-1158.

Research output: Contribution to journalArticle

@article{d773c0ad7cc142548bef74aef32dfd35,
title = "Throughput improvement and its tradeoff with the queuing delay in the diamond relay networks",
abstract = "Diamond relay network model, as a basic transmission model, has recently been attracting considerable attention in wireless ad hoc networks. Node cooperation and opportunistic scheduling scheme are two important techniques to improve the performance in wireless scenarios. In the paper we consider such a problem how to efficiently combine opportunistic scheduling and cooperative modes for the Rayleigh fading scenario in the diamond relay network. To do so, we first compare the throughput of SRP (Spatial Reused Pattern) and AFP (Amplify Forwarding Pattern) in the half-duplex case with the assumption that channel side information is known to all and then come up with a new scheduling scheme. It will be verified that only switching between SRP and AFP simply does little help to obtain an expected improvement because SRP is always superior to AFP on average due to its efficient spatial reuse. To improve the throughput further, we put forward a new processing strategy in which buffers are employed at both relays in SRP mode. By efficiently utilizing the links with relatively higher gains, the throughput can be greatly improved at a cost of queuing delay. Furthermore, we shall quantitatively evaluate the queuing delay and the tradeoff between the throughput and the additional queuing delay. Finally, to realize our developed strategy and make sure it always run at stable status, we present two criteria and an algorithm on the selection and adjustment of the switching thresholds.",
keywords = "Block Rayleigh fading, Cooperative, Diamond relay networks, Finite state channel, G/G/1 queue, Tradeoff",
author = "Qing Wang and Pingyi Fan and Khaled Letaief",
year = "2010",
month = "8",
doi = "10.1002/wcm.830",
language = "English",
volume = "10",
pages = "1140--1158",
journal = "Wireless Communications and Mobile Computing",
issn = "1530-8669",
publisher = "John Wiley and Sons Ltd",
number = "8",

}

TY - JOUR

T1 - Throughput improvement and its tradeoff with the queuing delay in the diamond relay networks

AU - Wang, Qing

AU - Fan, Pingyi

AU - Letaief, Khaled

PY - 2010/8

Y1 - 2010/8

N2 - Diamond relay network model, as a basic transmission model, has recently been attracting considerable attention in wireless ad hoc networks. Node cooperation and opportunistic scheduling scheme are two important techniques to improve the performance in wireless scenarios. In the paper we consider such a problem how to efficiently combine opportunistic scheduling and cooperative modes for the Rayleigh fading scenario in the diamond relay network. To do so, we first compare the throughput of SRP (Spatial Reused Pattern) and AFP (Amplify Forwarding Pattern) in the half-duplex case with the assumption that channel side information is known to all and then come up with a new scheduling scheme. It will be verified that only switching between SRP and AFP simply does little help to obtain an expected improvement because SRP is always superior to AFP on average due to its efficient spatial reuse. To improve the throughput further, we put forward a new processing strategy in which buffers are employed at both relays in SRP mode. By efficiently utilizing the links with relatively higher gains, the throughput can be greatly improved at a cost of queuing delay. Furthermore, we shall quantitatively evaluate the queuing delay and the tradeoff between the throughput and the additional queuing delay. Finally, to realize our developed strategy and make sure it always run at stable status, we present two criteria and an algorithm on the selection and adjustment of the switching thresholds.

AB - Diamond relay network model, as a basic transmission model, has recently been attracting considerable attention in wireless ad hoc networks. Node cooperation and opportunistic scheduling scheme are two important techniques to improve the performance in wireless scenarios. In the paper we consider such a problem how to efficiently combine opportunistic scheduling and cooperative modes for the Rayleigh fading scenario in the diamond relay network. To do so, we first compare the throughput of SRP (Spatial Reused Pattern) and AFP (Amplify Forwarding Pattern) in the half-duplex case with the assumption that channel side information is known to all and then come up with a new scheduling scheme. It will be verified that only switching between SRP and AFP simply does little help to obtain an expected improvement because SRP is always superior to AFP on average due to its efficient spatial reuse. To improve the throughput further, we put forward a new processing strategy in which buffers are employed at both relays in SRP mode. By efficiently utilizing the links with relatively higher gains, the throughput can be greatly improved at a cost of queuing delay. Furthermore, we shall quantitatively evaluate the queuing delay and the tradeoff between the throughput and the additional queuing delay. Finally, to realize our developed strategy and make sure it always run at stable status, we present two criteria and an algorithm on the selection and adjustment of the switching thresholds.

KW - Block Rayleigh fading

KW - Cooperative

KW - Diamond relay networks

KW - Finite state channel

KW - G/G/1 queue

KW - Tradeoff

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

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

U2 - 10.1002/wcm.830

DO - 10.1002/wcm.830

M3 - Article

AN - SCOPUS:77958062924

VL - 10

SP - 1140

EP - 1158

JO - Wireless Communications and Mobile Computing

JF - Wireless Communications and Mobile Computing

SN - 1530-8669

IS - 8

ER -