Search arXivSearch

arXiv · 2604.06657

Network-Wide PAoI Guarantee in CF-mMIMO Networks with S&C Coexistence: A Unified Framework for Spatial Partitioning Toward xURLLC

Abstract

As a key capability of 6G, sensing-communication (S&C) coexistence over distributed infrastructure is expected to support next-generation ultra-reliable and low-latency communication (xURLLC) applications, which demand both robust connectivity and real-time environmental awareness. This paper investigates network-wide information freshness in large-scale cell-free massive multiple-input multiple-output (CF-mMIMO) with S&C coexistence. A challenge arises from the spatial partitioning of access points (APs) into S&C roles: allocating more APs to sensing improves update generation, whereas allocating more APs to communication enhances reliable short-packet delivery. To address this, we develop a unified analytical framework by combining stochastic geometry and stochastic network calculus (SNC) to characterize the peak age of information (PAoI) violation probability (PAVP). Specifically, we derive the moment generating functions (MGFs) of sensory packet inter-arrival and service times, accounting for the joint stochastic spatial distribution of APs and users, imperfect channel state information (CSI), and finite blocklength coding (FBC). This facilitates the derivation of a tractable upper bound on the PAVP, which is minimized to determine the optimal AP partitioning. The derived bound accurately captures the performance trend and yields a minimizing partition factor that closely matches simulations. Therefore, the framework provides an efficient and low-complexity tool for network-wide PAoI guarantee and coexistence-oriented design in CF-mMIMO networks toward xURLLC.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yanxi Zhang, Mingwu Yao, Qinghai Yang, Muyu Mei. 2026-04-08. Network-Wide PAoI Guarantee in CF-mMIMO Networks with S&C Coexistence: A Unified Framework for Spatial Partitioning Toward xURLLC. https://arxiv.org/abs/2604.06657

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