Pull or Wait: How to Optimize Query Age of Information

Submitted by admin on Mon, 06/10/2024 - 05:00
We study a pull-based status update communication model where a source node submits update packets to a channel with random transmission delay, at times requested by a remote destination node. The objective is to minimize the average query-age-of-information (QAoI), defined as the average age-of-information (AoI) measured at query instants that occur at the destination side according to a stochastic arrival process.

Optimal Update Times for Stale Information Metrics Including the Age of Information

Submitted by admin on Mon, 06/10/2024 - 05:00
In this paper we examine the general problem of determining when to update information that can go out-of-date. Not updating frequently enough results in poor decision making based on stale information. Updating too often results in excessive update costs. We study the tradeoff between having stale information and the cost of updating that information. We use a general model, some versions of which match an idealized version of the Age of Information (AoI) model. We first present the assumptions, and a novel methodology for solving problems of this sort.

Causal Graph Discovery From Self and Mutually Exciting Time Series

Submitted by admin on Mon, 06/10/2024 - 05:00
We present a generalized linear structural causal model, coupled with a novel data-adaptive linear regularization, to recover causal directed acyclic graphs (DAGs) from time series. By leveraging a recently developed stochastic monotone Variational Inequality (VI) formulation, we cast the causal discovery problem as a general convex optimization. Furthermore, we develop a non-asymptotic recovery guarantee and quantifiable uncertainty by solving a linear program to establish confidence intervals for a wide range of non-linear monotone link functions.

Toward Goal-Oriented Semantic Communications: AoII Analysis of Coded Status Update System Under FBL Regime

Submitted by admin on Mon, 06/10/2024 - 05:00
In the past decade, the emergence of beyond fifth generation (B5G) wireless networks has necessitated the timely updating of system states in Internet of Things (IoT) and cyber-physical systems, where Age of Information (AoI) has been a well-concentrated metric. However, the content-agnostic nature of AoI reflects its limitation of characterizing the significance of status update messages, which induces various variants for AoI including Age of Incorrect Information (AoII).

Causal Semantic Communication for Digital Twins: A Generalizable Imitation Learning Approach

Submitted by admin on Mon, 06/10/2024 - 05:00
A digital twin (DT) leverages a virtual representation of the physical world, along with communication (e.g., 6G), computing (e.g., edge computing), and artificial intelligence (AI) technologies to enable many connected intelligence services. In order to handle the large amounts of network data based on digital twins (DTs), wireless systems can exploit the paradigm of semantic communication (SC) for facilitating informed decision-making under strict communication constraints by utilizing AI techniques such as causal reasoning.

Age-Aware Stochastic Hybrid Systems: Stability, Solutions, and Applications

Submitted by admin on Mon, 06/10/2024 - 05:00
In this paper, we analyze status update systems modeled through the Stochastic Hybrid Systems (SHSs) tool. Contrary to previous works, we allow the system’s transition dynamics to be polynomial functions of the Age of Information (AoI). This dependence allows us to encapsulate many applications and opens the door for more sophisticated systems to be studied. However, this same dependence on the AoI engenders technical and analytical difficulties that we address in this paper.

Weighted Age of Information-Based Scheduling for Large Population Games on Networks

Submitted by admin on Mon, 06/10/2024 - 05:00
In this paper, we study a multi-agent game between $N$ agents, which solve a consensus problem, and receive state information through a wireless network, that is controlled by a Base station (BS). Due to a hard-bandwidth constraint, the BS can concurrently connect at most $R_{d}

Remote Monitoring of Two-State Markov Sources via Random Access Channels: An Information Freshness vs. State Estimation Entropy Perspective

Submitted by admin on Mon, 06/10/2024 - 05:00
We study a system in which two-state Markov sources send status updates to a common receiver over a slotted ALOHA random access channel. We characterize the performance of the system in terms of state estimation entropy (SEE), which measures the uncertainty at the receiver about the sources’ state. Two channel access strategies are considered: a reactive policy that depends on the source behaviour and a random one that is independent of it.

Optimizing Task-Specific Timeliness With Edge-Assisted Scheduling for Status Update

Submitted by admin on Mon, 06/10/2024 - 05:00
Intelligent real-time applications, such as video surveillance, demand intensive computation to extract status information from raw sensing data. This poses a substantial challenge in orchestrating computation and communication resources to provide fresh status information. In this paper, we consider a scenario where multiple energy-constrained devices served by an edge server. To extract status information, each device can either do the computation locally or offload it to the edge server.

Learning Invariant Representations Under General Interventions on the Response

Submitted by admin on Mon, 06/10/2024 - 05:00
It has become increasingly common nowadays to collect observations of feature and response pairs from different environments. As a consequence, one has to apply learned predictors to data with a different distribution due to distribution shifts. One principled approach is to adopt the structural causal models to describe training and test models, following the invariance principle which says that the conditional distribution of the response given its predictors remains the same across environments.