论文标题
动态频谱共享的信息分析年龄分析
Age of Information Analysis for Dynamic Spectrum Sharing
论文作者
论文摘要
及时的信息更新对于网络监视和控制系统中的时间敏感应用程序至关重要。在本文中，考虑了认知无线电网络（CRN）的实时状态更新问题，其中二级用户（SU）可以将状态数据包从主要用户（PU）转移到目的地。在经过考虑的CRN中，SU有机会访问PU拥有的频谱，将其自己的状态数据包发送到目的地。信息的新鲜度通过信息时代（AOI）度量来衡量。通过为SU开发新的最佳状态更新和数据包传输方案来最大程度地减少AOI和能源消耗的问题在PU的平均AOI限制下解决。该问题被称为受约束的马尔可夫决策过程（CMDP）。表征了值函数的单调和可分解属性，然后用来证明相对于SU的AOI，最佳更新和中继策略是基于阈值的。这些结构揭示了SU的AOI与能源消耗以及SU的AOI与PU的AOI之间的权衡。提出了渐近最佳算法。然后使用数值结果来显示拟议政策的有效性。
Timely information updates are critical to time-sensitive applications in networked monitoring and control systems. In this paper, the problem of real-time status update is considered for a cognitive radio network (CRN), in which the secondary user (SU) can relay the status packets from the primary user (PU) to the destination. In the considered CRN, the SU has opportunities to access the spectrum owned by the PU to send its own status packets to the destination. The freshness of information is measured by the age of information (AoI) metric. The problem of minimizing the average AoI and energy consumption by developing new optimal status update and packet relaying schemes for the SU is addressed under an average AoI constraint for the PU. This problem is formulated as a constrained Markov decision process (CMDP). The monotonic and decomposable properties of the value function are characterized and then used to show that the optimal update and relaying policy is threshold-based with respect to the AoI of the SU. These structures reveal a tradeoff between the AoI of the SU and the energy consumption as well as between the AoI of the SU and the AoI of the PU. An asymptotically optimal algorithm is proposed. Numerical results are then used to show the effectiveness of the proposed policy.
