Skip to Main content Skip to Navigation
Conference papers

Multiuser broadcast erasure channel with feedback -- capacity and algorithms

Abstract : We consider the N-user broadcast erasure channel where feedback from the users is fed back to the transmitter in the form of ACK messages. We first provide a generic outer bound to the capacity of this system; we then propose a coding algorithm, compute its throughput 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 which differs from the outer bound by a factor O(N/L), where L is packet length. For the case of non-symmetric channels, we present a modification of the previous algorithm whose achievable region is identical to the outer bound for N 3, when instant feedback is known to all users, and differs from the bound by O(N/L) when each user knows only its own ACK. The proposed algorithms do not require any prior knowledge of channel statistics.
Document type :
Conference papers
Complete list of metadata

Cited literature [20 references]  Display  Hide  Download
Contributor : Service Ist Inria Sophia Antipolis-Méditerranée / I3s Connect in order to contact the contributor
Submitted on : Thursday, May 26, 2011 - 5:46:57 PM
Last modification on : Tuesday, July 13, 2021 - 1:58:03 PM
Long-term archiving on: : Saturday, August 27, 2011 - 2:26:00 AM


Files produced by the author(s)


  • HAL Id : inria-00596234, version 1



Marios Gatzianas, Leonidas Georgiadis, Leandros Tassiulas. Multiuser broadcast erasure channel with feedback -- capacity and algorithms. NET-COOP 2010 - 4th Workshop on Network Control and Optimization, Nov 2010, Gent, Belgium. ⟨inria-00596234⟩



Les métriques sont temporairement indisponibles