pith. sign in

arxiv: 2604.25868 · v1 · submitted 2026-04-28 · 💻 cs.NI · cs.IT· math.IT

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

Kevin Zagalo , Jean-Marie Gorce , Fran\c{c}ois Baccelli This is my paper

Pith reviewed 2026-05-07 14:41 UTC · model grok-4.3

classification 💻 cs.NI cs.ITmath.IT
keywords decoding delaysuccessive interference cancellationcell-free networksspatial network calculusspatial regulationuplinkrandom wireless networksSINR threshold
0
0 comments X

The pith

Spatial regulation in network calculus delivers worst-case decoding delay guarantees for uplink successive interference cancellation in cell-free wireless networks.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper establishes deterministic upper bounds on the time required to decode messages that meet a fixed SINR threshold in random cell-free networks where receivers apply successive interference cancellation to untangle overlapping transmissions. It does so by importing spatial regulation into the spatial network calculus framework to describe the worst-case spatial patterns of interfering transmitters. A reader would care because many wireless applications require strict timing assurances rather than average performance. If the bounds hold, engineers could certify delay limits for any network that obeys the regulation constraints without needing statistical channel models. The work focuses on the uplink direction and treats the decoding process as a sequence of interference removals ordered by signal strength.

Core claim

Using spatial regulation within spatial network calculus, the authors derive explicit upper bounds on decoding delays for messages requiring an SINR of at least η₀ that are decoded via successive interference cancellation in cell-free random-access networks. The regulation constrains the spatial density and placement of transmitters so that the cumulative interference experienced at each decoding stage remains bounded, yielding finite delay guarantees that hold for every admissible network configuration.

What carries the argument

Spatial regulation, a constraint on transmitter locations and densities inside the spatial network calculus that limits interference accumulation and thereby produces deterministic decoding delay bounds under successive interference cancellation.

If this is right

  • Worst-case decoding delays become finite and computable for every network obeying the spatial regulation rules.
  • The bounds depend only on the regulation parameters, the SINR threshold, and the number of cancellation stages rather than on random channel realizations.
  • Network operators can enforce spatial regulation to certify that all messages are decoded within a stated time limit.
  • The same calculus framework can be reused for other multiple-access schemes once their interference ordering is expressed as successive cancellation steps.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The same regulation approach might be adapted to derive delay guarantees for non-successive cancellation receivers such as joint decoding or linear filtering.
  • Enforcing spatial regulation in practice could involve distributed power control or carrier-sense rules that limit local transmitter density.
  • The bounds could be tightened further by incorporating additional geometry constraints such as minimum separation distances between transmitters.
  • Testing the predicted delays against traces from real cell-free testbeds would reveal how closely actual hardware matches the model's worst-case assumptions.

Load-bearing premise

The spatial regulation model accurately represents the worst-case interference patterns that arise during successive interference cancellation in cell-free random networks.

What would settle it

A simulation or measurement, for any fixed regulation parameters and SINR threshold η₀, in which the longest observed decoding delay for a message exceeds the upper bound computed by the spatial network calculus.

Figures

Figures reproduced from arXiv: 2604.25868 by Fran\c{c}ois Baccelli, Jean-Marie Gorce, Kevin Zagalo.

Figure 1
Figure 1. Figure 1: Successive Interference Cancellation (SIC) : Transmitter view at source ↗
Figure 2
Figure 2. Figure 2: Example of a space regulated PP. 10 view at source ↗
Figure 3
Figure 3. Figure 3: SrINR w.r.t. distance, with ℓ(r) = max{1, r} −4 and γ0 = −10 dB. The simulated PP is a Mat´ern processes of type II, where points from a stationary Poisson PP of intensity λ = 1 are kept only if they are at least at distance H from each other. Hence the intensity of the Mat´ern process is λH = 1−e −H2π H2π , c.f. [12, p. 58]. In order to compare the SrINR coming from Mat´ern (red circles) and Poisson (blac… view at source ↗
Figure 4
Figure 4. Figure 4: Coverage distance lower-bound w.r.t. SrINR threshold for view at source ↗
Figure 5
Figure 5. Figure 5: Space regulated regulated CF network with parameters shown in view at source ↗
Figure 6
Figure 6. Figure 6: Decoding delays simulations and theoretical bound against distance view at source ↗
read the original 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 this should occur within some strict time constraints. Its main contribution consists in quantifying the worst-case transmissions decoding delays in the uplink of a cell-free network 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.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

1 major / 0 minor

Summary. The paper claims to quantify worst-case decoding delay guarantees for uplink transmissions in cell-free random wireless networks that employ successive interference cancellation (SIC), where each message must satisfy a prescribed SINR threshold η₀. It asserts that these deterministic guarantees can be obtained by applying spatial network calculus, and in particular the spatial regulation framework, to bound the cumulative interference and resulting delays.

Significance. If the central derivation holds, the work would provide a useful deterministic analysis tool for delay-sensitive uplink scenarios in random topologies, extending network calculus concepts to the spatial domain and to multi-stage SIC. This could inform the design of reliable cell-free or distributed MIMO systems where average-case metrics are insufficient.

major comments (1)
  1. The manuscript does not explicitly re-derive or prove that the spatial regulation envelope on aggregate interference remains a valid upper bound after each successive cancellation step. Because SIC decoding order is determined by instantaneous, position-dependent received powers (which are random), it is unclear whether the regulated flow model continues to dominate the residual interference for all admissible topologies; this step is load-bearing for the claimed worst-case delay guarantees.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for the careful reading and constructive feedback. We address the single major comment below and will revise the manuscript to make the relevant derivation explicit.

read point-by-point responses

  1. Referee: The manuscript does not explicitly re-derive or prove that the spatial regulation envelope on aggregate interference remains a valid upper bound after each successive cancellation step. Because SIC decoding order is determined by instantaneous, position-dependent received powers (which are random), it is unclear whether the regulated flow model continues to dominate the residual interference for all admissible topologies; this step is load-bearing for the claimed worst-case delay guarantees.

    Authors: We agree that the manuscript would benefit from an explicit statement. The spatial regulation envelope is derived from the underlying point process of all transmitters and supplies a deterministic upper bound on the total aggregate interference that is independent of which subset of messages has already been decoded. After any number of successful cancellations the residual interference is strictly smaller than or equal to the total interference; consequently the same envelope remains a valid (conservative) upper bound on the residual. Because the bound does not rely on the instantaneous ordering, it continues to dominate the residual interference for every admissible topology and every possible decoding sequence. In the revised manuscript we will insert a short derivation immediately after the statement of the spatial regulation result, showing that the envelope applies unchanged to the post-cancellation residual at each SIC stage. revision: yes

Circularity Check

0 steps flagged

No circularity: derivation relies on external spatial network calculus framework

full rationale

The paper's central claim uses spatial network calculus and spatial regulation as an external tool introduced recently to derive decoding delay guarantees for SIC in cell-free networks. No self-definitional loops, fitted inputs renamed as predictions, or load-bearing self-citations appear in the provided abstract or description. The regulation model is treated as an independent input whose validity is assumed from prior work rather than derived within this paper. The derivation chain therefore remains self-contained against external benchmarks and does not reduce to its own inputs by construction.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

Abstract-only review provides no information on free parameters, axioms, or invented entities; all fields left empty.

pith-pipeline@v0.9.0 · 5389 in / 1000 out tokens · 65379 ms · 2026-05-07T14:41:14.103004+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

23 extracted references · 23 canonical work pages

  1. [1]

    Random measures, point processes, and stochastic geometry, 2020

    Fran¸ cois Baccelli, Bart/suppress lomiej B/suppress laszczyszyn, and Mohamed Karray. Random measures, point processes, and stochastic geometry, 2020

    work page 2020

  2. [2]

    Springer Berlin Heidelberg, Berlin, Heidelberg, 2003

    Fran¸ cois Baccelli and Pierre Br´ emaud.The Palm Calculus of Point Pro- cesses, pages 1–74. Springer Berlin Heidelberg, Berlin, Heidelberg, 2003

    work page 2003

  3. [3]

    Using poisson processes to model lattice cellular networks

    Bart/suppress lomiej B/suppress laszczyszyn, Mohamed Kadhem Karray, and Holger Paul Keeler. Using poisson processes to model lattice cellular networks. In 2013 Proceedings IEEE INFOCOM, pages 773–781. IEEE, 2013

    work page 2013

  4. [4]

    John Wiley & Sons, 2018

    Anne Bouillard, Marc Boyer, and Euriell Le Corronc.Deterministic net- work calculus: From theory to practical implementation. John Wiley & Sons, 2018

    work page 2018

  5. [5]

    Springer In- ternational Publishing, Cham, 2020

    Pierre Br´ emaud.Palm Probability in Space, pages 299–332. Springer In- ternational Publishing, Cham, 2020

    work page 2020

  6. [6]

    Channel hardening and favorable propaga- tion in cell-free massive mimo with stochastic geometry.IEEE Transactions on Communications, 66(11):5205–5219, 2018

    Zheng Chen and Emil Bj¨ ornson. Channel hardening and favorable propaga- tion in cell-free massive mimo with stochastic geometry.IEEE Transactions on Communications, 66(11):5205–5219, 2018

    work page 2018

  7. [7]

    L´ elio Chetot, Malcolm Egan, and Jean-Marie Gorce. Hybrid generalized approximate message passing for active user detection and channel estima- tion with correlated group-heterogeneous activity.IEEE Transactions on Communications, 2024

    work page 2024

  8. [8]

    Analysis of the delay distribu- tion in cellular networks by using stochastic geometry.IEEE Open Journal of the Communications Society, 2023

    Fadil Habibi Danufane and Marco Di Renzo. Analysis of the delay distribu- tion in cellular networks by using stochastic geometry.IEEE Open Journal of the Communications Society, 2023. 24

    work page 2023

  9. [9]

    Information theory and communi- cation networks: An unconsummated union.IEEE Transactions on Infor- mation Theory, 44(6):2416–2434, 1998

    Anthony Ephremides and Bruce Hajek. Information theory and communi- cation networks: An unconsummated union.IEEE Transactions on Infor- mation Theory, 44(6):2416–2434, 1998

    work page 1998

  10. [10]

    Spatial network calculus and performance guarantees in wireless networks.IEEE Transactions on Wireless Commu- nications, 23(5):5033–5047, 2023

    Ke Feng and Fran¸ cois Baccelli. Spatial network calculus and performance guarantees in wireless networks.IEEE Transactions on Wireless Commu- nications, 23(5):5033–5047, 2023

    work page 2023

  11. [11]

    The local delay in poisson networks.IEEE Transactions on Information Theory, 59(3):1788–1802, 2012

    Martin Haenggi. The local delay in poisson networks.IEEE Transactions on Information Theory, 59(3):1788–1802, 2012

    work page 2012

  12. [12]

    Cambridge University Press, 2013

    Martin Haenggi.Stochastic geometry for wireless networks. Cambridge University Press, 2013

    work page 2013

  13. [13]

    Stochastic geometry analysis of spatial-temporal performance in wireless networks: A tutorial.IEEE Communications Surveys & Tutorials, 23(4):2753–2801, 2021

    Xiao Lu, Mohammad Salehi, Martin Haenggi, Ekram Hossain, and Hai Jiang. Stochastic geometry analysis of spatial-temporal performance in wireless networks: A tutorial.IEEE Communications Surveys & Tutorials, 23(4):2753–2801, 2021

    work page 2021

  14. [14]

    Vincent Poor

    Homa Nikbakht, Malcolm Egan, Jean-Marie Gorce, and H. Vincent Poor. Broadcast channels with heterogeneous arrival and decoding deadlines: Second-order achievability.IEEE Transactions on Information Theory, 71(3):1758–1776, 2025

    work page 2025

  15. [15]

    Anastasios Papazafeiropoulos, Pandelis Kourtessis, Marco Di Renzo, Symeon Chatzinotas, and John M. Senior. Performance analysis of cell-free massive mimo systems: A stochastic geometry approach.IEEE Transac- tions on Vehicular Technology, 69(4):3523–3537, 2020

    work page 2020

  16. [16]

    Wireless access in ultra-reliable low-latency communication (urllc).IEEE Transactions on Communications, 67(8):5783–5801, 2019

    Petar Popovski, ˇCedomir Stefanovi´ c, Jimmy J Nielsen, Elisabeth De Car- valho, Marko Angjelichinoski, Kasper F Trillingsgaard, and Alexandru- Sabin Bana. Wireless access in ultra-reliable low-latency communication (urllc).IEEE Transactions on Communications, 67(8):5783–5801, 2019

    work page 2019

  17. [17]

    The gaussian broad- cast channels with a hard deadline and a global reliability constraint

    Paul Sheldon, Daniela Tuninetti, and Besma Smida. The gaussian broad- cast channels with a hard deadline and a global reliability constraint. In ICC 2021-IEEE International Conference on Communications, pages 1–6. IEEE, 2021

    work page 2021

  18. [18]

    Emre Telatar and Robert G

    I. Emre Telatar and Robert G. Gallager. Combining queueing theory with information theory for multiaccess.IEEE Journal on Selected Areas in Communications, 13(6):963–969, 1995

    work page 1995

  19. [19]

    Scheduling on the gaussian broadcast channel with hard deadlines

    Daniela Tuninetti, Besma Smida, Natasha Devroye, and Hulya Seferoglu. Scheduling on the gaussian broadcast channel with hard deadlines. In 2018 IEEE International Conference on Communications (ICC), pages 1–

    work page 2018

  20. [20]

    Variable-length stop-feedback codes with finite optimal decoding times for bi-awgn channels

    Hengjie Yang, Recep Can Yavas, Victoria Kostina, and Richard D Wesel. Variable-length stop-feedback codes with finite optimal decoding times for bi-awgn channels. In2022 IEEE International Symposium on Information Theory (ISIT), pages 2327–2332. IEEE, 2022

    work page 2022

  21. [21]

    Variable-length sparse feedback codes for point-to-point, multiple access, and random ac- cess channels.IEEE Transactions on Information Theory, 70(4):2367–2394, 2023

    Recep Can Yavas, Victoria Kostina, and Michelle Effros. Variable-length sparse feedback codes for point-to-point, multiple access, and random ac- cess channels.IEEE Transactions on Information Theory, 70(4):2367–2394, 2023

    work page 2023

  22. [22]

    Response Time Stochastic Analysis for Fixed-Priority Stable Real-Time Systems.IEEE Transactions on Computers, pages 1–12, Jan- uary 2023

    Kevin Zagalo, Yasmina Abdedda ¨ ım, A vner Bar-Hen, and Liliana Cucu- Grosjean. Response Time Stochastic Analysis for Fixed-Priority Stable Real-Time Systems.IEEE Transactions on Computers, pages 1–12, Jan- uary 2023

    work page 2023

  23. [23]

    The performance of successive inter- ference cancellation in random wireless networks.IEEE Transactions on Information Theory, 60(10):6368–6388, 2014

    Xinchen Zhang and Martin Haenggi. The performance of successive inter- ference cancellation in random wireless networks.IEEE Transactions on Information Theory, 60(10):6368–6388, 2014. A Proof of Lemma 1 Same method than [10, Theorem 1]: Lety∈Ψ andR > r >0,n∈N,k= 1,...,n,r k =r+k R−r n and⊚ k =⊚ y(r,rk). Then for the ring⊚ y(r,R) centered ony, ∑ x∈Φ∩⊚y(r,...

    work page 2014