RBG matching based optimal relay selection and subchannel allocation

Bo Bai, Wei Chen, Khaled Letaief, Zhigang Cao

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Citations (Scopus)

Abstract

Relay selection has been shown to be a practical and effective way to achieve cooperative diversity. In wide-band OFDM cooperative communication systems with multiple source and destination nodes, however, the best relay selection and subchannel allocation has not been studied in a systematic way. In this paper, a random combinatorial optimization approach, referred to as the random bipartite graph based maximum matching (RBG matching), will be proposed to solve this problem. By applying the method of Euler beta function and generalized hypergeometric function, we will first derive a new closed-form outage probability for the best relay selection in the decode-andforward (DF) scheme. Based on this result and the properties of the maximum matching on RBG, the outage probability and diversity-multiplexing tradeoff of the proposed RBG matching method will also be derived. As a result, we will demonstrate that the outage probability and the cooperative and frequency diversity-multiplexing tradeoff of the RBG matching method for cooperative communication systems with multiple source-destination pairs is the same as that of relay systems with only one source and one destination. Besides, the proposed algorithm for maximum matching also enjoys a sublinear computation complexity O(N2/3), where N is the number of subchannels. Simulation results will illustrate the potential of the proposed RBG matching method, and also verify the theoretical derivations.

Original languageEnglish
Title of host publication2011 IEEE International Conference on Communications, ICC 2011
DOIs
Publication statusPublished - 2011
Externally publishedYes
Event2011 IEEE International Conference on Communications, ICC 2011 - Kyoto, Japan
Duration: 5 Jun 20119 Jun 2011

Other

Other2011 IEEE International Conference on Communications, ICC 2011
CountryJapan
CityKyoto
Period5/6/119/6/11

Fingerprint

Outages
Cooperative communication
Multiplexing
Communication systems
Combinatorial optimization
Orthogonal frequency division multiplexing

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Computer Networks and Communications

Cite this

Bai, B., Chen, W., Letaief, K., & Cao, Z. (2011). RBG matching based optimal relay selection and subchannel allocation. In 2011 IEEE International Conference on Communications, ICC 2011 [5963313] https://doi.org/10.1109/icc.2011.5963313

RBG matching based optimal relay selection and subchannel allocation. / Bai, Bo; Chen, Wei; Letaief, Khaled; Cao, Zhigang.

2011 IEEE International Conference on Communications, ICC 2011. 2011. 5963313.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Bai, B, Chen, W, Letaief, K & Cao, Z 2011, RBG matching based optimal relay selection and subchannel allocation. in 2011 IEEE International Conference on Communications, ICC 2011., 5963313, 2011 IEEE International Conference on Communications, ICC 2011, Kyoto, Japan, 5/6/11. https://doi.org/10.1109/icc.2011.5963313
Bai B, Chen W, Letaief K, Cao Z. RBG matching based optimal relay selection and subchannel allocation. In 2011 IEEE International Conference on Communications, ICC 2011. 2011. 5963313 https://doi.org/10.1109/icc.2011.5963313
Bai, Bo ; Chen, Wei ; Letaief, Khaled ; Cao, Zhigang. / RBG matching based optimal relay selection and subchannel allocation. 2011 IEEE International Conference on Communications, ICC 2011. 2011.
@inproceedings{0ae9bf85577a48a48aeae66702f9ca02,
title = "RBG matching based optimal relay selection and subchannel allocation",
abstract = "Relay selection has been shown to be a practical and effective way to achieve cooperative diversity. In wide-band OFDM cooperative communication systems with multiple source and destination nodes, however, the best relay selection and subchannel allocation has not been studied in a systematic way. In this paper, a random combinatorial optimization approach, referred to as the random bipartite graph based maximum matching (RBG matching), will be proposed to solve this problem. By applying the method of Euler beta function and generalized hypergeometric function, we will first derive a new closed-form outage probability for the best relay selection in the decode-andforward (DF) scheme. Based on this result and the properties of the maximum matching on RBG, the outage probability and diversity-multiplexing tradeoff of the proposed RBG matching method will also be derived. As a result, we will demonstrate that the outage probability and the cooperative and frequency diversity-multiplexing tradeoff of the RBG matching method for cooperative communication systems with multiple source-destination pairs is the same as that of relay systems with only one source and one destination. Besides, the proposed algorithm for maximum matching also enjoys a sublinear computation complexity O(N2/3), where N is the number of subchannels. Simulation results will illustrate the potential of the proposed RBG matching method, and also verify the theoretical derivations.",
author = "Bo Bai and Wei Chen and Khaled Letaief and Zhigang Cao",
year = "2011",
doi = "10.1109/icc.2011.5963313",
language = "English",
isbn = "9781612842332",
booktitle = "2011 IEEE International Conference on Communications, ICC 2011",

}

TY - GEN

T1 - RBG matching based optimal relay selection and subchannel allocation

AU - Bai, Bo

AU - Chen, Wei

AU - Letaief, Khaled

AU - Cao, Zhigang

PY - 2011

Y1 - 2011

N2 - Relay selection has been shown to be a practical and effective way to achieve cooperative diversity. In wide-band OFDM cooperative communication systems with multiple source and destination nodes, however, the best relay selection and subchannel allocation has not been studied in a systematic way. In this paper, a random combinatorial optimization approach, referred to as the random bipartite graph based maximum matching (RBG matching), will be proposed to solve this problem. By applying the method of Euler beta function and generalized hypergeometric function, we will first derive a new closed-form outage probability for the best relay selection in the decode-andforward (DF) scheme. Based on this result and the properties of the maximum matching on RBG, the outage probability and diversity-multiplexing tradeoff of the proposed RBG matching method will also be derived. As a result, we will demonstrate that the outage probability and the cooperative and frequency diversity-multiplexing tradeoff of the RBG matching method for cooperative communication systems with multiple source-destination pairs is the same as that of relay systems with only one source and one destination. Besides, the proposed algorithm for maximum matching also enjoys a sublinear computation complexity O(N2/3), where N is the number of subchannels. Simulation results will illustrate the potential of the proposed RBG matching method, and also verify the theoretical derivations.

AB - Relay selection has been shown to be a practical and effective way to achieve cooperative diversity. In wide-band OFDM cooperative communication systems with multiple source and destination nodes, however, the best relay selection and subchannel allocation has not been studied in a systematic way. In this paper, a random combinatorial optimization approach, referred to as the random bipartite graph based maximum matching (RBG matching), will be proposed to solve this problem. By applying the method of Euler beta function and generalized hypergeometric function, we will first derive a new closed-form outage probability for the best relay selection in the decode-andforward (DF) scheme. Based on this result and the properties of the maximum matching on RBG, the outage probability and diversity-multiplexing tradeoff of the proposed RBG matching method will also be derived. As a result, we will demonstrate that the outage probability and the cooperative and frequency diversity-multiplexing tradeoff of the RBG matching method for cooperative communication systems with multiple source-destination pairs is the same as that of relay systems with only one source and one destination. Besides, the proposed algorithm for maximum matching also enjoys a sublinear computation complexity O(N2/3), where N is the number of subchannels. Simulation results will illustrate the potential of the proposed RBG matching method, and also verify the theoretical derivations.

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

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

U2 - 10.1109/icc.2011.5963313

DO - 10.1109/icc.2011.5963313

M3 - Conference contribution

SN - 9781612842332

BT - 2011 IEEE International Conference on Communications, ICC 2011

ER -