Degrees of freedom of a class of non-layered two unicast wireless networks

Previous work showed that the fully connected layered 2L interference channel, i.e., the multihop interference network formed by concatenation of L − 1 2-user interference channels, achieves the min-cut outer bound value of 2 DoF. In this paper, we study the effects of non-layered cross-layer links on the fully connected layered 2L networks. In particular, we consider the 24 interference channel with arbitrary cross-layer connectivity. We show that the min-cut outer bound value of 2 DoF can be always achieved (almost surely) except if there is a direct link from a source to its interfering destination. In this case, the DoF collapse to 1.

[1]  Syed Ali Jafar,et al.  Multiple Unicast Capacity of 2-Source 2-Sink Networks , 2011, 2011 IEEE Global Telecommunications Conference - GLOBECOM 2011.

[2]  Syed Ali Jafar,et al.  Degrees of Freedom of Wireless Networks With Relays, Feedback, Cooperation, and Full Duplex Operation , 2009, IEEE Transactions on Information Theory.

[3]  David Tse,et al.  Two unicast information flows over linear deterministic networks , 2011, 2011 IEEE International Symposium on Information Theory Proceedings.

[4]  Suhas N. Diggavi,et al.  Wireless Network Information Flow: A Deterministic Approach , 2009, IEEE Transactions on Information Theory.

[5]  Syed Ali Jafar,et al.  Interference Alignment and Spatial Degrees of Freedom for the K User Interference Channel , 2007, 2008 IEEE International Conference on Communications.

[6]  Hua Wang,et al.  Gaussian Interference Channel Capacity to Within One Bit , 2007, IEEE Transactions on Information Theory.

[7]  Sae-Young Chung,et al.  Aligned interference neutralization and the degrees of freedom of the 2 × 2 × 2 interference channel , 2010, 2011 IEEE International Symposium on Information Theory Proceedings.

[8]  Sreeram Kannan,et al.  Approximately Optimal Wireless Broadcasting , 2012, IEEE Transactions on Information Theory.

[9]  Ilan Shomorony,et al.  Two-Unicast Wireless Networks: Characterizing the Degrees of Freedom , 2011, IEEE Transactions on Information Theory.