Paper Info
Title
Relay Scheduling in the Half-Duplex Gaussian Parallel Relay Channel
Abstract
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.
Year
DOI
Venue
2010
10.1109/TIT.2010.2046213
IEEE Transactions on Information Theory
Keywords
Field
DocType
AWGN channels,Markov processes,block codes,protocols,scheduling,AWGN,additive white Gaussian noise,block Markov encoding,broadcast-multiaccess,channel coefficients,common message,dirty paper coding,half-duplex Gaussian parallel relay channel,network communication,optimum scheduling,relay scheduling,relaying protocol,simultaneous-successive relaying,Block Markov Encoding (BME),Dirty Paper Coding (DPC),parallel relay channel,relay scheduling,simultaneous relaying,successive relaying
Topology,Dirty paper coding,Discrete mathematics,Relay channel,Computer science,Block code,Signal-to-noise ratio,Real-time computing,Decoding methods,Additive white Gaussian noise,Relay,Duplex (telecommunications)
Journal
Volume
Issue
ISSN
56
6
0018-9448
Citations 
PageRank 
References 
15
0.80
20
Authors
3
Name
Order
Citations
PageRank
Seyed Saeed Changiz Rezaei1516.30
Shahab Oveis Gharan219816.23
Amir K. Khandani3113992.60