Skip to Content
SensorsSensors
  • Article
  • Open Access

16 May 2026

25 Pages

On Fixed-Wing Drone-Enabled Covert Transmission with Mobility Restrictions and QoS Requirement

,
and
1
School of Information Science and Technology, Nantong University, Nantong 226019, China
2
Xinglin College, Nantong University, Nantong 226236, China
*
Author to whom correspondence should be addressed.

Highlights

What are the main findings?
  • A joint optimization algorithm is developed to maximize the covert rate by adjusting a fixed-wing drone’s transmit power and speed, and seeking the optimal central position and radius of its flight area.
  • To maximize the covert rate, there exists a distance threshold between the receiver and the detector that is determined by the drone’s minimum flight speed and maximum bank angle. Below the threshold, the drone should fly as high as possible; above it, as low as possible.
What are the implications of the main findings?
  • The proposed optimization algorithm can fully utilize the fixed-wing drone’s maneuverability to select both the flight area and altitude based on the distance from the detector.
  • Within the derived flight area, the drone is capable of delivering covert data at the optimized covert rate while meeting the required level of quality of service.

Abstract

This article examines a fixed-wing drone (FWD)-enabled covert transmission, where the FWD performs a level flight within a circular area with a radius of r R meters and serves as a mobile transmitter to covertly deliver data to a ground receiver situated d 0 meters away from a ground detector. First, the conditions for satisfying the covertness constraint and meeting the transmission’s quality of service (QoS) requirement are derived, imposing additional mobility restrictions on the FWD beyond the predefined speed and altitude limits. Considering the FWD’s mobility and transmit power limits, an optimization problem maximizing the covert rate is solved, leading to a joint optimization algorithm that adjusts the FWD’s transmit power and speed while seeking the optimal central position and radius of the circular area. Within this area, the FWD is capable of performing an unrestricted level flight and delivering covert data at the optimized covert rate while meeting the required QoS level. Computer simulation results demonstrate that the smaller the radius r R , the larger the covert rate will be. The minimum value of r R is twice the FWD’s minimum turning radius, which is determined by the minimum flight speed and the maximum bank angle. The FWD’s flight altitude exhibits a strong correlation with both r R and d 0 . If 2 r R < d 0 ≤ 4 r R , the FWD should fly as high as possible. Conversely, if d 0 > 4 r R , the FWD should fly as low as possible so as to maximize the covert rate.

1. Introduction

Recently, drones, relying on their controllable high mobility, flexible on-demand deployment, and high probability of establishing line-of-sight (LoS) connections, have provided new avenues for supplementing wireless services while improving transmission range and quality in specific environments [1]. In practical applications, two types of drones (i.e., rotor-wing and fixed-wing drones) with necessary communication facilities can be deployed to offer data delivery or relaying services for air and ground users [2]. Compared with rotary-wing drones (RWDs), fixed-wing drones (FWDs) have inherent merits in various aspects, such as long endurance and large payloads, and hence play an increasingly important role in civilian, military, and commercial applications [2]. However, FWDs cannot hover in the air and must always fly forward so as to obtain lift [3]. Thus, FWDs face greater mobility restrictions and inferior maneuverability compared to RWDs. This flight characteristic results in two constraints for covert communications. First, FWDs cannot hover and must always fly forward to stay in the air. Second, unlike rotor-wing drones (RWDs), which can hover in place and change position freely, FWDs have a turning radius constrained by speed and bank angle, preventing arbitrarily sharp turns. Consequently, most covert communication schemes designed for RWDs are not suitable for FWDs.
As mentioned earlier, drone-assisted air-to-ground and ground-to-air transmissions are most likely to benefit from LoS connections, resulting in not only an improvement in transmission quality but also an increase in the risk of being detected or intercepted [2]. Covert communication, also referred to as low probability of detection communication, is expected to solve privacy protection and security issues in wireless communications [4]. The fundamental idea of covert communication is to handle data delivery from a transmitter to a receiver, subject to a constraint on a detector’s detection error probability (DEP). If the DEP is kept above 1 − ϑ for a positive and arbitrarily small ϑ , the communication behavior is presumed to be hidden from the detector [5]. Nowadays, to protect communication security, the idea of covert communication has been implemented in many fields such as underwater acoustic communication [6], the internet of vehicles [7] and satellite–terrestrial networks [8].
In view of their merits, drones are also capable of enhancing the covertness of wireless transmissions; hence, drone-enabled covert technologies have recently attracted much attention. In [9,10,11,12,13], drones are deployed to serve as legitimate transmitters or receivers to deliver or collect data. Then, transmit power control and optimal placement or trajectory are examined so as to optimize the transmission quality while satisfying the covertness constraint. Provided that the drone is a flying detector or a friendly jammer, effective strategies are devised so that data deliveries between ground transceivers are hidden [14,15]. By combining with advanced communication techniques, such as non-orthogonal multiple access, intelligent reflecting surface, maximum ratio transmission and zero-forcing, drone-enabled covert transmissions are examined in [16,17,18,19], leading to various types of covert communication technologies. Considering specific wireless environments such as cognitive radio, and integrated sensing and communication, drones are employed to hide target transmissions from intended detectors [20,21].
It should be noted that in the aforementioned studies, the drones are assumed to either remain stationary or follow fixed trajectories (from a start to an end location) with constrained speeds and altitudes. This scenario essentially models an RWD-enabled covert transmission. Given their inherent merits, FWDs are widely deployed to assist wireless transmissions, especially in the military area, where communication security is of utmost importance [2]. Therefore, it is imperative to examine FWD-enabled covert transmissions. As mentioned earlier, FWDs face greater mobility restrictions than RWDs and their maneuverability is not only affected by flight speed and altitude but also by factors such as the maximum bank angle [3]. Therefore, for FWD-enabled covert transmissions, not only DEP constraint but also the drone’s mobility restrictions should be considered. To the authors’ best knowledge, such an issue is still open and requires further research.
This article considers an FWD-enabled covert transmission, where the drone performs a level flight within a circular area with a radius of r R meters and serves as a mobile transmitter to covertly deliver data to Bob situated d 0 meters away from Willie. With the aim of maximizing the covert rate, a joint optimization problem is established and solved, leading to a new optimization algorithm. The main contributions of this article are summarized as follows.
  • Provided that Willie is equipped with a power detector so as to identify potential communication behaviors, the conditions for satisfying the covertness constraint and meeting the transmission’s quality of service (QoS) requirement are derived, imposing additional mobility restrictions on the FWD beyond the predefined speed and altitude limits.
  • Considering the FWD’s mobility and transmit power limits, an optimization problem maximizing the covert rate is solved, leading to a joint optimization algorithm that adjusts the FWD’s transmit power and speed while seeking the optimal central position and radius of the circular area. Within this area, the FWD is capable of performing an unrestricted level flight and delivering covert data at the optimized covert rate while meeting the required QoS level.
  • Computer simulations are conducted to verify the correctness and effectiveness of the investigations. It demonstrates that the smaller the radius r R , the larger the covert rate will be. The minimum value of r R is twice the FWD’s minimum turning radius, which is determined by the minimum flight speed and the maximum bank angle. The FWD’s flight altitude is strongly correlated with the values of r R and d 0 . If 2 r R < d 0 ≤ 4 r R , the FWD should fly as high as possible. Conversely, if d 0 > 4 r R , the FWD should fly as low as possible so as to maximize the covert rate.
The remainder of this article is organized as follows. The examined system model is presented in Section 2. In Section 3, the conditions for satisfying the covertness constraint and meeting the transmission’s QoS requirement are derived. On this basis, an optimization problem maximizing the covert rate is established. In Section 4, the optimization problem is solved, leading to a joint optimization algorithm that adjusts the FWD’s transmission power and speed while seeking the optimal central position and radius of the circular area. Simulation results and discussions are presented in Section 5 so as to verify the correctness and effectiveness of the proposed optimization algorithm. Section 6 concludes this article.

3. System Model

Figure 1 shows the examined system model, where an FWD R serves as a mobile transmitter to covertly deliver data to Bob; meanwhile, Willie dedicates to detecting whether such a communication behavior exists. Suppose that R performs an unrestricted level flight within a circular area D , where R is capable of delivering covert data to Bob at any time. Here, that means the FWD operates within a cylindrical region defined by a horizontal disk D of radius r R and an altitude range of h min , h max . Within this cylinder, the UAV can maneuver freely (i.e., follow a spiral trajectory) as long as it respects its kinematic constraints. In addition, the unrestricted level flight means that R can start its flight from the central position of D in any direction and then fly back to the starting position, and during this process, R is always within D without changing its altitude and speed. Denote by T the period of time during which R performs such a flight at a speed of v . Denote by x 0 , y 0 , h and r R the central position and the radius of D , respectively, where x 0 , y 0 is its horizontal coordinate and h is the FWD’s flight altitude. It should be noted that x 0 , y 0 , h determines the location of D , while r R affects the size of D . Suppose that R only flies in the airspace above Willie and Bob and hence, the location and the radius of D will be restricted, which leads to r R ≤ x 0 ≤ d 0 − r R and 0 < r R ≤ d 0 / 2 . Willie and Bob are situated at q w = 0 , 0 , 0 and q B = d 0 , 0 , 0 , respectively, where d 0 = q w − q B is the distance between Willie and Bob, and q w and q B are assumed to be known to R.
Figure 1. System model.
As is well known, an FWD must always fly forward so as to obtain lift and hence, there should be a minimum speed limit (also known as stall speed) [3]. On the other hand, an FWD’ s structure will be stressed beyond the limit load factor when it flies in excess of a design maneuvering speed [3]. Such a design maneuvering speed can be considered as a maximum speed limit. Therefore, R’s flight speed is subject to the following constraint.
V min ≤ v ≤ V max
In Equation (1), V min and V max are the minimum and maximum flight speed limits.
According to the 3GPP (3rd Generation Partnership Project), the probability of existing LoS links between air and ground transceivers is 100% when flying at an altitude greater than 40 m above the ground in rural environments [34]. On the other hand, there should be a maximum flight altitude limit due to the consideration of flight safety and/or the local regulations. Therefore, to ensure the existence of LoS links and flight safety, the flight altitude of the FWD should meet
h min ≤ h ≤ h max ,
where h min and h max are the minimum and maximum altitude limits of the FWD.
In the article, T is divided into N time-slots, and each has an equal length of T N = T / N   . Suppose that T N is sufficiently small; hence, R remains stationary within a time-slot. In the article, H 1 and H 0 are used to denote the events in which covert data are and are not delivered, respectively. Suppose that Willie utilizes a power detector to identify such potential communication behavior. Specifically, Willie conducts m numbers of detection in each time-slot, and then computes the detected average power used as the criterion to judge whether the communication behavior occurs. In time-slot n , the i -th detected signal by Willie can be written as [10]
y W i n = n W i , H 0 P R n h RW x R i n + n W i , H 1 ,
where i ∈ 1 , ⋯ , m and n W i denote the noise at Willie’s location with a power of δ W ; x R i n denotes the i -th detection of x R n , which is a unit power signal and covertly sent by R in time-slot n ; P R n is the transmit power of R in the case that x R n is sent in time-slot n and h RW denotes the channel gain from R to Willie. Since the free space path loss model [11,18] is assumed, h RW can be written as h RW = β 0 / d RW 2 , where β 0 denotes the channel power at unit distance and d RW is the distance between R and Willie. It should be noted that P R n is subject to the following constraint
P min ≤ P R n ≤ P max ,
where P min and P max are the minimum and maximum transmit power limits.
According to the detected signal given by Equation (3), Willie will make a binary judgment D 1 or D 0 . Here, D 1 corresponds to the finding of the communication behavior, while D 0 corresponds to the case that no communication behavior is identified. Similar to [10], the decision rule adopted by Willie can be expressed as
T W n ≜ 1 m ∑ i = 1 m y W i n 2 > D 1 D 0 ≤ λ n ,
where T W n is the average power detected by Willie in time-slot n , y W i n 2 is the signal power detected by Willie during the i -th detection, m is the total number of detections in each time-slot, and λ n is the set detection threshold. Suppose that Willie conducts an infinite number of detections, namely, m → ∞ . Then, T W n can be rewritten as [10,12]
T W n = δ W , H 0 h RW 2 P R n + δ W , H 1 .
In the article, noise uncertainty is considered. In this situation, noise power δ W becomes a random variable with a known distribution. According to [5,35], the noise power δ W in the dB domain can be considered as a uniformly distributed random variable within the interval of δ ⌣ − ρ , δ ⌣ + ρ , where δ ⌣ is the mean value in the dB domain and ρ is the noise uncertainty parameter in the dB domain and meets ρ > 0 . Therefore, the probability density function (PDF) of δ W can be expressed as [5,35]
f δ W x = 5 ln 10 ⋅ 1 ρ x , 10 δ ⌣ − ρ 10 ≤ x ≤ 10 δ ⌣ + ρ 10 0 , others .
Due to the uncertainty about noise power, Willie may make two types of mistakes during the detection process. The first one is called a missed detection, namely, judgment D 0 is made while H 1 happens. The second one is called a false alarm, namely, judgment D 1 is made while H 0 occurs in practice. Denote by P F n and P M n the probabilities of a false alarm and missed detection occurring, respectively. According to the decision rule given by Equation (5), P F n and P M n can be written as
P F n ≜ Pr D 1 | H 0 = Pr δ W > λ n ,
P M n ≜ Pr D 0 | H 1 = Pr h RW 2 P R n + δ W ≤ λ n .
Then, the DEP is defined as the summation of the false alarm and missed detection probabilities and can be expressed as
ε n = P F n + P M n .

4. Performance Analysis and Problem Establishment

It is worth mentioning that from Willie’s point of view, the power detection should be conducted as precisely as possible, meaning that the DEP given by Equation (10) should be as small as possible. From the FWD’s and Bob’s point of view, however, their goal is to keep their communication behavior undetected by Willie and guarantee their transmission quality as well. To this end, the DEP given by Equation (10) is first calculated, obtaining the minimum DEP ε min n . On this basis, the condition for satisfying the covertness constraint is derived by guaranteeing ε min n ≥ 1 − ϑ for a positive and arbitrarily small ϑ . Next, the condition for meeting the FWD’s and Bob’s required QoS is provided. Armed with the two conditions derived, an optimization problem maximizing the covert rate is established.

4.1. Performance Analysis

Using Equation (7), the probabilities of a false alarm and missed detection are calculated as
P F n = 1 , λ n < 10 δ ⌣ − ρ 10 5 ρ ⋅ δ ⌣ + ρ 10 − ln λ n ln 10 , 10 δ ⌣ − ρ 10 ≤ λ n < 10 δ ⌣ + ρ 10 0 , λ n ≥ 10 δ ⌣ + ρ 10
P M n = 0 , λ n < 10 δ ⌣ − ρ 10 + E W n 5 ρ ln λ n − E W n ln 10 − δ ⌣ − ρ 10 , 10 δ ⌣ − ρ 10 + E W n ≤ λ n < 10 δ ⌣ + ρ 10 + E W n 1 , λ n ≥ 10 δ ⌣ + ρ 10 + E W n
where E W n = β 0 P R n / d RW 2 .
It can be observed from Equations (11) and (12) that ε n may tend to 0 if 10 δ ⌣ + ρ 10 < 10 δ ⌣ − ρ 10 + E W n (i.e., E W n > 10 δ ⌣ + ρ 10 − 10 δ ⌣ − ρ 10 holds). Therefore, E W n ≤ 10 δ ⌣ + ρ 10 − 10 δ ⌣ − ρ 10 must be satisfied so that covert data delivery from R to Bob is feasible. If E W n ≤ 10 δ ⌣ + ρ 10 − 10 δ ⌣ − ρ 10 , ε n can be expressed as
ε n = 1 , λ n < 10 δ ⌣ − ρ 10 5 ρ ⋅ δ ⌣ + ρ 10 − ln λ n ln 10 , 10 δ ⌣ − ρ 10 ≤ λ n < 10 δ ⌣ − ρ 10 + E W n 1 − 5 ln 10 ρ ⋅ ln λ n λ n − E W n , 10 δ ⌣ − ρ 10 + E W n ≤ λ n < 10 δ ⌣ + ρ 10 5 ρ ln λ n − E W n ln 10 − δ ⌣ − ρ 10 , 10 δ ⌣ + ρ 10 ≤ λ n < 10 δ ⌣ + ρ 10 + E W n 1 , λ n ≥ 10 δ ⌣ + ρ 10 + E W n
It can be proved that ε n will achieve its minimum if the detection threshold λ n is set to 10 δ ⌣ − ρ 10 + E W n . Then, the minimum DEP ε min n can be expressed as
ε min n = 5 ρ ⋅ δ ⌣ + ρ 10 − log 10 δ ⌣ − ρ 10 + E W n .
To ensure covert data delivery from R to Bob, ε min n ≥ 1 − ϑ must be guaranteed for a positive and arbitrarily small ϑ . Then, substituting Equation (14) into ε min n ≥ 1 − ϑ leads to E W n ≤ 10 ρ 2 ϑ − 1 + δ ⌣ 10 − 10 δ ⌣ − ρ 10 . In addition, as mentioned above, covert data delivery from R to Bob requires that E W n ≤ 10 δ ⌣ + ρ 10 − 10 δ ⌣ − ρ 10 holds. Since 10 ρ 2 ϑ − 1 + δ ⌣ 10 − 10 δ ⌣ − ρ 10 < 10 δ ⌣ + ρ 10 − 10 δ ⌣ − ρ 10 holds and according to E W n = β 0 P R n / d RW 2 , the condition for ensuring covert data delivery from R to Bob can be expressed as d RW ≥ d RW min , where d RW min is the minimum distance that R must maintain from Willie and can be given by
d RW min = β 0 P R n 10 ρ 1 − 2 ϑ + δ ⌣ 10 − 10 δ ⌣ − ρ 10
The preceding analysis explains that the FWD R must maintain a distance of at least d RW min from Willie and d RW min is proportional to its transmit power. In the following, d RW ≥ d RW min is referred to as covertness constraint.
If d RW ≥ d RW min is guaranteed, R can deliver covert data to Bob. In this situation, their required QoS should be met. Suppose that R delivers data at a covert rate of R B n in time-slot n . Then, Bob receives y B n = P R n h RB x R n + n B n , where n ∈ 1 , 2 , ⋯ , N , h RB is the channel gain between R and Bob and n B n is the noise with a power of δ B . Likewise, Bob has an uncertainty about the noise power δ B and h RB is assumed to follow the free space path loss model [11,18]. Then, h RB can be written as h RB = β 0 / d RB 2 , where β 0 denotes the channel power at unit distance and d RB is the distance between R and Bob. At the end of time-slot n , the received signal-to-noise ratio (SNR) at Bob is γ B n = P R n β 0 / δ B d RB 2 and then the achievable rate at Bob can be calculated as log 2 1 + γ B n [11,18]. Due to the uncertainty about the noise power, δ B is a random variable and its PDF can be given by Equation (7) as well.
In the article, outage probability is adopted as a measure of communication QoS. To meet the required QoS, Equation (16) must be satisfied:
Pr log 2 1 + γ B n < R B n ≤ Θ B .
In Equation (16), Θ B is a design parameter defining the maximum outage probability that R and Bob can accept.
Using the PDF of δ B , the actual outage probability can be calculated as
Pr log 2 1 + γ B n < R B n = Pr δ B > P R n β 0 d RB 2 2 R B n − 1   = 1 , P R n β 0 d RB 2 2 R B n − 1 < 10 δ ⌣ − ρ 10 5 ρ δ ⌣ + ρ 10 − log P R n β 0 d RB 2 2 R B n − 1 , 10 δ ⌣ − ρ 10 ≤ P R n β 0 d RB 2 2 R B n − 1 < 10 δ ⌣ + ρ 10 0 , P R n β 0 d RB 2 2 R B n − 1 ≥ 10 δ ⌣ + ρ 10 .
It can be observed from Equation (17) that the actual outage probability can be classified as three exclusive cases and it is a non-decreasing function with respect to R’s transmit power P R n . As revealed earlier, the minimum distance that R must maintain from Willie is proportional to P R n , meaning that reducing P R n is beneficial for covert data delivery and for energy saving. On the other hand, Equation (16) must be satisfied so as to meet the required QoS, where Θ B is a system design parameter and is typically set to 0.01 for high-quality personal communication systems [36]. Therefore, the actual outage probability should be kept below Θ B when 10 δ ⌣ − ρ 10 ≤ P R n β 0 / d RB 2 2 R B n − 1 < 10 δ ⌣ + ρ 10 holds, which corresponds to the second case in Equation (17). Then, substituting Equation (17) into Equation (16) leads to d RB ≤ d RB max , where d RB max is the maximum distance that R can stay away from Bob and can be given by
d RB max = P R n β 0 10 δ ⌣ + ρ 1 − 2 Θ B 10 2 R B n − 1 .
Therefore, to meet the required QoS, the FWD R must stay within d RB max from Bob and d RB max is proportional to its transmit power as well. In the following, d RB ≤ d RB max is referred to as outage constraint.
As mentioned earlier, the FWD R performs an unrestricted level flight within D with a radius of r R at a speed of v . Since the speed and the altitude remain constants, R either flies along a straight path or makes a banked level turn during its flight. In this situation, v 2 / g r ≤ tan ϕ max must be satisfied [3], where g is the gravitational acceleration, r is the curvature radius of R’s flight path and ϕ max is R’s maximum bank angle limit. It should be noted that r is larger than 0 and will go to infinity when the FWD R flies along a straight path. Therefore, to ensure flight safety, the curvature radius of R’s flight path must satisfy r ≥ v 2 / g tan ϕ max .

4.2. Problem Establishment

Here, an optimization problem is established with the aim of maximizing the covert rate subject to the FWD’s mobility and transmit power limits as well as the derived covertness and outage constraints. This optimization problem can be written as
x 0 * , y 0 * , h * , r R * , P R * n , v * = arg max x 0 , y 0 , h , r R , P R n , v R B n
s . t .   x 0 − r R cos θ 2 + y 0 + r R sin θ 2 + h 2 ≥ d RW min 2
d 0 − x 0 + r R cos θ 2 + y 0 + r R sin θ 2 + h 2 ≤ d RB max 2
V min ≤ v ≤ V max
h min ≤ h ≤ h max
v 2 / g r ≤ tan ϕ max ,   r > 0
r R ≤ x 0 ≤ d 0 − r R ,   0 < r R ≤ d 0 / 2
q n ∈ D
P min ≤ P R n ≤ P max
where n ∈ 1 , 2 , ⋯ , N , x 0 * , y 0 * , h * and r R * are the optimal central position and radius of D , P R * n and v * are the optimal transmit power and speed of the FWD R, θ is the central angle when R flies along the edge of D and can be any value in the interval of 0 ∘ , 360 ∘ , and q n denotes the position of R at time-slot n . Here, Equation (19b) ensures that the covertness constraint can be satisfied, where x 0 − r R cos θ 2 + y 0 + r R sin θ 2 + h 2 is the square of the distance from any point on the edge of D to Willie; Equation (19c) guarantees the satisfaction of the outage constraint, where d 0 − x 0 + r R cos θ 2 + y 0 + r R sin θ 2 + h 2 denotes the square of the distance from any point on the edge of D to Bob. Equations (19d)~(19h) are R’s mobility constraints. Specifically, Equations (19d) and (19e) are R’s flight speed and altitude limits; Equation (19f) is R’s maximum bank angle limit; Equation (19g) gives the location and size restrictions of the circular area D ; and Equation (19h) gives the restriction that R should be always within D . Equation (19i) gives R’s transmit power limit.
It should be noted that in problem (19), the FWD R is assumed to fly along the edge of the circular area D . Actually, R is capable of flying within D . Such an assumption aims to simplify the optimization problem due to the fact that as long as the covertness and outage constraints can be satisfied if R flies along the edge of D , they will be always met when R is within D .

5. Problem Solution and Algorithm Design

It can be observed from problem (19) that the global optimum can be obtained when the radius of D (i.e., r R ) achieves its minimum. From Equation (23), it can be observed that for fixed values of ρ , ϑ and Θ B , maximizing d RW min / d RB max is equivalent to maximizing R B n . Furthermore, according to the system model, when the ratio d RW min / d RB max attains its maximum, the radius of the drone’s circular flight area D is minimized. Consequently, the global optimum is achieved at r R = r min . To this end, the minimum radius of D is first derived and presented in the following propositions.
Proposition 1.
The minimum radius of the circular area D , within which the FWD R is capable of performing an unrestricted level flight, can be given by
r R * = 2 V min 2 g tan ϕ max .
Proof. 
When R performs a level flight, its maneuverability is reflected in its turning radius. The smaller the turning radius, the better the maneuverability will be. Therefore, to minimize its flight area, R should fly with its maximum maneuverability. As revealed in the preceding subsection, the curvature radius of R’s flight path must satisfy r ≥ v 2 / g tan ϕ max , and hence, the minimum turning radius is r min = V min 2 / g tan ϕ max . It means that R should fly at its minimum speed with the maximum bank angle so as to achieve its maximum maneuverability. Suppose that R departs from x 0 , y 0 , h with its maximum maneuverability. Then, the position of R at time t can be expressed as
q t = x 0 + V min ∫ 0 t cos θ 0 + ω τ d τ , y 0 + V min ∫ 0 t sin θ 0 + ω τ , h = x 0 + V min ω sin θ 0 + ω t − sin θ 0 , y 0 + V min ω cos θ 0 − cos θ 0 + ω t , h .
where θ 0 is the directional angle of the speed and θ 0 ∈ 0 , 2 π and ω = V min / r min is R’s angular velocity when utilizing its maximum maneuverability. At time t , the distance between R and its starting position can be calculated as d t = V min 2 1 − cos ω t / ω . It is noticed that d t will achieve its maximum value of 2 V min / ω when ω t is an odd multiple of π . It means that the longest distance that can be reached is 2 r min when the FWD R departs from x 0 , y 0 , h with its maximum maneuverability. On the other hand, suppose that R flies along a circle of radius 2 r min at the speed V min . The FWD R is capable of starting from any point on the circle and then reaching the circle center with its maximum maneuverability. Therefore, the minimum radius of D , namely, the optimal radius of the circular region D for problem (19), is 2 r min . In addition, the optimal speed of R for problem (19) is v * = V min . □
According to Proposition 1, problem (19) is infeasible if r R * > d 0 / 2 , otherwise it can be transformed into
x 0 * , y 0 * , h * , P R * n = arg max x 0 , y 0 , h , P R n R B n
s . t .   x 0 − r R * cos θ 2 + y 0 + r R * sin θ 2 + h 2 ≥ d RW min 2
d 0 − x 0 + r R * cos θ 2 + y 0 + r R * sin θ 2 + h 2 ≤ d RB max 2
r R * ≤ x 0 ≤ d 0 − r R *
h min ≤ h ≤ h max
P min ≤ P R n ≤ P max
where r R * is given by Equation (20).
According to Equations (15) and (18), covert rate can be rewritten as
R B n = log 2 10 ρ 1 − 2 ϑ + δ ⌣ 10 − 10 δ ⌣ − ρ 10 10 δ ⌣ + ρ 1 − 2 Θ B 10 ⋅ d RW min 2 d RB max 2 + 1 .
It can be observed from Equation (23) that maximizing R B n is equivalent to maximizing the ratio d RW min 2 / d RB max 2 . Thus, the maximum covert rate will be achieved when d RW min 2 / d RB max 2 attains its maximum. It means that the global maximum will be achieved when the inequality constraints given by Equations (22b) and (22c) hold with equality.
As revealed in the preceding section, the FWD R should stay as far away from Willie as possible so as to satisfy the covertness constraint. In addition, the minimum distance d RW min that R should stay away from Willie is proportional to its transmit power P R n . Thus, replacing P R n with P min or P max in Equation (15) yields the lower-bound or upper-bound of d RW min . In the following, the lower-bound and upper-bound of d RW min are denoted as d RW min LB and d RW min UB , respectively.
Likewise, the FWD R should approach Bob as closely as possible so as to meet the required QoS and the maximum distance that R can stay away from Bob is d RB max . Since R’s minimum flight altitude is h min and the optimal radius of D is r R * , the theoretical minimum value of d RB max is h min 2 + 4 r R * 2 , which is denoted as d RB max LB in this context. In this situation, the coordinate of the central position of D is d 0 − r R * , 0 , h min . For ease of presentation, the above case is referred to as the nearest location of D .
According to the above analyses, the solution of problem (22) can be classified as the following two cases.
Case 1: d RW min UB 2 − h min 2 + 2 r R * ≤ d 0 holds. In this situation, D and x 2 + y 2 + z 2 = d RW min UB 2 will not intersect or be tangent when D situates in the nearest location. To maximize the covert rate, the FWD R should delivery data with its maximum transmit power and fly within D with the central position of d 0 − r R * , 0 , h min , meaning that P R * n = P max , x 0 * = d 0 − r R * , y 0 * = 0 and h * = h min . Then, the maximum cover rate can be given by
R B n = log 2 1 + β 0 P max 10 δ ⌣ + ρ 1 − 2 Θ B 10 d RB max LB 2 ,
where d RB max LB = h min 2 + 4 r R * 2 is the theoretical minimum value of d RB max .
Case 2: d RW min UB 2 − h min 2 + 2 r R * > d 0 holds. In this situation, D and x 2 + y 2 + z 2 = d RW min UB 2 will intersect when D is situated in the nearest location and the coordinate along the z-axis of the intersection point is larger than h min . As revealed earlier, maximizing R B n is equivalent to maximizing d RW min 2 / d RB max 2 , and the maximum R B n will be achieved when d RW min 2 / d RB max 2 attains its maximum. It can be deduced that if D and x 2 + y 2 + z 2 = d RW min 2 are tangent at x = d 0 − 2 r R * , d RW min 2 / d RB max 2 achieves its maximum. In this situation, the projection of the central position of D is on the line between Willie and Bob. Then, d RW min 2 / d RB max 2 can be written as
d RW min 2 d RB max 2 = h 2 + d 0 − 2 r R * 2 h 2 + 4 r R * 2 .
Obviously, Equation (25) is a decreasing function of h if d 0 > 4 r R * , while it is an increasing function of h if 2 r R * < d 0 ≤ 4 r R * . Therefore, R should fly as low as possible when d 0 > 4 r R * holds, while R should fly as high as possible when 2 r R * < d 0 ≤ 4 r R * holds such that covert data delivered can be carried out and the required QoS can be met. To solve the optimization problem, the following six sub-cases are examined.
Sub-case 2.1: d 0 > 4 r R * and d RW min LB 2 − d 0 − 2 r R * 2 < h min hold. In this situation, the FWD R should fly as low as possible, and D can be tangent to x 2 + y 2 + z 2 = d RW min 2 when D is situated in the nearest location. This means that h * = h min , x 0 * = d 0 − r R * , y 0 * = 0 , d RB max = 4 r R * 2 + h min 2 and d RW min = h min 2 + d 0 − 2 r R * 2 . Using d RW min = h min 2 + d 0 − 2 r R * 2 and Equation (15), the optimal transmit power of R can be obtained, giving
P R * n = h min 2 + d 0 − 2 r R * 2 10 ρ 1 − 2 ϑ + δ ⌣ 10 − 1 0 δ ⌣ − ρ 10 β 0 .
Using d RB max = 4 r R * 2 + h min 2 and Equations (18) and (26), the maximum covert rate can be calculated as
R B n = log 2 1 + h min 2 + d 0 − 2 r R * 2 10 ρ 1 − 2 ϑ + δ ⌣ 10 − 10 δ ⌣ − ρ 10 10 δ ⌣ + ρ 1 − 2 Θ B 10 4 r R * 2 + h min 2 .
Sub-case 2.2: d 0 > 4 r R * and h min ≤ d RW min LB 2 − d 0 − 2 r R * 2 ≤ h max hold. Here, d 0 > 4 r R * implies that the drone should fly as low as possible, while h min ≤ d RW min LB 2 − d 0 − 2 r R * 2 ≤ h max means that the drone can fly with an altitude between h min and h max when it is exactly d RW min LB away from Willie. Thus, the drone can only use its minimum power P min to transmit data. In this situation, R should fly as low as possible, and D can be tangent to x 2 + y 2 + z 2 = d RW min 2 when h min ≤ h ≤ h max . Therefore, R should operate in its minimum transmit power such that it is capable of flying at the lowest altitude. It means that P R * n = P min , h * = d RW min LB 2 − d 0 − 2 r R * 2 , x 0 * = d 0 − r R * and y 0 * = 0 . Then, d RB max = 4 r R * 2 + h * 2 can be obtained. Using d RB max = 4 r R * 2 + h * 2 and Equation (18), the maximum covert rate can be calculated as
R B n = log 2 1 + β 0 P min 10 δ ⌣ + ρ 1 − 2 Θ B 10 4 r R * 2 + h 2 .
Sub-case 2.3: d 0 > 4 r R * and d RW min LB 2 − d 0 − 2 r R * 2 ≥ h max hold. Here, d 0 > 4 r R * implies that the drone should fly as low as possible, while d RW min LB 2 − d 0 − 2 r R * 2 ≥ h max means that the drone’s flight altitude exceeds the maximum limit, even when it is exactly d RW min LB away from Willie. In this situation, the drone remains exactly d RW min LB away from Willie and can therefore only use its minimum power P min to transmit data, i.e., P R * n = P min . In addition, D can only be tangent to x 2 + y 2 + z 2 = d RW min 2 when h > h max , and hence, the projection of the central position of D cannot be on the line between Willie and Bob. To meet the flight altitude limit, D needs to move along the y-axis until R’s flight altitude is equal to h max , i.e., h * = h max . Then, x 0 * = d 0 − r R * and y 0 * = ± d RW min LB 2 − h max 2 + r R * 2 − d 0 − r R * 2 can be obtained followed by the calculation of d RB max = x 0 * − d 0 2 + y 0 * 2 + r R * 2 + h max 2 . Using d RB max and Equation (18), the maximum covert rate can be calculated as
R B n = log 2 1 + β 0 P min 10 δ ⌣ + ρ 1 − 2 Θ B 10 x 0 − d 0 2 + y 0 2 + r R * 2 + h max 2 .
Sub-case 2.4: 2 r R * < d 0 ≤ 4 r R * and d RW min UB 2 − d 0 − 2 r R * 2 ≤ h max hold. As revealed earlier, R needs to fly as high as possible in this sub-case. Then, R should operate in its maximum transmit power, i.e., P R * n = P max and the optimal flight altitude is h * = d RW min UB 2 − d 0 − 2 r R * 2 , which leads to x 0 * = d 0 − r R * and y 0 * = 0 . Then, d RB max can be calculated as d RB max = h * 2 + 4 r R * 2 . According to d RB max and Equation (18), the maximum covert rate can be calculated as
R B n = log 2 1 + β 0 P max 10 δ ⌣ + ρ 1 − 2 Θ B 10 d RW min UB 2 − d 0 − 2 r R * 2 + 4 r R * 2 .
Sub-case 2.5: 2 r R * < d 0 ≤ 4 r R * , d RW min UB 2 − d 0 − 2 r R * 2 > h max and d RW min LB 2 − d 0 − 2 r R * 2 ≤ h max hold. In this situation, the optimal flight altitude of R is h * = h max and then x 0 * = d 0 − r R * and y 0 * = 0 can be obtained straightforwardly. Then, d RB max and d RW min can be calculated as d RB max = h max 2 + 4 r R * 2 and d RW min = h max 2 + d 0 − 2 r R * 2 . According to d RW min and Equation (15), the optimal transmit power of the FWD R is
P R * n = h max 2 + d 0 − 2 r R * 2 10 ρ 1 − 2 ϑ + δ ⌣ 10 − 10 δ ⌣ − ρ 10 β 0 .
According to d RB max and Equations (18) and (31), the maximum covert rate can be calculated as
R B n = log 2 1 + h max 2 + d 0 − 2 r R * 2 10 ρ 1 − 2 ϑ + δ ⌣ 10 − 10 δ ⌣ − ρ 10 10 δ ⌣ + ρ 1 − 2 Θ B 10 h max 2 + 4 r R * 2 .
Sub-case 2.6: 2 r R * < d 0 ≤ 4 r R * and d RW min LB 2 − d 0 − 2 r R * 2 > h max hold. Here, 2 r R * < d 0 ≤ 4 r R * implies that the drone should fly as high as possible, while d RW min LB 2 − d 0 − 2 r R * 2 > h max means that the drone’s flight altitude exceeds the maximum limit, even when it is exactly d RW min LB away from Willie. In this situation, D can only be tangent to x 2 + y 2 + z 2 = d RW min 2 when h > h max and hence, R can only operate in the minimum transmit power, i.e., P R * n = P min . To meet the flight altitude limit, D needs to move along the y-axis until R’s flight altitude is equal to h max , i.e., h * = h max . Then, x 0 * = d 0 − r R * and y 0 * = ± d RW min LB 2 − h max 2 + r R * 2 − d 0 − r R * 2 can be obtained, followed by the calculation of d RB max = x 0 * − d 0 2 + y 0 * 2 + r R * 2 + h max 2 . According to d RB max and Equation (18), the maximum covert rate can be calculated and given by Equation (29).
Summarizing the above analyses, an optimization algorithm is presented as below.
Algorithm 1: Joint optimization algorithm for carrying out covert data delivery with the maximum covert rate, while meeting the required QoS.
Step 1: Initialize the system parameters, including the gravitational acceleration g , Willie and Bob’s 3D coordinates q w and q B , the FWD’s minimum and maximum flight altitudes h min and h max , the FWD’s minimum and maximum flight speeds V min and V max , the FWD’s minimum and maximum transmit power P min and P max , the FWD’s maximum bank angle ϕ max , the channel power at unit distance β 0 , the positive and arbitrarily small parameter ϑ , the outage probability limit Θ B , the mean value of the noise power in the dB domain δ ⌣ and the noise uncertainty parameter in the dB domain ρ .
Step 2: Calculate the distance between Willie and Bob d 0 = q w − q B , d RW min LB and d RW min UB . According to Equation (20), calculate the optimal radius r R * and d RB max LB = h min 2 + 4 r R * 2 . Set the optimal flight speed as v * = V min .
Step 3: If d RW min UB 2 − h min 2 + 2 r R * ≤ d 0 , the FWD’s optimal transmit power is P R * n = P max , x 0 * = d 0 − r R * , y 0 * = 0 and h * = h min . According to Equation (24), calculate the maximum cover rate. Next, turn to Step 11.
Step 4: If d 0 > 4 r R * and d RW min LB 2 − d 0 − 2 r R * 2 < h min , x 0 * = d 0 − r R * , y 0 * = 0 and h * = h min . According to Equations (26) and (27), calculate the optimal transmit power P R * n and the maximum cover rate, respectively. Next, turn to Step 11.
Step 5: If d 0 > 4 r R * and h min ≤ d RW min LB 2 − d 0 − 2 r R * 2 ≤ h max , the FWD’s optimal transmit power is P R * n = P min , and x 0 * = d 0 − r R * , y 0 * = 0 , h * = d RW min LB 2 − d 0 − 2 r R * 2 . According to Equation (28), calculate the maximum covert rate. Next, turn to Step 11.
Step 6: If d 0 > 4 r R * and d RW min LB 2 − d 0 − 2 r R * 2 ≥ h max , the FWD’s optimal transmit power is P R * n = P min and x 0 * = d 0 − r R * , y 0 * = ± d RW min LB 2 − h max 2 + r R * 2 − d 0 − r R * 2 , h * = h max . According to Equation (29), calculate the maximum covert rate. Next, turn to Step 11.
Step 7: If 2 r R * < d 0 ≤ 4 r R * and d RW min UB 2 − d 0 − 2 r R * 2 ≤ h max , the FWD’s optimal transmit power is P R * n = P max and x 0 * = d 0 − r R * , y 0 * = 0 , h * = d RW min UB 2 − d 0 − 2 r R * 2 . According to Equation (30), calculate the maximum covert rate. Next, turn to Step 11.
Step 8: If 2 r R * < d 0 ≤ 4 r R * , d RW min UB 2 − d 0 − 2 r R * 2 > h max and d RW min LB 2 − d 0 − 2 r R * 2 ≤ h max , x 0 * = d 0 − r R * , y 0 * = 0 and h * = h max . According to Equations (31) and (32), calculate the optimal transmit power P R * n and the maximum covert rate, respectively. Next, turn to Step 11.
Step 9: If 2 r R * < d 0 ≤ 4 r R * and d RW min LB 2 − d 0 − 2 r R * 2 > h max , the FWD’s optimal transmit power is P R * n = P min and x 0 * = d 0 − r R * , y 0 * = ± d RW min LB 2 − h max 2 + r R * 2 − d 0 − r R * 2 , h * = h max . According to Equation (29), calculate the maximum covert rate. Next, turn to Step 11.
Step 10: If d 0 ≤ 2 r R * , the FWD and Bob stay silent and do not deliver any data. Next, turn to Step 12.
Step 11: The FWD performs an unrestricted level flight within the circular area D with the central position x 0 * , y 0 * , h * and the radius r R * at the speed v * and meanwhile the FWD delivers data to Bob at the calculated covert rate at any time.
Step 12: The algorithm ends.

6. Simulation Results

In this section, computer simulations are conducted to verify the correctness and effectiveness of the proposed optimization algorithm. Table 1 gives the values of the parameters used in the simulations [2,10,36].
Table 1. Values of the parameters.
In the simulations, three different noise uncertainty cases are involved, where the noise uncertainty parameter in the dB domain is set to ρ = 0.5   dB , ρ = 1   dB and ρ = 1.5   dB , respectively. It should be noted that the larger the value of ρ , the greater the uncertainty about noise power will be. In addition, the distance between Willie and Bob ranges between 15 and 500 m. To verify the correctness and efficiency of the proposed Algorithm 1, the sequential quadratic programming available in the MATLABR2024b Optimization Toolbox is used to solve the initial optimization problem and the achieved results are denoted as “simulation” in the plotted Figures.
It should be noted that according to Equation (20), the minimum radius of D is r R * = 5.102   m as V min = 5   m / s and ϕ max = 45 ∘ are assumed. As revealed in preceding section, the FWD should fly as low as possible if d 0 > 20.408 , while it should fly as high as possible if 10.204 < d 0 ≤ 20.408 .
Figure 2, Figure 3, Figure 4 and Figure 5 plot the FWD’s flight altitude, the horizontal coordinate of the central position of D , the FWD’s transmit power, and the covert rate at which the FWD delivers data to Bob, where d 0 is between 15 and 50 m. Likewise, Figure 6, Figure 7, Figure 8 and Figure 9 show the simulation results when d 0 is between 50 and 500 m.
Figure 2. Flight altitude versus d 0 , where d 0 ranges from 15 to 50 m.
Figure 3. Horizontal coordinate of the central position of D versus d 0 , where d 0 ranges from 15 to 50 m.
Figure 4. Transmit power versus d 0 , where d 0 ranges from 15 to 50 m.
Figure 5. Covert rate versus d 0 , where d 0 ranges from 15 to 50 m.
Figure 6. Flight altitude versus d 0 , where d 0 ranges from 50 to 500 m.
Figure 7. Horizontal coordinate of the central position of D versus d 0 , where d 0 ranges from 50 to 500 m.
Figure 8. Transmit power versus d 0 , where d 0 ranges from 50 to 500 m.
Figure 9. Covert rate versus d 0 , where d 0 ranges from 50 to 500 m.
Figure 2 and Figure 6 show that the FWD’s flight altitude gradually decreases as d 0 increases. For a given d 0 , the greater the uncertainty about noise power (namely, the larger the value of ρ ), the lower the FWD’s flight altitude. When d 0 reaches approximately 20 m, a steep drop in the FWD’s flight altitude occurs. When d 0 is between 20 and 300 m, the FWD’s flight altitude decreases as d 0 increases. When d 0 is greater than 330 m, the FWD flies at the lowest altitude regardless of the value of ρ . These phenomena are consistent with the theoretical analysis, confirming the correctness of the investigations.
Figure 3 and Figure 7 show that the horizontal coordinate of the central position of D is on the line between Willie and Bob and satisfies the location restriction of D , confirming the correctness of the proposed algorithm.
Figure 4 and Figure 8 show that the FWD’s transmit power first decreases and then increases when d 0 ranges from 20 to 500 m. When d 0 is less than 20 m (in this situation d 0 ≤ 4 r R * holds), the FWD’s flight altitude is very high (see Figure 2) and hence, the FWD can operate at high transmit power levels. When d 0 reaches approximately 20 m, a steep drop in the FWD’s flight altitude occurs, resulting in a significant reduction in the FWD’s transmit power. When d 0 ranges between 20 and 200 m (in this situation d 0 > 4 r R * holds), the FWD can only operate at the minimum transmit power level. When d 0 is greater than 330 m, the FWD’s transmit power increases rapidly as d 0 increases. For a given d 0 , the greater the uncertainty about noise power (namely, the larger the value of ρ ), the higher the allowed transmit power.
Figure 5 and Figure 9 show that the covert rate increases as d 0 increases and the greater the noise uncertainty, the larger the achieved covert rate. When d 0 ranges from 15 to 200 m, the covert rate enhances slowly as d 0 increases. However, when d 0 is greater than 300 m, the covert rate enhances rapidly as d 0 increases.
In addition, Figure 2, Figure 3, Figure 4, Figure 5, Figure 6, Figure 7, Figure 8 and Figure 9 show that the theoretical results are consistent with the simulation results, confirming the correctness of the investigations.
Figure 10, Figure 11, Figure 12 and Figure 13 plot Willie’s DEP, where θ is the central angle when the FWD flies along the edge of the circular area D and is between 0 ∘ and 360 ∘ . Figure 10, Figure 11, Figure 12 and Figure 13 correspond to four difference cases of d 0 = 15   m , d 0 = 50   m , d 0 = 100   m and d 0 = 500   m , respectively.
Figure 10. Willie’s DEP when d 0 is equal to 15 m.
Figure 11. Willie’s DEP when d 0 is equal to 50 m.
Figure 12. Willie’s DEP when d 0 is equal to 100 m.
Figure 13. Willie’s DEP when d 0 is equal to 500 m.
It can be observed from Figure 10, Figure 11, Figure 12 and Figure 13 that Willie’s DEP is greater than the set value 1 − ϑ , confirming the correctness of the proposed algorithm. For the cases where d 0 = 50   m , d 0 = 100   m and d 0 = 500   m , θ = 180 ∘ means that the FWD is close to Bob but far from Willie, which leads to a large DEP. For the case where d 0 = 15   m , the DEP remains almost unchanged as θ varies. It is because the change in value of θ does not have any impact on the distance between the FWD and Willie if the FWD’s flight altitude is very high. Likewise, for the case where d 0 = 15   m , noise uncertainty (i.e., the value of ρ ) does not have any impact on Willie’s DEP since the FWD flies very high and the distance between the FWD and Willie is approximately invariant under changes in θ . For the cases where d 0 = 50   m and d 0 = 500   m , however, Willie’s DEP enhances as the uncertainty about noise power (namely, increasing the value of ρ ) increases. It is because a large value of ρ leads to great uncertainty about the noise power, making correct judgment more challenging for Willie. For the case where d 0 = 500   m , the noise uncertainty (i.e., the value of ρ ) will not affect Willie’s DEP as the FWD is far away from Willie.
Figure 14, Figure 15, Figure 16 and Figure 17 plot Bob’s outage probability when the FWD flies along the edge of D , where the four different cases considered in Figure 10, Figure 11, Figure 12 and Figure 13 are involved.
Figure 14. Bob’s outage probability when d 0 is equal to 15 m.
Figure 15. Bob’s outage probability when d 0 is equal to 50 m.
Figure 16. Bob’s outage probability when d 0 is equal to 100 m.
Figure 17. Bob’s outage probability when d 0 is equal to is 500 m.
It can be observed from Figure 14, Figure 15, Figure 16 and Figure 17 that Bob’s outage probability can be kept below the set value of 0.01, confirming the correctness of the proposed algorithm. When θ = 180 ∘ , the FWD is close to Bob and then the minimum outage probability can be achieved. Figure 17 shows that when θ is between 45 ∘ and 315 ∘ (in this situation, the FWD is close to Bob), Bob’s outage probability tends to 0. Generally, Bob’s outage probability decreases as d 0 increases. It is because when d 0 is large, the FWD’s flight altitude is low and hence it can approach Bob, which is beneficial for data delivery. When noise uncertainty increases (namely, the value of ρ increases), Bob cannot accurately estimate the noise power, leading to SNR misestimation and consequently increasing the outage probability.

7. Discussion

An important finding is the threshold at d 0 = 4 r R . When d 0 > 4 r R , the receiver is far from the detector, lowering the altitude can improve the legitimate link more than increasing the detection risk, so the FWD should fly as low as possible. When 2 r R < d 0 ≤ 4 r R , the receiver and detector are relatively close. Flying higher weakens the signal at both, but the reduction at the detector benefits covertness more. This explains why the FWD should fly as high as possible in this region.
Noise uncertainty improves covertness by increasing the detector’s DEP, thereby enabling higher transmit power or lower altitude. However, it also raises the receiver’s outage probability, which degrades the QoS. This trade-off indicates that noise uncertainty is not unconditionally beneficial. The results provide a quantitative guideline for selecting the operating point (altitude and power) given a specific level of noise uncertainty.
The findings offer several practical insights. First, if the distance between the receiver and detector can be estimated, the optimal altitude and transmit power can be determined using the proposed algorithm. Second, in environments with high noise uncertainty (e.g., dense urban areas), the system can tolerate lower altitudes or higher power to improve the covert rate, though the outage probability must be carefully considered. Third, the circular flight area respects the physical constraints of FWDs, making the solution practically deployable.
Several limitations remain in this article. First, the system model is idealized: it assumes an LoS channel, single static detector, and perfect knowledge of the receiver’s location. Second, only steady-state flight is considered; non-steady-state maneuvers (altitude changes) may temporarily affect covertness and QoS. Third, this article focuses on a single receiver; multi-user scenarios are not considered. Fourth, the detector’s location is assumed to be perfectly known; location uncertainty would require a more conservative strategy. Addressing these limitations is left for future work.

8. Conclusions

This article examined an FWD-enabled covert transmission, where the FWD performs an unrestricted level flight within a circular area with a radius of r R and meanwhile delivers covert data at a covert rate to a receiver situated d 0 meters away from a detector. With the aim of maximizing the covert rate while meeting the required QoS, a joint optimization algorithm is proposed, giving the optimal location and radius of the circular area and the optimal flight speed and transmit power of the FWD. It is found that the FWD should fly as high as possible if 2 r R < d 0 ≤ 4 r R and then deliver covert data with high transmit power. However, in this case, the covert rate remains relatively low. If d 0 > 4 r R , the FWD should fly as low as possible. In this situation, the FWD’s transmit power and the resulting covert rate are low if d 0 is slightly greater than 4 r R . When d 0 increases, the FWD’s flight altitude decreases slowly, while progressively raising the transmit power. When d 0 increases to a certain value, the FWD flies at its minimum altitude. After that, the FWD’s transmit power and the covert rate increase rapidly as d 0 further increases. For a given d 0 , the larger the uncertainty about noise power, the lower the allowed altitude or the higher the allowed transmit power, which increases the covert rate that can be achieved. In addition, the uncertainty about noise power is beneficial for increasing the detector’s DEP. However, it also leads to an increase in the receiver’s outage probability, declining the QoS level of the covert transmission.

Author Contributions

Conceptualization, C.H. and X.J.; methodology, C.H. and X.J.; software, C.H. and X.J.; validation, C.H. and X.J.; formal analysis, C.H. and X.J.; investigation, C.H. and X.J.; resources, X.J. and L.G.; data curation, X.J.; writing—original draft preparation, C.H. and X.J.; writing—review and editing, C.H., X.J. and L.G.; visualization, C.H.; supervision, X.J.; project administration, X.J. and L.G.; funding acquisition, C.H., X.J. and L.G. All authors have read and agreed to the published version of the manuscript.

Funding

This research was funded by the Project of the 6th Jianghai Talent of Nantong City; by the Natural Science Foundation of Nantong City, grant number JC2023020; and by the Innovation Training Program for College Students, grant number 202510304033.

Data Availability Statement

The original contributions presented in this study are included in the article. Further inquiries can be directed to the corresponding author.

Conflicts of Interest

The authors declare no conflicts of interest.

References

  1. Zeng, Y.; Zhang, R.; Lim, T.J. Wireless communications with unmanned aerial vehicles: Opportunities and challenges. IEEE Commun. Mag. 2016, 54, 36–42. [Google Scholar] [CrossRef] [Scilit]
  2. Yang, F.; Qin, X.; Gong, S.; Deng, N.; Xing, C.; Zhao, N. A survey of covert UAV communications. Chin. J. Aeronaut. 2025, 38, 103493. [Google Scholar] [CrossRef] [Scilit]
  3. Hale, F.J. Introduction to Aircraft Performance, Selection and Design; John Wiley & Sons: New York, NY, USA, 1984. [Google Scholar]
  4. Yan, S.; Zhou, X.; Hu, J.; Hanly, S.V. Low probability of detection communication: Opportunities and challenges. IEEE Wirel. Commun. 2019, 26, 19–25. [Google Scholar] [CrossRef] [Scilit]
  5. He, B.; Yan, S.; Zhou, X.; Lau, V.K.N. On covert communication with noise uncertainty. IEEE Commun. Lett. 2017, 21, 941–944. [Google Scholar] [CrossRef] [Scilit]
  6. Wang, Y.; Zhang, Y. High covertness camouflage covert underwater acoustic communication based on masking technique. Signal Process. 2024, 225, 109632. [Google Scholar] [CrossRef] [Scilit]
  7. Zhang, H.; Zou, Y.; Yu, D.; Yu, J.; Cheng, X. Covert communications with friendly jamming in Internet of vehicles. Veh. Commun. 2022, 35, 100472. [Google Scholar] [CrossRef] [Scilit]
  8. Zeng, S.; Cao, B.; Peng, M.; Wang, S.; Sun, C. Covert wireless communication over uplink satellite-terrestrial network. Digit. Commun. Netw. 2025, 11, 1318–1329. [Google Scholar] [CrossRef] [Scilit]
  9. Yan, S.; Hanly, S.V.; Collings, I.B.; Goeckel, D.L. Hiding unmanned aerial vehicles for wireless transmissions by covert communications. In ICC 2019; IEEE: New York, NY, USA, 2019; pp. 1–6. [Google Scholar] [CrossRef] [Scilit]
  10. Zhou, X.; Yan, S.; Hu, J.; Sun, J.; Li, J.; Shu, F. Joint optimization of a UAV’s trajectory and transmit power for covert communications. IEEE Trans. Signal Process. 2019, 67, 4276–4290. [Google Scholar] [CrossRef] [Scilit]
  11. Wu, P.; Yuan, X.; Hu, Y.; Schmeink, A. Joint power allocation and trajectory design for UAV-enabled covert communication. IEEE Trans. Wirel. Commun. 2024, 23, 683–698. [Google Scholar] [CrossRef] [Scilit]
  12. Li, M.; Tao, X.; Wu, H.; Li, N. Joint trajectory and resource optimization for covert communication in UAV-enabled relaying systems. IEEE Trans. Veh. Technol. 2023, 72, 5518–5523. [Google Scholar] [CrossRef] [Scilit]
  13. Zhou, X.; Yan, S.; Ng, D.W.K.; Schober, R. Three-dimensional placement and transmit power design for UAV covert communications. IEEE Trans. Veh. Technol. 2021, 70, 13424–13429. [Google Scholar] [CrossRef] [Scilit]
  14. Wang, H.-M.; Zhang, Y.; Zhang, X.; Li, Z. Secrecy and covert communications against UAV surveillance via multi-Hop networks. IEEE Trans. Commun. 2020, 68, 389–401. [Google Scholar] [CrossRef] [Scilit]
  15. Rao, H.; Xiao, S.; Yan, S.; Wang, J.; Tang, W. Optimal geometric solutions to UAV-enabled covert communications in line-of-sight scenarios. IEEE Trans. Wirel. Commun. 2022, 21, 10633–10647. [Google Scholar] [CrossRef] [Scilit]
  16. Deng, D.; Dang, S.; Li, X.; Ng, D.W.K.; Nallanathan, A. Joint optimization for covert communications in UAV-assisted NOMA networks. IEEE Trans. Veh. Technol. 2024, 73, 1012–1026. [Google Scholar] [CrossRef] [Scilit]
  17. Su, Y.; Fu, S.; Si, J.; Xiang, C.; Zhang, N.; Li, X. Optimal hovering height and power allocation for UAV-aided NOMA covert communication system. IEEE Wirel. Commun. Lett. 2023, 12, 937–941. [Google Scholar] [CrossRef] [Scilit]
  18. Wang, C.; Chen, X.; An, J.; Xiong, Z.; Xing, C.; Zhao, N.; Niyato, D. Covert communication assisted by UAV-IRS. IEEE Trans. Commun. 2023, 71, 357–369. [Google Scholar] [CrossRef] [Scilit]
  19. Chen, X.; Chang, Z.; Hämäläinen, T. Enhancing covert secrecy rate in a zero-forcing UAV jammer-assisted covert communication. IEEE Wirel. Commun. Lett. 2024, 13, 3375–3379. [Google Scholar] [CrossRef] [Scilit]
  20. Vo, V.N.; Long, N.Q.; Dang, V.-H.; Ho, T.D.; Tran, H.; Chatzinotas, S.; Tran, D.-H.; Sanguanpong, S.; So-In, C. Deep learning-driven throughput maximization in covert communication for UAV-RIS cognitive systems. IEEE Open J. Commun. Soc. 2025, 6, 4140–4155. [Google Scholar] [CrossRef] [Scilit]
  21. Zhou, Y.; Fan, P.; Ma, Z. A UAV-enabled integrated sensing and covert communication system. IEEE Trans. Veh. Technol. Earlier Access. 2025, 74, 11540–11545. [Google Scholar] [CrossRef] [Scilit]
  22. Wei, H.; Zhang, P.; Deng, N.; Zhao, N.; Nallanathan, A. UAV trajectory design and power allocation for device-clustering covert communications. IEEE Trans. Veh. Technol. 2026, 1–5. [Google Scholar] [CrossRef] [Scilit]
  23. Lei, H.; Jiang, J.; Ansari, I.S.; Pan, G.; Alouini, M.S. Trajectory and power design for aerial multi-user covert communications. IEEE Trans. Aerosp. Electron. Syst. 2024, 60, 4574–4589. [Google Scholar] [CrossRef] [Scilit]
  24. Yang, M.; Huang, Y.; Lei, J. Joint altitude and power optimization for multi-UAV-aided covert communication with relay selection. Drones 2026, 10, 160. [Google Scholar] [CrossRef] [Scilit]
  25. Liu, P.; Si, J.; Li, Z.; Al-Dhahir, N.; Gao, Y. Joint 3-D trajectory and power optimization for dual-UAV-assisted short-packet covert communications. IEEE Internet Things J. 2024, 11, 17388–17401. [Google Scholar] [CrossRef] [Scilit]
  26. Wei, J.; Guo, Y.; Wang, H.; Gu, J.; Zhang, Y.; Yi, J.; Chen, X.; Ding, G. Fluid antenna array-enabled AAV covert communications against active warden. IEEE Trans. Wirel. Commun. 2026, 25, 9030–9045. [Google Scholar] [CrossRef] [Scilit]
  27. Wei, J.; Guo, Y.; Wang, H.; Gu, J.; Liu, J.; Ding, G. Cognitive jamming-aided UAV multi-user covert communication. IEEE J. Sel. Areas Commun. 2026, 44, 1873–1887. [Google Scholar] [CrossRef] [Scilit]
  28. Yang, F.; Wang, C.; Xiong, J.; Deng, N.; Zhao, N.; Li, Y. UAV-enabled robust covert communication against active wardens. IEEE Trans. Veh. Technol. 2024, 73, 9159–9164. [Google Scholar] [CrossRef] [Scilit]
  29. Zhang, R.; Chen, X.; Liu, M.; Zhao, N.; Wang, X.; Nallanathan, A. UAV relay assisted cooperative jamming for covert communications over Rician fading. IEEE Trans. Veh. Technol. 2022, 71, 7936–7941. [Google Scholar] [CrossRef] [Scilit]
  30. Wang, Q.; Guo, S.; Wu, C.; Xing, C.; Zhao, N.; Niyato, D.; Karagiannidis, G.K. STAR-RIS aided covert communication in UAV air-ground networks. IEEE J. Sel. Areas Commun. 2025, 43, 245–259. [Google Scholar] [CrossRef] [Scilit]
  31. Qian, Y.; Yang, C.; Mei, Z.; Zhou, X.; Shi, L.; Li, J. On joint optimization of trajectory and phase shift for IRS-UAV assisted covert communication systems. IEEE Trans. Veh. Technol. 2023, 72, 12873–12883. [Google Scholar] [CrossRef] [Scilit]
  32. Wang, W.; Fu, S.; Yang, L.; Li, C.; Ren, Y. Age of information optimization for UAV deployment with covert communication: A deep reinforcement learning approach. IEEE Trans. Veh. Technol. 2025, 74, 19772–19776. [Google Scholar] [CrossRef] [Scilit]
  33. Zeng, Y.; Xu, J.; Zhang, R. Energy minimization for wireless communication with rotary-wing UAV. IEEE Trans. Wirel. Commun. 2019, 18, 2329–2345. [Google Scholar] [CrossRef] [Scilit]
  34. 3GPP. Study on Enhanced LTE Support for Aerial Vehicles; (Release 15), TR 36.777. Tech. Rep. Dec.; 3GPP Sup-port Office: Valbonne, France, 2017. [Google Scholar]
  35. Hu, J.; Cheng, B.; Chen, Y.; Wang, J.; Shu, F.; Chen, Z. Simultaneously transmitting and reflecting (STAR) RIS enhanced covert transmission with noise uncertainty. Signal Process. 2025, 232, 109907. [Google Scholar] [CrossRef] [Scilit]
  36. Goldsmith, A. Wireless Communications; Cambridge University Press: Cambridge, UK, 2005. [Google Scholar]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Article Metrics

Citations

Article Access Statistics

Multiple requests from the same IP address are counted as one view.