Optimal Slotted Random Access in Coded Wireless Packet Networks - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2010

Optimal Slotted Random Access in Coded Wireless Packet Networks


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.
Fichier principal
Vignette du fichier
p374-riemensberger.pdf (298.5 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00502230 , version 1 (13-07-2010)


  • HAL Id : inria-00502230 , version 1


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. ⟨inria-00502230⟩


259 View
537 Download


Gmail Facebook Twitter LinkedIn More