Benefits of Coding on Age of Information in Broadcast Networks
arXiv:1904.10077
Abstract
Age of Information (AoI) is studied in two-user broadcast networks with feedback, and lower and upper bounds are derived on the expected weighted sum AoI of the users. In particular, a class of simple coding actions is considered and within this class, randomized and deterministic policies are devised. Explicit conditions are found for symmetric dependent channels under which coded randomized policies strictly outperform the corresponding uncoded policies. Similar behavior is numerically shown for deterministic policies.
References in corpus (8)
- Multiuser broadcast erasure channel with feedback - capacity and algorithms
- Capacity of 1-to-K Broadcast Packet Erasure Channels with Channel Output Feedback
- Scheduling Policies for Minimizing Age of Information in Broadcast Wireless Networks
- Throughput-Optimal Scheduling Design with Regular Service Guarantees in Wireless Networks
- Age-of-Information in the Presence of Error
- Distributed Scheduling Algorithms for Optimizing Information Freshness in Wireless Networks
- Delay and Peak-Age Violation Probability in Short-Packet Transmissions
- Timely Lossless Source Coding for Randomly Arriving Symbols