Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Optimal Relay-Subset Selection and Time-Allocation in Decode-and-Forward
 

Summary: Optimal Relay-Subset Selection and
Time-Allocation in Decode-and-Forward
Cooperative Networks
Elzbieta Beres and Raviraj Adve
Dept. of Elec. and Comp. Eng. , University of Toronto
10 King's College Road, Toronto, ON M5S 3G4, Canada
email: ela.beres@utoronto.ca, rsadve@comm.utoronto.ca
Abstract--We present the optimal relay-subset selection and
transmission-time for a decode-and-forward, half-duplex coop-
erative network of arbitrary size. The resource allocation is
obtained by maximizing over the rates obtained for each possible
subset of active relays, and the unique time allocation for each
set can be obtained by solving a linear system of equations.
We also give a recursive algorithm which reduces the number
of operations as well as the computational load of finding the
required matrix inverses. Our results, in terms of outage rate,
confirm the benefit of adding potential relays to a small network
and the diminishing marginal returns for a larger network.
Furthermore, optimizing over the channel resources ensures that
more relays are active over a larger SNR range.

  

Source: Adve, Raviraj - Department of Electrical and Computer Engineering, University of Toronto

 

Collections: Engineering