Capacity of a Class of Linear Binary Field Multisource Relay Networks

In this paper, we study a layered linear binary field network with time-varying channels, which is a simplified model reflecting broadcast, interference, and fading natures of wireless communications. We observe that fading can play an important role in mitigating interuser interference effectively for both single-hop and multihop networks. We propose new coding schemes with randomized ergodic channel pairing, which exploit such channel variations, and derive their achievable ergodic rates. By comparing them with the cut-set upper bound, the capacity region of single-hop networks and the sum capacity of multihop networks are characterized for some classes of channel distributions and network topologies.

[1]  Suhas N. Diggavi,et al.  Approximate capacity of Gaussian relay networks , 2008, 2008 IEEE International Symposium on Information Theory.

[2]  Sae-Young Chung,et al.  Deterministic relay networks with state information , 2009, 2009 IEEE International Symposium on Information Theory.

[3]  D. R. Fulkerson,et al.  Flows in Networks. , 1964 .

[4]  NamWooseok,et al.  Capacity of the Gaussian two-way relay channel to within 1/2 bit , 2010 .

[5]  Rudolf Ahlswede,et al.  Network information flow , 2000, IEEE Trans. Inf. Theory.

[6]  Syed Ali Jafar,et al.  Multiple Access Outerbounds and the Inseparability of Parallel Interference Channels , 2008, IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference.

[7]  H.V. Poor,et al.  Ergodic two-user interference channels: Is separability optimal? , 2008, 2008 46th Annual Allerton Conference on Communication, Control, and Computing.

[8]  Suhas N. Diggavi,et al.  Transmission techniques for relay-interference networks , 2008, 2008 46th Annual Allerton Conference on Communication, Control, and Computing.

[9]  Sriram Vishwanath,et al.  On models for multi-user Gaussian channels with fading , 2010, 2010 44th Annual Conference on Information Sciences and Systems (CISS).

[10]  Sae-Young Chung,et al.  Capacity of a class of multi-source relay networks , 2009, 2009 Information Theory and Applications Workshop.

[11]  Youjian Liu,et al.  Sum Capacity of Interference Channels With a Local View: Impact of Distributed Decisions , 2009, IEEE Transactions on Information Theory.

[12]  Muriel Médard,et al.  An algebraic approach to network coding , 2003, TNET.

[13]  Suhas N. Diggavi,et al.  Approximate capacity of a class of Gaussian relay-interference networks , 2009, 2009 IEEE International Symposium on Information Theory.

[14]  Gerhard Kramer,et al.  The multicast capacity of deterministic relay networks with no interference , 2006, IEEE Transactions on Information Theory.

[15]  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.

[16]  Sae-Young Chung,et al.  Capacity Bounds for Two-Way Relay Channels , 2008, 2008 IEEE International Zurich Seminar on Communications.

[17]  Shuo-Yen Robert Li,et al.  Linear network coding , 2003, IEEE Trans. Inf. Theory.

[18]  Imre Csiszár,et al.  Information Theory - Coding Theorems for Discrete Memoryless Systems, Second Edition , 2011 .

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

[20]  Sae-Young Chung,et al.  Approximate capacity of a class of multi-source Gaussian relay networks , 2010, 2010 IEEE Information Theory Workshop.

[21]  S. Vishwanath,et al.  Unicast Transmission Over Multiple Access Erasure Networks: Capacity and Duality , 2007, 2007 IEEE Information Theory Workshop.

[22]  Syed Ali Jafar,et al.  Capacity of Wireless Networks within o(log(SNR)) - the Impact of Relays, Feedback, Cooperation and Full-Duplex Operation , 2008, ArXiv.

[23]  Suhas N. Diggavi,et al.  Approximate Capacity of a Class of Gaussian Interference-Relay Networks , 2011, IEEE Transactions on Information Theory.

[24]  Abbas El Gamal,et al.  Capacity theorems for the relay channel , 1979, IEEE Trans. Inf. Theory.

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

[26]  Sae-Young Chung,et al.  Capacity of the Gaussian Two-Way Relay Channel to Within ${1\over 2}$ Bit , 2009, IEEE Transactions on Information Theory.

[27]  Babak Hassibi,et al.  Capacity of wireless erasure networks , 2006, IEEE Transactions on Information Theory.

[28]  Abhay Parekh,et al.  The Approximate Capacity of the Many-to-One and One-to-Many Gaussian Interference Channels , 2008, IEEE Transactions on Information Theory.

[29]  Michael Gastpar,et al.  Ergodic Interference Alignment , 2012, IEEE Trans. Inf. Theory.

[30]  Syed Ali Jafar,et al.  Interference Alignment and the Degrees of Freedom of Wireless $X$ Networks , 2009, IEEE Transactions on Information Theory.

[31]  Suhas N. Diggavi,et al.  Wireless Network Information Flow , 2007, ArXiv.

[32]  Sanjay Shakkottai,et al.  On Network Coding for Interference Networks , 2006, 2006 IEEE International Symposium on Information Theory.

[33]  Aydin Sezgin,et al.  Approximate capacity of the two-way relay channel: A deterministic approach , 2008, 2008 46th Annual Allerton Conference on Communication, Control, and Computing.

[34]  Eric V. Denardo,et al.  Flows in Networks , 2011 .

[35]  Mohammad Reza Aref,et al.  Information flow in relay networks , 1981 .

[36]  Suhas N. Diggavi,et al.  Approximate Capacity of Gaussian Interference-Relay Networks with Weak Cross Links , 2010, ArXiv.

[37]  Tracey Ho,et al.  A Random Linear Network Coding Approach to Multicast , 2006, IEEE Transactions on Information Theory.

[38]  David Tse,et al.  The two-user Gaussian interference channel: a deterministic view , 2008, Eur. Trans. Telecommun..

[39]  Muriel Médard,et al.  Random coding in noise-free multiple access networks over finite fields , 2003, GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489).