Degrees of Freedom Region of a Class of Multisource Gaussian Relay Networks

Abstract: We study a layered

K

-user

M

-hop Gaussian relay network consisting of

K_{m}

nodes in the

m^{o p e r a t o r n a m e t h}

layer, where

M g e q 2

and

K = K_{1} = K_{M + 1}

. We observe that the time-varying nature of wireless channels or fading can be exploited to mitigate the inter-user interference. The proposed amplify-and-forward relaying scheme exploits such channel variations and works for a wide class of channel distributions including Rayleigh fading. We show a general achievable degrees of freedom (DoF) region for this class of Gaussian relay networks. Specifically, the set of all

(d_{1}, ..., d_{K})

such that

d_{i} l e q 1

for all

i

and

s u m_{i = 1}^{K} d_{i} l e q K_{S i g m a}

is achievable, where

d_{i}

is the DoF of the

i^{o p e r a t o r n a m e t h}

source--destination pair and

K_{S i g m a}

is the maximum integer such that

K_{S i g m a} l e q m i n_{m} K_{m}

and

M / K_{S i g m a}

is an integer. We show that surprisingly the achievable DoF region coincides with the cut-set outer bound if

M / m i n_{m} K_{m}

is an integer, thus interference-free communication is possible in terms of DoF. We further characterize an achievable DoF region assuming multi-antenna nodes and general message set, which again coincides with the cut-set outer bound for a certain class of networks.

Cited in

(1)

Degrees of Freedom for the MIMO Multi-Way Relay Channel

This page was built for publication: Degrees of Freedom Region of a Class of Multisource Gaussian Relay Networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5280943)