OPRA: Optimal relay assignment for capacity maximization in cooperative networks

Dejun Yang, Xi Fang, Guoliang Xue

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

44 Citations (Scopus)

Abstract

Cooperative communication has been proposed to increase the capacity of wireless networks. By exploiting a relay node, it achieves spatial diversity to cope with fading channel without requiring wireless nodes to be equipped with multiple antennas. However, the selection of relay nodes has a significant impact on the final capacity. In this paper, we study the problem of relay assignment in cooperative networks, where multiple source-destination transmission pairs share the same set of relay nodes. Specifically, we propose a system model where a relay node can be shared by multiple source-destination pairs and present a corresponding formulation for the capacity calculation. Our objective is to find a relay assignment to maximize the total capacity of the network. As the main contribution, we develop an optimal relay assignment algorithm to solve this problem in polynomial time. We also show that our algorithm has several attractive properties.

Original languageEnglish (US)
Title of host publicationIEEE International Conference on Communications
DOIs
StatePublished - 2011
Event2011 IEEE International Conference on Communications, ICC 2011 - Kyoto, Japan
Duration: Jun 5 2011Jun 9 2011

Other

Other2011 IEEE International Conference on Communications, ICC 2011
CountryJapan
CityKyoto
Period6/5/116/9/11

Fingerprint

Cooperative communication
Fading channels
Wireless networks
Polynomials
Antennas

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Computer Networks and Communications

Cite this

Yang, D., Fang, X., & Xue, G. (2011). OPRA: Optimal relay assignment for capacity maximization in cooperative networks. In IEEE International Conference on Communications [5963394] https://doi.org/10.1109/icc.2011.5963394

OPRA : Optimal relay assignment for capacity maximization in cooperative networks. / Yang, Dejun; Fang, Xi; Xue, Guoliang.

IEEE International Conference on Communications. 2011. 5963394.

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

Yang, D, Fang, X & Xue, G 2011, OPRA: Optimal relay assignment for capacity maximization in cooperative networks. in IEEE International Conference on Communications., 5963394, 2011 IEEE International Conference on Communications, ICC 2011, Kyoto, Japan, 6/5/11. https://doi.org/10.1109/icc.2011.5963394
Yang, Dejun ; Fang, Xi ; Xue, Guoliang. / OPRA : Optimal relay assignment for capacity maximization in cooperative networks. IEEE International Conference on Communications. 2011.
@inproceedings{6f4897072f944dcd91376f26c6aa43d1,
title = "OPRA: Optimal relay assignment for capacity maximization in cooperative networks",
abstract = "Cooperative communication has been proposed to increase the capacity of wireless networks. By exploiting a relay node, it achieves spatial diversity to cope with fading channel without requiring wireless nodes to be equipped with multiple antennas. However, the selection of relay nodes has a significant impact on the final capacity. In this paper, we study the problem of relay assignment in cooperative networks, where multiple source-destination transmission pairs share the same set of relay nodes. Specifically, we propose a system model where a relay node can be shared by multiple source-destination pairs and present a corresponding formulation for the capacity calculation. Our objective is to find a relay assignment to maximize the total capacity of the network. As the main contribution, we develop an optimal relay assignment algorithm to solve this problem in polynomial time. We also show that our algorithm has several attractive properties.",
author = "Dejun Yang and Xi Fang and Guoliang Xue",
year = "2011",
doi = "10.1109/icc.2011.5963394",
language = "English (US)",
isbn = "9781612842332",
booktitle = "IEEE International Conference on Communications",

}

TY - GEN

T1 - OPRA

T2 - Optimal relay assignment for capacity maximization in cooperative networks

AU - Yang, Dejun

AU - Fang, Xi

AU - Xue, Guoliang

PY - 2011

Y1 - 2011

N2 - Cooperative communication has been proposed to increase the capacity of wireless networks. By exploiting a relay node, it achieves spatial diversity to cope with fading channel without requiring wireless nodes to be equipped with multiple antennas. However, the selection of relay nodes has a significant impact on the final capacity. In this paper, we study the problem of relay assignment in cooperative networks, where multiple source-destination transmission pairs share the same set of relay nodes. Specifically, we propose a system model where a relay node can be shared by multiple source-destination pairs and present a corresponding formulation for the capacity calculation. Our objective is to find a relay assignment to maximize the total capacity of the network. As the main contribution, we develop an optimal relay assignment algorithm to solve this problem in polynomial time. We also show that our algorithm has several attractive properties.

AB - Cooperative communication has been proposed to increase the capacity of wireless networks. By exploiting a relay node, it achieves spatial diversity to cope with fading channel without requiring wireless nodes to be equipped with multiple antennas. However, the selection of relay nodes has a significant impact on the final capacity. In this paper, we study the problem of relay assignment in cooperative networks, where multiple source-destination transmission pairs share the same set of relay nodes. Specifically, we propose a system model where a relay node can be shared by multiple source-destination pairs and present a corresponding formulation for the capacity calculation. Our objective is to find a relay assignment to maximize the total capacity of the network. As the main contribution, we develop an optimal relay assignment algorithm to solve this problem in polynomial time. We also show that our algorithm has several attractive properties.

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

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

U2 - 10.1109/icc.2011.5963394

DO - 10.1109/icc.2011.5963394

M3 - Conference contribution

AN - SCOPUS:80052183732

SN - 9781612842332

BT - IEEE International Conference on Communications

ER -