The Unbounded Benefit of Encoder Cooperation for the k-user MAC

Parham Noorzad; Michelle Effros; Michael Langberg

doi:10.1109/TIT.2017.2777965

The Unbounded Benefit of Encoder Cooperation for the k-user MAC

Parham Noorzad, Michelle Effros, Michael Langberg

Research output: Contribution to journal › Article › peer-review

Abstract

Cooperation strategies allow communication devices to work together to improve network capacity. Consider a network consisting of k encoders, a multiple access channel (MAC), a decoder, and a node, referred to as a 'cooperation facilitator' (CF), that is connected to each encoder via a pair of rate-limited links, with one link going from the encoder to the CF and the other link going back. Let the 'cooperation rate' be the total outgoing rate of the CF. This paper demonstrates the existence of a class of MACs where the ratio of the sum-capacity gain to cooperation rate tends to infinity as the cooperation rate tends to zero. For any k ≥ 2, examples of channels in this class include the k-user binary adder MAC and the k-user Gaussian MAC.

Original language	English
Pages (from-to)	3655-3678
Number of pages	24
Journal	IEEE Transactions on Information Theory
Volume	64
Issue number	5
DOIs	https://doi.org/10.1109/TIT.2017.2777965
State	Published - May 2018
Externally published	Yes

Bibliographical note

Publisher Copyright:
© 1963-2012 IEEE.

Keywords

Conferencing encoders
cooperation facilitator
cost constraints
edge removal problem
multiple access channel
multivariate covering lemma
network information theory

Access to Document

10.1109/TIT.2017.2777965

Cite this

@article{95bfaf27b1be4a009521f87cb8953736,

title = "The Unbounded Benefit of Encoder Cooperation for the k-user MAC",

abstract = "Cooperation strategies allow communication devices to work together to improve network capacity. Consider a network consisting of k encoders, a multiple access channel (MAC), a decoder, and a node, referred to as a 'cooperation facilitator' (CF), that is connected to each encoder via a pair of rate-limited links, with one link going from the encoder to the CF and the other link going back. Let the 'cooperation rate' be the total outgoing rate of the CF. This paper demonstrates the existence of a class of MACs where the ratio of the sum-capacity gain to cooperation rate tends to infinity as the cooperation rate tends to zero. For any k ≥ 2, examples of channels in this class include the k-user binary adder MAC and the k-user Gaussian MAC.",

keywords = "Conferencing encoders, cooperation facilitator, cost constraints, edge removal problem, multiple access channel, multivariate covering lemma, network information theory",

author = "Parham Noorzad and Michelle Effros and Michael Langberg",

note = "Publisher Copyright: {\textcopyright} 1963-2012 IEEE.",

year = "2018",

month = may,

doi = "10.1109/TIT.2017.2777965",

language = "אנגלית",

volume = "64",

pages = "3655--3678",

journal = "IEEE Transactions on Information Theory",

issn = "0018-9448",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "5",

}

TY - JOUR

T1 - The Unbounded Benefit of Encoder Cooperation for the k-user MAC

AU - Noorzad, Parham

AU - Effros, Michelle

AU - Langberg, Michael

PY - 2018/5

Y1 - 2018/5

N2 - Cooperation strategies allow communication devices to work together to improve network capacity. Consider a network consisting of k encoders, a multiple access channel (MAC), a decoder, and a node, referred to as a 'cooperation facilitator' (CF), that is connected to each encoder via a pair of rate-limited links, with one link going from the encoder to the CF and the other link going back. Let the 'cooperation rate' be the total outgoing rate of the CF. This paper demonstrates the existence of a class of MACs where the ratio of the sum-capacity gain to cooperation rate tends to infinity as the cooperation rate tends to zero. For any k ≥ 2, examples of channels in this class include the k-user binary adder MAC and the k-user Gaussian MAC.

AB - Cooperation strategies allow communication devices to work together to improve network capacity. Consider a network consisting of k encoders, a multiple access channel (MAC), a decoder, and a node, referred to as a 'cooperation facilitator' (CF), that is connected to each encoder via a pair of rate-limited links, with one link going from the encoder to the CF and the other link going back. Let the 'cooperation rate' be the total outgoing rate of the CF. This paper demonstrates the existence of a class of MACs where the ratio of the sum-capacity gain to cooperation rate tends to infinity as the cooperation rate tends to zero. For any k ≥ 2, examples of channels in this class include the k-user binary adder MAC and the k-user Gaussian MAC.

KW - Conferencing encoders

KW - cooperation facilitator

KW - cost constraints

KW - edge removal problem

KW - multiple access channel

KW - multivariate covering lemma

KW - network information theory

UR - http://www.scopus.com/inward/record.url?scp=85037658821&partnerID=8YFLogxK

U2 - 10.1109/TIT.2017.2777965

DO - 10.1109/TIT.2017.2777965

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:85037658821

SN - 0018-9448

VL - 64

SP - 3655

EP - 3678

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

IS - 5

ER -

The Unbounded Benefit of Encoder Cooperation for the k-user MAC

Abstract

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this