A Unified Sampling and Scheduling Approach for Status Update in Multiaccess Wireless Networks

Information source sampling and update scheduling have been treated separately in the context of real-time status update for age of information optimization. In this paper, a unified sampling and scheduling $(\mathrm{S}^{2})$ approach is proposed, focusing on decentralized updates in multiaccess wireless networks. To gain some insights, we first analyze an example consisting of two-state Markov sources, showing that when both optimized, the unified approach outperforms the separate approach significantly in terms of status tracking error by capturing the key status variation. We then generalize to source nodes with random-walk state transitions whose scaling limit is Wiener processes, the closed-form Whittle’s index with arbitrary status tracking error functions is obtained and indexability established. Furthermore, a mean-field approach is applied to solve for the decentralized status update design explicitly. In addition to simulation results which validate the optimality of the proposed $\mathrm{S}^{2}$ scheme and its advantage over the separate approach, a use case of dynamic channel state information (CSI) update is investigated, with CSI generated by a ray-tracing electromagnetic software.

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

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

[3]  Roy D. Yates,et al.  The Age of Information in Networks: Moments, Distributions, and Sampling , 2018, IEEE Transactions on Information Theory.

[4]  Anthony Ephremides,et al.  Towards an effective age of information: Remote estimation of a Markov source , 2018, IEEE INFOCOM 2018 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS).

[5]  Eytan Modiano,et al.  Minimizing the Age of Information in broadcast wireless networks , 2016, 2016 54th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[6]  Anthony Ephremides,et al.  Age and value of information: Non-linear age case , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).

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

[8]  Richard F. Serfozo,et al.  M/M/1 Queueing Decision Processes with Monotone Hysteretic Optimal Policies , 1984, Oper. Res..

[9]  Eytan Modiano,et al.  Optimizing Information Freshness in Wireless Networks Under General Interference Constraints , 2018, IEEE/ACM Transactions on Networking.

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

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

[12]  P. Lions,et al.  Mean field games , 2007 .

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

[14]  Udo Kamps,et al.  Chebyshev polynomials and least squares estimation based on one-dependent random variables , 1989 .

[15]  Zhisheng Niu,et al.  Decentralized Status Update for Age-of-Information Optimization in Wireless Multiaccess Channels , 2018, 2018 IEEE International Symposium on Information Theory (ISIT).

[16]  Xueying Guo,et al.  Index policies for optimal mean-variance trade-off of inter-delivery times in real-time sensor networks , 2015, 2015 IEEE Conference on Computer Communications (INFOCOM).

[17]  Yi Gai,et al.  The saturation throughput region of p-persistent CSMA , 2011, 2011 Information Theory and Applications Workshop.

[18]  Robert G. Gallager,et al.  Discrete Stochastic Processes , 1995 .

[19]  Ling Shi,et al.  Event-Based Sensor Data Scheduling: Trade-Off Between Communication Rate and Estimation Quality , 2013, IEEE Transactions on Automatic Control.

[20]  R. Weber,et al.  On an index policy for restless bandits , 1990, Journal of Applied Probability.