Joint Information-Theoretic Secrecy and Covertness for UAV-Assisted Wireless Transmission With Finite Blocklength

Abstract

In this paper, we study a novel joint information-theoretic secrecy and covertness model for an unmanned aerial vehicle (UAV)-assisted finite blocklength transmission system, in which an UAV delivers classified information to a ground user (Bob) in the presence of two unauthorized users (Eve and Willie). Specifically, Eve tries to decode the legitimate information while Willie tries to detect if the UAV's transmission is present or not. Firstly, we assume that the perfect location knowledge of both Eve and Willie is known at the UAV. In this scenario, to guarantee security and covertness, the average secrecy rate maximization problem is formulated via joint design of the UAV's transmit power and three dimensional (3D) trajectory under Willie's covertness constraint. Technically speaking, the optimization problem is non-convex and mathematically intractable to tackle owing to the coupling of multiple variables. To address this non-convex problem, an iterative alternating optimization (AO) algorithm is developed with the assistance of the successive convex approximation (SCA) technique. After that, we extend the system model to both Eve's and Willie's imperfect location knowledge case, which is more sophisticated compared to the perfect location knowledge case due to the uncertain location constraints. We still utilize the iterative AO algorithm combined with SCA and <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$\mathcal {S}$</tex-math></inline-formula> -procedure techniques to cope with the nonconvex problem. Numerical results indicate that our proposed 3D optimization algorithm performs better than the conventional two dimensional (2D) scheme and the benchmark scheme for both perfect and imperfect location knowledge cases.