发表机构
School of Engineering, São Paulo State University (UNESP)（圣保罗州立大学工程学院）
机构由 AI 辅助整理，请以论文原文为准。AI 中文总结
针对1-持久年龄阈值时隙ALOHA获取瞬态主导有限时域性能的问题，提出角色保护计数器阈值时隙ALOHA，通过分离预留记忆与信息年龄实现快速无碰撞获取，获取时间从O(n^2)降至O(n log n)。
AI 中文摘要
目标导向的感知、估计和控制受益于对任务相关更新的及时、定期访问。尽管1-持久年龄阈值时隙ALOHA（1-pTSA）能够自组织成周期性的无碰撞调度，但其获取瞬态可能主导有限时域性能。我们提出了角色保护计数器阈值时隙ALOHA（RP-CTSA），它将预留记忆与信息年龄（AoI）分离。一个已调度的单节点在与活跃竞争者碰撞后保留其相位，而涉及多个已调度节点的碰撞则立即释放它们；AoI仅在解码更新后重置。该协议需要个体确认和二进制释放/保持指示，但不需要集中式相位分配或碰撞者识别。设$n$表示节点数，$\Gamma_n$为计数器阈值。在逆人口访问缩放下，获取动态允许精确的纯死亡表示。当$\Gamma_n=n$时，获取时间为$O(n^2)$；当$\Gamma_n\sim(1+\theta)n$且$\theta>0$时，获取时间为$O(n\log n)$。仿真确认了两种机制，并显示在保持每个无碰撞调度的同时，相对于1-pTSA具有显著的有限时域AoI增益。
英文摘要
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.
CommentsSubmitted to IEEE Transactions on Communications for peer review
