Search arXivSearch

arXiv · 2601.22901

Status Updating via Integrated Sensing and Communication: Freshness Optimisation

Abstract

In this paper, we study how sensing and communication should be jointly coordinated in integrated sensing and communication (ISAC) systems to maintain timely situational awareness under reliability and resource constraints. We consider an ISAC-enabled base station that supports a remote source by dynamically choosing between sensing new state information and communicating previously acquired information, with the two operations semantically intertwined rather than serving separate targets and users. Both sensing and communication are unreliable and costly. The objective is to optimise a long-term cost that captures information freshness at the source, measured by the age of information (AoI), together with sensing and communication overheads. The resulting sequential decision problem is formulated as an infinite-horizon Markov decision process (MDP) with two-dimensional AoI states that capture information freshness at the source and at the base station. We prove that the optimal stationary policy admits a monotone threshold structure characterised by a nondecreasing switching curve in the AoI state space, and show that, as the base-station information becomes staler, the system increasingly favours sensing over communication. Our numerical analysis corroborates the theoretical findings.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Touraj Soleymani, Mohamad Assaad, John S. Baras. 2026-07-03. Status Updating via Integrated Sensing and Communication: Freshness Optimisation. https://arxiv.org/abs/2601.22901

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Fundamental Scaling Laws of Covert Communication in the Presence of Block Fading

Covert communication is the undetected transmission of sensitive information over a communication channel. In wireless communication systems, channel impairments such as signal fading present challenges in the effective implementation and analysis of covert communication systems. This paper generalizes early work in the covert communication field by considering asymptotic results for the number of bits that can be covertly transmitted in $n$ channel uses on a block fading channel. Critical to the investigation is characterizing the performance of optimal detectors at the adversary. Matching achievable and converse results are presented.

cs.IT

Sequence Reconstruction over the Deletion Channel

In this paper, we consider the Levenshtein's sequence reconstruction problem in the case where the transmitted codeword is chosen from $\{0,1\}^n$ and the channel can delete up to $t$ symbols from the transmitted codeword. We determine the minimum number of channel outputs (assuming that they are distinct) required to reconstruct a list of size $\ell-1$ of candidate sequences, one of which corresponds to the original transmitted sequence. More specifically, we determine the maximum possible size of the intersection of $\ell \geq 3$ deletion balls of radius $t$ centered at $x_1, x_2, \dots, x_{\ell}$, where $x_i \in \{0,1\}^n$ for all $i \in \{1,2,\dots,\ell\}$ and $x_i \neq x_j$ for $i \neq j$, with $ n \geq t+\ell-1$ and $t \geq 1$.

cs.IT

A generalization of the map $χ$

The mapping $ χ_n:\mathbb{F}_2^n \to \mathbb{F}_2^n$ defined by $y=χ_n(x)$ with $y_i = x_i + x_{i+1}x_{i+2} + x_{i+2}$, where the indices are computed modulo $n$, has been widely studied for its application in lightweight cryptography. In this paper, we generalize this mapping and completely characterize all these shift-invariant permutations of the form $y_i=x_{i+u}+x_{i+v}(x_{i+w}+a_i)$, where $0\le u, v, w<n$ and $a_i\in \mathbb{F}_2$, $1\le i\le n$.

cs.IT