Related papers: Choosing Outdated Information to Achieve Reliabili…
The problem of reducing the age-of-information has been extensively studied in the single-hop networks. In this paper, we minimize the age-of-information in general multihop networks. If the packet transmission times over the network links…
Gossip protocols are widely used to disseminate information in massive peer-to-peer networks. These protocols are often claimed to guarantee privacy because of the uncertainty they introduce on the node that started the dissemination. But…
Stringent demands for timely information delivery, driven by the widespread adoption of real-time applications and the Internet of Things, have established the age of information (AoI) as a critical metric for quantifying data freshness.…
This paper considers a multi-source real-time updating system in which an energy harvesting (EH)-powered transmitter node has multiple sources generating status updates about several physical processes. The status updates are then sent to a…
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).…
Freshness of data is an important performance metric for real-time applications, which can be measured by age-of-information. For computation-intensive messages, the embedded information is not available until being computed. In this paper,…
Age-of-information (AoI) is a metric quantifying information freshness at the receiver. It captures the delay together with packet loss and packet generation rate. However, the existing literature focuses on average or peak AoI and neglects…
In applications of remote sensing, estimation, and control, timely communication is not always ensured by high-rate communication. This work proposes distributed age-efficient transmission policies for random access channels with $M$…
We study the optimal transmission and scheduling policy for a transmitter (source) communicating with two gossiping receivers aiming at tracking the source's status over time using the age of information (AoI) metric. Gossiping enables…
We study the information freshness under three different source aware packet management policies in a status update system consisting of two independent sources and one server. The packets of each source are generated according to the…
We derive key features of the Age-of-Information distribution in a system whose activities are strictly limited to periodic instances on a global time grid. In particular, one agent periodically generates updates while the other agent…
The paper deals with Age of Information (AoI) in a network of multiple sources and parallel queues with buffering capabilities, preemption in service and losses in served packets. The queues do not communicate between each other and the…
Having timely and fresh knowledge about the current state of information sources is critical in a variety of applications. In particular, a status update may arrive at the destination later than its generation time due to processing and…
We consider a cellular network containing $n$ nodes where nodes within a cell gossip with each other in a fully-connected fashion and a source shares updates with these nodes via a mobile drone. The drone receives source updates and shares…
We consider a single server communication setting where the interarrival times of data updates at the source node and the service times to the destination node are arbitrarily distributed. We consider two service discipline models. If a new…
The timeliness of status message delivery in communications networks is subjective to time-varying wireless channel transmissions. In this paper, we investigate the age of information (AoI) of each source in a multi-source M/G/1 queueing…
We develop an analytical model of information dissemination for a gossiping protocol that combines both pull and push approaches. With this model we analyse how fast an item is replicated through a network, and how fast the item spreads in…
In this work, we investigate the design of information-update systems, where incoming update packets are forwarded to a remote destination through multiple servers (each server can be viewed as a wireless channel). One important performance…
We design and analyze gossip algorithms for networks with correlated data. In these networks, either the data to be distributed, the data already available at the nodes, or both, are correlated. This model is applicable for a variety of…
Gossip algorithms are widely used to solve the distributed consensus problem, but issues can arise when nodes receive multiple signals either at the same time or before they are able to finish processing their current work load.…