Transmit or Idle: Efficient AoI Optimal Transmission Policy for Gossiping Receivers
Irtiza Hasan, Ahmed Arafa

TL;DR
This paper develops an optimal transmission policy for a source communicating with two gossiping receivers, balancing AoI and transmission costs using an MDP framework, and reveals structural properties of the optimal policy.
Contribution
It formulates a joint AoI and cost optimization problem for gossiping networks and characterizes the optimal policy's threshold structure using RVI, a novel approach in this context.
Findings
Optimal policy has an age-difference threshold structure.
Direct transmission is optimal when minimum AoI is high and age difference is small.
Gossiping can reduce transmission costs effectively.
Abstract
We study the optimal transmission and scheduling policy for a transmitter (source) communicating with two gossiping receivers aiming at tracking the source's status over time using the age of information (AoI) metric. Gossiping enables local information exchange in a decentralized manner without relying solely on the transmitter's direct communication, which we assume incurs a transmission cost. On the other hand, gossiping may be communicating stale information, necessitating the transmitter's intervention. With communication links having specific success probabilities, we formulate an average-cost Markov Decision Process (MDP) to jointly minimize the sum AoI and transmission cost for such a system in a time-slotted setting. We employ the Relative Value Iteration (RVI) algorithm to evaluate the optimal policy for the transmitter and then prove several structural properties showing that…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAge of Information Optimization · Privacy-Preserving Technologies in Data · Opportunistic and Delay-Tolerant Networks
