Papers
Topics
Authors
Recent
Search
2000 character limit reached

Irregular Repetition Slotted Aloha with Multipacket Detection: A Density Evolution Analysis

Published 11 Dec 2023 in cs.IT, cs.NI, and math.IT | (2312.06516v1)

Abstract: Irregular repetition slotted Aloha (IRSA) has shown significant advantages as a modern technique for uncoordinated random access with massive number of users due to its capability of achieving theoretically a throughput of $1$ packet per slot. When the receiver has also the multi-packet reception of multi-user (MUD) detection property, by applying successive interference cancellation, IRSA also obtains very low packet loss probabilities at low traffic loads, but is unable in general to achieve a normalized throughput close to the $1$. In this paper, we reconsider the case of IRSA with $k$-MUD receivers and derive the general density evolution equations for the non-asymptotic analysis of the packet loss rate, for arbitrary frame lengths and two variants of the first slot used for transmission. Next, using the potential function, we give new capacity bounds on the capacity of the system, showing the threshold arrival rate for zero decoding error probability. Our numerical results illustrate performance in terms of throughput and average delay for $k$-MUD IRSA with finite memory at the receiver, and also with bounded maximum delay.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (34)
  1. doi:10.1109/comst.2019.2938259.
  2. doi:10.1002/9781119471509.w5gref031.
  3. doi:10.1109/jsac.2022.3145234.
  4. doi:10.1109/tcom.1977.1093713.
  5. doi:10.1109/twc.2007.348337.
  6. doi:10.1109/tcomm.2010.120710.100054.
  7. doi:10.1109/twc.2013.121813.130435.
  8. doi:10.1109/glocom.2012.6503624.
  9. doi:10.1109/tcomm.2016.2633468.
  10. doi:10.1109/isit.2017.8006984.
  11. doi:10.1109/lcomm.2018.2812845.
  12. doi:10.1109/lcomm.2014.2385073.
  13. doi:10.1109/tcomm.2016.2625253.
  14. doi:10.1109/twc.2020.3029387.
  15. arXiv:2202.07908.
  16. doi:10.1109/jiot.2020.2994296.
  17. doi:10.1109/tcomm.2017.2759264.
  18. doi:10.1109/tvt.2018.2831926.
  19. doi:10.1109/lcomm.2019.2900319.
  20. doi:10.1109/twc.2021.3122016.
  21. arXiv:2111.06140.
  22. doi:10.1109/18.910576.
  23. doi:10.1109/18.910578.
  24. doi:10.1109/tit.2002.1003839.
  25. doi:10.1109/tit.2015.2492579.
  26. doi:10.1109/tnet.2021.3050485.
  27. arXiv:2107.10696.
  28. doi:10.1109/wons.2013.6578348.
  29. doi:10.1109/iwcmc48107.2020.9148173.
  30. doi:10.1109/TVT.2021.3120069.
  31. doi:10.1109/lcomm.2018.2834360.
  32. doi:10.1109/lcomm.2017.2761768.
  33. doi:10.1109/9.1272.
  34. doi:10.1561/2200000092.
Citations (2)
View on Semantic Scholar

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Generate Now

Collections

Sign up for free to add this paper to one or more collections.

Sign Up