Multiuser broadcast erasure channel with feedback - capacity and algorithms
arXiv:1009.1254 · doi:10.1109/TIT.2013.2265692
Abstract
We consider the -user broadcast erasure channel with unicast sessions (one for each user) where receiver feedback is regularly sent to the transmitter in the form of ACK/NACK messages. We first provide a generic outer bound to the capacity of this system; we then propose a virtual-queue-based inter-session mixing coding algorithm, determine its rate region and show that it achieves capacity under certain conditions on channel statistics, assuming that instantaneous feedback is known to all users. Removing this assumption results in a rate region that asymptotically differs from the outer bound by 1 bit as , where is the number of bits per packet (packet length). For the case of arbitrary channel statistics, we present a modification of the previous algorithm whose rate region is identical to the outer bound for N=3, when instant feedback is known to all users, and differs from the bound by 1 bit as , when the 3 users know only their own ACK. The proposed algorithms do not require any prior knowledge of channel statistics.
54 pages, 3 figures, 3 tables, submitted to IEEE Transactions on Information Theory. Updated version to match reviewer comments
References in corpus (2)
Cited by in corpus (22)
- Multiuser broadcast erasure channel with feedback - capacity and algorithms
- Capacity of 1-to-K Broadcast Packet Erasure Channels with Channel Output Feedback
- Fundamental Limits of Cache-Aided Wireless BC: Interplay of Coded-Caching and CSIT Feedback
- Cache-Enabled Broadcast Packet Erasure Channels with State Feedback
- Content Delivery over Broadcast Erasure Channels with Distributed Random Cache
- Completion Delay Minimization for Instantly Decodable Network Codes
- Benefits of Coding on Age of Information in Broadcast Networks
- Capacity Region of Erasure Broadcast Channels with Common Message and Feedback
- Secret Communication over Broadcast Erasure Channels with State-feedback
- A Graph Model for Opportunistic Network Coding
- Secure Capacity Region for Erasure Broadcast Channels with Feedback
- Capacity and Algorithms for a Cognitive Network with Primary-Secondary User Cooperation
- Timely Broadcasting in Erasure Networks: Age-Rate Tradeoffs
- Erasure Broadcast Channels with Intermittent Feedback
- Content Delivery in Erasure Broadcast Channels with Cache and Feedback
- Three-terminal Erasure Source-Broadcast with Feedback
- Capacity and Stability Regions for Layered Packet Erasure Broadcast Channels with Feedback
- On the Capacity Region of Broadcast Packet Erasure Relay Networks With Feedback
- On the Capacity Region of the Layered Packet Erasure Broadcast Channel with Feedback
- Capacity Regions of Two-User Broadcast Erasure Channels with Feedback and Hidden Memory
- Exploiting Location Information to Enhance Throughput in Downlink V2I Systems
- Linear Network Coding Capacity Region of The Smart Repeater with Broadcast Erasure Channels