Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2501.17412 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912717687750656 |
|---|---|
| author | Lin, Kuan-Yu Lu, Wei-Lun Hsu, Yu-Pin Huang, Yu-Chih |
| author_facet | Lin, Kuan-Yu Lu, Wei-Lun Hsu, Yu-Pin Huang, Yu-Chih |
| contents | We study peak Age of Information (PAoI) violation guarantee in a periodic multi-source status update system. The system is served by a shared base station, which requires scheduling. Our main contribution is a randomized scheduling framework that targets heterogeneous PAoI requirements. To that end, we derive numerically trackable upper bounds on the PAoI violation probability in two traffic regimes (long and short period) by leveraging the multivariate noncentral hypergeometric Wallenius distribution and the geometric distribution, respectively. Guided by these bounds, we design two low-complexity randomized scheduling schemes that meet diverse PAoI violation probability targets without the traffic assumption. Simulations validate the bounds and demonstrate feasible operation across a wide range of configurations. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2501_17412 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Randomized Scheduling for Periodic Multi-Source Systems with PAoI Violation Guarantees Lin, Kuan-Yu Lu, Wei-Lun Hsu, Yu-Pin Huang, Yu-Chih Information Theory We study peak Age of Information (PAoI) violation guarantee in a periodic multi-source status update system. The system is served by a shared base station, which requires scheduling. Our main contribution is a randomized scheduling framework that targets heterogeneous PAoI requirements. To that end, we derive numerically trackable upper bounds on the PAoI violation probability in two traffic regimes (long and short period) by leveraging the multivariate noncentral hypergeometric Wallenius distribution and the geometric distribution, respectively. Guided by these bounds, we design two low-complexity randomized scheduling schemes that meet diverse PAoI violation probability targets without the traffic assumption. Simulations validate the bounds and demonstrate feasible operation across a wide range of configurations. |
| title | Randomized Scheduling for Periodic Multi-Source Systems with PAoI Violation Guarantees |
| topic | Information Theory |
| url | https://arxiv.org/abs/2501.17412 |