On relay assignment in network-coded cooperative systems

Xuehua Zhang, Ali Ghrayeb, Mazen Hasna

Research output: Contribution to journalArticle

26 Citations (Scopus)

Abstract

We consider in this paper relay assignment for cooperative systems with multiple two-way relay channels. The nodes corresponding to one two-way relay channel (henceforth referred to as pair) communicate with each other through a relay. The relays use network coding to simultaneously transmit the signals corresponding to the pairs they are assigned to. We propose two relay assignment schemes. One scheme considers all possible relay assignment permutations and selects the one that yields the best performance, and the other one considers only a subset of these permutations and selects the best one. The advantage of the latter is that it results in a significant reduction in computational complexity, in addition to making the analysis more tractable. We analyze the performance of these schemes over asymmetric independent Rayleigh fading channels. We also consider semi-symmetric and symmetric channels as special cases. We derive closed-form expressions for the end-to-end bit error rate performance for all scenarios and show that the full diversity order is achieved, which is the number of available relays. We present several examples to verify the theoretical results.

Original languageEnglish
Article number5699834
Pages (from-to)868-876
Number of pages9
JournalIEEE Transactions on Wireless Communications
Volume10
Issue number3
DOIs
Publication statusPublished - Mar 2011
Externally publishedYes

Fingerprint

Cooperative Systems
Network coding
Rayleigh fading
Fading channels
Bit error rate
Relay
Computational complexity
Assignment
Relay Channel
Permutation
Rayleigh Fading Channel
Network Coding
Error Rate
Computational Complexity
Closed-form
Verify
Scenarios
Subset
Vertex of a graph

Keywords

  • Cooperative networks
  • network coding
  • relay assignment
  • two-way relay channels

ASJC Scopus subject areas

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

Cite this

On relay assignment in network-coded cooperative systems. / Zhang, Xuehua; Ghrayeb, Ali; Hasna, Mazen.

In: IEEE Transactions on Wireless Communications, Vol. 10, No. 3, 5699834, 03.2011, p. 868-876.

Research output: Contribution to journalArticle

@article{652d113e880a4f17ae95873db3c05dfa,
title = "On relay assignment in network-coded cooperative systems",
abstract = "We consider in this paper relay assignment for cooperative systems with multiple two-way relay channels. The nodes corresponding to one two-way relay channel (henceforth referred to as pair) communicate with each other through a relay. The relays use network coding to simultaneously transmit the signals corresponding to the pairs they are assigned to. We propose two relay assignment schemes. One scheme considers all possible relay assignment permutations and selects the one that yields the best performance, and the other one considers only a subset of these permutations and selects the best one. The advantage of the latter is that it results in a significant reduction in computational complexity, in addition to making the analysis more tractable. We analyze the performance of these schemes over asymmetric independent Rayleigh fading channels. We also consider semi-symmetric and symmetric channels as special cases. We derive closed-form expressions for the end-to-end bit error rate performance for all scenarios and show that the full diversity order is achieved, which is the number of available relays. We present several examples to verify the theoretical results.",
keywords = "Cooperative networks, network coding, relay assignment, two-way relay channels",
author = "Xuehua Zhang and Ali Ghrayeb and Mazen Hasna",
year = "2011",
month = "3",
doi = "10.1109/TWC.2010.011811.100302",
language = "English",
volume = "10",
pages = "868--876",
journal = "IEEE Transactions on Wireless Communications",
issn = "1536-1276",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "3",

}

TY - JOUR

T1 - On relay assignment in network-coded cooperative systems

AU - Zhang, Xuehua

AU - Ghrayeb, Ali

AU - Hasna, Mazen

PY - 2011/3

Y1 - 2011/3

N2 - We consider in this paper relay assignment for cooperative systems with multiple two-way relay channels. The nodes corresponding to one two-way relay channel (henceforth referred to as pair) communicate with each other through a relay. The relays use network coding to simultaneously transmit the signals corresponding to the pairs they are assigned to. We propose two relay assignment schemes. One scheme considers all possible relay assignment permutations and selects the one that yields the best performance, and the other one considers only a subset of these permutations and selects the best one. The advantage of the latter is that it results in a significant reduction in computational complexity, in addition to making the analysis more tractable. We analyze the performance of these schemes over asymmetric independent Rayleigh fading channels. We also consider semi-symmetric and symmetric channels as special cases. We derive closed-form expressions for the end-to-end bit error rate performance for all scenarios and show that the full diversity order is achieved, which is the number of available relays. We present several examples to verify the theoretical results.

AB - We consider in this paper relay assignment for cooperative systems with multiple two-way relay channels. The nodes corresponding to one two-way relay channel (henceforth referred to as pair) communicate with each other through a relay. The relays use network coding to simultaneously transmit the signals corresponding to the pairs they are assigned to. We propose two relay assignment schemes. One scheme considers all possible relay assignment permutations and selects the one that yields the best performance, and the other one considers only a subset of these permutations and selects the best one. The advantage of the latter is that it results in a significant reduction in computational complexity, in addition to making the analysis more tractable. We analyze the performance of these schemes over asymmetric independent Rayleigh fading channels. We also consider semi-symmetric and symmetric channels as special cases. We derive closed-form expressions for the end-to-end bit error rate performance for all scenarios and show that the full diversity order is achieved, which is the number of available relays. We present several examples to verify the theoretical results.

KW - Cooperative networks

KW - network coding

KW - relay assignment

KW - two-way relay channels

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

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

U2 - 10.1109/TWC.2010.011811.100302

DO - 10.1109/TWC.2010.011811.100302

M3 - Article

AN - SCOPUS:79952985303

VL - 10

SP - 868

EP - 876

JO - IEEE Transactions on Wireless Communications

JF - IEEE Transactions on Wireless Communications

SN - 1536-1276

IS - 3

M1 - 5699834

ER -