Elements of information theory
Elements of information theory
Bounds on achievable rates for general multi-terminal networks with practical constraints
IPSN'03 Proceedings of the 2nd international conference on Information processing in sensor networks
Towards an information theory of large networks: an achievable rate region
IEEE Transactions on Information Theory
A network information theory for wireless communication: scaling laws and optimal operation
IEEE Transactions on Information Theory
An achievable rate for the multiple-level relay channel
IEEE Transactions on Information Theory
Capacity of a class of relay channels with orthogonal components
IEEE Transactions on Information Theory
Capacity bounds and power allocation for wireless relay channels
IEEE Transactions on Information Theory
Space-time diversity enhancements using collaborative communications
IEEE Transactions on Information Theory
Cooperative Strategies and Capacity Theorems for Relay Networks
IEEE Transactions on Information Theory
Gaussian Orthogonal Relay Channels: Optimal Resource Allocation and Capacity
IEEE Transactions on Information Theory
On the achievable diversity-multiplexing tradeoff in half-duplex cooperative channels
IEEE Transactions on Information Theory
Towards the Optimal Amplify-and-Forward Cooperative Diversity Scheme
IEEE Transactions on Information Theory
Offset Encoding for Multiple-Access Relay Channels
IEEE Transactions on Information Theory
Cooperation in a Half-Duplex Gaussian Diamond Relay Channel
IEEE Transactions on Information Theory
| Hi-index | 754.84 |
This study investigates the problem of communication for a network composed of two half-duplex parallel relays with additive white Gaussian noise (AWGN). There is no direct link between the source and the destination. However, the relays can communicate with each other through the channel between them. Two protocols, i.e., simultaneous and successive relaying, associated with two possible relay schedulings are proposed. The simultaneous relaying protocol is based on the Broadcast-Multiaccess with Common Message (BCM) scheme considered in [34]. For the successive relaying protocol: (i) a non-cooperative scheme based on the Dirty Paper Coding (DPC) and (ii) a cooperative scheme based on the Block Markov Encoding (BME) are considered. The composite scheme of employing BME in at most one relay and DPC in at least another one is also proposed. It is proved that this scheme achieves at least the same rate when compared to the cooperative and non-cooperative schemes for the Gaussian case. A Simultaneous-Successive Relaying based on Dirty Paper Coding scheme (SSRD) is also proposed. The optimum scheduling of the relays, and hence the capacity of the half-duplex Gaussian parallel relay channel in the low and high signal-to-noise ratio (SNR) scenarios, is derived. In the low SNR scenario, it is revealed that under certain conditions for the channel coefficients the ratio of the achievable rate of the simultaneous relaying based on BCM to the cut-set bound tends to be 1. On the other hand, as SNR goes to infinity it is proved that successive relaying, based on the DPC, asymptotically achieves the capacity of the network.