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 work 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.
Additional Information
© 2017 IEEE. Manuscript received September 30, 2016; revised June 28, 2017 and October 22, 2017; accepted November 6, 2017. Date of publication December 1, 2017; date of current version April 19, 2018. This work was supported by the National Science Foundation under Grant 1527524, Grant 1526771, and Grant 1321129. This paper was presented in part at the 2015 IEEE International Symposium of Information Theory [1] and the 2016 IEEE ISIT [2]. The first author thanks M. F. Wong for useful discussions regarding the proof of Theorem 3.Attached Files
Submitted - 1601.06113.pdf
Files
| Name | Size | Download all |
|---|---|---|
|
md5:e072e5add5b265c47495f12e0263e6bb
|
710.6 kB | Preview Download |
Additional details
- Eprint ID
- 84114
- Resolver ID
- CaltechAUTHORS:20180104-165541678
- CCF-1527524
- NSF
- CCF-1526771
- NSF
- CCF-1321129
- NSF
- Created
-
2018-01-05Created from EPrint's datestamp field
- Updated
-
2021-11-15Created from EPrint's last_modified field