Computer Science – Information Theory
Scientific paper
2008-12-19
Computer Science
Information Theory
Submitted to IEEE Trans. on Wirless Comm., Dec. 19th 2008
Scientific paper
We present the optimal relay-subset selection and transmission-time for a decode-and-forward, half-duplex cooperative 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 present a simple recursive algorithm for the optimization problem which reduces the computational load of finding the required matrix inverses, and reduces the number of required iterations. 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. We also show that optimizing over the channel resources ensures that more relays are active over a larger SNR range, and that linear network constellations significantly outperform grid constellations. Through simulations, the optimization is shown to be robust to node numbering.
Adve Raviraj
Beres Elzbieta
No associations
LandOfFree
Optimal Relay-Subset Selection and Time-Allocation in Decode-and-Forward Cooperative Networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Optimal Relay-Subset Selection and Time-Allocation in Decode-and-Forward Cooperative Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Optimal Relay-Subset Selection and Time-Allocation in Decode-and-Forward Cooperative Networks will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-103483