Search arXivSearch

arXiv · 2606.28940

Modeling and Analysis of Sensing Assisted UAV Networks for Urban Vehicular Communications

Abstract

Urban vehicular networks (VNs) demand seamless connectivity and situational awareness within road-constrained environments, motivating the deployment of unmanned aerial vehicles (UAVs) platforms capable of simultaneously sensing vehicles and establishing communication with them. In this paper, we present a sensing-assisted UAV network that provides connectivity to the vehicles in an urban area. The road network of the urban area is modeled as Manhattan Poisson line process (MPLP), and the random location of vehicles on each road is modeled as one dimensional Poisson point processes (PPPs). UAVs are distributed in the urban area at a fixed altitude and provide connectivity after sensing the vehicles. Their locations are modeled as a two-dimensional homogeneous PPP. Combined with the fixed altitude, this results in a three-dimensional spatial configuration. We incorporate an elevation dependent blockage model and define the sensing radius based on detection probability (DP), showing that it is jointly limited by signal strength and blockage effects. We derive the DP and characterize the typical UAV's sensing region within the reliability requirements. We also derive the Laplace transform (LT) of aggregate interference accounting for directional patterns and sensing-driven activity, and analyze the resulting coverage probability (CP). Finally, we obtain the rate coverage (RC) of sensed vehicles falling within the UAV's sensing zone. Numerical results shows that increasing altitude degrades sensing and coverage performance, whereas RC exhibits a non-monotonic trend, first decreasing and then increasing with altitude.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Kaushlendra Pandey, Nithin V Sabu, Abhishek K. Gupta. 2026-06-27. Modeling and Analysis of Sensing Assisted UAV Networks for Urban Vehicular Communications. https://arxiv.org/abs/2606.28940

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