DocumentCode :
2423905
Title :
OPRA: Optimal Relay Assignment for Capacity Maximization in Cooperative Networks
Author :
Yang, Dejun ; Fang, Xi ; Xue, Guoliang
Author_Institution :
Arizona State Univ., Tempe, AZ, USA
fYear :
2011
fDate :
5-9 June 2011
Firstpage :
1
Lastpage :
6
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.
Keywords :
antenna arrays; cooperative communication; radio networks; OPRA; capacity maximization; cooperative communication; cooperative networks; multiple antennas; optimal relay assignment; optimal relay assignment algorithm; relay node; wireless networks; Algorithm design and analysis; IEEE Communications Society; Mobile communication; Mobile computing; Peer to peer computing; Polynomials; Relays;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Communications (ICC), 2011 IEEE International Conference on
Conference_Location :
Kyoto
ISSN :
1550-3607
Print_ISBN :
978-1-61284-232-5
Electronic_ISBN :
1550-3607
Type :
conf
DOI :
10.1109/icc.2011.5963394
Filename :
5963394
Link To Document :
بازگشت