Related papers: Status Updates with Priorities: Lexicographic Opti…
In this work, a wireless broadcast network with a base station (BS) sending random time-sensitive information updates to multiple users with interference constraints is considered. The Age of Synchronization (AoS), namely the amount of time…
Consider a scenario where a source continuously monitors an object and sends time-stamped status updates to a destination through a rate-limited link. In order to measure the "freshness" of the status information available at the…
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,…
In this paper, we investigate an amplify-and-forward (AF) based two-way cooperative status update system, where two sources aim to exchange status updates with each other as timely as possible with the help of a relay. Specifically, the…
In a typical Internet of Things (IoT) application where a central controller collects status updates from multiple terminals, e.g., sensors and monitors, through a wireless multiaccess uplink, an important problem is how to attain timely…
In this paper, we investigate multi-connectivity schemes in the context of status update systems with short payloads. As the performance metric, we use the Age of Information (AoI). Due to short payloads, transmission errors must be taken…
Device-to-device (D2D) links scheduling for avoiding excessive interference is critical to the success of wireless D2D communications. Most of the traditional scheduling schemes only consider the maximum throughput or fairness of the system…
Scheduling the transmission of time-sensitive data to multiple users over error-prone communication channels is studied with the goal of minimizing the long-term average age of information (AoI) at the users under a constraint on the…
We consider a system in which an information source generates independent and identically distributed status update packets from an observed phenomenon that takes $n$ possible values based on a given pmf. These update packets are encoded at…
In this paper, we analyze the non-linear age of information (AoI) performance in a point-to-point short packet communication system, where a transmitter generates packets based on status updates and transmits the packets to a receiver.…
We consider a multi-source relaying system where independent sources randomly generate status update packets which are sent to the destination with the aid of a relay through unreliable links. We develop transmission scheduling policies to…
We consider an energy harvesting source equipped with a finite battery, which needs to send timely status updates to a remote destination. The timeliness of status updates is measured by a non-decreasing penalty function of the Age of…
We study the scheduling problem for a multi-source single-server generate-at-will (GAW) status update system with sources having heterogeneous service times and weights, with the goal of minimizing the weighted sum age of information (AoI).…
We consider a wireless network with a base station serving multiple traffic streams to different destinations. Packets from each stream arrive to the base station according to a stochastic process and are enqueued in a separate (per stream)…
Age of Information (AoI) and Peak AoI (PAoI) and their analytical models have recently drawn substantial amount of attention in information theory and wireless communications disciplines, in the context of qualitative assessment of…
In this paper, we consider a single-source multi-server generate-at-will discrete-time non-preemptive status update system where update packets are transmitted using {\em only one} of the available servers, according to a server selection…
We consider the problem of minimizing age of information in multihop wireless networks and propose three classes of policies to solve the problem - stationary randomized, age difference, and age debt. For the unicast setting with fixed…
Timely status updates are crucial to enabling applications in massive Internet of Things (IoT). This paper measures the data-freshness performance of a status update system with an energy harvesting transmitter, considering the randomness…
We consider a source that collects a multiplicity of streams of updates and sends them through a network to a monitor. However, only a single update can be in the system at a time. Therefore, the transmitter always preempts the packet being…
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…