Related papers: Age Optimal Information Gathering and Disseminatio…
This paper considers a cooperative Internet of Things (IoT) system with a source aiming to transmit randomly generated status updates to a designated destination as timely as possible under the help of a relay. We adopt a recently proposed…
This paper examines the average age minimization problem where only a fraction of the network users can transmit simultaneously over unreliable channels. Finding the optimal scheduling scheme, in this case, is known to be challenging.…
This paper considers a large-scale wireless network consisting of source-destination (SD) pairs, where the sources send time-sensitive information, termed status updates, to their corresponding destinations in a time-slotted fashion. We…
This paper considers a cooperative status update system with a source aiming to send randomly generated status updates to a designated destination as timely as possible with the help of a relay. We adopt a recently proposed concept, Age of…
In networks with intermittent connectivity, such as mobile, aerial, and space systems, maintaining information freshness is complicated by time-varying arrivals, service disruptions, and interactions among traffic classes with different…
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…
This paper considers an Industrial Internet of Thing (IIoT) system with a source monitoring a dynamic process with randomly generated status updates. The status updates are sent to an designated destination in a real-time manner over an…
We consider a wireless broadcast network with a base station sending time-sensitive information to a number of clients through unreliable channels. The Age of Information (AoI), namely the amount of time that elapsed since the most recently…
Age of Information (AoI) has gained importance as a Key Performance Indicator (KPI) for characterizing the freshness of information in information-update systems and time-critical applications. Recent theoretical research on the topic has…
This paper investigates the average age of information (AoI) minimization in status update systems in which the update packets are transmitted with fixed rate. It is assumed that the source avoids queue-induced delay by generating and…
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)…
Recent developments in cyber-physical systems have increased the importance of maximizing the freshness of the information about the physical environment. However, optimizing the access policies of Internet of Things devices to maximize the…
We study the problem of randomized information dissemination in networks. We compare the now standard PUSH-PULL protocol, with agent-based alternatives where information is disseminated by a collection of agents performing independent…
This paper investigates the application of non-orthogonal multiple access (NOMA) to grant-free transmissions to reduce the age of information (AoI) in uplink status update systems, where multiple sources upload their {status updates} to {a…
In this paper, the minimization of time-averaged age-of-information (AoI) in an energy harvesting (EH) source-equipped remote sensing setting is considered. The EH source opportunistically samples one or multiple processes over discrete…
We consider a multi-source relaying system where the sources independently and randomly generate status update packets which are sent to the destination with the aid of a bufferaided relay through unreliable links. We formulate a stochastic…
This paper considers utilizing the knowledge of age gains to reduce the network average age of information (AoI) in random access with event-driven periodic updating for the first time. Built on the form of slotted ALOHA, we require each…
In this letter, we consider the requirement of information freshness in covert communications for the first time. With artificial noise (AN) generated from a full-duplex (FD) receiver, we formulate a covertness maximization problem under…
We consider the problem of collective exploration of a known $n$-node edge-weighted graph by $k$ mobile agents that have limited energy but are capable of energy transfers. The agents are initially placed at an arbitrary subset of nodes in…
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…