4.7 Article

Packet Error Probability and Effective Throughput for Ultra-Reliable and Low-Latency UAV Communications

Journal

IEEE TRANSACTIONS ON COMMUNICATIONS
Volume 69, Issue 1, Pages 73-84

Publisher

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TCOMM.2020.3025578

Keywords

UAV; URLLC; packet error probability; effective throughput; short packet transmission

Funding

  1. Natural Science Foundation of Jiangsu Province for Distinguished Young Scholars [BK20190012]
  2. NSFC [61871109, 61941115]
  3. U.K. Engineering and Physical Sciences Research Council [EP/S02476X/1]
  4. EPSRC [EP/S02476X/1] Funding Source: UKRI

Ask authors/readers for more resources

This paper studies the average packet error probability (APEP) and effective throughput (ET) of the control link in unmanned-aerial-vehicle (UAV) communications, focusing on the use of short packets for low-latency requirements. Analytical expressions are derived for these metrics in both free space (FS) and 3-Dimensional (3D) channel models, and optimal packet length is obtained through one-dimensional search to maximize ET. The results are validated through Monte-Carlo simulations.
In this paper, we study the average packet error probability (APEP) and effective throughput (ET) of the control link in unmanned-aerial-vehicle (UAV) communications, where the ground central station (GCS) sends control signals to the UAV that requires ultra-reliable and low-latency communications (URLLC). To ensure the low latency, short packets are adopted for the control signal. As a result, the Shannon capacity theorem cannot be adopted here due to its assumption of infinite channel blocklength. We consider both free space (FS) and 3-Dimensional (3D) channel models by assuming that the locations of the UAV are randomly distributed within a restricted space. We first characterize the statistical characteristics of the signal-to-noise ratio (SNR) for both FS and 3D models. Then, the closed-form analytical expressions of APEP and ET are derived by using Gaussian-Chebyshev quadrature. Also, the lower bounds are derived to obtain more insights. Finally, we obtain the optimal value of packet length with the objective of maximizing the ET by applying one-dimensional search. Our analytical results are verified by the Monte-Carlo simulations.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available