Degrees of Freedom Region of a Class of Multi-source Gaussian Relay Networks

preprint2012arXivOpen access

Abstract

We study a layered KK-user MM-hop Gaussian relay network consisting of KmK_m nodes in the mth⁡m^{\operatorname{th}} layer, where M≥2M\geq2 and K=K1=KM+1K=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 (d1,...,dK)(d_1,..., d_K) such that di≤1d_i\leq 1 for all ii and ∑i=1Kdi≤KΣ\sum_{i=1}^K d_i\leq K_Σ is achievable, where did_i is the DoF of the ith⁡i^{\operatorname{th}} source--destination pair and KΣK_Σ is the maximum integer such that KΣ≤min⁡m{Km}K_Σ\leq \min_m\{K_m\} and M/KΣM/K_Σ is an integer. We show that surprisingly the achievable DoF region coincides with the cut-set outer bound if M/min⁡m{Km}M/\min_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.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.