Related papers: Age of information without service preemption
We focus on a slotted ALOHA system without feedback, in which nodes transmit time-stamped updates to a common gateway. Departing from the classical generate-at-will model, we assume that each transmitter may not always have fresh…
In this paper, we study an age of information minimization problem in continuous-time and discrete-time status updating systems that involve multiple packet flows, multiple servers, and transmission errors. Four scheduling policies are…
Age of information (AoI) is an effective performance metric measuring the freshness of information and is popular for applications involving status update. Most of the existing works have adopted average AoI as the metric, which cannot…
Age of Information (AoI) is a recently defined quantity, which measures the freshness of information in a communication scheme. In this paper, we analyze a network that consists of a sensor node, an energy source and a receiver. The energy…
While age of Information (AoI) has gained importance as a metric characterizing the fresh-ness of information in information-update systems and time-critical applications, most previous studies on AoI have been theoretical. In this chapter,…
We consider a node-monitor pair, where updates are generated stochastically (according to a known distribution) at the node that it wishes to send to the monitor. The node is assumed to incur a fixed cost for each transmission, and the…
A resource-constrained system monitors a source of information by requesting a finite number of updates subject to random transmission delays. An a priori fixed update request policy is shown to minimize a polynomial penalty function of the…
We consider a multi-source network with a common monitor, where fresh updates are generated at each source, following a Poisson process. At any time, at most one source can transmit its update to the monitor, and transmission time for…
Internet of Things (IoT) has been emerging as one of the use cases permeating our daily lives in 5th Generation wireless networks, where status update packages are usually required to be timely delivered for many IoT based intelligent…
We study a setting where an intelligent model (e.g., a pre-trained neural network) infers the real-time value of a target signal using data samples transmitted from a remote source. The transmission scheduler decides (i) the freshness of…
In this paper, we examine a multi-sensor system where each sensor may monitor more than one time-varying information process and send status updates to a remote monitor over a common channel. We consider that each sensor's status update may…
In this paper, a dense Internet of Things (IoT) monitoring system is studied in which a large number of devices contend for transmitting timely status packets to their corresponding receivers over wireless noisy channels, using a carrier…
This paper estimates the freshness of the information in a wireless relay communication system that employs simultaneous wireless information and power transfer (SWIPT) operating under ultra-reliable low-latency communication (URLLC)…
The freshness of status information is of great importance for time-critical Internet of Things (IoT) applications. A metric measuring status freshness is the age-of-information (AoI), which captures the time elapsed from the status being…
We show how to calculate the Age of Information in an overtake-free network of quasi-reversible queues, with exponential exogenous interarrivals of multiple classes of update packets and exponential service times at all nodes. Results are…
We study age-agnostic scheduling in a non-preemptive status update system with two sources sending time-stamped information packets at random instances to a common monitor through a single server. The server is equipped with a waiting room…
Timely information updates are critical to time-sensitive applications in networked monitoring and control systems. In this paper, the problem of real-time status update is considered for a cognitive radio network (CRN), in which the…
In this paper, we study an age of information minimization problem, where multiple flows of update packets are sent over multiple servers to their destinations. Two online scheduling policies are proposed. When the packet generation and…
We consider an information update system where an information receiver requests updates from an information provider in order to minimize its age of information. The updates are generated at the transmitter as a result of completing a set…
In this paper, we consider N information streams sharing a common service facility. The streams are supposed to have different priorities based on their sensitivity. A higher priority stream will always preempt the service of a lower…