Gaussian Half-Duplex Relay Networks: improved constant gap and connections with the assignment problem

Abstract

This paper considers a general Gaussian relay network where a source transmits a message to a destination with the help of N half-duplex relays. It proves that the information theoretic cut-set upper bound to the capacity can be achieved to within 2:021(N +2) bits with noisy network coding, thereby reducing the previously known gap. Further improved gap results are presented for more structured networks like diamond networks. It is then shown that the generalized Degrees-of-Freedom of a general Gaussian half-duplex relay network is the solution of a linear program, where the coefficients of the linear inequality constraints are proved to be the solution of several linear programs, known in graph theory as the assignment problem, for which efficient numerical algorithms exist. The optimal schedule, that is, the optimal value of the 2^N possible transmit-receive configurations/states for the relays, is investigated and known results for diamond networks are extended to general relay networks. It is shown, for the case of 2 relays, that only 3 out of the 4 possible states have strictly positive probability. Extensive experimental results show that, for a general N-relay network with N<9, the optimal schedule has at most N +1 states with strictly positive probability. As an extension of a conjecture presented for diamond networks, it is conjectured that this result holds for any HD relay network and any number of relays. Finally, a 2-relay network is studied to determine the channel conditions under which selecting the best relay is not optimal, and to highlight the nature of the rate gain due to multiple relays.

Substantial text overlaps with Section VIII in arXiv: 1301.5522. Submitted to IEEE Transactions on Information Theory

References in corpus (1)

• On Capacity and Optimal Scheduling for the Half-Duplex Multiple-Relay Channel

Cited by in corpus (9)

• On the Optimality of Simple Schedules for Networks with Multiple Half-Duplex Relays
• Efficiently Finding Simple Schedules in Gaussian Half-Duplex Relay Line Networks
• Gaussian 1-2-1 Networks: Capacity Results for mmWave Communications
• The Approximate Optimality of Simple Schedules for Half-Duplex Multi-Relay Networks
• Network Simplification in Half-Duplex: Building on Submodularity
• On the Capacity of the Half-Duplex MIMO Gaussian Diamond Channel
• On Network Simplification for Gaussian Half-Duplex Diamond Networks
• Best Relay Selection in Gaussian Half-Duplex Diamond Networks
• Generalized Degrees Freedom of Noncoherent MIMO Channels with Asymmetric Link Strengths