Search arXivSearch

arXiv · 2604.26113

Multi-TRP Assisted UAV Detection in 3GPP 5G-Advanced ISAC Network

Abstract

ISAC is currently being standardized within the 3GPP New Radio (NR) to enable cellular infrastructure to perform sensing using existing communication waveforms. While standardization is progressing, practical deployment may be limited by scenario-dependent observability constraints. For example, in UMa-AV scenarios, sensing with a single TRP can be affected by restricted angular coverage, partial blockage, and limited field of view, which may degrade detection reliability in three-dimensional UAV environments. For this reason, multi-TRP solutions have been suggested to improve spatial diversity and sensing robustness. In this paper, we present a system-level investigation of multi-TRP assisted monostatic sensing for UAV detection under standardized 3GPP UMa-AV channel assumptions and Release 19 evaluation parameters. We propose a spatial diversity fusion framework and evaluate the achievable performance of a 3GPP network by combining the measurements obtained independently at different TRP. Extensive evaluations demonstrate that multi-TRP assistance improves target observability, reduces spurious detections, and tightens localization error distributions at the cost of additional sensing overhead due to the need for multiple TRPs to periodically allocate radio resources for sensing measurements. In the evaluated scenario, results show that a voting threshold of two assisting TRPs achieves an optimal trade-off between miss detection probability and false alarm suppression, meeting 3GPP performance objectives. Furthermore, we quantify the sensing overhead and show that proper system design, tuned to the application requirements, can substantially reduce its impact: for example, extending the sensing refresh interval beyond the 128 ms coherent processing interval to 1 s reduces the effective overhead from 29 % to approximately 3.7 %, enabling more scalable network deployment.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Neeraj Varshney, Steve Blandino, Jian Wang, Anuraag Bodi, Camillo Gentile, Nada Golmie. 2026-05-01. Multi-TRP Assisted UAV Detection in 3GPP 5G-Advanced ISAC Network. https://arxiv.org/abs/2604.26113

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