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

Authors:
Elzbieta Beres;Raviraj Adve
Affiliations:
Boston Consulting Group, Toronto, ON and The Edward S. Rogers Sr. Department of Electrical and Computer Engineering, University of Toronto;The Edward S. Rogers Sr. Department of Electrical and Computer Engineering, University of Toronto, Toronto, Ontario, Canada
Venue:
IEEE Transactions on Wireless Communications
Year:
2010

Citing 20
Cited 1

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
Parity forwarding for multiple-relay networks

IEEE Transactions on Information Theory
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
Improving amplify-and-forward relay networks: optimal power allocation versus selection

IEEE Transactions on Wireless Communications
Cooperative Communications with Outage-Optimal Opportunistic Relaying

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
Towards an information theory of large networks: an achievable rate region

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

IEEE Transactions on Information Theory
Degraded Gaussian multirelay channel: capacity and optimal power allocation

IEEE Transactions on Information Theory
An achievable rate for the multiple-level relay channel

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

IEEE Transactions on Information Theory
Cooperative Strategies and Capacity Theorems for Relay Networks

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

IEEE Transactions on Information Theory
A simple Cooperative diversity method based on network path selection

IEEE Journal on Selected Areas in Communications

Resource Allocation Schemes for the Heterogeneous OFDMA System with Multiple Ad Hoc Relays

Wireless Personal Communications: An International Journal

Quantified Score

Hi-index	0.01

Visualization

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.