On Network Coding for Interference Networks

We consider a finite-field model for the wireless broadcast and additive interference network (WBAIN), both in the presence and absence of fading. We show that the single-source unicast capacity (with extension to multicast) of a WBAIN with or without fading can be upper bounded by the capacity of an equivalent broadcast erasure network. We further present a coding strategy for WBAINs with i.i.d. and uniform fading based on random linear coding at each node that achieves a rate differing from the upper bound by no more than O(1/q), where q is the field size. Using these results, we show that channel fading in conjunction with network coding can lead to large gains in the unicast (multicast) capacity as compared to no fading

[1]  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).

[2]  Gerhard Kramer,et al.  On the separation of channel and network coding in aref networks , 2005, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005..

[3]  Norman M. Abramson,et al.  THE ALOHA SYSTEM: another alternative for computer communications , 1899, AFIPS '70 (Fall).

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

[5]  Dimitri P. Bertsekas,et al.  Data Networks , 1986 .

[6]  Muriel Médard,et al.  Algebraic gossip: a network coding approach to optimal multiple rumor mongering , 2006, IEEE Transactions on Information Theory.

[7]  Stuart C. Schwartz,et al.  Stability properties of slotted Aloha with multipacket reception capability , 1988 .

[8]  Muriel Médard,et al.  On coding for reliable communication over packet networks , 2005, Phys. Commun..