MmWave UAV Networks with Multi-cell Association: Performance Limit and Optimization

Chun-Hung Liu; Kai-Hsiang Ho; Jwo-Yuh Wu

Home/Archive/arXiv

arXiv · 1905.06099

MmWave UAV Networks with Multi-cell Association: Performance Limit and Optimization

Chun-Hung Liu·Kai-Hsiang Ho·Jwo-Yuh Wu

View original source ↗Read source document ↗Export metadata ↓

Abstract

This paper aims to exploit the fundamental limits on the downlink coverage and spatial throughput performances of a cellular network comprised of a tier of unmanned aerial vehicle (UAV) base stations (BSs) using the millimeter wave (mmWave) band and a tier of ground BSs using the ultra high frequency (UHF) band. To reduce handover signaling overhead, the ground BSs take charge of control signaling delivery whereas the UAVs are in charge of payload data transmission so that users need to be simultaneously associated with a ground BS and a UAV in this network with a control-data plane-split architecture. We first propose a three-dimensional (3D) location distribution model of the UAVs using stochastic geometry which is able to generally characterize the positions of the UAVs in the sky. Using this 3D distribution model of UAVs, two performance metrics, i.e., multi-cell coverage probability and volume spectral efficiency, are proposed. Their explicit low-complexity expressions are derived and their upper limits are found when each of the UAVs and ground BSs is equipped with a massive antenna array. We further show that the multi-cell coverage probability and the volume spectral efficiency can be maximized by optimally deploying and positioning the UAVs in the sky and thereby their fundamental maximal limits are found. These important analytical findings are validated by numerical simulations.

Explore related subjects

cs.IT math.IT

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Chun-Hung Liu, Kai-Hsiang Ho, Jwo-Yuh Wu. 2019-08-19. MmWave UAV Networks with Multi-cell Association: Performance Limit and Optimization. https://arxiv.org/abs/1905.06099

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

KEEP EXPLORING

Related papers

arXiv2026

Bistatic Target Detection by Exploiting Both Deterministic Pilots and Unknown Random Data Payloads

Integrated sensing and communication (ISAC) plays a crucial role in 6G, to enable innovative applications such as drone surveillance, urban air mobility, and low-altitude logistics. However, the hybrid ISAC signal, which comprises deterministic pilot and random data payload components, poses challenges for target detection due to two reasons: 1) these two components cause coupled shifts in both the mean and variance of the received signal, and 2) the random data payloads are typically unknown to the sensing receiver in the bistatic setting. Unfortunately, these challenges could not be tackled by existing target detection algorithms. In this paper, a generalized likelihood ratio test (GLRT)-based detector is derived, by leveraging the known deterministic pilots and the statistical characteristics of the unknown random data payloads. Due to the analytical intractability of exact performance characterization, we perform an asymptotic analysis for the false alarm probability and detection probability of the proposed detector. The results highlight a critical trade-off: both deterministic and random components improve detection reliability, but the latter also brings statistical uncertainty that hinders detection performance. Simulations validate the theoretical findings and demonstrate the effectiveness of the proposed detector, which highlights the necessity of designing a dedicated detector to fully exploited the signaling resources assigned to random data payloads.

cs.IT↗

arXiv2026

On Unbiased Parameter Estimation and Signal Reconstruction

In this paper, we extend the theory of depth-unbiased source localization to unbiased parameter estimation and signal reconstruction for an arbitrary number of non-zero parameters. The topic touches on exact reconstructibility, most commonly studied in compressed sensing and multisource estimation across various imaging problems. The theoretical results derive upper bounds on the number of recoverable parameters in the noiseless case, and define a probability measure to assess the likelihood of recovering all non-zero parameters with correct magnitude order. The work provides a mathematical explanation of the open question regarding the noise robustness of standardized and unbiased methods. The paper also reveals a trade-off between the number of sensors and the signal-to-noise ratio. Numerical experiments demonstrate the theoretical findings.

cs.IT↗

arXiv2026

Minimum enclosing Bregman balls made easy

In this work, we revisit the problem of computing minimum enclosing Bregman balls (Bregman MEBs) of finite sets of parameters. First, we show that Bregman MEBs are equivalent to MEBs of corresponding weighted point sets with respect to the power distance. We then report an efficient Frank--Wolfe $(1+ε)$-approximation algorithm for computing power MEBs, for any $ε>0$. This power MEB approximation algorithm coincides with the Bregman MEB approximation algorithm of Nock and Nielsen (2005) when expressed in the dual gradient space. Finally, we show that the Bregman potential lifting transforms used to construct Bregman Voronoi diagrams can be reinterpreted as the classical paraboloid lifting transform applied to corresponding weighted point sets. In particular, Bregman MEB circumcenters lie on the farthest Bregman Voronoi diagrams or equivalently on the corresponding farthest power diagrams.

cs.IT↗