Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2506.04793 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909639177666560 |
|---|---|
| author | Munari, Andrea Stefanovic, Cedomir |
| author_facet | Munari, Andrea Stefanovic, Cedomir |
| contents | Age of Information (AoI) has emerged as a key metric for assessing data freshness in IoT applications, where a large number of devices report time-stamped updates to a monitor. Such systems often rely on random access protocols based on variations of ALOHA at the link layer, where collision resolution algorithms play a fundamental role to enable reliable delivery of packets. In this context, we provide the first analytical characterization of average AoI for the classical Capetanakis tree-based algorithm with gated access under exogenous traffic, capturing the protocol's dynamics, driven by sporadic packet generation and variable collision resolution times. We also explore a variant with early termination, where contention is truncated after a maximum number of slots even if not all users are resolved. The approach introduces a fundamental trade-off between reliability and timeliness, allowing stale packets to be dropped to improve freshness. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2506_04793 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | On the Role of Early-Termination for Age of Information in Tree-Based Random Access Protocols Munari, Andrea Stefanovic, Cedomir Information Theory Networking and Internet Architecture Age of Information (AoI) has emerged as a key metric for assessing data freshness in IoT applications, where a large number of devices report time-stamped updates to a monitor. Such systems often rely on random access protocols based on variations of ALOHA at the link layer, where collision resolution algorithms play a fundamental role to enable reliable delivery of packets. In this context, we provide the first analytical characterization of average AoI for the classical Capetanakis tree-based algorithm with gated access under exogenous traffic, capturing the protocol's dynamics, driven by sporadic packet generation and variable collision resolution times. We also explore a variant with early termination, where contention is truncated after a maximum number of slots even if not all users are resolved. The approach introduces a fundamental trade-off between reliability and timeliness, allowing stale packets to be dropped to improve freshness. |
| title | On the Role of Early-Termination for Age of Information in Tree-Based Random Access Protocols |
| topic | Information Theory Networking and Internet Architecture |
| url | https://arxiv.org/abs/2506.04793 |