Conceptio › Archive › arXiv (OAI Expanded)
arXiv (OAI Expanded) open access

Decoding Delay Guarantees of Space Regulated Multiple Access Random Wireless Networks using Successive Interference Cancellation

Zagalo, Kevin et al. · arxiv_oai_expanded
arXiv (OAI Expanded) · Papers
Open Source ↗Direct PDF ↓
information-theorynetworking-and-internet-architecture
Conceptio Open Archive

Analyze & explore related research in Conceptio

Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.

[2604.25868] Decoding Delay Guarantees of Space Regulated Multiple Access Random Wireless Networks using Successive Interference Cancellation Skip to main content Search Submit Donate Log in Computer Science > Networking and Internet Architecture arXiv:2604.25868 (cs) [Submitted on 28 Apr 2026 ( v1 ), last revised 18 Sep 2026 (this version, v4)] Title: Decoding Delay Guarantees of Space Regulated Multiple Access Random Wireless Networks using Successive Interference Cancellation Authors: Kevin Zagalo , Jean-Marie Gorce , François Baccelli View PDF HTML (experimental) Abstract: This paper is focused on decoding delay guarantees in wireless networks, where messages have a given signal-to-interference-plus-noise ratio threshold $\eta_0$ to meet in order to be successfully decoded, and where transmissions should occur within some strict time constraints. Its main contribution consists in quantifying the worst-case transmissions decoding delays in the uplink of cellular and cell-free networks using successive interference cancellation. We show how such decoding delay guarantees can be obtained using spatial network calculus, a new tool introduced recently, and in particular spatial regulation. The results rely on the assumption of absence of fading. We nevertheless outline what this approach will lead to in the fading case for cellular networks. Comments: Submitted to IEEE journal Subjects: Networking and Internet Architecture (cs.NI) ; Information Theory (cs.IT) Cite as: arXiv:2604.25868 [cs.NI] (or arXiv:2604.25868v4 [cs.NI] for this version) https://doi.org/10.48550/arXiv.2604.25868 Focus to learn more arXiv-issued DOI via DataCite Submission history From: Kevin Zagalo [ view email ] [v1] Tue, 28 Apr 2026 17:04:25 UTC (149 KB) [v2] Tue, 28 Jul 2026 13:57:03 UTC (158 KB) [v3] Tue, 25 Aug 2026 09:27:20 UTC (220 KB) [v4] Fri, 18 Sep 2026 07:09:21 UTC (220 KB) Full-text links: Access Paper: View PDF HTML (experimental) TeX Source view license Additional Features Audio Summary Current browse context: cs.NI < prev | next > new | recent | 2026-04 Change to browse by: cs cs.IT math math.IT References & Citations SciX Google Scholar Semantic Scholar export BibTeX citation Bookmark Bibliographic Tools Bibliographic and Citation Tools Bibliographic Explorer Toggle Bibliographic Explorer ( What is the Explorer? ) Connected Papers Toggle Connected Papers ( What is Connected Papers? ) Litmaps Toggle Litmaps ( What is Litmaps? ) scite.ai Toggle scite Smart Citations ( What are Smart Citations? ) Code, Data, Media Code, Data and Media Associated with this Article alphaXiv Toggle alphaXiv ( What is alphaXiv? ) Links to Code Toggle CatalyzeX Code Finder for Papers ( What is CatalyzeX? ) DagsHub Toggle DagsHub ( What is DagsHub? ) GotitPub Toggle Gotit.pub ( What is GotitPub? ) Huggingface Toggle Hugging Face ( What is Huggingface? ) ScienceCast Toggle ScienceCast ( What is ScienceCast? ) Demos Demos Replicate Toggle Replicate ( What is Replicate? ) Spaces Toggle Hugging Face Spaces ( What is Spaces? ) Spaces Toggle TXYZ.AI ( What is TXYZ.AI? ) Related Papers Recommenders and Search Tools Link to Influence Flower Influence Flower ( What are Influence Flowers? ) Core recommender toggle CORE Recommender ( What is CORE? ) Author Venue Institution Topic About arXivLabs 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? ) We gratefully acknowledge support from our major funders , member institutions , and all contributors. About · Help · Contact · Subscribe · Copyright · Privacy · Accessibility · Operational Status (opens in new tab)

Related documents

Record · ID 668508 · SHA-256 1ba70438fca93e3c
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive