Joint Status Sampling and Updating for Minimizing Age of Information in the Internet of Things

The effective operation of time-critical Internet of things (IoT) applications requires real-time reporting of fresh status information of underlying physical processes. In this paper, a real-time IoT monitoring system is considered, in which the IoT devices sample a physical process with a sampling cost and send the status packet to a given destination with an updating cost. This joint status sampling and updating process is designed to minimize the average age of information (AoI) at the destination node under an average energy cost constraint at each device. This stochastic problem is formulated as an infinite horizon average cost constrained Markov decision process (CMDP) and transformed into an unconstrained Markov decision process (MDP) using a Lagrangian method. For the single IoT device case, the optimal policy for the CMDP is shown to be a randomized mixture of two deterministic policies for the unconstrained MDP, which is of threshold type. This reveals a fundamental tradeoff between the average AoI at the destination and the sampling and updating costs. Then, a structure-aware optimal algorithm to obtain the optimal policy of the CMDP is proposed and the impact of the wireless channel dynamics is studied while demonstrating that channels having a larger mean channel gain and less scattering can achieve better AoI performance. For the case of multiple IoT devices, a low-complexity semi-distributed suboptimal policy is proposed with the updating control at the destination and the sampling control at each IoT device. Then, an online learning algorithm is developed to obtain this policy, which can be implemented at each IoT device and requires only the local knowledge and small signaling from the destination. The proposed learning algorithm is shown to converge almost surely to the suboptimal policy. Simulation results show the structural properties of the optimal policy for the single IoT device case; and show that the proposed policy for multiple IoT devices outperforms a zero-wait baseline policy, with average AoI reductions reaching up to 33%.

[1]  Keith W. Ross,et al.  Randomized and Past-Dependent Policies for Markov Decision Processes with Multiple Constraints , 1989, Oper. Res..

[2]  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.

[3]  Walid Saad,et al.  Unmanned Aerial Vehicle With Underlaid Device-to-Device Communications: Performance and Tradeoffs , 2015, IEEE Transactions on Wireless Communications.

[4]  Yu-Pin Hsu,et al.  Age of Information: Whittle Index for Scheduling Stochastic Arrivals , 2018, 2018 IEEE International Symposium on Information Theory (ISIT).

[5]  V. Borkar Stochastic approximation with two time scales , 1997 .

[6]  Vincent K. N. Lau,et al.  A Survey on Delay-Aware Resource Control for Wireless Systems—Large Deviation Theory, Stochastic Lyapunov Drift, and Distributed Stochastic Learning , 2011, IEEE Transactions on Information Theory.

[7]  Elif Uysal-Biyikoglu,et al.  Scheduling status updates to minimize age of information with an energy harvesting sensor , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).

[8]  Martin L. Puterman,et al.  Markov Decision Processes: Discrete Stochastic Dynamic Programming , 1994 .

[9]  Vikram Krishnamurthy,et al.  MIMO Transmission Control in Fading Channels—A Constrained Markov Decision Process Formulation With Monotone Randomized Policies , 2007, IEEE Transactions on Signal Processing.

[10]  Vincent K. N. Lau,et al.  Distributive Stochastic Learning for Delay-Optimal OFDMA Power and Subband Allocation , 2010, IEEE Transactions on Signal Processing.

[11]  Ger Koole,et al.  Monotonicity in Markov Reward and Decision Chains: Theory and Applications , 2007, Found. Trends Stoch. Syst..

[12]  Eytan Modiano,et al.  Scheduling Algorithms for Minimizing Age of Information in Wireless Broadcast Networks with Random Arrivals , 2017, IEEE Transactions on Mobile Computing.

[13]  Leslie Pack Kaelbling,et al.  On the Complexity of Solving Markov Decision Problems , 1995, UAI.

[14]  Walid Saad,et al.  Machine Learning for Wireless Networks with Artificial Intelligence: A Tutorial on Neural Networks , 2017, ArXiv.

[15]  F. Beutler,et al.  Optimal policies for controlled markov chains with a constraint , 1985 .

[16]  Pedro Merino,et al.  The 3GPP NB-IoT system architecture for the Internet of Things , 2017, 2017 IEEE International Conference on Communications Workshops (ICC Workshops).

[17]  Dusit Niyato,et al.  Random access for machine-to-machine communication in LTE-advanced networks: issues and approaches , 2013, IEEE Communications Magazine.

[18]  E. Altman Constrained Markov Decision Processes , 1999 .

[19]  Xingqin Lin,et al.  A Primer on 3GPP Narrowband Internet of Things , 2016, IEEE Communications Magazine.

[20]  J. Bather,et al.  Multi‐Armed Bandit Allocation Indices , 1990 .

[21]  Ness B. Shroff,et al.  Age-optimal Sampling and Transmission Scheduling in Multi-Source Systems , 2018, MobiHoc.

[22]  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).

[23]  Kaibin Huang,et al.  Energy-Efficient Resource Allocation for Mobile-Edge Computation Offloading , 2016, IEEE Transactions on Wireless Communications.

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

[25]  Zhisheng Niu,et al.  Can Decentralized Status Update Achieve Universally Near-Optimal Age-of-Information in Wireless Multiaccess Channels? , 2018, 2018 30th International Teletraffic Congress (ITC 30).

[26]  Eytan Modiano,et al.  Scheduling Policies for Minimizing Age of Information in Broadcast Wireless Networks , 2018, IEEE/ACM Transactions on Networking.

[27]  H. Robbins A Stochastic Approximation Method , 1951 .

[28]  H. T. Kung,et al.  Distributed Deep Neural Networks Over the Cloud, the Edge and End Devices , 2017, 2017 IEEE 37th International Conference on Distributed Computing Systems (ICDCS).

[29]  Dimitri P. Bertsekas,et al.  Dynamic Programming and Optimal Control 3rd Edition, Volume II , 2010 .

[30]  Roy D. Yates,et al.  Status updates through queues , 2012, 2012 46th Annual Conference on Information Sciences and Systems (CISS).

[31]  V. Borkar Stochastic Approximation: A Dynamical Systems Viewpoint , 2008 .

[32]  Vikram Krishnamurthy,et al.  Monotonicity of Constrained Optimal Transmission Policies in Correlated Fading Channels With ARQ , 2010, IEEE Transactions on Signal Processing.

[33]  Antonio Iera,et al.  The Internet of Things: A survey , 2010, Comput. Networks.

[34]  Songtao Feng,et al.  Minimizing Age of Information for an Energy Harvesting Source with Updating Failures , 2018, 2018 IEEE International Symposium on Information Theory (ISIT).

[35]  Vivek S. Borkar,et al.  Learning Algorithms for Markov Decision Processes with Average Cost , 2001, SIAM J. Control. Optim..

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

[37]  James E. Smith,et al.  Structural Properties of Stochastic Dynamic Programs , 2002, Oper. Res..

[38]  Tho Le-Ngoc,et al.  Optimal Scheduling over Time-Varying Channels with Traffic Admission Control: Structural Results and Online Learning Algorithms , 2013, IEEE Transactions on Wireless Communications.

[39]  Tim Hesterberg,et al.  Introduction to Stochastic Search and Optimization: Estimation, Simulation, and Control , 2004, Technometrics.

[40]  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.

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

[42]  Zhisheng Niu,et al.  Timely Status Update in Massive IoT Systems: Decentralized Scheduling for Wireless Uplinks , 2018, ArXiv.

[43]  Vikram Krishnamurthy,et al.  ${Q}$-Learning Algorithms for Constrained Markov Decision Processes With Randomized Monotone Policies: Application to MIMO Transmission Control , 2007, IEEE Transactions on Signal Processing.

[44]  Ursula Challita,et al.  Artificial Neural Networks-Based Machine Learning for Wireless Networks: A Tutorial , 2017, IEEE Communications Surveys & Tutorials.

[45]  Elif Uysal-Biyikoglu,et al.  Optimal Sampling and Remote Estimation of the Wiener Process over a Channel with Random Delay , 2017, ArXiv.