跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2611.10952 · v1

Optimal Sampling and Transmission Policy for Information Freshness in Gossip Networks

首次提交 2026-11-08 04:29
版本更新 2026-11-08 04:29
雷达观测 2026-11-10 11:14
arXiv ↗PDF ↗

摘要

We study the optimal sampling and transmission policies for a transmitter communicating with n gossiping receivers with the objective of tracking a source's status over time using a semantic freshness metric: Version Age of Information (VAoI). The transmitter observes the version changes in the source, and can acquire a new information version by paying a sampling cost. The receivers gossip, allowing information exchange among each other without direct transmission. Gossiping can save on transmission cost, but it may propagate stale version information, necessitating transmitter intervention. With imperfect communication links, we formulate an infinite horizon average cost Markov Decision Process (MDP) in order to jointly optimize receivers' VAoIs, sampling and transmission costs in a time slotted fully connected (FC) gossip network. We first solve the MDP using Relative Value Iteration (RVI) algorithm. Then, we prove that the sampling decision has a threshold structure in the transmitter VAoI. Further, under reliable gossiping links, we show that transmission and idling has an VAoI-difference threshold structure with minimum VAoI activation. Numerical results obtained using RVI show that the optimal policy consistently outperforms natural baselines. These results characterize how source sampling, direct transmission, and receiver gossip should be jointly coordinated for cost-aware semantic freshness in gossip networks.

作者备注:Potential IEEE journal publication

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

目前只收录了一个版本。收录下一版后,可以对照标题、作者、分类和摘要。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v1 · 2026-11-08 04:29 · 最新观测版本

Optimal Sampling and Transmission Policy for Information Freshness in Gossip Networks

We study the optimal sampling and transmission policies for a transmitter communicating with n gossiping receivers with the objective of tracking a source's status over time using a semantic freshness metric: Version Age of Information (VAoI). The transmitter observes the version changes in the source, and can acquire a new information version by paying a sampling cost. The receivers gossip, allowing information exchange among each other without direct transmission. Gossiping can save on transmission cost, but it may propagate stale version information, necessitating transmitter intervention. With imperfect communication links, we formulate an infinite horizon average cost Markov Decision Process (MDP) in order to jointly optimize receivers' VAoIs, sampling and transmission costs in a time slotted fully connected (FC) gossip network. We first solve the MDP using Relative Value Iteration (RVI) algorithm. Then, we prove that the sampling decision has a threshold structure in the transmitter VAoI. Further, under reliable gossiping links, we show that transmission and idling has an VAoI-difference threshold structure with minimum VAoI activation. Numerical results obtained using RVI show that the optimal policy consistently outperforms natural baselines. These results characterize how source sampling, direct transmission, and receiver gossip should be jointly coordinated for cost-aware semantic freshness in gossip networks.

查看此版本解读 →查看此版本原文 ↗