DocumentCode :
1534958
Title :
Optimal Relay-Subset Selection and Time-Allocation in Decode-and-Forward Cooperative Networks
Author :
Beres, Elzbieta ; Adve, Raviraj
Author_Institution :
Edward S. Rogers Sr. Dept. of Electr. & Comput. Eng., Univ. of Toronto, Toronto, ON, Canada
Volume :
9
Issue :
7
fYear :
2010
fDate :
7/1/2010 12:00:00 AM
Firstpage :
2145
Lastpage :
2155
Abstract :
We consider a half-duplex mesh network wherein a single source communicates to a destination with the help of N potential decode-and-forward relays. We develop the optimal selection of a relaying subset and allocation of transmission time. This resource allocation is found by maximizing over the rates achievable for each possible subset of active relays; in turn, the optimal time allocation for each subset is obtained by solving a linear system of equations. An assumed relay numbering imposes a causality constraint. We also present a recursive algorithm to solve the optimization problem which reduces the computational load of finding the required matrix inverses and the number of required iterations. We show that (i) optimizing transmission time significantly improves achievable rate; (ii) optimizing over the channel resources ensures that more relays are active over a larger range of signal-to-noise ratios; (iii) linear network constellations significantly outperform grid constellations; (iv) the achievable rate is robust to node ordering.
Keywords :
Bandwidth; Constellation diagram; Decoding; Equations; Linear systems; Mesh networks; Power system relaying; Relays; Resource management; Strontium; Relay-subset selection; cooperative networks; decode-and-forward; time-allocation;
fLanguage :
English
Journal_Title :
Wireless Communications, IEEE Transactions on
Publisher :
ieee
ISSN :
1536-1276
Type :
jour
DOI :
10.1109/TWC.2010.07.081669
Filename :
5508967
Link To Document :
بازگشت