Search arXivSearch

arXiv · 1710.10389

Blocking Probability and Spatial Throughput Characterization for Cellular-Enabled UAV Network with Directional Antenna

Abstract

The past few years have witnessed a tremendous increase on the use of unmanned aerial vehicles (UAVs) in civilian applications, which call for high-performance communication between UAVs and their ground clients, especially when they are densely deployed. To achieve this goal, cellular base stations (BSs) can be leveraged to provide a new and promising solution to support massive UAV communications simultaneously in a cost-effective way. However, different from terrestrial communication channels, UAV-to-BS channels are usually dominated by the light-of-sight (LoS) link, which aggravates the co-channel interference and renders the spatial frequency reuse in existing cellular networks ineffective. In this paper, we consider the use of a directional antenna at each UAV to confine the interference to/from other UAV users within a limited region and hence improve the spatial reuse of the spectrum. Under this model, a UAV user may be temporarily blocked from communication if it cannot find any BS in its antenna main-lobe, or it finds that all BSs under its main-lobe are simultaneously covered by those of some other UAVs and hence suffer from strong co-channel interference. Assuming independent homogeneous Poisson point processes (HPPPs) for the UAVs' and ground BSs' locations respectively, we first analytically derive a closed-form upper bound for the UAV blocking probability and then characterize the achievable average spatial throughput of the cellular-enabled UAV communication network, in terms of various key parameters including the BS/UAV densities as well as the UAV's flying altitude and antenna beamwidth. Simulation results verify that the derived bound is practically tight, and further show that adaptively adjusting the UAV altitude and/or beamwidth with different BS/UAV densities can significantly reduce the UAV blocking probability and hence improve the network spatial throughput.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jiangbin Lyu, Rui Zhang. 2017-10-28. Blocking Probability and Spatial Throughput Characterization for Cellular-Enabled UAV Network with Directional Antenna. https://arxiv.org/abs/1710.10389

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

KEEP EXPLORING

Related papers

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

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

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