Achievable Data Rate for URLLC-Enabled UAV Systems with 3-D Channel Model

Arumugam Nallanathan; Cunhua Pan; Hong Ren; Kezhi Wang; Maged Elkashlan; Yansha Deng

arxiv: 1907.06557 · v1 · pith:345GVCK6new · submitted 2019-07-15 · 📡 eess.SP

Achievable Data Rate for URLLC-Enabled UAV Systems with 3-D Channel Model

Hong Ren , Cunhua Pan , Kezhi Wang , Yansha Deng , Maged Elkashlan , Arumugam Nallanathan This is my paper

Pith reviewed 2026-05-24 21:14 UTC · model grok-4.3

classification 📡 eess.SP

keywords UAV communicationsURLLC3-D channel modelachievable data ratefinite blocklengthlower boundGaussian-Chebyshev quadraturecontrol information

0 comments

The pith

A closed-form tight lower bound is derived for the average achievable data rate of short-blocklength URLLC control links to UAVs in 3-D channels.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper establishes a closed-form lower bound on the average achievable data rate for delivering control information from a ground station to a UAV. The setting uses finite-blocklength rate expressions required by ultra-reliable low-latency communications to support collision avoidance. With the UAV position modeled as uniform inside a bounded volume, the position-averaged rate is first approximated by Gaussian-Chebyshev quadrature and then bounded analytically from below. A reader cares because the resulting expression directly informs the largest safe packet size for control messages without repeated Monte Carlo runs.

Core claim

The authors show that the average achievable data rate for GCS-to-UAV control delivery under a 3-D channel and short channel blocklength admits a tight closed-form lower bound. They first apply Gaussian-Chebyshev quadrature to approximate the exact position-averaged rate and then derive the closed-form lower bound on that quantity.

What carries the argument

Gaussian-Chebyshev quadrature approximation of the position integral, followed by closed-form lower bounding of the finite-blocklength achievable rate expression averaged over uniform UAV location.

If this is right

The closed-form bound enables direct computation of AADR for varying transmit power, blocklength, or altitude without numerical integration.
Control packet sizes for URLLC UAV operation can be chosen from the AADR value to meet reliability targets.
The 3-D channel model is folded into the rate expression, producing realistic performance predictions for aerial links.
Numerical verification confirms the bound remains tight across the examined parameter ranges.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

The bound could be inserted into an optimization routine to choose ground-station height or frequency that maximizes AADR for a fleet of UAVs.
Replacing the uniform density with an altitude-dependent density (for example, higher near airports) would test whether a similar closed-form bound can still be obtained.
If the bound is used for real-time packet adaptation, latency introduced by the 3-D path-loss calculation must remain negligible compared with the URLLC deadline.

Load-bearing premise

The UAV location is assumed to be uniformly distributed inside the restricted space, allowing the position average to reduce to a single integral that can be bounded.

What would settle it

A direct Monte Carlo computation of the exact AADR for a non-uniform UAV position distribution that lies well above or below the closed-form lower bound would show the bound does not hold outside the uniform case.

read the original abstract

In this paper, we investigate the average achievable data rate (AADR) of the control information delivery from the ground control station (GCS) to unmanned-aerial-vehicle (UAV) under a 3-D channel, which requires ultra-reliable and low-latency communications (URLLC) to avoid collision. The value of AADR can give insights on the packet size design. Achievable data rate under short channel blocklength is adopted to characterize the system performance. The UAV is assumed to be uniformly distributed within a restricted space. We first adopt the Gaussian-Chebyshev quadrature (GCQ) to approximate the exact AADR. The tight lower bound of AADR is derived in a closed form. Numerical results verify the correctness and tightness of our derived results.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Desk Editor's Note private letter to a colleague

The paper turns the position-averaged short-blocklength rate into a closed-form lower bound via GCQ for one UAV control scenario under uniform distribution and 3D channels.

read the letter

The core result is a closed-form lower bound on the average achievable data rate for short-packet control links from a ground station to a UAV, where the average is taken over the UAV's location in a 3D space. They start from the standard finite-blocklength rate expression, assume the UAV position is uniform inside a restricted volume, set up the expectation integral, apply Gaussian-Chebyshev quadrature for an approximation, and then derive the lower bound in closed form. Numerical checks confirm the bound stays close to the quadrature result across the plotted parameters.

Referee Report

2 major / 2 minor

Summary. The paper investigates the average achievable data rate (AADR) for control information delivery from a ground control station to a UAV under a 3-D channel model in a URLLC setting. It adopts the short-blocklength achievable rate, assumes the UAV is uniformly distributed in a restricted space, approximates the exact AADR via Gaussian-Chebyshev quadrature (GCQ), derives a claimed tight closed-form lower bound on the AADR, and presents numerical results to verify correctness and tightness.

Significance. If the closed-form lower bound is valid and tight under the stated assumptions, the result offers a practical tool for packet-size design in URLLC UAV control links. The combination of short-blocklength rate analysis with a 3-D channel model and quadrature-based approximation addresses a relevant engineering problem; the explicit closed-form bound (when it holds) is a strength for system-level insights.

major comments (2)

[Derivation of lower bound (following the GCQ approximation)] The derivation of the closed-form lower bound relies on integrating the short-blocklength rate over the uniform spatial density of the UAV; any deviation from uniformity alters both the integral and the resulting expression, so the scope of the closed-form result must be stated explicitly in the main derivation section.
[Numerical results section] The abstract asserts that numerical results verify the tightness of the lower bound and correctness of the GCQ approximation, but without reported quantitative error metrics (e.g., relative gap to the exact integral or to Monte-Carlo benchmarks) it is difficult to assess how tight the bound actually is across the parameter range.

minor comments (2)

[System model] Notation for the 3-D channel parameters (path-loss exponents, shadowing variances, etc.) should be introduced consistently before the AADR integral is written.
[System model] The restricted space in which the UAV is uniformly distributed should be given explicit dimensions or coordinates so that the averaging integral can be reproduced.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the positive assessment and constructive comments. We address each major comment below and will incorporate the suggested clarifications and additions in the revised manuscript.

read point-by-point responses

Referee: [Derivation of lower bound (following the GCQ approximation)] The derivation of the closed-form lower bound relies on integrating the short-blocklength rate over the uniform spatial density of the UAV; any deviation from uniformity alters both the integral and the resulting expression, so the scope of the closed-form result must be stated explicitly in the main derivation section.

Authors: We agree. The closed-form lower bound is obtained by integrating under the uniform spatial density assumption stated in the system model. In the revised manuscript we will add an explicit statement in the derivation section clarifying that the closed-form expression holds specifically for the uniform distribution of the UAV. revision: yes
Referee: [Numerical results section] The abstract asserts that numerical results verify the tightness of the lower bound and correctness of the GCQ approximation, but without reported quantitative error metrics (e.g., relative gap to the exact integral or to Monte-Carlo benchmarks) it is difficult to assess how tight the bound actually is across the parameter range.

Authors: We agree that quantitative metrics would improve the assessment. In the revised version we will augment the numerical results section with relative error values (e.g., the gap between the GCQ approximation and the exact integral, and between the lower bound and Monte-Carlo benchmarks) evaluated over the considered parameter ranges. revision: yes

Circularity Check

0 steps flagged

No circularity; derivation rests on explicit modeling assumptions and standard approximations without self-referential reduction

full rationale

The paper states an explicit assumption that the UAV is uniformly distributed within a restricted space, defines AADR as the expectation of the short-blocklength rate over that distribution, applies the Gaussian-Chebyshev quadrature to approximate the integral, and then derives a closed-form lower bound. This chain is self-contained: the uniform pdf is an input modeling choice, not a quantity derived from the bound itself; the GCQ step is a numerical approximation technique; and no parameters are fitted to data and then relabeled as predictions. No self-citations, uniqueness theorems, or ansatzes are invoked in the provided abstract or description to close any loop. The result is therefore a direct consequence of the stated assumptions rather than equivalent to them by construction.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

Review performed on abstract only; full derivation and any hidden modeling choices unavailable.

axioms (1)

domain assumption UAV position is uniformly distributed within a restricted space.
Stated in abstract; used to compute the spatial average of the achievable rate.

pith-pipeline@v0.9.0 · 5679 in / 1069 out tokens · 16071 ms · 2026-05-24T21:14:30.688095+00:00 · methodology

discussion (0)

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

IndisputableMonolith/Foundation/AlexanderDuality.lean alexander_duality_circle_linking unclear

?

unclear
Relation between the paper passage and the cited Recognition theorem.

The UAV is assumed to be uniformly distributed within a restricted space... fd(x) = 3x²/(D³-r³)
IndisputableMonolith/Cost/FunctionalEquation.lean washburn_uniqueness_aczel echoes

?

echoes
ECHOES: this paper passage has the same mathematical shape or conceptual pattern as the Recognition theorem, but is not a direct formal dependency.

R(γ) = log2(1+γ) - ... f(x) is ... convex ... E{R(γ)} ≥ f(E{1/γ})

What do these tags mean?

matches: The paper's claim is directly supported by a theorem in the formal canon.
supports: The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends: The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses: The paper appears to rely on the theorem as machinery.
contradicts: The paper's claim conflicts with a theorem or certificate in the canon.
unclear: Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.