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.
Type de document :
Communication dans un congrès
NET-COOP 2010 - 4th Workshop on Network Control and Optimization, Nov 2010, Gent, Belgium. 2010
Liste complète des métadonnées

Littérature citée [20 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/inria-00596234
Contributeur : Service Ist Inria Sophia Antipolis-Méditerranée / I3s <>
Soumis le : jeudi 26 mai 2011 - 17:46:57
Dernière modification le : mercredi 11 octobre 2017 - 13:52:02
Document(s) archivé(s) le : samedi 27 août 2011 - 02:26:00

Fichier

regpaper8.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : inria-00596234, version 1

Collections

Citation

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. 2010. 〈inria-00596234〉

Partager

Métriques

Consultations de la notice

124

Téléchargements de fichiers

112