Capacity bounds for networks of broadcast channels

This paper derives new outer bounds on the capacities of networks comprised of broadcast and point-to-point channels. The results are tight in some cases, and methods for bounding their error in general are discussed. The results given demonstrate the simplicity of generalizing network coding results to networks of noisy channels using the family of network equivalence tools. The approach taken is not inherently a cut-set approach and frequently yields tighter bounds than those achieved by traditional cut-sets.

[1]  Lihua Song,et al.  A separation theorem for single-source network coding , 2006, IEEE Transactions on Information Theory.

[2]  Babak Hassibi,et al.  A Practical Scheme for Wireless Network Operation , 2007, IEEE Transactions on Communications.

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

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

[5]  Muriel Médard,et al.  On a theory of network equivalence , 2009, 2009 IEEE Information Theory Workshop on Networking and Information Theory.

[6]  Robert D. Kleinberg,et al.  Tighter Cut-based Bounds for k-pairs Communication Problems , 2005 .

[7]  Michelle Effros.  On capacity outer bounds for a simple family of wireless networks , 2010, 2010 Information Theory and Applications Workshop (ITA).

[9]  S. Savari,et al.  Capacity Bounds for Relay Networks , .

[10]  Robert D. Kleinberg,et al.  On the capacity of information networks , 2006, SODA 2006.

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

[12]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[13]  S. Borade.  Network information flow: limits and achievability , 2002, Proceedings IEEE International Symposium on Information Theory,.

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

[15]  Robert D. Kleinberg,et al.  On the capacity of information networks , 2006, IEEE Transactions on Information Theory.

[16]  Serap A. Savari,et al.  Edge-Cut Bounds on Network Coding Rates , 2006, Journal of Network and Systems Management.

[17]  Lihua Song,et al.  Zero-error network coding for acyclic network , 2003, IEEE Trans. Inf. Theory.

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

[19]  Randall Dougherty,et al.  Nonreversibility and Equivalent Constructions of Multiple-Unicast Networks , 2006, IEEE Transactions on Information Theory.