Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2604.13496 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866915938009350144 |
|---|---|
| author | Zou, Peng Maatouk, Ali Erbayat, Egemen Subramaniam, Suresh |
| author_facet | Zou, Peng Maatouk, Ali Erbayat, Egemen Subramaniam, Suresh |
| contents | Motivated by cooperative distributed networks in which users dynamically alternate between transmit and receive modes under half-duplex constraints, this paper studies the Age of Information (AoI) in a distributed multi-user network using an ALOHA-based protocol. We derive closed-form expressions for the average AoI and formulate an optimization problem over transmission probabilities. After proving the convexity of the problem, we leverage the derived optimality conditions to characterize optimal policies for general network graphs, obtain closed-form solutions for $d$-regular topologies, and derive tractable optimality conditions for star topologies. Numerical results confirm that the proposed mechanism can effectively and adaptively determine user-specific optimal transmission probabilities across varying network topologies. These findings contribute to the design of adaptive and efficient distributed networks with enhanced information freshness. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2604_13496 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Age of Information Optimization in Distributed Sensor Networks with Half-Duplex Channels Zou, Peng Maatouk, Ali Erbayat, Egemen Subramaniam, Suresh Information Theory Motivated by cooperative distributed networks in which users dynamically alternate between transmit and receive modes under half-duplex constraints, this paper studies the Age of Information (AoI) in a distributed multi-user network using an ALOHA-based protocol. We derive closed-form expressions for the average AoI and formulate an optimization problem over transmission probabilities. After proving the convexity of the problem, we leverage the derived optimality conditions to characterize optimal policies for general network graphs, obtain closed-form solutions for $d$-regular topologies, and derive tractable optimality conditions for star topologies. Numerical results confirm that the proposed mechanism can effectively and adaptively determine user-specific optimal transmission probabilities across varying network topologies. These findings contribute to the design of adaptive and efficient distributed networks with enhanced information freshness. |
| title | Age of Information Optimization in Distributed Sensor Networks with Half-Duplex Channels |
| topic | Information Theory |
| url | https://arxiv.org/abs/2604.13496 |