On the Shannon capacity and queueing stability of random access multicast

Simple item page
dc.creatorShrader, Brooke
dc.creatorEphremides, Anthony
dc.date2007-05-21
dc.date2007-09-20
dc.date.accessioned2026-07-07T08:30:42Z
dc.date.available2026-07-07T08:30:42Z
dc.descriptionWe study and compare the Shannon capacity region and the stable throughput region for a random access system in which source nodes multicast their messages to multiple destination nodes. Under an erasure channel model which accounts for interference and allows for multipacket reception, we first characterize the Shannon capacity region. We then consider a queueing-theoretic formulation and characterize the stable throughput region for two different transmission policies: a retransmission policy and random linear coding. Our results indicate that for large blocklengths, the random linear coding policy provides a higher stable throughput than the retransmission policy. Furthermore, our results provide an example of a transmission policy for which the Shannon capacity region strictly outer bounds the stable throughput region, which contradicts an unproven conjecture that the Shannon capacity and stable throughput coincide for random access systems.
dc.description27 pages, 3 figures. Revisions to sections I, III, VII and App. A, B
dc.identifierhttps://arxiv.org/abs/0705.3058
dc.identifierhttp://arxiv.org/abs/0705.3058
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/138303
dc.subjectInformation Theory
dc.titleOn the Shannon capacity and queueing stability of random access multicast
dc.typetext

Files

Collections

arXiv