Age of Information Analysis for Dynamic Spectrum Sharing

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.

[1]  James C. Spall,et al.  Introduction to Stochastic Search and Optimization. Estimation, Simulation, and Control (Spall, J.C. , 2007 .

[2]  Branka Vucetic,et al.  Minimizing Age of Information in Cognitive Radio-Based IoT Systems: Underlay or Overlay? , 2019, IEEE Internet of Things Journal.

[3]  Jingxian Wu,et al.  Optimal Status Update for Age of Information Minimization With an Energy Harvesting Source , 2017, IEEE Transactions on Green Communications and Networking.

[4]  Deniz Gündüz,et al.  Average Age of Information With Hybrid ARQ Under a Resource Constraint , 2019, IEEE Transactions on Wireless Communications.

[5]  Walid Saad,et al.  A Vision of 6G Wireless Systems: Applications, Trends, Technologies, and Open Research Problems , 2019, IEEE Network.

[6]  Ness B. Shroff,et al.  Minimizing the Age of Information Through Queues , 2017, IEEE Transactions on Information Theory.

[7]  Roy D. Yates,et al.  Real-time status: How often should one update? , 2012, 2012 Proceedings IEEE INFOCOM.

[8]  Roy D. Yates,et al.  Update or wait: How to keep your data fresh , 2016, IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications.

[9]  Jing Yang,et al.  When to preempt? Age of information minimization under link capacity constraint , 2018, Journal of Communications and Networks.

[10]  Ekram Hossain,et al.  Resource allocation for spectrum underlay in cognitive radio networks , 2008, IEEE Transactions on Wireless Communications.

[11]  James C. Spall,et al.  Introduction to stochastic search and optimization - estimation, simulation, and control , 2003, Wiley-Interscience series in discrete mathematics and optimization.

[12]  Walid Saad,et al.  Optimal Sampling and Updating for Minimizing Age of Information in the Internet of Things , 2018, 2018 IEEE Global Communications Conference (GLOBECOM).

[13]  Eytan Modiano,et al.  Age of information: Design and analysis of optimal scheduling algorithms , 2016, 2017 IEEE International Symposium on Information Theory (ISIT).

[14]  Linn I. Sennott,et al.  Constrained Average Cost Markov Decision Chains , 1993, Probability in the Engineering and Informational Sciences.

[15]  Roy D. Yates,et al.  The Age of Information: Real-Time Status Updating by Multiple Sources , 2016, IEEE Transactions on Information Theory.

[16]  Dimitri P. Bertsekas,et al.  Dynamic Programming and Optimal Control, Two Volume Set , 1995 .

[17]  Panganamala Ramana Kumar,et al.  Cyber–Physical Systems: A Perspective at the Centennial , 2012, Proceedings of the IEEE.