Search arXivSearch

arXiv · 2606.06307

A Spherical Stochastic Geometry Framework for Patrol-Based HAPs Network: Coverage and Energy Efficiency Analysis

Abstract

This paper develops a stochastic-geometry framework for high-altitude platform station (HAPs) networks in which platforms execute cyclic patrol trajectories anchored to designated service regions. We introduce two small-circle ring Cox process models on the spherical Earth. In the small-circle ring Poisson Cox process (SCR-PCP), platforms form one-dimensional Poisson point processes on localized patrol rings, whereas in the small-circle ring binomial Cox process (SCR-BCP), each ring contains a fixed number of uniformly distributed platforms. We establish the isotropy of both models and derive spatial statistics, including the distributions of the nearest-anchor, nearest-ring, and nearest-HAPs distances, together with the joint serving distance and serving ring angle distribution required for SCR-BCP analysis. Building on these results, we derive coverage probability expressions under nearest-HAPs association by decomposing aggregate interference into same-ring and other-ring components and characterizing their conditional Laplace transforms. To account for the flight dynamics of patrol-based HAPs, we integrate a steady circular flight propulsion model with the communication analysis and introduce a coverage energy efficiency (CEE) metric. This yields an analytical condition for the energy-optimal patrol radius that balances coverage performance against the propulsion cost of circular flight. Numerical results reveal fundamental differences between intensity-driven (SCR-PCP) and finite-fleet (SCR-BCP) deployments and demonstrate that patrol geometry, platform density, and cruising velocity should be jointly optimized to achieve energy-efficient HAPs operation.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Mohammad Taha Shah, Mohamed-Slim Alouini. 2026-06-04. A Spherical Stochastic Geometry Framework for Patrol-Based HAPs Network: Coverage and Energy Efficiency Analysis. https://arxiv.org/abs/2606.06307

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