The 5th Age of Information Workshop (AoI 2022)
Timeliness Research: The Next Decade
Sanjit K. Kaul (IIIT-Delhi, India)
Virtual Coffee Break
Competitive Analyses of Online Minimum Age of Information Transmission Scheduling
Tung-Wei Kuo (National Chengchi University, Taiwan)
Online Scheduling of Transmission and Processing for AoI Minimization with Edge Computing
Jianhang Zhu (SUN YAT-SEN University, China); Jie Gong (Sun Yat-sen University, China)
Improving AoI via Learning-based Distributed MAC in Wireless Networks
Yash Deshpande and Onur Ayan (Technical University of Munich, Germany); Wolfgang Kellerer (Technische UniversitŠt MŸnchen, Germany)
Distribution of AoI in EH-powered Multi-source Systems under Non-preemptive and Preemptive Policies
Mohamed A. Abd-Elmagid and Harpreet S Dhillon (Virginia Tech, USA)
Sennur Ulukus (University of Maryland, USA)
Age of Loop Oriented Wireless Networked Control System: Communication and Control Co-Design in the FBL Regime
Jie Cao (Harbin Institute of Technology, Shenzhen, China); Xu Zhu (Harbin Institute of Technology, Shenzhen, China & University of Liverpool, United Kingdom (Great Britain)); Sumei Sun (Institute for Infocomm Research, Singapore); Petar Popovski (Aalborg University, Denmark); Shaohan Feng (Institute for Infocomm Research, Agency for Science, Technology and Research, Singapore); Yufei Jiang (Harbin Institute of Technology, Shenzhen, China)
impact of fading channel and finite block length due to limited transmission bits are considered. A closed-form expression for Peak AoL (PAoL) is derived with respect to block length and the number of allowable transmission times in the presence of block error probability. It is shown that the average PAoL is less than the sum of the average peak Age of information (PAoI) in uplink (PAoU) and the PAoI in downlink (PAoD), due to the coupling of uplink and downlink. In addition, the average PAoL is proved to be convex with respect to block length and mono-decreasing with respect to the allowable transmission time. We then propose a low-complexity PAoL-aware block length adaptation scheme with retransmission policy and optimal control. Simulation results verify the correctness of our analytical results and demonstrate the effectiveness of the proposed PAoL-aware block length adaptation scheme in terms of information freshness and control performance.
Age of Information in the Presence of an Adversary
Subhankar Banerjee and Sennur Ulukus (University of Maryland, USA)
Game Theoretic Analysis of Age of Information for Slotted ALOHA Access With Capture
Leonardo Badia (Universitˆ degli Studi di Padova, Italy); Andrea Zanella (University of Padova, Italy & CNIT, Italy); Michele Zorzi (Universitˆ degli Studi di Padova, Italy)
Fully analytical investigations based on game theory have shown how selfish players can behave efficiently in random access systems if they are driven by AoI-based objectives.
In this paper, we expand this kind of reasoning to the case of a slotted ALOHA system with capture effect. We present a fully analytical derivation of some notable cases, based on the existing literature, and we highlight the impact of some parameters, specifically the cost coefficient and the capture threshold, towards achieving an efficient allocation that represents an equilibrium point for the network management. It is shown that, when the capture effect is relatively strong, which is easier when the number of terminals is limited, the Nash equilibrium of the system achieves near-optimal performance.
Coexistence of Age Sensitive Traffic and High Throughput Flows: Does Prioritization Help?
Tanya Shreedhar and Sanjit K Kaul (IIIT Delhi, India); Roy Yates (Rutgers University, USA)
Yin Sun (Auburn University, USA)