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

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.

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

References in corpus (3)

• Capacity of Linear Two-hop Mesh Networks with Rate Splitting, Decode-and-forward Relaying and Cooperation
• Worst-Case Additive Noise in Wireless Networks
• Two-Hop Interference Channels: Impact of Linear Time-Varying Schemes

Cited by in corpus (5)

• Multi-Way Information Exchange Over Completely-Connected Interference Networks with a Multi-Antenna Relay
• Opportunistic Network Decoupling With Virtual Full-Duplex Operation in Multi-Source Interfering Relay Networks
• Linear Degrees of Freedom of the X-Channel with Delayed CSIT
• Layered Interference Networks with Delayed CSI: DoF Scaling with Distributed Transmitters
• Two-Hop Interference Channels: Impact of Linear Time-Varying Schemes