Optimal Slotted Random Access in Coded Wireless Packet Networks

Abstract : We consider the problem of jointly optimizing random access and subgraph selection in coded wireless packet networks. As opposed to the corresponding scheduling approach, the problem cannot be formulated as a convex optimization problem and is thus difficult to solve. We propose a special adaptation of the branch and bound method which allows for computing the optimal strategy for small and medium networks. The key tool for efficiency is a random access specific convex relaxation bound. We compare these results to both optimal and suboptimal joint medium access and subgraph selection techniques, to conclude that there is room for further improvement of suboptimal yet practical random access schemes.
Type de document :
Communication dans un congrès
WiOpt'10: Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, May 2010, Avignon, France. pp.374-379, 2010
Liste complète des métadonnées

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

https://hal.inria.fr/inria-00502230
Contributeur : Service Ist Inria Sophia Antipolis-Méditerranée / I3s <>
Soumis le : mardi 13 juillet 2010 - 15:04:39
Dernière modification le : mardi 13 juillet 2010 - 15:22:51
Document(s) archivé(s) le : jeudi 14 octobre 2010 - 15:42:54

Fichier

p374-riemensberger.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : inria-00502230, version 1

Collections

Citation

Maximilian Riemensberger, Michael Heindlmaier, Andreas Dotzler, Danail Traskov, Wolfgang Utschick. Optimal Slotted Random Access in Coded Wireless Packet Networks. WiOpt'10: Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, May 2010, Avignon, France. pp.374-379, 2010. 〈inria-00502230〉

Partager

Métriques

Consultations de la notice

231

Téléchargements de fichiers

510