Optimal relay-subset selection and time-allocation in decode-and-forward cooperative networks

Authors:
Elzbieta Beres;Raviraj Adve
Affiliations:
Dept. of Elec. and Comp. Eng., University of Toronto, Toronto, ON, Canada;Dept. of Elec. and Comp. Eng., University of Toronto, Toronto, ON, Canada
Venue:
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Year:
2009

Citing 12
Cited 0

Matrix analysis

Matrix analysis
Routing and power allocation in asynchronous Gaussian multiple-relay channels

EURASIP Journal on Wireless Communications and Networking
A novel cluster-based cooperative MIMO scheme for multi-hop wireless sensor networks

EURASIP Journal on Wireless Communications and Networking
Multinode Cooperative Communications in Wireless Networks

IEEE Transactions on Signal Processing
An analytical approach to the study of cooperation in wireless ad hoc networks

IEEE Transactions on Wireless Communications
On energy efficiency and optimum resource allocation of relay transmissions in the low-power regime

IEEE Transactions on Wireless Communications
Opportunistic cooperation by dynamic resource allocation

IEEE Transactions on Wireless Communications
Selection Cooperation in Multi-Source Cooperative Networks

IEEE Transactions on Wireless Communications
Reliable Multi-hop Routing with Cooperative Transmissions in Energy-Constrained Networks

IEEE Transactions on Wireless Communications
Distributed space-time-coded protocols for exploiting cooperative diversity in wireless networks

IEEE Transactions on Information Theory
Capacity bounds and power allocation for wireless relay channels

IEEE Transactions on Information Theory
Resource Allocation for Wireless Fading Relay Channels: Max-Min Solution

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 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.