Metraipolis › archive › dc_2d36bf163eae

Fast Collision-Free Acquisition in 1-Persistent Age-Threshold Slotted ALOHA via Role-Protected Counters — arXiv:2609.09934

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.09934
License (as archived)
CC0-1.0
Archived
2026-10-16T10:53:20.313Z
SHA-256 of the archived text
d9275490194a1a944962b6bb347643e0799b21a5d7e9d56aaeb1f378ec6ec17b
Stable URL of this page
https://metraipolis.com/documento/dc_2d36bf163eae

How to cite

Fast Collision-Free Acquisition in 1-Persistent Age-Threshold Slotted ALOHA via Role-Protected Counters — arXiv:2609.09934 — arXiv (en), https://arxiv.org/abs/2609.09934 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_2d36bf163eae (Metraipolis archive dc_2d36bf163eae, sha256 d9275490194a1a944962b6bb347643e0799b21a5d7e9d56aaeb1f378ec6ec17b)
BibTeX
@misc{dc2d36bf163eae,
  title = {Fast Collision-Free Acquisition in 1-Persistent Age-Threshold Slotted ALOHA via Role-Protected Counters — arXiv:2609.09934},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.09934},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_2d36bf163eae; sha256 d9275490194a1a944962b6bb347643e0799b21a5d7e9d56aaeb1f378ec6ec17b},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.09934. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Goal-oriented sensing, estimation, and control benefit from prompt, regular access to task-relevant updates. Although 1-persistent age-threshold slotted ALOHA (1-pTSA) can self-organize into a periodic collision-free schedule, its acquisition transient can dominate finite-horizon performance. We propose role-protected counter-threshold slotted ALOHA (RP--CTSA), which separates reservation memory from the age of information (AoI). A scheduled singleton retains its phase after colliding with active contenders, whereas a collision involving multiple scheduled nodes releases them immediately; AoI resets only after a decoded update. The protocol requires individual acknowledgments and a binary RELEASE/HOLD indication, but no centralized phase assignment or identification of colliders. Let $n$ denote the number of nodes and $\Gamma_n$ the counter threshold. Under inverse-population access scaling, the acquisition dynamics admit an exact pure-death representation. When $\Gamma_n=n$, the acquisition time is $O(n^2)$; when $\Gamma_n\sim(1+\theta)n$, with $\theta>0$, it is $O(n\log n)$. Simulations confirm both regimes and show substantial finite-horizon AoI gains over 1-pTSA while preserving every collision-free schedule.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-10 in math.IT).
Categorie arXiv: Information Theory (cs.IT).
Pagina del lavoro: https://arxiv.org/abs/2609.09934 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-16T09:00:25.842Z dalla pagina https://arxiv.org/catchup/math.IT/2026-09-10?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).