Role-protected counters speed up collision-free network access schedules
Fast Collision-Free Acquisition in 1-Persistent Age-Threshold Slotted ALOHA via Role-Protected Counters
Information Theory
Summary
When lots of devices try to send updates in a shared network, they can collide and waste time. The authors propose a new way to manage access using special counters that help devices keep their turn even after some collisions. This method speeds up the process of forming a smooth, collision-free schedule, so updates get through more quickly and regularly. Their approach doesn’t need a central controller or detailed knowledge of which devices collided.
What this means in practice
- •For wireless network engineers: Create faster, self-organizing access schedules to improve update delivery regularity without central coordination in sensor networks.
- •For industrial iot system designers: Improve time-sensitive data collection from many devices by reducing collisions and speeding stable periodic scheduling in control networks.
Authors
Plínio Santini Dester
Abstract
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 $Γ_n$ the counter threshold. Under inverse-population access scaling, the acquisition dynamics admit an exact pure-death representation. When $Γ_n=n$, the acquisition time is $O(n^2)$; when $Γ_n\sim(1+θ)n$, with $θ>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.