Update or Wait: How to Keep Your Data Fresh

In this work, we study how to optimally manage the freshness of information updates sent from a source node to a destination via a channel. A proper metric for data freshness at the destination is the age-of-information, or simply age, which is defined as how old the freshest received update is since the moment that this update was generated at the source node (e.g., a sensor). A reasonable update policy is the zero-wait policy, i.e., the source node submits a fresh update once the previous update is delivered and the channel becomes free, which achieves the maximum throughput and the minimum delay. Surprisingly, this zero-wait policy does not always minimize the age. This counter-intuitive phenomenon motivates us to study how to optimally control information updates to keep the data fresh and to understand when the zero-wait policy is optimal. We introduce a general age penalty function to characterize the level of dissatisfaction on data staleness and formulate the average age penalty minimization problem as a constrained semi-Markov decision problem (SMDP) with an uncountable state space. We develop efficient algorithms to find the optimal update policy among all causal policies, and establish sufficient and necessary conditions for the optimality of the zero-wait policy. Our investigation shows that the zero-wait policy is far from the optimum if (i) the age penalty function grows quickly with respect to the age, (ii) the packet transmission times over the channel are positively correlated over time, or (iii) the packet transmission times are highly random (e.g., following a heavy-tail distribution)

Ultra-Reliable Low-Latency Vehicular Networks: Taming the Age of Information Tail

While the notion of age of information (AoI) has recently emerged as an important concept for analyzing ultra-reliable low-latency communications (URLLC), the majority of the existing works have focused on the average AoI measure. However, an average AoI based design falls short in properly characterizing the performance of URLLC systems as it cannot account for extreme events that occur with very low probabilities. In contrast, in this paper, the main objective is to go beyond the traditional notion of average AoI by characterizing and optimizing a URLLC system while capturing the AoI tail distribution. In particular, the problem of vehicles' power minimization while ensuring stringent latency and reliability constraints in terms of probabilistic AoI is studied. To this end, a novel and efficient mapping between both AoI and queue length distributions is proposed. Subsequently, extreme value theory (EVT) and Lyapunov optimization techniques are adopted to formulate and solve the problem. Simulation results shows a nearly two-fold improvement in terms of shortening the tail of the AoI distribution compared to a baseline whose design is based on the maximum queue length among vehicles, when the number of vehicular user equipment (VUE) pairs is 80. The results also show that this performance gain increases significantly as the number of VUE pairs increases.Comment: Accepted in IEEE GLOBECOM 2018 with 7 pages, 6 figure

An Electric Vehicle Charging Management Scheme Based on Publish/Subscribe Communication Framework

Motivated by alleviating CO2 pollution, Electric Vehicle (EV) based applications have recently received wide interests from both commercial and research communities by using electric energy instead of traditional fuel energy. Although EVs are inherently with limited travelling distance, such limitation could be overcome by deploying public Charging Stations (CSs) to recharge EVs battery during their journeys. In this article, we propose a communication framework for on-the-move EV charging scenario, based on Publish/Subscribe (P/S) mechanism to disseminate necessary information about CSs to EVs. Concerning privacy issue, those EVs subscribing to such information could then locally make their individual decisions to select desired CSs for charging, rather than applying a centralized manner where private EV information is required to be released through communication. In this paper we propose a novel communication framework for on-the-move EV charging scenario, based on the Publish/Subscribe (P/S) mechanism for disseminating necessary CS information to EVs, in order for them to make optimized decisions on where to charge. A core part of our communication framework is the utilization of Road Side Units (RSUs) to bridge the information flow from CSs to EVs, which has been regarded as a type of cost-efficient communication infrastructure. Under this design, we introduce two complementary communication modes of signalling protocols, namely Push and Pull Modes, in order to enable the required information dissemination operation. Both analysis and simulation show the advantage of Pull Mode, in which the information is cached at RSUs to support asynchronous communication. We further propose a remote reservation service based on the Pull Mode, such that the CS-selection decision making can utilize the knowledge of EVs' charging reservation, as published from EVs through RSUs to CSs. Results show that both the performance at CS and EV sides are further improved based on using this anticipated information