论文标题

相关的信息匪徒

Correlated Age-of-Information Bandits

论文作者

Juneja, Ishank, Fatale, Santosh, Moharir, Sharayu

论文摘要

我们考虑一个由传感器节点组成的系统,该传感器节点跟踪时间变化的数量。在每个离散的时间段中,节点都尝试通过一个K通信渠道将更新发送到中央监控站。我们考虑跨频道相关的通道实现的设置。这是由基于mmwave的5G系统的动机,在所有频率渠道中,对成功通信至关重要的视线是在所有频率渠道中都很普遍的,而其他因素(例如湿度)的效果取决于频率。感兴趣的度量是信息年龄(AOI),它是监测站可用数据的新鲜度的量度。在通道统计信息未知但跨时间静止并跨通道相关的环境中,算法挑战是确定在每个时间段进行通信中使用哪种通道。我们将问题建模为具有武器通道的多臂匪徒(MAB)。我们表征了任何政策绩效的基本限制。此外,通过分析和模拟,我们表征了利用相关性的UCB和汤普森采样策略的变体的性能。

We consider a system composed of a sensor node tracking a time varying quantity. In every discretized time slot, the node attempts to send an update to a central monitoring station through one of K communication channels. We consider the setting where channel realizations are correlated across channels. This is motivated by mmWave based 5G systems where line-of-sight which is critical for successful communication is common across all frequency channels while the effect of other factors like humidity is frequency dependent. The metric of interest is the Age-of-Information (AoI) which is a measure of the freshness of the data available at the monitoring station. In the setting where channel statistics are unknown but stationary across time and correlated across channels, the algorithmic challenge is to determine which channel to use in each time-slot for communication. We model the problem as a Multi-Armed bandit (MAB) with channels as arms. We characterize the fundamental limits on the performance of any policy. In addition, via analysis and simulations, we characterize the performance of variants of the UCB and Thompson Sampling policies that exploit correlation.

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源