Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2412.19973

An Overview of Cellular ISAC for Low-Altitude UAV: New Opportunities and Challenges

Yuxuan Song·Yong Zeng·Yuhang Yang·Zixiang Ren·Gaoyuan Cheng·Xiaoli Xu·Jie Xu·Shi Jin·Rui Zhang
View original source ↗Read source document ↗Export metadata ↓

Abstract

Low-altitude unmanned aerial vehicles (UAVs) are expected to play an important role in future wireless networks, either as aerial base stations (BSs) or aerial users connected to the cellular network. In addition, integrated sensing and communication (ISAC) has been identified as one of the six usage scenarios for the forthcoming sixth-generation (6G) mobile networks, aimed at improving network functionalities and realizing situational awareness of the physical world. While most existing research efforts focus on terrestrial two-dimensional (2D) communication and sensing, UAV as an aerial platform offers a new degree of freedom for designing three-dimensional (3D) air-ground (AG) ISAC networks. In this article, we provide an overview of cellular-connected UAV ISAC, by elaborating the UAV's roles as a target to be sensed and as an aerial anchor to provide sensing functionality, respectively. In particular, we pay attention to the network coverage issue and topics specific to UAV networking, emphasizing the new opportunities as well as unique challenges to be addressed.

Explore related subjects

cs.ITmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yuxuan Song, Yong Zeng, Yuhang Yang, Zixiang Ren, Gaoyuan Cheng, Xiaoli Xu, Jie Xu, Shi Jin, Rui Zhang. 2024-12-28. An Overview of Cellular ISAC for Low-Altitude UAV: New Opportunities and Challenges. https://arxiv.org/abs/2412.19973

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

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗
arXiv2026

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↗