On the Achievable Degrees of Freedom in a Class of Multi-user Half-duplex Relay Networks

We study the achievable sum degrees of freedom (DoF) in a class of wireless single-antenna multi-hop half-duplex relay networks. The network contain M-s information sources, M-d information destinations, and arbitrary layers of relays, each with 2K (K >= max{M-s, M-d}) half-duplex relays, in between. A cluster successive relaying transmission scheme is applied to conduct the communication: We divide the relays in each layer into two equal-size clusters and activate them successively to efficiently use the available channel. It is shown that in a time-varying fading environment this scheme asymptotically achieves the sum DoF min {M-s K/M-s + K, M-d K/M-d + K - 1}, which is irrelevant to the number of hops the source messages have to pass through. This result also implies that, when the number of relays in each layer is infinitely large, the available DoF (i.e. the optimally achievable sum DoF) of the considered networks in min {M-s, M-d}. Neither distributed signal processing nor multiple layers of half-duplex relay operation negatively affects the system DoF performance.