Minimizing the Age of Two Heterogeneous Sources With Packet Drops Via Cyclic Schedulers
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2024
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866914649716293632 |
|---|---|
| author | Liyanaarachchi, Sahan Ulukus, Sennur Akar, Nail |
| author_facet | Liyanaarachchi, Sahan Ulukus, Sennur Akar, Nail |
| contents | In a communication setting where multiple sources share a single channel to provide status updates to a remote monitor, source transmissions need to be scheduled appropriately to maintain timely communication between each of the sources and the monitor. We consider age-agnostic scheduling policies which are advantageous due to their simplicity of implementation. Further, we focus on a special class of age-agnostic policies, called cyclic schedulers, where each source is scheduled based on a fixed cyclic pattern. We use weighted average age of information (AoI) to quantify the timeliness of communication. We develop a Markov chain formulation to compute the exact mean AoI for the case of two-source cyclic schedulers. Based on the obtained age expression, we develop an algorithm that generates near-optimal cyclic schedulers to minimize the weighted average AoI for two heterogeneous sources, in the presence of channel errors. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2401_12962 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Minimizing the Age of Two Heterogeneous Sources With Packet Drops Via Cyclic Schedulers Liyanaarachchi, Sahan Ulukus, Sennur Akar, Nail Information Theory Networking and Internet Architecture Systems and Control In a communication setting where multiple sources share a single channel to provide status updates to a remote monitor, source transmissions need to be scheduled appropriately to maintain timely communication between each of the sources and the monitor. We consider age-agnostic scheduling policies which are advantageous due to their simplicity of implementation. Further, we focus on a special class of age-agnostic policies, called cyclic schedulers, where each source is scheduled based on a fixed cyclic pattern. We use weighted average age of information (AoI) to quantify the timeliness of communication. We develop a Markov chain formulation to compute the exact mean AoI for the case of two-source cyclic schedulers. Based on the obtained age expression, we develop an algorithm that generates near-optimal cyclic schedulers to minimize the weighted average AoI for two heterogeneous sources, in the presence of channel errors. |
| title | Minimizing the Age of Two Heterogeneous Sources With Packet Drops Via Cyclic Schedulers |
| topic | Information Theory Networking and Internet Architecture Systems and Control |
| url | https://arxiv.org/abs/2401.12962 |