Skip to main content
We gratefully acknowledge support from the Simons Foundation, member institutions, and all contributors. Donate
arXiv logo
Cornell University Logo

Computer Science > Information Theory

arXiv:1307.0085 (cs)
[Submitted on 29 Jun 2013]

Title:Coded Slotted ALOHA with Varying Packet Loss Rate across Users

Authors:Cedomir Stefanovic, Petar Popovski
View PDF
Abstract:The recent research has established an analogy between successive interference cancellation in slotted ALOHA framework and iterative belief-propagation erasure-decoding, which has opened the possibility to enhance random access protocols by utilizing theory and tools of erasure-correcting codes. In this paper we present a generalization of the and-or tree evaluation, adapted for the asymptotic analysis of the slotted ALOHA-based random-access protocols, for the case when the contending users experience different channel conditions, resulting in packet loss probability that varies across users. We apply the analysis to the example of frameless ALOHA, where users contend on a slot basis. We present results regarding the optimal access probabilities and contention period lengths, such that the throughput and probability of user resolution are maximized.
Comments: 4 pages, submitted to GlobalSIP 2013
Subjects: Information Theory (cs.IT)
Cite as: arXiv:1307.0085 [cs.IT]
  (or arXiv:1307.0085v1 [cs.IT] for this version)
  https://doi.org/10.48550/arXiv.1307.0085

Submission history

From: Cedomir Stefanovic [view email]
[v1] Sat, 29 Jun 2013 10:25:14 UTC (362 KB)
Full-text links:

Access Paper:

  • View PDF
  • TeX Source
  • Other Formats
view license
Current browse context:
cs.IT
< prev   |   next >
new | recent | 2013-07
Change to browse by:
cs
math
math.IT

References & Citations

DBLP - CS Bibliography

listing | bibtex
Cedomir Stefanovic
Petar Popovski
export BibTeX citation

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)