论文标题
多渠道网络中信息优化的年龄和其他信息的信息
Age of Information Optimization in Multi-Channel Network with Sided Information
论文作者
论文摘要
我们考虑了一个离散的时间多渠道网络，该网络目的地从多个来源收集带有侧面通道信息的时间敏感数据包。流行的指标，信息时代（AOI）用于测量目的地的数据新鲜度。由于干扰约束，只能在每个时间插槽中选择分离源通道对进行传输，并且决策者应选择最佳的调度对，以最大程度地减少目的地的平均AOI。为了学习最佳频道选择，我们通过使用飞行员提供的侧面信息来应用线性上下文匪徒（LCB）框架。具体而言，我们建立了AOI遗憾与亚最佳通道选择时间之间的关系，并提出了与年龄无关和年龄依赖性算法之间的关系。事实证明，前一种方法可以实现子线性AOI遗憾，但在模拟中线性和非线性上下文模型中的后者算法表现出色。
We consider a discrete-time multi-channel network where the destination collects time-sensitive packets from multiple sources with sided channel information. The popular metric, Age of Information (AoI), is applied to measure the data freshness at the destination. Due to the interference constraint, only disjoint source-channel pairs can be chosen for transmission in each time slot, and the decision maker should choose the optimal scheduling pairs to minimize the average AoI at the destination. To learn the optimal channel selection, we apply the linear contextual bandit (LCB) framework by utilizing the sided information provided by pilots. Concretely, we establish the relationship between AoI regret and sub-optimal channel selection times and propose both age-independent and age-dependent algorithms. The former method is proven to achieve the sub-linear AoI regret but is outperformed by the latter algorithm both in the linear and non-linear contextual model in simulation.
