Can Negligible Cooperation Increase Network Capacity? The Average-Error Case

In communication networks, cooperative strategies are coding schemes where network nodes work together to improve network performance metrics such as sum-rate. This work studies encoder cooperation in the setting of a discrete multiple access channel with two encoders and a single decoder. A node in the network that is connected to both encoders via rate-limited links, referred to as the cooperation facilitator (CF), enables the cooperation strategy. Previously, the authors presented a class of multiple access channels where the average-error sum-capacity has an infinite derivative in the limit where CF output link capacities approach zero. The authors also demonstrated that for some channels, the maximal-error sum-capacity is not continuous at the point where the output link capacities of the CF equal zero. This work shows that the the average-error sum-capacity is continuous when CF output link capacities converge to zero; that is, the infinite derivative of the average-error sum-capacity is not a result of its discontinuity as in the maximal-error case.

[1]  Michael Langberg,et al.  Can Negligible Rate Increase Network Reliability? , 2018, IEEE Transactions on Information Theory.

[2]  Oliver Kosut,et al.  Strong Converses are Just Edge Removal Properties , 2017, IEEE Transactions on Information Theory.

[3]  Michael Langberg,et al.  Network coding: Is zero error always possible? , 2011, 2011 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[4]  Michael Langberg,et al.  On the Capacity Advantage of a Single Bit , 2016, 2016 IEEE Globecom Workshops (GC Wkshps).

[5]  R. Gallager Information Theory and Reliable Communication , 1968 .

[6]  Parham Noorzad Network Effects in Small Networks: A Study of Cooperation , 2017 .

[7]  John N. Tsitsiklis,et al.  Introduction to linear optimization , 1997, Athena scientific optimization and computation series.

[8]  Frans M. J. Willems,et al.  The discrete memoryless multiple access channel with partially cooperating encoders , 1983, IEEE Trans. Inf. Theory.

[9]  Anand D. Sarwate,et al.  Some observations on limited feedback for multiaccess channels , 2009, 2009 IEEE International Symposium on Information Theory.

[10]  M. Effros,et al.  A continuity theory for lossless source coding over networks , 2008, 2008 46th Annual Allerton Conference on Communication, Control, and Computing.

[11]  Michael Langberg,et al.  The unbounded benefit of encoder cooperation for the k-user MAC , 2016, 2016 IEEE International Symposium on Information Theory (ISIT).

[12]  Tracey Ho,et al.  On the impact of a single edge on the network coding capacity , 2011, 2011 Information Theory and Applications Workshop.

[13]  Alex J. Grant,et al.  On capacity regions of non-multicast networks , 2010, 2010 IEEE International Symposium on Information Theory.

[14]  Tracey Ho,et al.  On equivalence between network topologies , 2010, 2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[15]  Michael Langberg,et al.  Source coding for dependent sources , 2012, 2012 IEEE Information Theory Workshop.

[16]  Masoud Salehi,et al.  Multiple access channels with arbitrarily correlated sources , 1980, IEEE Trans. Inf. Theory.

[17]  Andries P. Hekstra,et al.  Dependence balance bounds for single-output two-way channels , 1989, IEEE Trans. Inf. Theory.