Wireless scheduling for information freshness and synchrony: Drift-based design and heavy-traffic analysis

We consider the problem of scheduling in wireless networks with the aim of maintaining up-to-date and synchronized (also called, aligned) information at the receiver across multiple flows. This is in contrast to the more conventional approach of scheduling for optimizing long-term performance metrics such as throughput, fairness, or average delay. Maintaining the age of information at a low and roughly equal level is particularly important for distributed cyber-physical systems, in which the effectiveness of the control decisions depends critically on the freshness and synchrony of information from multiple sources/sensors. In this work, we first expose the weakness of several popular MaxWeight scheduling solutions that utilize queue-length, delay, and age information as their weights. Then, we develop a novel age-based scheduler that combines age with the interarrival times of incoming packets in its decisions, which yields significant gains in the information freshness at the receiver. We characterize the performance of our strategy through a heavy-traffic analysis that establishes upper and lower bounds on the freshness of system information.

[1]  Stochastic Inequalities,et al.  HITTING-TIME AND OCCUPATION-TIME BOUNDS IMPLIED BY DRIFT ANALYSIS WITH APPLICATIONS , 1982 .

[2]  S. Shakkottai,et al.  Pathwise optimality of the exponential scheduling rule for wireless channels , 2004, Advances in Applied Probability.

[3]  Qing He,et al.  Optimizing freshness of information: On minimum age link scheduling in wireless systems , 2016, 2016 14th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt).

[4]  Michael J. Neely.  Delay-Based Network Utility Maximization , 2013, IEEE/ACM Transactions on Networking.

[5]  Atilla Eryilmaz,et al.  Throughput-optimal wireless scheduling with regulated inter-service times , 2013, 2013 Proceedings IEEE INFOCOM.

[6]  Matthew Andrews,et al.  Providing quality of service over a shared wireless link , 2001, IEEE Commun. Mag..

[7]  Eytan Modiano,et al.  Fairness and Optimal Stochastic Control for Heterogeneous Networks , 2005, IEEE/ACM Transactions on Networking.

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

[9]  R. Srikant,et al.  Stable scheduling policies for fading wireless channels , 2005, IEEE/ACM Transactions on Networking.

[10]  Lei Ying,et al.  Communication Networks - An Optimization, Control, and Stochastic Networks Perspective , 2014 .

[11]  B. Sadiq,et al.  Throughput optimality of delay-driven MaxWeight scheduler for a wireless system with flow dynamics , 2009, 2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[12]  Ness B. Shroff,et al.  Delay-based Back-Pressure scheduling in multi-hop wireless networks , 2011, INFOCOM.

[13]  H. Vincent Poor,et al.  Towards utility-optimal random access without message passing , 2010, Wirel. Commun. Mob. Comput..

[14]  Leandros Tassiulas,et al.  Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks , 1992 .

[15]  Jiaping Liu,et al.  Towards utility-optimal random access without message passing , 2010, CMC 2010.

[16]  Atilla Eryilmaz,et al.  Wireless Scheduling for Information Freshness and Synchrony: Drift-Based Design and Heavy-Traffic Analysis , 2018, IEEE/ACM Transactions on Networking.

[17]  R. Srikant,et al.  Asymptotically tight steady-state queue length bounds implied by drift conditions , 2011, Queueing Syst. Theory Appl..

[18]  I-Hong Hou.  Scheduling Heterogeneous Real-Time Traffic Over Fading Wireless Channels , 2014, IEEE/ACM Transactions on Networking.

[19]  Roy D. Yates,et al.  Real-time status updating: Multiple sources , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.

[20]  Alexander L. Stolyar,et al.  On the Asymptotic Optimality of the Gradient Scheduling Algorithm for Multiuser Throughput Allocation , 2005, Oper. Res..

[21]  Ness B. Shroff,et al.  Delay-Based Back-Pressure Scheduling in Multihop Wireless Networks , 2011, IEEE/ACM Transactions on Networking.

[22]  Michael J. Neely,et al.  Opportunistic Scheduling with Reliability Guarantees in Cognitive Radio Networks , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[23]  N. Shroff,et al.  Delay-Based BackPressure Scheduling in Multi-Hop Wireless Networks , 2010 .

[24]  Eytan Modiano,et al.  Dynamic power allocation and routing for time varying wireless networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[25]  R. Srikant,et al.  On the universality of age-based scheduling in wireless networks , 2015, 2015 IEEE Conference on Computer Communications (INFOCOM).

[26]  Roy D. Yates,et al.  Lazy is timely: Status updates by an energy harvesting source , 2015, 2015 IEEE International Symposium on Information Theory (ISIT).

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

[28]  R. Srikant,et al.  A tutorial on cross-layer optimization in wireless networks , 2006, IEEE Journal on Selected Areas in Communications.

[29]  Leandros Tassiulas,et al.  Resource Allocation and Cross-Layer Control in Wireless Networks , 2006, Found. Trends Netw..

[30]  Atilla Eryilmaz,et al.  Heavy-traffic-optimal scheduling with regular service guarantees in wireless networks , 2013, MobiHoc '13.

[31]  A. Stolyar,et al.  LARGEST WEIGHTED DELAY FIRST SCHEDULING: LARGE DEVIATIONS AND OPTIMALITY , 2001 .