Large Relay Networks Research Articles

Successive relaying for large MIMO amplify‐and‐forward relay networks

SummaryIn this paper, we consider a large relay network with one source, K relays and M users, where the source and relays are equipped with W and N antennas, respectively. We propose an amplify‐and‐forward successive relaying protocol in which the relays are divided into 2 groups to successively help transmission to M users. Achievable sum rate of the proposed protocol is derived and found to scale as when N and M are fixed and K→∞ . On the other hand, when M and K are fixed and N→∞, the achievable sum rate scales as . Therefore, the scaling law of the achievable sum rate coincides with the capacity scaling law of the considered network. Then, both precoding at the source and grouping of the relay nodes are jointly optimized to further improve the proposed protocol. Numerical results show that the proposed successive relaying protocol can outperform the conventional 2‐slot relaying protocol and the proposed joint optimization scheme for source precoding and relay grouping bring considerable rate gain.

Asymptotic Capacity of Large Relay Networks with Conferencing Links

In this correspondence, we consider a half-duplex large relay network, which consists of one source-destination pair and $N$ relay nodes, each of which is connected with a subset of the other relays via signal-to-noise ratio (SNR)-limited out-of-band conferencing links. The asymptotic achievable rates of two basic relaying schemes with the "$p$-portion" conferencing strategy are studied: For the decode-and-forward (DF) scheme, we prove that the DF rate scales as $\mathcal{O} (\log (N))$; for the amplify-and-forward (AF) scheme, we prove that it asymptotically achieves the capacity upper bound in some interesting scenarios as $N$ goes to infinity.