A unified matching framework for multi-flow decode-and-forward cooperative networks

Bo Bob Bai, Wei Chen, Khaled Letaief, Zhigang Cao

Research output: Contribution to journalArticle

24 Citations (Scopus)

Abstract

Recent works have shown that cooperative diversity can be achieved by using relay selection (RS), distributed space-time coding (DSTC), and distributed beam-forming (DBF) in narrow-band decode-and-forward (DF) cooperative networks with one source-and-destination (s-d) pair. However, the joint resource allocation for broadband DF cooperative networks with multiple s-d flows has not received much attention yet. In this paper, a random hypergraph based unified matching framework is proposed, under which five feasible types of multi-flow DF cooperative networks will be considered. In each type, the maximum matching method will be applied to RS, DSTC, and DBF schemes so as to achieve the optimal channel allocation and relay selection with fairness assurance. By analyzing the properties of maximum matching, the outage probability of each s-d pair after resource allocation will be obtained. The results of diversity- multiplexing tradeoff will show that the proposed framework is capable of achieving the full frequency diversity and cooperative diversity for each s-d pair simultaneously, while the frequency multiplexing is equally shared. Based on the unified framework, the random rotation based parallel Hopcroft-Karp (Rsuperscript2PHK) algorithm will then be designed, which can work in each destination node independently, and shall enjoy a poly-logarithmic complexity O(log 2loN), where N is the number of channels and l o is a constant.

Original languageEnglish
Article number6136824
Pages (from-to)397-406
Number of pages10
JournalIEEE Journal on Selected Areas in Communications
Volume30
Issue number2
DOIs
Publication statusPublished - Feb 2012
Externally publishedYes

Fingerprint

Multiplexing
Resource allocation
Outages

Keywords

  • Decode-and-forward
  • Diversity-multiplexing tradeoff
  • Maximum matching
  • Multi-flow cooperative networks
  • Outage probability
  • Random hypergraph
  • Resource allocation

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Computer Networks and Communications

Cite this

A unified matching framework for multi-flow decode-and-forward cooperative networks. / Bai, Bo Bob; Chen, Wei; Letaief, Khaled; Cao, Zhigang.

In: IEEE Journal on Selected Areas in Communications, Vol. 30, No. 2, 6136824, 02.2012, p. 397-406.

Research output: Contribution to journalArticle

@article{ccf925a361d349d9a432ea978e5c32bf,
title = "A unified matching framework for multi-flow decode-and-forward cooperative networks",
abstract = "Recent works have shown that cooperative diversity can be achieved by using relay selection (RS), distributed space-time coding (DSTC), and distributed beam-forming (DBF) in narrow-band decode-and-forward (DF) cooperative networks with one source-and-destination (s-d) pair. However, the joint resource allocation for broadband DF cooperative networks with multiple s-d flows has not received much attention yet. In this paper, a random hypergraph based unified matching framework is proposed, under which five feasible types of multi-flow DF cooperative networks will be considered. In each type, the maximum matching method will be applied to RS, DSTC, and DBF schemes so as to achieve the optimal channel allocation and relay selection with fairness assurance. By analyzing the properties of maximum matching, the outage probability of each s-d pair after resource allocation will be obtained. The results of diversity- multiplexing tradeoff will show that the proposed framework is capable of achieving the full frequency diversity and cooperative diversity for each s-d pair simultaneously, while the frequency multiplexing is equally shared. Based on the unified framework, the random rotation based parallel Hopcroft-Karp (Rsuperscript2PHK) algorithm will then be designed, which can work in each destination node independently, and shall enjoy a poly-logarithmic complexity O(log 2loN), where N is the number of channels and l o is a constant.",
keywords = "Decode-and-forward, Diversity-multiplexing tradeoff, Maximum matching, Multi-flow cooperative networks, Outage probability, Random hypergraph, Resource allocation",
author = "Bai, {Bo Bob} and Wei Chen and Khaled Letaief and Zhigang Cao",
year = "2012",
month = "2",
doi = "10.1109/JSAC.2012.120219",
language = "English",
volume = "30",
pages = "397--406",
journal = "IEEE Journal on Selected Areas in Communications",
issn = "0733-8716",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "2",

}

TY - JOUR

T1 - A unified matching framework for multi-flow decode-and-forward cooperative networks

AU - Bai, Bo Bob

AU - Chen, Wei

AU - Letaief, Khaled

AU - Cao, Zhigang

PY - 2012/2

Y1 - 2012/2

N2 - Recent works have shown that cooperative diversity can be achieved by using relay selection (RS), distributed space-time coding (DSTC), and distributed beam-forming (DBF) in narrow-band decode-and-forward (DF) cooperative networks with one source-and-destination (s-d) pair. However, the joint resource allocation for broadband DF cooperative networks with multiple s-d flows has not received much attention yet. In this paper, a random hypergraph based unified matching framework is proposed, under which five feasible types of multi-flow DF cooperative networks will be considered. In each type, the maximum matching method will be applied to RS, DSTC, and DBF schemes so as to achieve the optimal channel allocation and relay selection with fairness assurance. By analyzing the properties of maximum matching, the outage probability of each s-d pair after resource allocation will be obtained. The results of diversity- multiplexing tradeoff will show that the proposed framework is capable of achieving the full frequency diversity and cooperative diversity for each s-d pair simultaneously, while the frequency multiplexing is equally shared. Based on the unified framework, the random rotation based parallel Hopcroft-Karp (Rsuperscript2PHK) algorithm will then be designed, which can work in each destination node independently, and shall enjoy a poly-logarithmic complexity O(log 2loN), where N is the number of channels and l o is a constant.

AB - Recent works have shown that cooperative diversity can be achieved by using relay selection (RS), distributed space-time coding (DSTC), and distributed beam-forming (DBF) in narrow-band decode-and-forward (DF) cooperative networks with one source-and-destination (s-d) pair. However, the joint resource allocation for broadband DF cooperative networks with multiple s-d flows has not received much attention yet. In this paper, a random hypergraph based unified matching framework is proposed, under which five feasible types of multi-flow DF cooperative networks will be considered. In each type, the maximum matching method will be applied to RS, DSTC, and DBF schemes so as to achieve the optimal channel allocation and relay selection with fairness assurance. By analyzing the properties of maximum matching, the outage probability of each s-d pair after resource allocation will be obtained. The results of diversity- multiplexing tradeoff will show that the proposed framework is capable of achieving the full frequency diversity and cooperative diversity for each s-d pair simultaneously, while the frequency multiplexing is equally shared. Based on the unified framework, the random rotation based parallel Hopcroft-Karp (Rsuperscript2PHK) algorithm will then be designed, which can work in each destination node independently, and shall enjoy a poly-logarithmic complexity O(log 2loN), where N is the number of channels and l o is a constant.

KW - Decode-and-forward

KW - Diversity-multiplexing tradeoff

KW - Maximum matching

KW - Multi-flow cooperative networks

KW - Outage probability

KW - Random hypergraph

KW - Resource allocation

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

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

U2 - 10.1109/JSAC.2012.120219

DO - 10.1109/JSAC.2012.120219

M3 - Article

VL - 30

SP - 397

EP - 406

JO - IEEE Journal on Selected Areas in Communications

JF - IEEE Journal on Selected Areas in Communications

SN - 0733-8716

IS - 2

M1 - 6136824

ER -