Relay Scheduling in the Half-Duplex Gaussian Parallel Relay Channel

Abstract

<para xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> 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., <emphasis emphasistype="boldital">simultaneous</emphasis> and <emphasis emphasistype="boldital">successive</emphasis> relaying, associated with two possible relay schedulings are proposed. The simultaneous relaying protocol is based on the <emphasis emphasistype="boldital">Broadcast-Multiaccess with Common Message (BCM)</emphasis> scheme considered in <citerefgrp><citeref refid="ref34"/></citerefgrp>. For the successive relaying protocol: (i) a <emphasis emphasistype="boldital">non-cooperative</emphasis> scheme based on the <emphasis emphasistype="boldital">Dirty Paper Coding (DPC)</emphasis> and (ii) a <emphasis emphasistype="boldital">cooperative</emphasis> scheme based on the <emphasis emphasistype="boldital">Block Markov Encoding (BME)</emphasis> are considered. The composite scheme of employing BME in <emphasis emphasistype="boldital">at most</emphasis> one relay and DPC in <emphasis emphasistype="boldital">at least</emphasis> another one is also proposed. It is proved that this scheme achieves at least the same rate when compared to the <emphasis emphasistype="boldital">cooperative</emphasis> and <emphasis emphasistype="boldital">non-cooperative</emphasis> schemes for the Gaussian case. A <emphasis emphasistype="boldital">Simultaneous-Successive Relaying based on Dirty Paper Coding scheme (SSRD)</emphasis> 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. </para>