Performance analysis of relay assignment schemes for cooperative networks with multiple source-destination pairs

Xuehua Zhang, Mazen Hasna, Ali Ghrayeb

Research output: Contribution to journalArticle

21 Citations (Scopus)

Abstract

In this paper, we consider two relay assignment schemes for cooperative networks comprising multiple source-destination pairs. Both schemes are based on the max-min criterion and aim at achieving the maximum spatial diversity for all pairs. One scheme is used as a performance benchmark since it considers all possible relay assignment permutations and selects the best one. The other scheme, on the other hand, considers only a subset of those permutations and selects the best one. The advantages of the latter one is that it reduces the complexity of the assignment process, in addition to making the performance analysis tractable. We examine these schemes over asymmetric channels using M-ary phase shift keying signaling. We consider both amplify-and-forward (AF) and decode-and-forward (DF) relaying where we derive expressions for the end-to-end (E2E) symbol error rate (SER). In both cases, we show that the full spatial diversity is achieved. To account for error propagation in DF relaying, we adopt a threshold-based relaying scheme whereby the relays forward only bits that are deemed reliable and remain silent otherwise. We compare this scheme to Genie-aided relaying where the relays forward only correctly decoded bits. We analyze these two schemes and derive expressions for the E2E SER performance. We present several numerical examples that validate the analytical results.

Original languageEnglish
Article number6092793
Pages (from-to)166-177
Number of pages12
JournalIEEE Transactions on Wireless Communications
Volume11
Issue number1
DOIs
Publication statusPublished - Jan 2012
Externally publishedYes

Fingerprint

Cooperative Networks
Relay
Performance Analysis
Assignment
Phase shift keying
Spatial Diversity
Symbol Error Rate
Decode-and-forward
Permutation
Asymmetric Channel
Error Propagation
Amplify-and-forward
Min-max
Phase Shift
Benchmark
Numerical Examples
Subset

Keywords

  • Amplify-and-forward
  • cooperative communication
  • decode-and-forward
  • error propagation
  • relay assignment

ASJC Scopus subject areas

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

Cite this

Performance analysis of relay assignment schemes for cooperative networks with multiple source-destination pairs. / Zhang, Xuehua; Hasna, Mazen; Ghrayeb, Ali.

In: IEEE Transactions on Wireless Communications, Vol. 11, No. 1, 6092793, 01.2012, p. 166-177.

Research output: Contribution to journalArticle

@article{46a20fc5c21b4ff2af73ab00019481ab,
title = "Performance analysis of relay assignment schemes for cooperative networks with multiple source-destination pairs",
abstract = "In this paper, we consider two relay assignment schemes for cooperative networks comprising multiple source-destination pairs. Both schemes are based on the max-min criterion and aim at achieving the maximum spatial diversity for all pairs. One scheme is used as a performance benchmark since it considers all possible relay assignment permutations and selects the best one. The other scheme, on the other hand, considers only a subset of those permutations and selects the best one. The advantages of the latter one is that it reduces the complexity of the assignment process, in addition to making the performance analysis tractable. We examine these schemes over asymmetric channels using M-ary phase shift keying signaling. We consider both amplify-and-forward (AF) and decode-and-forward (DF) relaying where we derive expressions for the end-to-end (E2E) symbol error rate (SER). In both cases, we show that the full spatial diversity is achieved. To account for error propagation in DF relaying, we adopt a threshold-based relaying scheme whereby the relays forward only bits that are deemed reliable and remain silent otherwise. We compare this scheme to Genie-aided relaying where the relays forward only correctly decoded bits. We analyze these two schemes and derive expressions for the E2E SER performance. We present several numerical examples that validate the analytical results.",
keywords = "Amplify-and-forward, cooperative communication, decode-and-forward, error propagation, relay assignment",
author = "Xuehua Zhang and Mazen Hasna and Ali Ghrayeb",
year = "2012",
month = "1",
doi = "10.1109/TWC.2011.111211.101972",
language = "English",
volume = "11",
pages = "166--177",
journal = "IEEE Transactions on Wireless Communications",
issn = "1536-1276",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "1",

}

TY - JOUR

T1 - Performance analysis of relay assignment schemes for cooperative networks with multiple source-destination pairs

AU - Zhang, Xuehua

AU - Hasna, Mazen

AU - Ghrayeb, Ali

PY - 2012/1

Y1 - 2012/1

N2 - In this paper, we consider two relay assignment schemes for cooperative networks comprising multiple source-destination pairs. Both schemes are based on the max-min criterion and aim at achieving the maximum spatial diversity for all pairs. One scheme is used as a performance benchmark since it considers all possible relay assignment permutations and selects the best one. The other scheme, on the other hand, considers only a subset of those permutations and selects the best one. The advantages of the latter one is that it reduces the complexity of the assignment process, in addition to making the performance analysis tractable. We examine these schemes over asymmetric channels using M-ary phase shift keying signaling. We consider both amplify-and-forward (AF) and decode-and-forward (DF) relaying where we derive expressions for the end-to-end (E2E) symbol error rate (SER). In both cases, we show that the full spatial diversity is achieved. To account for error propagation in DF relaying, we adopt a threshold-based relaying scheme whereby the relays forward only bits that are deemed reliable and remain silent otherwise. We compare this scheme to Genie-aided relaying where the relays forward only correctly decoded bits. We analyze these two schemes and derive expressions for the E2E SER performance. We present several numerical examples that validate the analytical results.

AB - In this paper, we consider two relay assignment schemes for cooperative networks comprising multiple source-destination pairs. Both schemes are based on the max-min criterion and aim at achieving the maximum spatial diversity for all pairs. One scheme is used as a performance benchmark since it considers all possible relay assignment permutations and selects the best one. The other scheme, on the other hand, considers only a subset of those permutations and selects the best one. The advantages of the latter one is that it reduces the complexity of the assignment process, in addition to making the performance analysis tractable. We examine these schemes over asymmetric channels using M-ary phase shift keying signaling. We consider both amplify-and-forward (AF) and decode-and-forward (DF) relaying where we derive expressions for the end-to-end (E2E) symbol error rate (SER). In both cases, we show that the full spatial diversity is achieved. To account for error propagation in DF relaying, we adopt a threshold-based relaying scheme whereby the relays forward only bits that are deemed reliable and remain silent otherwise. We compare this scheme to Genie-aided relaying where the relays forward only correctly decoded bits. We analyze these two schemes and derive expressions for the E2E SER performance. We present several numerical examples that validate the analytical results.

KW - Amplify-and-forward

KW - cooperative communication

KW - decode-and-forward

KW - error propagation

KW - relay assignment

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

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

U2 - 10.1109/TWC.2011.111211.101972

DO - 10.1109/TWC.2011.111211.101972

M3 - Article

VL - 11

SP - 166

EP - 177

JO - IEEE Transactions on Wireless Communications

JF - IEEE Transactions on Wireless Communications

SN - 1536-1276

IS - 1

M1 - 6092793

ER -