Degrees of Freedom of Two-Hop Wireless Networks: Everyone Gets the Entire Cake
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 constant channel coefficients (in which case the result holds for almost all values of constant channel coefficients...
Saved in:
Published in: | IEEE transactions on information theory Vol. 60; no. 5; pp. 2417 - 2431 |
---|---|
Main Authors: | , |
Format: | Journal Article |
Language: | English |
Published: |
New York, NY
IEEE
01-05-2014
Institute of Electrical and Electronics Engineers The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
Subjects: | |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | 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 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 multihop networks with fully connected hops, and multihop networks with MIMO nodes, for which the degrees of freedom are also fully characterized. |
---|---|
Bibliography: | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 23 |
ISSN: | 0018-9448 1557-9654 |
DOI: | 10.1109/TIT.2014.2308172 |