2016/01/31 by Parham Noorzad, Michelle Effros, Michael Langberg
Computer Science · Mathematics · #cs.IT #math.IT
paper · pdf · doi:10.1109/isit.2016.7541317
46 pages, 4 figures. Submitted to the IEEE Transactions on Information Theory. This article supersedes arXiv:1504.04432 and arXiv:1508.03349
arxiv created 2016/09/30 · arxiv updated 2016/11/17
Cooperation strategies allow communication devices to work together to improve network capacity. Consider a network consisting of a k-user multiple access channel (MAC) and a node that is connected to all k encoders via rate-limited bidirectional links, referred to as the "cooperation facilitator" (CF). Define the cooperation benefit as the sum-capacity gain resulting from the communication between the encoders and the CF and the cooperation rate as the total rate the CF shares with the encoders. This work demonstrates the existence of a class of k-user MACs where the ratio of the cooperation benefit to cooperation rate tends to infinity as the cooperation rate tends to zero. Examples of channels in this class include the binary erasure MAC for k=2 and the k-user Gaussian MAC for any k≥ 2.