Elements of information theory
Elements of information theory
Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Flow optimization in parallel relay networks with cooperative relaying
IEEE Transactions on Wireless Communications
Cooperative transmission in a wireless relay network based on flow management
IEEE Transactions on Communications
Opportunistic cooperation by dynamic resource allocation
IEEE Transactions on Wireless Communications
Diversity and multiplexing: a fundamental tradeoff in multiple-antenna channels
IEEE Transactions on Information Theory
Distributed space-time-coded protocols for exploiting cooperative diversity in wireless networks
IEEE Transactions on Information Theory
Cooperative diversity in wireless networks: Efficient protocols and outage behavior
IEEE Transactions on Information Theory
Capacity bounds and power allocation for wireless relay channels
IEEE Transactions on Information Theory
On the achievable diversity-multiplexing tradeoff in half-duplex cooperative channels
IEEE Transactions on Information Theory
Outage Capacity of the Fading Relay Channel in the Low-SNR Regime
IEEE Transactions on Information Theory
Multiple-Antenna Cooperative Wireless Systems: A Diversity–Multiplexing Tradeoff Perspective
IEEE Transactions on Information Theory
A simple Cooperative diversity method based on network path selection
IEEE Journal on Selected Areas in Communications
Cooperative transmission in a wireless relay network based on flow management
IEEE Transactions on Communications
Grouping Algorithm for Partner Selection in Cooperative Transmission
Wireless Personal Communications: An International Journal
Hi-index | 0.00 |
Cooperative transmission protocols using a flow optimization approach for a general multi-node half-duplex wireless relay network are presented. The proposed design involves solving a convex flow optimization problem on a graph that models the relay network. Two protocols are developed using the techniques of broadcasting (BC), multiple-access (MA), and time sharing (TS), and both are shown to achieve the optimal diversity-multiplexing tradeoff (DMT). Simulation results are used to quantify the performances of the proposed protocols in terms of outage probabilities, and to compare them against the max-flow-min-cut bound.