相关信息流土匪
Correlated Age-of-Information Bandits
摘要:
我们考虑一个由传感器节点跟踪时变量组成的系统。在每个离散时隙中,节点尝试通过K个通信信道之一向中央监控站发送更新。我们考虑通道实现跨通道相关的设置。这是由基于毫米波的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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。