Joint relay selection and subchannel allocation for amplify-and-forward OFDMA cooperative networks

Bo Bai, Wei Chen, Khaled Letaief, Zhigang Cao

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

6 Citations (Scopus)

Abstract

In this paper, a random combinatorial optimization approach, which we shall refer to as random bipartite graph (RBG) based maximum matching, will be proposed to investigate and solve the joint relay selection and subchannel allocation problem in cooperative networks. By studying the properties of the maximum matching on RBG, the outage probability and diversity-multiplexing tradeoff of the proposed RBG matching method will be obtained. It will then be demonstrated that the outage probability and 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, i.e., d(r) = N (K + 1)(1 - 2r), where N is the number of subchannels, and K is the number of relay nodes. In addition, it will be shown that the proposed algorithm for maximum matching enjoys a sublinear computation complexity O(N2/3). Simulation results will illustrate the potential of the proposed RBG matching method as well as verify the theoretical derivations.

Original languageEnglish
Title of host publication2012 IEEE International Conference on Communications, ICC 2012
Pages4192-4196
Number of pages5
DOIs
Publication statusPublished - 2012
Externally publishedYes
Event2012 IEEE International Conference on Communications, ICC 2012 - Ottawa, ON, Canada
Duration: 10 Jun 201215 Jun 2012

Other

Other2012 IEEE International Conference on Communications, ICC 2012
CountryCanada
CityOttawa, ON
Period10/6/1215/6/12

Fingerprint

Multiplexing
Outages
Cooperative communication
Combinatorial optimization
Communication systems

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Cite this

Bai, B., Chen, W., Letaief, K., & Cao, Z. (2012). Joint relay selection and subchannel allocation for amplify-and-forward OFDMA cooperative networks. In 2012 IEEE International Conference on Communications, ICC 2012 (pp. 4192-4196). [6364644] https://doi.org/10.1109/ICC.2012.6364644

Joint relay selection and subchannel allocation for amplify-and-forward OFDMA cooperative networks. / Bai, Bo; Chen, Wei; Letaief, Khaled; Cao, Zhigang.

2012 IEEE International Conference on Communications, ICC 2012. 2012. p. 4192-4196 6364644.

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

Bai, B, Chen, W, Letaief, K & Cao, Z 2012, Joint relay selection and subchannel allocation for amplify-and-forward OFDMA cooperative networks. in 2012 IEEE International Conference on Communications, ICC 2012., 6364644, pp. 4192-4196, 2012 IEEE International Conference on Communications, ICC 2012, Ottawa, ON, Canada, 10/6/12. https://doi.org/10.1109/ICC.2012.6364644
Bai B, Chen W, Letaief K, Cao Z. Joint relay selection and subchannel allocation for amplify-and-forward OFDMA cooperative networks. In 2012 IEEE International Conference on Communications, ICC 2012. 2012. p. 4192-4196. 6364644 https://doi.org/10.1109/ICC.2012.6364644
Bai, Bo ; Chen, Wei ; Letaief, Khaled ; Cao, Zhigang. / Joint relay selection and subchannel allocation for amplify-and-forward OFDMA cooperative networks. 2012 IEEE International Conference on Communications, ICC 2012. 2012. pp. 4192-4196
@inproceedings{5263a0cbf45646e18da5011d131a3b7f,
title = "Joint relay selection and subchannel allocation for amplify-and-forward OFDMA cooperative networks",
abstract = "In this paper, a random combinatorial optimization approach, which we shall refer to as random bipartite graph (RBG) based maximum matching, will be proposed to investigate and solve the joint relay selection and subchannel allocation problem in cooperative networks. By studying the properties of the maximum matching on RBG, the outage probability and diversity-multiplexing tradeoff of the proposed RBG matching method will be obtained. It will then be demonstrated that the outage probability and 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, i.e., d(r) = N (K + 1)(1 - 2r), where N is the number of subchannels, and K is the number of relay nodes. In addition, it will be shown that the proposed algorithm for maximum matching enjoys a sublinear computation complexity O(N2/3). Simulation results will illustrate the potential of the proposed RBG matching method as well as verify the theoretical derivations.",
author = "Bo Bai and Wei Chen and Khaled Letaief and Zhigang Cao",
year = "2012",
doi = "10.1109/ICC.2012.6364644",
language = "English",
isbn = "9781457720529",
pages = "4192--4196",
booktitle = "2012 IEEE International Conference on Communications, ICC 2012",

}

TY - GEN

T1 - Joint relay selection and subchannel allocation for amplify-and-forward OFDMA cooperative networks

AU - Bai, Bo

AU - Chen, Wei

AU - Letaief, Khaled

AU - Cao, Zhigang

PY - 2012

Y1 - 2012

N2 - In this paper, a random combinatorial optimization approach, which we shall refer to as random bipartite graph (RBG) based maximum matching, will be proposed to investigate and solve the joint relay selection and subchannel allocation problem in cooperative networks. By studying the properties of the maximum matching on RBG, the outage probability and diversity-multiplexing tradeoff of the proposed RBG matching method will be obtained. It will then be demonstrated that the outage probability and 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, i.e., d(r) = N (K + 1)(1 - 2r), where N is the number of subchannels, and K is the number of relay nodes. In addition, it will be shown that the proposed algorithm for maximum matching enjoys a sublinear computation complexity O(N2/3). Simulation results will illustrate the potential of the proposed RBG matching method as well as verify the theoretical derivations.

AB - In this paper, a random combinatorial optimization approach, which we shall refer to as random bipartite graph (RBG) based maximum matching, will be proposed to investigate and solve the joint relay selection and subchannel allocation problem in cooperative networks. By studying the properties of the maximum matching on RBG, the outage probability and diversity-multiplexing tradeoff of the proposed RBG matching method will be obtained. It will then be demonstrated that the outage probability and 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, i.e., d(r) = N (K + 1)(1 - 2r), where N is the number of subchannels, and K is the number of relay nodes. In addition, it will be shown that the proposed algorithm for maximum matching enjoys a sublinear computation complexity O(N2/3). Simulation results will illustrate the potential of the proposed RBG matching method as well as verify the theoretical derivations.

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

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

U2 - 10.1109/ICC.2012.6364644

DO - 10.1109/ICC.2012.6364644

M3 - Conference contribution

SN - 9781457720529

SP - 4192

EP - 4196

BT - 2012 IEEE International Conference on Communications, ICC 2012

ER -