vix.ing · top · new · best · stats · spec

Degrees of Freedom of Two-Hop Wireless Networks: "Everyone Gets the Entire Cake"

2012/10/08 by Ilan Shomorony, Shomorony, Ilan, A. Salman Avestimehr +1 · 1 citation
Computer Science · Engineering · Mathematics · #Advanced MIMO Systems Optimization #Cooperative Communication and Network Coding #FOS: Computer and information sciences #Information Theory (cs.IT) #Mobile Ad Hoc Networks #Wireless Communication Security Techniques #cs.IT #math.IT

paper · pdf · doi:10.48550/arxiv.1210.2143

Presented at the 2012 Allerton Conference. Submitted to IEEE Transactions on Information Theory

openalex publication_date 2012/10/08 · arxiv created 2013/05/15 · arxiv updated 2013/05/16 · openalex created_date 2022/08/17 · openalex updated_date 2026/07/28

Abstract

We show that fully connected two-hop wireless networks with K sources, K relays and K destinations have K degrees of freedom both in the case of time-varying channel coefficients and in the case of constant channel coefficients (in which case the result holds for almost all values of constant channel coefficients). Our main contribution is a new achievability scheme which we call Aligned Network Diagonalization. This scheme allows the data streams transmitted by the sources to undergo a diagonal linear transformation from the sources to the destinations, thus being received free of interference by their intended destination. In addition, we extend our scheme to multi-hop networks with fully connected hops, and multi-hop networks with MIMO nodes, for which the degrees of freedom are also fully characterized.

Cited by

Related