Next Article in Journal
The Distributed Adaptive Bipartite Consensus Tracking Control of Networked Euler–Lagrange Systems with an Application to Quadrotor Drone Groups
Previous Article in Journal
Applications of GANs to Aid Target Detection in SAR Operations: A Systematic Literature Review
Previous Article in Special Issue
Convolutional Neural Network and Ensemble Learning-Based Unmanned Aerial Vehicles Radio Frequency Fingerprinting Identification
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Multi-Node Joint Jamming Scheme for Secure UAV-Aided NOMA-CDRT Systems: Performance Analysis and Optimization

1
School of Electronic and Information Engineering, Nanjing University of Information Science and Technology, Nanjing 210044, China
2
Henan Key Laboratory of Visible Light Communications, Information Engineering University, Zhengzhou 450002, China
3
School of Electrical and Information Engineering, Zhengzhou University, Zhengzhou 450001, China
4
School of Electronic and Information Engineering, Suzhou University of Science and Technology, Suzhou 215000, China
*
Author to whom correspondence should be addressed.
Drones 2024, 8(9), 449; https://doi.org/10.3390/drones8090449 (registering DOI)
Submission received: 4 August 2024 / Revised: 25 August 2024 / Accepted: 26 August 2024 / Published: 1 September 2024
(This article belongs to the Special Issue Physical-Layer Security in Drone Communications)

Abstract

:
Unmanned aerial vehicle (UAV) communication using non-orthogonal multiple access-based coordinated direct and relay transmission (NOMA-CDRT) supports both massive connectivity and wide-area coverage, becoming a key technology for future emergency rescue communications. However, relay forwarding and high-quality line-of-sight links may subject UAV-aided NOMA-CDRT to multiple eavesdropping attempts by saboteurs. Therefore, we propose a multi-node joint jamming scheme using artificial noise (AN) for the UAV-assisted NOMA-CDRT to improve the system’s physical layer security. In the proposed scheme, the base station directly serves a nearby user while using a UAV relay to serve a disaster-affected user, and both the users and the UAV relay utilize AN to jointly interfere with eavesdroppers around the users. To accurately characterize and maximize the ergodic secrecy sum rate (ESSR) of the proposed scheme, we derive the corresponding closed-form expressions and design a joint power allocation and interference control (JPAIC) algorithm using particle swarm optimization. Simulations verify the correctness of the theoretical analysis, the ESSR advantage of the proposed scheme compared with the conventional NOMA-CDRT, and the effectiveness of the proposed JPAIC.

1. Introduction

Due to the advantages of wide-area coverage, cost-effectiveness, and deployment flexibility, unmanned aerial vehicle (UAV) communication has been regarded as a crucial enabling technology for future wireless communication networks [1,2,3,4]. UAVs can serve as aerial base stations (BSs) or relays to enhance communication service quality, offering substantial benefits in scenarios such as emergency rescue, post-disaster recovery, and remote area communication [5,6,7]. To further improve spectral efficiency and support massive connections, UAV communication has also been integrated with non-orthogonal multiple access (NOMA) in recent years. Compared with the conventional orthogonal multiple access (OMA), the performance superiority of NOMA is achieved by using power-domain superposition coding and successive interference cancellation (SIC), which allow for the transmission of multi-user signals on the same physical layer resources [8,9]. However, the inherent high-quality line-of-sight (LoS) links and the multi-user information contained in NOMA signals make legitimate nodes of UAV-based NOMA (UAV-NOMA) systems vulnerable to eavesdropping by saboteurs [10,11,12].
To ensure communication security of UAV-NOMA systems, researchers have made significant efforts in direct transmission scenarios. In [12], Zhao et al. proposed a secure transmission scheme for a UAV-NOMA system using multi-antenna beamforming and jointly optimizing power allocation and UAV hovering position. Qian et al. deployed a UAV to collect data from ground sensors and maximized the total secrecy throughput of the UAV-NOMA network by jointly optimizing the scheduling decisions of auxiliary devices and the transmission power of the sensors [13]. Wang et al. proposed a downlink multi-user secure transmission scheme for UAV-NOMA networks based on heterogeneous user needs, achieving the maximization of the minimum secrecy rate through the joint optimization of user scheduling, power allocation, and trajectory design [14]. In [15], Yu et al. derived approximate expressions for the secrecy and reliability outage probabilities of UAV-NOMA-based ultra-reliable and low latency communication networks. The authors in [16] proposed a protection zone scheme for mmWave UAV-NOMA systems to enhance physical layer security by excluding eavesdroppers. Lu et al. designed a secure communication scheme for UAV-NOMA-based mobile edge computing systems, and the authors maximized the security computation capacity by optimizing multiple parameters such as local computing and UAV trajectory [17]. Guo et al. combined UAV-NOMA with simultaneously transmitting and reflecting reconfigurable intelligent surfaces (STAR-RIS), and jointly optimized power control, transmission/reflection coefficients, and the deployment positions of UAV/STAR-RIS to maximize the uplink secure energy efficiency [18]. Diao et al. derived closed-form expressions for connection outage probability, secrecy outage probability, and effective secrecy throughput to characterize the security performance of UAV-NOMA systems with friendly UAV jammers [19]. Sun et al. investigated downlink mmWave simultaneous wireless information and power transfer (SWIPT)-enabled UAV-NOMA systems and derived the corresponding connection outage probability and secrecy outage probability [20]. In [21], Deng et al. optimized the trajectory of a UAV and the transmit power of ground users to ensure the secure and covert communication of the UAV-NOMA system under the threat of eavesdropping UAVs.
Moreover, existing research has investigated secure UAV-NOMA transmission in relay scenarios to promote the diversification of its applications and further improve the communication coverage. In [22], Diao et al. proposed a joint energy transfer and artificial noise (AN) scheme for UAV-NOMA systems in the presence of eavesdropping UAVs. Simulations demonstrated that the proposed scheme promotes green and secure communication in multi-UAV cases. Zhang et al. characterized the performance of a satellite–terrestrial communication system based on NOMA, SWIPT, and UAV relaying by deriving analytical expressions for the secrecy outage probability [23]. To study the security of UAV-NOMA-based cognitive relay systems, the authors in [24] designed an iterative algorithm to maximize the minimum average secrecy rate for secondary users. Zheng et al. derived a closed-form expression for the secrecy outage probability of an underlay cognitive radio-enabled downlink UAV-NOMA network, where the UAV acts as a relay to assist communication between the source and two destination users [25]. The authors in [26] investigated a cognitive multiple input multiple output UAV-NOMA system and minimized the outage probability of the secondary network by optimizing the transmission power and coordinates of the UAV as well as the NOMA power allocation coefficients.
In addition to the pure relay system mentioned above, coordinated direct and relay transmission (CDRT), which evolved from the two-way relay system with analog network coding, is also an important type of relay system [27,28]. Currently, the transmission scheme design for NOMA-based CDRT (NOMA-CDRT) systems has been widely studied, but only a few works focus on secure communication in NOMA-CDRT systems, and these are limited to ground cellular scenarios. For instance, Lv et al. in [29] considered a ground NOMA-CDRT system with one untrusted amplify-and-forward (AF) relay, and designed adaptive cooperative jamming schemes for both downlink and uplink to realize secure transmission. To evaluate the system security performance and provide more insights, Lv et al. further derived a closed-form lower bound of the ergodic secrecy sum rate (ESSR) for the ground NOMA-CDRT system in [30]. Moreover, Lei et al. in [31] introduced physical layer network coding into the untrusted AF relay-based NOMA-CDRT system and utilized inter-user interference and friendly interference signals to enhance system security.
The aforementioned research provides meaningful insights into improving the security of NOMA-CDRT systems, but challenges remain in secure UAV-aided NOMA-CDRT systems: (1) Existing research on secure NOMA-CDRT primarily focused on AF relay configurations and ground communication scenarios. Given the noise amplification characteristics of AF relays and the advantages of flexible UAV deployment, it is crucial to study the secure UAV-aided NOMA-CDRT systems using the decode-and-forward (DF) strategy [32]. However, to the best of our knowledge, no secure UAV-assisted NOMA-CDRT schemes employing DF relays have yet been identified. (2) Existing related work mainly addressed scenarios with untrusted relays and has not sufficiently explored secure NOMA-CDRT in the presence of multiple ground eavesdroppers. (3) The DF characteristics create multiple opportunities for eavesdroppers to intercept legitimate information, and the UAV LoS link further exacerbates this vulnerability.
Motivated by the above observations, this paper studies the secure transmission design and performance optimization of the UAV-aided NOMA-CDRT system with a DF relay. The contributions of this paper are as follows.
  • This paper proposes a multi-node joint jamming (MNJJ) scheme using AN to achieve secure UAV-assisted NOMA-CDRT. In the proposed scheme, the BS uses NOMA to provide services to the nearby user while communicating with the disaster-affected user via a UAV relay. Both the users and the UAV collaboratively send AN to interfere with the surrounding eavesdroppers.
  • To accurately characterize the security performance of the proposed scheme, we use double factorization and Gaussian–Chebyshev quadrature to derive the closed-form expressions of the ESSR under two conditions: when the legitimate nodes are aware of each other’s AN and when they are not.
  • We design a joint power allocation and interference control (JPAIC) algorithm using particle swarm optimization (PSO) for the proposed MNJJ scheme. The proposed JPAIC determines the optimal scheme selection under different conditions and maximizes the ESSR. Simulations demonstrate the ESSR advantages of the proposed MNJJ over the conventional NOMA-CDRT (CNC) and the effectiveness of the proposed JPAIC.
To clearly present the research approach, Figure 1 provides a concise framework of our work. The remainder of this paper is organized as follows. Section 2 introduces the system model, and Section 3 presents the proposed MNJJ scheme. Section 4 provides the ESSR performance analysis and the proposed JPAIC. Section 5 gives the simulation results and Section 6 concludes the paper.
Notation: f Z ( z ) and F Z ( z ) represent the probability density function (PDF) and cumulative distribution function (CDF) of the variable Z, respectively. CN ( 0 , 1 ) represents a complex Gaussian distribution with mean zero and variance one. E [ · ] denotes the expectation operator, Ei ( · ) and Γ ( · ) represent the exponential integral function and the Gamma function, respectively. Denote [ z ] + = max ( z , 0 ) . Ψ ¯ = Ψ Θ Θ 1 means replacing all instances of Θ in Ψ with Θ 1 to obtain Ψ ¯ .

2. System Model

2.1. System Configuration

As shown in Figure 2, this paper investigates the physical layer security of a downlink UAV-aided NOMA-CDRT system, which consists of one BS, one DF-based UAV relay, two legitimate users (i.e., U 1 and U 2 ), and two eavesdroppers (i.e., E 1 and E 2 ). A typical application scenario for the considered system is emergency rescue. Specifically, when the BS in cell 2 is damaged or non-functional due to a sudden disaster or fault, the BS in cell 1 can use the UAV relay to serve U 2 while also communicating with its own cell user U 1 . There are potential eavesdroppers E 1 and E 2 near users U 1 and U 2 , respectively. These two eavesdroppers with strong computing power attempt to intercept any legitimate information. Assume that all devices are equipped with a single antenna and legitimate nodes can switch between half-duplex and full-duplex modes as needed. A transmission cycle consists of two time slots t 1 and t 2 . Both legitimate signals and AN have zero mean and unit variance.
Hereafter, the subscripts s, r, u 1 , u 2 , e 1 , e 2 , 1, and 2 represent the BS, UAV, U 1 , U 2 , E 1 , E 2 , t 1 , and t 2 , respectively. Figure 2 establishes a three-dimensional Cartesian coordinate framework, where the coordinate of the node i, i { s , r , u 1 , u 2 , e 1 , e 2 } , is expressed as ( x i , y i , z i ) . Without loss of generality, we assume that the BS and the UAV are in the x z plane, with the ground projection of the UAV at the origin of the x y plane. The UAV hovers at a fixed height z r during transmission. The distance between nodes i and j { s , r , u 1 , u 2 , e 1 , e 2 } , j i , is d i j = ( x i x j ) 2 + ( y i y j ) 2 + ( z i z j ) 2 .

2.2. Channel Model

We assume that all channel links follow quasi-static block fading and include additive white Gaussian noise (AWGN) with zero mean and variance N 0 . Let n i k represent the AWGN at node i during the k-th, k { 1 , 2 } , time slot. Define the channel coefficient, channel power, and path loss between ground nodes i ¯ { s , u 1 , u 2 } and j ¯ { u 1 , e 1 , e 2 } , j ¯ i ¯ , during the k-th time slot as h i ¯ j ¯ k , G , H i ¯ j ¯ k , G = | h i ¯ j ¯ k , G | 2 , and L i ¯ j ¯ G , respectively. The small-scale fading of a ground-to-ground (G2G) link is modeled as a Rayleigh distribution, i.e., h i ¯ j ¯ k , G CN ( 0 , 1 ) , while the corresponding path loss can be modeled as L i ¯ j ¯ G = β G ( d i ¯ j ¯ ) α G , where β G = ( 4 π f c c ) 2 is the path loss coefficient at the unit reference distance, and α G = 3 is the path loss exponent, usually greater than two for G2G links. The parameter c = 3 × 10 8 m/s is the speed of light and f c is the carrier frequency.
Similarly, we denote the channel coefficient, channel power, and path loss for the air-to-ground (A2G) link from the UAV to ground node j ˜ { u 1 , u 2 , e 1 , e 2 } as h r j ˜ k , A , H r j ˜ k , A = | h r j ˜ k , A | 2 , and L r j ˜ A = β r j ˜ A ( d r j ˜ ) α A , where β r j ˜ A and α A are the reference path loss coefficient and path loss exponent for A2G links, respectively. Specifically, we set α A = 2 and β r j ˜ A = 10 β 1 A / 10 + β 2 A / ( 10 + 10 C e D ( θ r j ˜ C ) ) according to the Type B channel model described in [33], where β 1 A = 10 log 10 ( 4 π f c c ) 2 + η N L O S , β 2 A = η L O S η N L O S , θ r j ˜ = 180 π arcsin ( z r d r j ˜ ) is the angle of elevation. For suburban areas, we set C = 5.0188 , D = 0.3511 , η L O S = 0.1 dB, and η N L O S = 21 dB. The small-scale fading of the A2G link is modeled as Nakagami-m fading with shape parameter m, which we consider as an integer for simplicity. The PDF and CDF of H r j ˜ A , k can be written as f H r j ˜ k , A ( z ) = m r j ˜ m r j ˜ z m r j ˜ 1 / Γ ( m r j ˜ ) exp ( m r j ˜ z ) , and F H r j ˜ k , A ( z ) = 1 exp ( m r j ˜ z ) l = 0 m r j ˜ 1 ( m r j ˜ z ) l / l ! . Note that the channel modeling for ground-to-air (G2A) links is the same as for A2G links. Assume L s u 1 H < L s r A due to the typically greater distance between the BS and the UAV compared to the BS and U 1 .

3. Secure MNJJ Scheme Design

To enhance the system’s physical layer security, this section proposes an MNJJ scheme for the UAV-aided NOMA-CDRT system, as illustrated in Figure 3. The proposed MNJJ includes two time slots, detailed as follows.

3.1. First Phase

In t 1 , the BS broadcasts a superposition coded signal S s = a 1 P s s 1 + a 2 P s s 2 , where P s is the transmission power of the BS, and s 1 and s 2 are the signals intended for U 1 and U 2 , respectively. Since U 2 requires UAV assistance, the power allocation coefficients are set as a 2 > a 1 and a 1 + a 2 = 1 . The UAV and U 1 switch to full-duplex mode and receive the signal from the BS while simultaneously sending AN J r 1 and J u 1 1 to interfere with E 1 . Here, we consider two cases: (1) Case I, where the legitimate nodes are unaware of each other’s AN, and (2) Case II, where legitimate nodes can know each other’s AN. When considering Case I, simultaneous sending of AN by the UAV and U 1 may interfere with each other. In Case II, legitimate nodes can use the known AN to eliminate the corresponding interference from other legitimate nodes by estimating channel and power parameters. To determine the optimal secure transmission method under different cases, we consider three types of the proposed MNJJ: both U 1 and the UAV turn on the jamming (i.e., NN), only U 1 turns on the jamming (i.e., NF), and only the UAV turns on the jamming (i.e., FN). The received signals at U 1 , the UAV, and E 1 in t 1 can be written as
y u 1 1 = h s u 1 1 , G ( L s u 1 G ) 1 P s S s + h r u 1 1 , A ( L r u 1 A ) 1 κ r 1 b r 1 P m J r 1 + h u 1 u 1 1 , G χ u 1 1 P R S I J u 1 1 + n u 1 1 ,
y r 1 = h s r 1 , A ( L s r A ) 1 P s S s + h u 1 r 1 , A ( L u 1 r A ) 1 κ u 1 1 b u 1 1 P m J u 1 1 + h r r 1 , A χ r 1 P R S I J r 1 + n r 1 ,
and
y e 1 1 = h s e 1 1 , G ( L s e 1 G ) 1 P s S s + h r e 1 1 , A ( L r e 1 A ) 1 χ r 1 b r 1 P m J r 1 + h u 1 e 1 1 , G ( L u 1 e 1 G ) 1 χ u 1 1 b u 1 1 P m J u 1 1 + n e 1 1 ,
where h u 1 u 1 1 , G and h r r 1 , A are the self-interference channel coefficients at U 1 and the UAV in t 1 , respectively, and P m is the maximum interference power of each node. χ i 1 = 0 and χ i 1 = 1 indicate that the node i { r , u 1 } turns off and turns on jamming in t 1 , respectively. When χ i 1 = 1 , the conditions κ i 1 = 1 and κ i 1 = 0 represent Case I and Case II. The interference power coefficient b i 1 satisfies 0 b i 1 1 . Note that b i 1 = 0 holds when χ i 1 = 0 , and 0 < b i 1 1 holds when χ i 1 = 1 . The ratio of residual interference power P R S I resulting from self-interference cancellation to noise power N 0 , denoted as ρ R S I P R S I N 0 , is typically set in the range of 3 dB to 15 dB [34].
The user U 1 employs SIC to sequentially decode s 2 and s 1 . Therefore, the signal-to-interference-plus-noise ratios (SINRs) for decoding s 2 and s 1 at U 1 are written as
γ u 1 , s 2 1 = H s u 1 1 , G ( L s u 1 G ) 1 ρ s a 2 H s u 1 1 , G ( L s u 1 G ) 1 ρ s a 1 + H r u 1 1 , A ( L r u 1 A ) 1 κ r 1 b r 1 ρ m + H u 1 u 1 1 , G χ u 1 1 ρ R S I + 1 ,
and
γ u 1 , s 1 1 = H s u 1 1 , G ( L s u 1 G ) 1 ρ s a 1 H r u 1 1 , A ( L r u 1 A ) 1 κ r 1 b r 1 ρ m + H u 1 u 1 1 , G χ u 1 1 ρ R S I + 1 ,
where H u 1 u 1 1 , G = | h u 1 u 1 1 , G | 2 , ρ s P s N 0 , and ρ m P m N 0 . Similarly, the UAV directly decodes s 2 treating s 1 as interference. The corresponding SINR can be written as
γ r , s 2 1 = H s r 1 , A ( L s r A ) 1 ρ s a 2 H s r 1 , A ( L s r A ) 1 ρ s a 1 + H u 1 r 1 , A ( L u 1 r A ) 1 κ u 1 1 b u 1 1 ρ m + H r r 1 , A χ r 1 ρ R S I + 1 ,
where H r r 1 , A = | h r r 1 , A | 2 . Based on (3), the eavesdropper E 1 may eavesdrop on both s 1 and s 2 in t 1 . Considering the worst case, we assume that E 1 has powerful computational capabilities and can directly distinguish signals s 1 and s 2 from the received signal [35]. The SINRs for E 1 to decode s 2 and s 1 can be written as
γ e 1 , s 2 1 = H s e 1 1 , G ( L s e 1 G ) 1 ρ s a 2 H r e 1 1 , A ( L r e 1 A ) 1 χ r 1 b r 1 ρ m + H u 1 e 1 1 , G ( L u 1 e 1 G ) 1 χ u 1 1 b u 1 1 ρ m + 1 ,
and
γ e 1 , s 1 1 = H s e 1 1 , G ( L s e 1 G ) 1 ρ s a 1 H r e 1 1 , A ( L r e 1 A ) 1 χ r 1 b r 1 ρ m + H u 1 e 1 1 , G ( L u 1 e 1 G ) 1 χ u 1 1 b u 1 1 ρ m + 1 .

3.2. Second Phase

In t 2 , the UAV forwards the decoded s 2 with power P r to U 2 , and the BS sends a new signal s 1 to U 1 . At this time, E 1 attempts to intercept both s 1 and s 2 , while E 2 tries to intercept s 2 . By using the full-duplex mode, U 1 and U 2 simultaneously receive signals and transmit AN J u 1 2 and J u 2 2 with powers b u 1 2 P m and b u 2 2 P m to interfere with the corresponding eavesdroppers. Here, 0 < b u 1 2 1 and 0 < b u 2 2 1 denote the self-interference power coefficients at U 1 and U 2 in t 2 . Consequently, after self-interference cancellation, the received signal at U 1 can be expressed as y u 1 2 = h s u 1 2 , G P s ( L s u 1 G ) 1 s 1 + h r u 1 2 , A P r ( L r u 1 A ) 1 s 2 + h u 1 u 1 2 , G P R S I J u 1 2 + n u 1 2 . Since U 1 has prior information about s 2 , it can estimate h r u 1 2 , A P r ( L r u 1 A ) 1 and then cancel the interference term h r u 1 2 , A P r ( L r u 1 A ) 1 s 2 from y u 1 2 . Based on this, the SINR for U 1 to decode s 1 in t 2 can be written as
γ u 1 , s 1 2 = H s u 1 2 , G ( L s u 1 G ) 1 ρ s H u 1 u 1 2 , G ρ R S I + 1 ,
where H u 1 u 1 2 , G = | h u 1 u 1 2 , G | 2 .
Similarly, the received signal at E 1 can be written as y e 1 2 = h s e 1 2 , G P s ( L s e 1 G ) 1 s 1 + h r e 1 2 , A P r ( L r e 1 A ) 1 s 2 + h u 1 e 1 2 , G ( L u 1 e 1 G ) 1 b u 1 2 P m J u 1 2 + n e 1 2 . Considering the worst case, E 1 can distinguish signals s 1 and s 2 . In this case, the SINRs for E 1 attempting to eavesdrop on s 1 and s 2 are written as
γ e 1 , s 1 2 = H s e 1 2 , G ( L s e 1 G ) 1 ρ s H u 1 e 1 2 , G ( L u 1 e 1 G ) 1 b u 1 2 ρ m + 1 ,
and
γ e 1 , s 2 2 = H r e 1 2 , A ( L r e 1 A ) 1 ρ r H u 1 e 1 2 , G ( L u 1 e 1 G ) 1 b u 1 2 ρ m + 1 .
The user U 2 receives the relaying signal and its own AN. After self-interference cancellation, the received signal at U 2 can be written as y u 2 2 = h r u 2 2 , A P r ( L r u 2 A ) 1 s 2 + h u 2 u 2 2 , G P R S I J u 2 2 + n u 2 2 . Therefore, the SINR for U 2 to decode s 2 is
γ u 2 , s 2 2 = H r u 2 2 , A ( L r u 2 A ) 1 ρ r H u 2 u 2 2 , G ρ R S I + 1 .
Similarly, the received signal at E 2 can be expressed as y e 2 2 = h r e 2 2 , A P r ( L r e 2 A ) 1 s 2 + h u 2 e 2 2 , G ( L u 2 e 2 G ) 1 b u 2 2 P m J u 2 2 + n e 2 2 . The SINR for E 2 to decode s 2 is given by
γ e 2 , s 2 2 = H r e 2 2 , A ( L r e 2 A ) 1 ρ r H u 2 e 2 2 , G b u 2 2 ( L u 2 e 2 G ) 1 ρ m + 1 .
Note that the proposed scheme can be readily extended to a multi-antenna scenario using the existing transmit antenna selection technique [36]. The proposed scheme can be expanded to accommodate more users by utilizing existing user pairing methods, which helps manage system complexity within practical limits [37,38].

4. Performance Analysis and Optimization

This section derives the closed-form expressions for the ESSRs of the NN, NF, and FN for the proposed MNJJ under Case I and Case II to precisely characterize system security performance. Based on γ u 1 , s 1 1 and γ e 1 , s 1 1 , the achievable ergodic secrecy rate (ESR) for s 1 is S R s 1 = E 1 2 log 2 ( 1 + γ u 1 , s 1 1 ) E 1 2 log 2 ( 1 + γ e 1 , s 1 1 ) +  [39,40,41,42]. Using γ u 1 , s 1 2 and γ e 1 , s 1 2 , the achievable ESR for s 1 is S R s 1 = E 1 2 log 2 ( 1 + γ u 1 , s 1 2 ) E 1 2 log 2 ( 1 + γ e 1 , s 1 2 ) + . The achievable ergodic rate of s 2 over the DF dual-hop link is limited by the weaker link. Additionally, U 1 needs to decode s 2 first and then decode s 1 in t 1 . Therefore, the achievable ergodic rate for s 2 at U 2 can be expressed as L R s 2 = E 1 2 log 2 ( 1 + min ( γ u 1 , s 2 1 , γ r , s 2 1 , γ u 2 , s 2 2 ) ) . The reception of s 2 at E 2 requires the assistance of the UAV relay, and thus, the achievable ergodic rate for s 2 at E 2 is also constrained by the poorer channel quality in the DF dual-hop link and can be expressed as 1 2 log 2 ( 1 + min ( γ r , s 2 1 , γ e 2 , s 2 2 ) ) . Due to the DF process of the UAV relay, E 1 has the opportunity to eavesdrop on s 2 during both t 1 and t 2 . Overall, if either E 1 or E 2 intercepts s 2 during the entire transmission period, it compromises communication security. Therefore, the achievable ergodic rate for s 2 at the eavesdroppers is given by E R s 2 = E 1 2 log 2 ( 1 + max ( γ e 1 , s 2 2 , min ( γ r , s 2 1 , γ e 2 , s 2 2 ) , γ e 1 , s 2 1 ) ) . Based on this, the ESR for s 2 is S R s 2 = L R s 2 E R s 2 + .
For derivation, we present the following valid equations
0 log 2 ( 1 + z ) f Z ( z ) d z = 1 ln 2 0 1 F Z ( z ) 1 + z d z ,
and
1 ( z + W ) b ( z + T ) = b 1 = 1 b 1 W T b 1 1 ( z + W ) b ¯ + 1 W T b 1 z + T ,
where b ¯ = b b 1 + 1 .

4.1. ESR for the Proposed MNJJ in Case I

4.1.1. NN in Case I

The following theorem provides the ESR of s 1 for the NN in Case I.
Theorem 1.
When legitimate nodes cannot know each other’s AN (i.e., Case I), the closed-form expression of the ESR for s 1 in the NN can be written as S R s 1 NN I = L R s 1 NN I E R s 1 NN I + , where
L R s 1 NN I = m r u 1 m r u 1 2 ln 2 ( Ω 2 1 ) Ω 1 m r u 1 { i 1 = 1 m r u 1 Ω 1 m r u 1 Ω 1 i 1 Ω 1 Ω 2 m r u 1 Ω 2 Ω 1 i 1 Φ 1 + Ω 1 Ω 2 m r u 1 Ω 2 Ω 1 m r u 1 Φ 2 Ω 1 m r u 1 Ω 1 m r u 1 Φ 3 } ,
and
E R s 1 NN I = L R s 1 NN I m r u 1 m r e 1 , Ω 1 Ω 4 , Ω 2 Ω 5 , Ω 3 Ω 6 ,
where
Φ 1 = exp m r u 1 Ω 3 Ω 1 { ( 1 ) i ¯ 1 Ω 3 i ¯ 1 1 Ei ( Ω 3 m r u 1 / Ω 1 ) ( i ¯ 1 1 ) ! + exp ( Ω 3 m r u 1 / Ω 1 ) ( m r u 1 / Ω 1 ) i ¯ 1 1 i 2 = 0 i ¯ 1 2 ( Ω 3 m r u 1 / Ω 1 ) i 2 ( i ¯ 1 i 2 2 ) ! ( i ¯ 1 1 ) ! } ,
Φ 2 = exp ( Ω 3 Ω 2 ) Ei ( Ω 3 Ω 2 ) , Φ 3 = exp ( Ω 3 ) Ei ( Ω 3 ) , Ω 1 = ( L r u 1 A ) 1 b r 1 ρ m ( L s u 1 G ) 1 a 1 ρ s , Ω 2 = ρ R S I ( L s u 1 G ) 1 a 1 ρ s , Ω 3 = 1 ( L s u 1 G ) 1 a 1 ρ s , Ω 4 = ( L r e 1 A ) 1 b r 1 ρ m ( L s e 1 G ) 1 a 1 ρ s , Ω 5 = ( L u 1 e 1 G ) 1 b u 1 1 ρ m ( L s e 1 G ) 1 a 1 ρ s , Ω 6 = 1 ( L s e 1 G ) 1 a 1 ρ s , and i ¯ 1 = m r u 1 i 1 + 1 .
Proof. 
See Appendix A.    □
Based on (9) and (10), we let U s 1 I 1 H s u 1 2 , G ( L s u 1 G ) 1 ρ s H u 1 u 1 2 , G ρ R S I + 1 and V s 1 I 1 H s e 1 2 , G ( L s e 1 G ) 1 ρ s H u 1 e 1 2 , G ( L u 1 e 1 G ) 1 b u 1 2 ρ m + 1 . The CDFs of U s 1 I 1 and V s 1 I 1 can be easily obtained as F U s 1 I 1 ( u ) = 1 exp ( Ω 8 u ) / ( 1 + Ω 7 u ) and F V s 1 I 1 ( v ) = 1 exp ( Ω 10 v ) / ( 1 + Ω 9 v ) , where Ω 7 = ρ R S I / ( ( L s u 1 G ) 1 ρ s ) , Ω 8 = 1 / ( ( L s u 1 G ) 1 ρ s ) , Ω 9 = ( L u 1 e 1 G ) 1 b u 1 2 ρ m / ( ( L s e 1 G ) 1 ρ s ) , and Ω 10 = 1 / ( ( L s e 1 G ) 1 ρ s ) .
Using (14) and  [43] (Equation (3.352.4)), the ESR for s 1 can be calculated as
S R s 1 NN I = 1 2 ln 2 0 1 F U s 1 I 1 ( u ) 1 + u d u 0 1 F V s 1 I 1 ( v ) 1 + v d v + = 1 2 ln 2 [ 1 ( Ω 7 1 ) exp Ω 8 Ω 7 Ei Ω 8 Ω 7 + exp Ω 8 Ei Ω 8 1 ( Ω 9 1 ) exp Ω 10 Ω 9 Ei Ω 10 Ω 9 + exp ( Ω 10 ) Ei ( Ω 10 ) ] + .
According to L R s 2 , the ergodic rate of s 2 at U 2 in the NN is L R s 2 NN I = E 1 2 log 2 ( 1 + U s 2 I 1 ) , where U s 2 I 1 min ( U s 2 I 1 1 , U s 2 I 1 2 , U s 2 I 1 3 ) , U s 2 I 1 1 H s u 1 1 , G ( L s u 1 G ) 1 ρ s a 2 H s u 1 1 , G ( L s u 1 G ) 1 ρ s a 1 + H r u 1 1 , A ( L r u 1 A ) 1 b r 1 ρ m + H u 1 u 1 1 , G ρ R S I + 1 , U s 2 I 1 2 H s r 1 , A ( L s r A ) 1 ρ s a 2 H s r 1 , A ( L s r A ) 1 ρ s a 1 + H u 1 r 1 , A ( L u 1 r A ) 1 b u 1 1 ρ m + H r r 1 , A ρ R S I + 1 , and U s 2 I 1 3 γ u 2 , s 2 2 . By using (6), (7), (11), (13), and E R s 2 , the ergodic rate of s 2 at the eavesdroppers in the NN can be rewritten as E R s 2 NN I = E 1 2 log 2 ( 1 + V s 2 I 1 ) , where V s 2 I 1 max ( V s 2 I 1 1 , min ( U s 2 I 1 2 , V s 2 I 1 2 ) , V s 2 I 1 3 ) , V s 2 I 1 1 = γ e 1 , s 2 2 , V s 2 I 1 2 = γ e 2 , s 2 2 , and V s 2 I 1 3 = H s e 1 1 , G ( L s e 1 G ) 1 ρ s a 2 H r e 1 1 , A ( L r e 1 A ) 1 b r 1 ρ m + H u 1 e 1 1 , G ( L u 1 e 1 G ) 1 b u 1 1 ρ m + 1 . Based on this, the ESR of s 2 for the NN in Case I is given in the following theorem.
Theorem 2.
In Case I, the closed-form expression of the ESR for s 2 in the NN can be written as S R s 2 NN I = L R s 2 NN I E R s 2 NN I + , where
L R s 2 NN I = a 2 π 4 ln 2 a 1 N 1 n 1 = 1 N 1 1 ( φ n 1 ) 2 1 F ˜ U s 2 I 1 ( u n 1 ) 1 + u n 1 ,
and
E R s 2 NN I = π 4 ln 2 { a 2 a 1 N 2 n 2 = 1 N 2 1 ( φ n 2 ) 2 1 F ˙ V s 2 I 1 ( v n 2 ) 1 + v n 2 + 1 N 3 π 2 arctan a 2 a 1 n 3 = 1 N 3 1 ( φ n 3 ) 2 ( sec v n 3 ) 2 1 F ¨ V s 2 I 1 ( tan v n 3 ) 1 + tan v n 3 } ,
where F ˜ U s 2 I 1 ( u ) = 1 ( 1 F ˜ U s 2 I 1 1 ( u ) ) ( 1 F ˜ U s 2 I 1 2 ( u ) ) ( 1 F U s 2 I 1 3 ( u ) ) , F ˙ V s 2 I 1 ( v ) = ( 1 ( 1 F ˜ U s 2 I 1 2 ( v ) ) ( 1 F V s 2 I 1 2 ( v ) ) ) F V s 2 I 1 1 ( v ) F V s 2 I 1 3 ( v ) , F ¨ V s 2 I 1 ( v ) = F V s 2 I 1 1 ( v ) F V s 2 I 1 3 ( v ) . Additionally, we have
F ˜ U s 2 I 1 1 ( u ) = 1 m r u 1 m r u 1 ( a 2 a 1 u ) m r u 1 + 1 ( Ω 12 a 2 a 1 ) u + a 2 ( Ω 11 a 2 m r u 1 a 1 ) u + m r u 1 a 2 m r u 1 exp Ω 13 a 2 u a 2 a 1 u , F ˜ U s 2 I 1 2 ( u ) = 1 exp ( m s r Ξ 3 ( u ) ) i 3 = 0 m s r 1 i 4 = 0 i 3 i 5 = 0 i 4 i 3 i 4 i 4 i 5 ( m s r Ξ 3 ( u ) ) i 3 i 3 !
× ( Ω 14 ) i 3 i 4 ( ρ R S I ) i 4 i 5 m u 1 r m u 1 r m r r m r r Γ ( i 3 i 4 + m u 1 r ) Γ ( i 4 i 5 + m r r ) Γ ( m u 1 r ) Γ ( m r r ) ( m s r Ξ 1 ( u ) + m u 1 r ) i 3 i 4 + m u 1 r ( m s r Ξ 2 ( u ) + m r r ) i 4 i 5 + m r r ,
F U s 2 I 1 3 ( u ) = 1 exp ( m r u 2 Ω 16 u ) i 6 = 0 m r u 2 1 i 7 = 0 i 6 i 6 i 7 Γ ( i 7 + 1 ) ( Ω 15 ) i 7 ( m r u 2 Ω 16 v ) i 6 i 6 ! ( Ω 16 ) i 7 ( m r u 2 Ω 15 v + 1 ) i 7 + 1 ,
F V s 2 I 1 1 ( v ) = 1 exp ( m r e 1 Ω 18 v ) i 8 = 0 m r e 1 1 i 9 = 0 i 8 i 8 i 9 Γ ( i 9 + 1 ) ( Ω 17 ) i 9 ( m r e 1 Ω 18 v ) i 8 i 8 ! ( Ω 18 ) i 9 ( m r e 1 Ω 17 v + 1 ) i 9 + 1 ,
F V s 2 I 1 2 ( v ) = 1 exp ( m r e 2 Ω 20 v ) i 10 = 0 m r e 2 1 i 11 = 0 i 10 i 10 i 11 Γ ( i 11 + 1 ) ( Ω 19 ) i 11 ( m r e 2 Ω 20 v ) i 10 i 10 ! ( Ω 20 ) i 11 ( m r e 2 Ω 19 v + 1 ) i 11 + 1 ,
F V s 2 I 1 3 ( v ) = 1 m r e 1 m r e 1 exp ( Ω 23 v ) ( Ω 22 v + 1 ) ( Ω 21 v + m r e 1 ) m r e 1 ,
where Ω 11 = ( L r u 1 A ) 1 b r 1 ρ m ( L s u 1 G ) 1 ρ s a 2 , Ω 12 = ρ R S I ( L s u 1 G ) 1 ρ s a 2 , Ω 13 = 1 ( L s u 1 G ) 1 ρ s a 2 , Ω 14 = ( L u 1 r A ) 1 b u 1 1 ρ m , Ω 15 = ρ R S I ( L r u 2 A ) 1 ρ r , Ω 16 = 1 ( L r u 2 A ) 1 ρ r , Ω 17 = ( L u 1 e 1 G ) 1 b u 1 2 ρ m ( L r e 1 A ) 1 ρ r , Ω 18 = 1 ( L r e 1 A ) 1 ρ r , Ω 19 = b u 2 2 ( L u 2 e 2 G ) 1 ρ m ( L r e 2 A ) 1 ρ r , Ω 20 = 1 ( L r e 2 A ) 1 ρ r , Ω 21 = ( L r e 1 A ) 1 b r 1 ρ m ( L s e 1 G ) 1 ρ s a 2 , Ω 22 = ( L u 1 e 1 G ) 1 b u 1 1 ρ m ( L s e 1 G ) 1 ρ s a 2 , Ω 23 = 1 ( L s e 1 G ) 1 ρ s a 2 , Ξ 1 ( u ) = ( L u 1 r A ) 1 b u 1 1 ρ m u ( L s r A ) 1 ρ s ( a 2 a 1 u ) , Ξ 2 ( u ) = ρ R S I u ( L s r A ) 1 ρ s ( a 2 a 1 u ) , Ξ 3 ( u ) = u ( L s r A ) 1 ρ s ( a 2 a 1 u ) , φ n 1 = cos ( 2 n 1 1 2 N 1 π ) , φ n 2 = cos ( 2 n 2 1 2 N 2 π ) , φ n 3 = cos ( 2 n 3 1 2 N 3 π ) , u n 1 = a 2 ( 1 + φ n 1 ) 2 a 1 , v n 2 = a 2 ( 1 + φ n 2 ) 2 a 1 , v n 3 = π ( 1 + φ n 3 ) 4 + ( 1 φ n 3 ) arctan ( a 2 / a 1 ) 2 , and N 1 , N 2 , and N 3 are the complexity–accuracy trade-off parameters.
Proof. 
See Appendix B.    □

4.1.2. NF in Case I

When considering the NF in Case I, the conditions κ i 1 = 1 , χ u 1 1 = 1 , and χ r 1 = 0 hold. Based on S R s 1 , (5), and (8), the ESR of s 1 for the NF in Case I can be written as S R s 1 NF I = L R s 1 NF I E R s 1 NF I + , where L R s 1 NF I = E 1 2 log 2 ( 1 + U s 1 I 2 ) , E R s 1 NF I = E 1 2 log 2 ( 1 + V s 1 I 2 ) , U s 1 I 2 H s u 1 1 , G ( L s u 1 G ) 1 ρ s a 1 H u 1 u 1 1 , G ρ R S I + 1 , and V s 1 I 2 H s e 1 1 , G ( L s e 1 G ) 1 ρ s a 1 H u 1 e 1 1 , G ( L u 1 e 1 G ) 1 b u 1 1 ρ m + 1 . When b r 1 = 0 , U s 1 I 1 degenerates into U s 1 I 2 . Therefore, based on (A1), we can easily obtain F U s 1 I 2 ( u ) = 1 exp ( Ω 3 u ) Ω 2 u + 1 . Using (14), (15), and [43] (Equation (3.352.4)), we can calculate L R s 1 NF I as
L R s 1 NF I = 1 2 ln 2 0 exp ( Ω 3 u ) ( 1 + u ) ( 1 + Ω 2 u ) d u = Φ 2 Φ 3 2 ln 2 ( Ω 2 1 ) .
By comparing V s 1 I 2 and U s 1 I 2 , we can use (23) to obtain
E R s 1 NF I = L R s 1 NF I Ω 2 Ω 5 , Ω 3 Ω 6 .
Combining (23) and (24), we obtain S R s 1 NF I .
By observing (9) and (10), changes in the values of κ i 1 , χ u 1 1 , and χ r 1 have no effect on the SINRs for U 1 and E 1 to decode s 1 in t 2 . Hence, we have S R s 1 NF I = S R s 1 NN I .
Let U s 2 I 2 1 H s u 1 1 , G ( L s u 1 G ) 1 ρ s a 2 H s u 1 1 , G ( L s u 1 G ) 1 ρ s a 1 + H u 1 u 1 1 , G ρ R S I + 1 , U s 2 I 2 2 H s r 1 , A ( L s r A ) 1 ρ s a 2 H s r 1 , A ( L s r A ) 1 ρ s a 1 + H u 1 r 1 , A ( L u 1 r A ) 1 b u 1 1 ρ m + 1 , and U s 2 I 2 3 γ u 2 , s 2 2 . Based on L R s 2 , the ergodic rate of s 2 at U 2 for the NF in t 2 can be written as L R s 2 NF I = E 1 2 log 2 ( 1 + min ( U s 2 I 2 1 , U s 2 I 2 2 , U s 2 I 2 3 ) ) . Since U s 2 I 2 1 = U s 2 I 1 1 b r 1 0 , the CDF of U s 2 I 2 1 can be directly obtained with the help of (A4), as shown by
F U s 2 I 2 1 ( u ) = F ˜ U s 2 I 2 1 ( u ) = F ˜ U s 2 I 1 1 Ω 11 0 , u < a 2 a 1 , 1 , u a 2 a 1 .
Following the similar steps in (A5) and (A6), the CDF of U s 2 I 2 2 can be written as
F U s 2 I 2 2 ( u ) = F ˜ U s 2 I 2 2 ( u ) , u < a 2 a 1 , 1 , u a 2 a 1 ,
where
F ˜ U s 2 I 2 2 ( u ) = 1 exp ( m s r Ξ 3 ( u ) )   × i 3 = 0 m s r 1 i 4 = 0 i 3 i 3 i 4 ( m s r Ξ 3 ( u ) ) i 3 ( Ω 14 ) i 3 i 4 m u 1 r m u 1 r Γ ( i 3 i 4 + m u 1 r ) i 3 ! Γ ( m u 1 r ) ( m s r Ξ 1 ( u ) + m u 1 r ) i 3 i 4 + m u 1 r .
Since γ u 2 , s 2 2 is the same in both the NN and NF, we have F U s 2 I 2 3 ( u ) = F U s 2 I 1 3 ( u ) . Using the order statistics and (20), the closed-form expression for L R s 2 NF I is
L R s 2 NF I = L R s 2 NN I F ˜ U s 2 I 1 ( u n 1 ) F ˜ U s 2 I 2 ( u n 1 ) ,
where F ˜ U s 2 I 2 ( u ) = 1 ( 1 F ˜ U s 2 I 2 1 ( u ) ) ( 1 F ˜ U s 2 I 2 2 ( u ) ) ( 1 F U s 2 I 2 3 ( u ) ) .
Moreover, based on E R s 2 , the ergodic rate of s 2 achieved by the eavesdroppers in this case can be rewritten as E R s 2 NF I = E 1 2 log 2 ( 1 + max ( V s 2 I 2 1 , min ( U s 2 I 2 2 , V s 2 I 2 2 ) , V s 2 I 2 3 ) ) , where V s 2 I 2 1 = V s 2 I 1 1 , V s 2 I 2 2 = V s 2 I 1 2 , and V s 2 I 2 3 = V s 2 I 1 3 b r 1 0 . Recalling (22d), (22e), and (22f), we have F V s 2 I 2 1 ( v ) = F V s 2 I 1 1 ( v ) , F V s 2 I 2 2 ( v ) = F V s 2 I 1 2 ( v ) , and F V s 2 I 2 3 ( v ) = 1 exp ( Ω 23 v ) / ( Ω 22 v + 1 ) . Furthermore, utilizing (21), E R s 2 NF I can be written as E R s 2 NF I = E R s 2 NN I F ˙ V s 2 I 1 ( v n 2 ) F ˙ V s 2 I 2 ( v n 2 ) , F ¨ V s 2 I 1 ( tan v n 3 ) F ¨ V s 2 I 2 ( tan v n 3 ) , where F ˙ V s 2 I 2 ( v ) = ( 1 ( 1 F ˜ U s 2 I 2 2 ( v ) ) ( 1 F V s 2 I 2 2 ( v ) ) ) F V s 2 I 2 1 ( v ) F V s 2 I 2 3 ( v ) and F ¨ V s 2 I 2 ( v ) = F V s 2 I 2 1 ( v ) F V s 2 I 2 3 ( v ) .
Based on this, the ESR of s 2 for the NF in Case I is written as S R s 2 NF I = L R s 2 NF I E R s 2 NF I + .

4.1.3. FN in Case I

Since κ i 1 = 1 , χ u 1 1 = 0 , and χ r 1 = 1 , the ESR of s 1 for the FN in Case I can be rewritten as S R s 1 FN I = L R s 1 FN I E R s 1 FN I + , where L R s 1 FN I = E 1 2 log 2 ( 1 + U x 1 I 3 ) , E R x 1 FN I = E 1 2 log 2 ( 1 + V x 1 I 3 ) , U s 1 I 3 = U s 1 I 1 ρ R S I 0 , and V s 1 I 3 = V s 1 I 1 b u 1 1 0 . Following the similar steps in (A2), we have
L R s 1 FN I = m r u 1 m r u 1 2 ln 2 Ω 1 m r u 1 i 1 = 1 m r u 1 Ω 1 m r u 1 Ω 1 i 1 Φ 1 Ω 1 m r u 1 Ω 1 m r u 1 Φ 3 ,
and
E R s 1 FN I = L R s 1 FN I ( m r u 1 m r e 1 , Ω 1 Ω 4 , Ω 3 Ω 6 ) .
By combining (29) and (30), the closed-form expression for S R s 1 FN I is obtained.
Moreover, the ESR of s 1 for the FN in Case I is S R s 1 FN I = S R s 1 NN I because γ u 1 , s 1 2 and γ e 1 , s 1 2 remain unchanged.
Based on L R s 2 and E R s 2 , the ergodic rates of s 2 achieved by U 2 and the eavesdroppers in this case can be rewritten as L R s 2 FN I = E 1 2 log 2 ( 1 + min ( U s 2 I 3 1 , U s 2 I 3 2 , U s 2 I 3 3 ) ) and E R s 2 FN I = E 1 2 log 2 ( 1 + max ( V s 2 I 3 1 , min ( U s 2 I 3 2 , V s 2 I 3 2 ) , V s 2 I 3 3 ) ) , respectively, where U s 2 I 3 1 = U s 2 I 1 1 ρ R S I 0 , U s 2 I 3 2 = U s 2 I 1 2 b u 1 1 0 , U s 2 I 3 3 = U s 2 I 1 3 , V s 2 I 3 1 = V s 2 I 1 1 , V s 2 I 3 2 = V s 2 I 1 2 , and V s 2 I 3 3 = V s 2 I 1 3 b u 1 1 0 . Therefore, we can obtain the CDFs of U s 2 I 3 1 , U s 2 I 3 2 , and U s 2 I 3 3 by following similar derivation steps as in (22a), (22b), and (22c), which are given as
F U s 2 I 3 1 ( u ) = F ˜ U s 2 I 3 1 ( u ) = F ˜ U s 2 I 1 1 Ω 12 0 , u < a 2 a 1 , 1 , u a 2 a 1 ,
F U s 2 I 3 2 ( u ) = F ˜ U s 2 I 3 2 ( u ) , u < a 2 a 1 , 1 , u a 2 a 1 ,
and
F U s 2 I 3 3 ( u ) = F U s 2 I 1 3 ( u ) ,
where F ˜ U s 2 I 3 2 ( u ) = 1 exp ( m s r Ξ 3 ( u ) ) i 3 = 0 m s r 1 i 4 = 0 i 3 i 3 i 4 m r r m r r ( m s r Ξ 3 ( u ) ) i 3 ( ρ R S I ) i 3 i 4 Γ ( i 3 i 4 + m r r ) i 3 ! Γ ( m r r ) ( m s r Ξ 2 ( u ) + m r r ) i 3 i 4 + m r r .
Using the order statistics and (20), we have
L R s 2 FN I = L R s 2 NN I F ˜ U s 2 I 1 ( u n 1 ) F ˜ U s 2 I 3 ( u n 1 ) ,
where F ˜ U s 2 I 3 ( u ) = 1 ( 1 F ˜ U s 2 I 3 1 ( u ) ) ( 1 F ˜ U s 2 I 3 2 ( u ) ) ( 1 F U s 2 I 3 3 ( u ) ) .
Similar to (22f), the CDF of V s 2 I 3 3 can be given by F V s 2 I 3 3 ( v ) = 1 m r e 1 m r e 1 exp ( Ω 23 v ) ( Ω 21 v + m r e 1 ) m r e 1 .
Since V s 2 I 3 1 = V s 2 I 1 1 and V s 2 I 3 2 = V s 2 I 1 2 , the equations F V s 2 I 3 1 ( v ) = F V s 2 I 1 1 ( v ) and F V s 2 I 3 2 ( v ) = F V s 2 I 1 2 ( v ) hold. Referring to (21), the ergodic rate E R s 2 NF I can be obtained as
E R s 2 FN I = E R s 2 NN I F ˙ V s 2 I 1 ( v n 2 ) F ˙ V s 2 I 3 ( v n 2 ) , F ¨ V s 2 I 1 ( tan v n 3 ) F ¨ V s 2 I 3 ( tan v n 3 ) ,
where F ¨ V s 2 I 3 ( v ) = F V s 2 I 3 1 ( v ) F V s 2 I 3 3 ( v ) and F ˙ V s 2 I 3 ( v ) = ( 1 ( 1 F ˜ U s 2 I 3 2 ( v ) ) ( 1 F V s 2 I 3 2 ( v ) ) ) × F V s 2 I 3 1 ( v ) F V s 2 I 3 3 ( v ) . Using (34) and (35), the ESR of s 2 for the FN in Case I can be written as S R s 2 FN I = L R s 2 FN I E R s 2 FN I + .

4.2. ESR for the Proposed MNJJ in Case II

4.2.1. NN in Case II

The conditions κ i 1 = 0 , χ u 1 1 = 1 , and χ r 1 = 1 hold when considering for the NN in Case II. The SINRs γ u 1 , s 1 1 and γ e 1 , s 1 1 under these conditions are equivalent to U s 1 I 2 and V s 1 I 1 , respectively. Therefore, with the help of (17) and (23), the ESR for s 1 in this case can be directly written as S R s 1 NN II = L R s 1 NF I E R s 1 NN I + .
The parameters κ i 1 , χ u 1 1 , and χ r 1 have no effect on γ u 1 , s 1 2 and γ e 1 , s 1 2 , and thus, the ESR for s 1 in this case is S R s 1 NN II = S R s 1 NN I .
In this case, the SINRs γ u 1 , s 2 1 and γ r , s 2 1 become U s 2 I 2 1 and U s 2 I 3 2 , respectively, while the remaining SINRs related to s 2 are unchanged compared to the proposed NN in Case I. Therefore, using (20), (21), (22a), (22b), (25) and (32), we can directly obtain the ESR of s 2 for the NN in Case II as
S R s 2 NN II = [ L R s 2 NN I F ˜ U s 2 I 1 1 ( u n 1 ) F ˜ U s 2 I 2 1 ( u n 1 ) , F ˜ U s 2 I 1 2 ( u n 1 ) F ˜ U s 2 I 3 2 ( u n 1 ) E R s 2 NN I F ˜ U s 2 I 1 2 ( v n 2 ) F ˜ U s 2 I 3 2 ( v n 2 ) ] + .

4.2.2. NF in Case II

For the NF in Case II, the conditions κ i 1 = 0 , χ u 1 1 = 1 , and χ r 1 = 0 hold. Under these conditions, the SINRs γ u 1 , s 1 1 and γ e 1 , s 1 1 become U s 1 I 2 and V s 1 I 2 , respectively. Based on (23) and (24), the ESR of s 1 in this case can be written as S R s 1 NF II = L R s 1 NF I E R s 1 NF I + .
Similarly, the ESR for s 1 in this case can be directly given by S R s 1 NF II = S R s 1 NN I .
Compared to the NF in Case I, only γ r , s 2 1 changes among the SINRs related to s 2 in the NF for Case II. Specifically, γ r , s 2 1 = H s r 1 , A ( L s r A ) 1 ρ s a 2 H s r 1 , A ( L s r A ) 1 ρ s a 1 + 1 . Let U s 2 II 2 2 γ r , s 2 1 . The CDF of U s 2 II 2 2 can be written as
F U s 2 II 2 2 ( u ) = F ˜ U s 2 II 2 2 ( u ) = F H s r 1 , A u ( L s r A ) 1 ρ s ( a 2 a 1 u ) , u < a 2 a 1 , 1 , u a 2 a 1 .
Based on L R s 2 NF I , E R s 2 NF I , and (37), the ESR of s 2 for the NF in Case II can be written as
S R s 2 NF II = [ L R s 2 NF I F ˜ U s 2 I 2 2 ( u n 1 ) F ˜ U s 2 II 2 2 ( u n 1 ) E R s 2 NF I F ˜ U s 2 I 2 2 ( v n 2 ) F ˜ U s 2 II 2 2 ( v n 2 ) ] + .

4.2.3. FN in Case II

If U 1 turns off jamming and the UAV turns on jamming in t 1 , and the legitimate nodes are aware of each other’s AN, the SINRs γ u 1 , s 1 1 and γ e 1 , s 1 1 become γ u 1 , s 1 1 = H s u 1 1 , G ( L s u 1 G ) 1 ρ s a 1 and γ e 1 , s 1 1 = V s 1 I 3 , respectively. The CDF of γ u 1 , s 1 1 can be easily obtained as F γ u 1 , s 1 1 ( u ) = Ω 13 exp ( Ω 13 u ) . Therefore, using (14) and [43] (Equation (3.352.4)), the ergodic rate of s 1 at U 1 in this case can be given by
L R s 1 FN II = 1 2 ln 2 exp ( Ω 13 ) Ei ( Ω 13 ) .
Consequently, the ESR of s 1 in this case can be written as S R s 1 FN II = L R s 1 FN II E R s 1 FN I + . Similar to S R s 1 NF I , the ESR of s 1 for the FN in Case II can still be written as S R s 1 NF II = S R s 1 NN I . In the FN, the SINRs related to s 2 are the same in Case I and Case II except for γ u 1 , s 2 1 . The SINR γ u 1 , s 2 1 in Case II is γ u 1 , s 2 1 = H s u 1 1 , G ( L s u 1 G ) 1 ρ s a 2 H s u 1 1 , G ( L s u 1 G ) 1 ρ s a 1 + 1 . Denote U s 2 II 3 1 γ u 1 , s 2 1 . The CDF of U s 2 II 3 1 can be written as
F U s 2 II 3 1 ( u ) = F ˜ U s 2 II 3 1 ( u ) = 1 exp u ( L s u 1 G ) 1 ρ s ( a 2 a 1 u ) , u < a 2 a 1 , 1 , u a 2 a 1 .
Hence, using (34), (35), and (40), the ESR of s 2 for the FN in Case II can be written as
S R s 2 FN II = L R s 2 FN I F ˜ U s 2 I 3 1 ( u n 1 ) F ˜ U s 2 II 3 1 ( u n 1 ) E R s 2 FN I + .

4.3. ESSR for the Proposed MNJJ

Based on the derivation results in Section 4.1 and Section 4.2, the closed-form expression for the ESSR of the proposed MNJJ scheme under various cases can be uniformly expressed as
E S S R M = S R s 1 M + S R s 1 M + S R s 2 M ,
where M { NN I , NF I , FN I , NN II , NF II , FN II } .

4.4. The Proposed JPAIC Algorithm

This section focuses on maximizing the ESSR of the proposed MNJJ scheme by jointly optimizing the power allocation coefficients and interference power coefficients while ensuring the security of each signal transmission. Using the obtained E S S R M as the objective function, we can formulate the corresponding mathematical optimization problem as
P : max a 2 , b r , 1 , b u 1 1 , b u 1 2 , b u 2 2 E S S R M
s . t . 0.5 + ε a 2 1 ε ,
b r 1 = 0 , i f M { NF I , NF II } , ε b r 1 1 , i f M { NN I , FN I , NN II , FN II } ,
b u 1 1 = 0 , i f M { FN I , FN II } , ε b u 1 1 1 , i f M { NN I , NF I , NN II , NF II } ,
ε b u ¯ 2 1 , u ¯ { u 1 , u 2 } ,
S R s ¯ M > 0 , s ¯ { s 1 , s 1 , s 2 } ,
where ε represents the optimization accuracy of the variables to be optimized, (43a) restricts the range of power allocation coefficients to satisfy the downlink NOMA criteria, (43c) and (43d) specify the range of interference power coefficients b r 1 and b u 1 1 to comply with the state of interference activation or deactivation for the UAV and U 1 under different cases, (43e) ensures that U 1 and U 2 always have interference activated in t 2 and that the interference power does not exceed the preset maximum value, and (43f) guarantees that the ESRs of all signals are greater than zero.
The closed-form expression for the optimal solution of the power allocation coefficients and interference coefficients cannot be directly obtained for the above problem. Therefore, we design a JPAIC algorithm using PSO. As shown in Algorithm 1, the five variables to be optimized are treated as particles in a five-dimensional space. By iteratively searching the positions of multiple particles, the optimal fitness value (i.e., the maximum of E S S R M ) can be obtained. Moreover, the computational complexity of the proposed JPAIC algorithm mainly depends on lines 4–17 in Algorithm 1. Therefore, the computational complexity of the proposed JPAIC algorithm can be easily obtained as O ( N P C M + 3 N I N P C M ) , where C M represents the computational complexity primarily caused by addition and multiplication in (42).
Algorithm 1 JPAIC Algorithm Using PSO
  1:
Input the type of the proposed MNJJ scheme M , number of particles N P , number of iterations N I , precision ε , and system model parameters include: path loss L i ¯ j ¯ G and L r j ˜ A , shape parameter m r j ˜ , transmission powers P s and P r , maximum interference power P m , residual self-interference power P R S I , and noise power N 0 .
  2:
Initialize each particle’s location L n = [ l n 1 , l n 2 , l n 3 , l n 4 , l n 5 ] , velocity v n = [ v n 1 , v n 2 , v n 3 , v n 4 , v n 5 ] , and personal best location L n , b e s t = L n , where v n = 0 , l n q = ( l n q , max l n q , min ) δ l n q + l n q , min , q { 1 , 2 , , 5 } . The variables l n 1 , l n 2 , l n 3 , l n 4 , and l n 5 correspond to a 2 , b r 1 , b u 1 1 , b u 1 2 , and b u 2 2 , respectively. Here, δ l n q is a random number in [0, 1], and l n q , max and l n q , min are the maximum and minimum of l n q determined by (43b) to (43e).
  3:
Set the inertia coefficient ω = 0.7234 and the learning factors λ 1 = 2.5 and λ 2 = 3 .
  4:
Calculate the global best location L g b e s t = arg max L n ( 0 ) , n { 1 , 2 , , N p } ( E S S R M ( L n ) ) , where the constraint (43f) should be met.
  5:
while  1 m N I  do
  6:    
for  1 n N P  do
  7:       
Update the velocity v n = ω v n + λ 1 δ n , 1 ( L g b e s t L n ) + λ 2 δ n , 2 ( L n , b e s t L n ) and individual location L n = L n + v n , where δ n , 1 and δ n , 2 are random numbers in the interval [0, 1].
  8:       
Check if each element of L n is within the range specified by (43b) to (43e). If an element exceeds its maximum, set it to the maximum; if it falls below its minimum, set it to the minimum.
  9:       
Calculate E S S R M ( L n ) , E S S R M ( L n , b e s t ) , and E S S R M ( L g b e s t ) by using (42). When the constraint (43f) does not hold, set the corresponding ESSR to zero.
10:       
if  E S S R M ( L n ) > E S S R M ( L n , b e s t )  then
11:           
L n , b e s t = L n .
12:       
end if
13:       
if  E S S R M ( L n ) > E S S R M ( L g b e s t )  then
14:           
L g b e s t = L n .
15:       
end if
16:    
end for
17:
end while
18:
Output the optimal coefficient combination L g b e s t and the maximum ESSR E S S R M ( L g b e s t ) .

5. Simulation Results

This section employs Monte Carlo simulations to verify the performance merits of the proposed MNJJ scheme and the proposed JPAIC algorithm, as well as the validity of the theoretical analysis. In the simulations, we consider two node location configurations: Location 1 and Location 2. In Location 1, the coordinates of the BS, UAV, U 1 , E 1 , U 2 , and E 2 are ( 50 , 0 , 0 ) , ( 0 , 0 , 50 ) , ( 40 , 2 , 0 ) , ( 40 , 0 , 0 ) , ( 40 , 2 , 0 ) , and ( 40 , 0 , 0 ) , respectively. In Location 2, these coordinates change to ( 50 , 0 , 0 ) , ( 0 , 0 , 50 ) , ( 45 , 0 , 0 ) , ( 45 , 2 , 0 ) , ( 40 , 0 , 0 ) , and ( 40 , 5 , 0 ) . We set the carrier frequency to f c = 2 GHz, P r = P s , the maximum interference power to P m = 40 dBm, and the noise power to N 0 = 110 dBm. Additionally, we investigate the performance of the proposed MNJJ scheme under both fixed and optimal power allocation and interference control settings. For the fixed power setting (FPS), the fixed power allocation coefficients are a 1 = 0.1 and a 2 = 0.9 , and the fixed interference power coefficients are b u 1 2 = 1 and b u 2 2 = 1 . Specifically, we examine: (1) the NN with b u 1 1 = b r 1 = 1 ; (2) the NF with b u 1 1 = 1 and b r 1 = 0 ; and (3) the NF with b u 1 1 = 0 and b r 1 = 1 . Unless otherwise specified, we set the shape parameter of the Nakagami-m channel to 2, the ratio of residual interference to noise power to ρ R S I = 3 dB [34], the optimization precision to ε = 0.01 , the particle swarm size to N P = 4 , and the number of iterations to N I = 15 . The markers “NN-I”, “NF-I”, “FN-I”, “NN-II”, “NF-II”, and “FN-II” in the following figures represent NN, NF, and FN in Case I and Case II, respectively. The marker “CNC-I” refers to the CNC scheme in Case I, with the CNC referenced in [27].

5.1. Case I

Figure 4 compares the ESSR of the proposed MNJJ scheme with three types (i.e., the NN, NF, and FN) with that of the CNC scheme in Case I. In this figure, the theoretical curves of the ESSR for the proposed MNJJ perfectly coincide with the corresponding simulation values, which validates the correctness of the theoretical analysis. Under different node location settings, the ranking of the ESSR from highest to lowest is consistently the NF, NN, FN, and CNC. The superiority in ESSR for the proposed MNJJ is attributed to multi-node joint jamming. Since legitimate nodes are unaware of each other’s AN in Case I, the simultaneous interference from the UAV and U 1 (i.e., the NN) excessively reduces the SINRs of s 1 and s 2 at the legitimate nodes. Based on this, the NN has a lower ESSR than the NF in Case I. Compared with the NF, only the UAV in the FN is enabled for interference, and the distance from the UAV to E 1 is much greater than the distance from U 1 to E 1 . Therefore, the UAV has the similar interference intensity on U 1 and E 1 in the FN, making it impossible to guarantee the secrecy rates of s 1 and s 2 . This fact, in turn, causes the ESSR of the FN to be slightly lower than that of the NN. Additionally, in the Location 2 configuration, the legitimate nodes U 1 and U 2 are closer to the corresponding information sources than the eavesdroppers, leading to a higher ESSR in Location 2 compared to Location 1. From the perspective of ESSR performance, the NF scheme is more suitable for Case I.
Figure 5 illustrates the impact of the shape parameter m of the A2G/G2A channel on the ESSRs for the proposed MNJJ and the CNC under P s = 20 dBm in Case I. From Figure 5, the proposed NF consistently achieves a higher ESSR than both the NN and FN for different values of m, and the ESSRs of the NN and FN are almost identical. These observations are consistent with the findings in Figure 4. The increase in m has a relatively small impact on the ESSR of each scheme. Typically, a larger m indicates better A2G/G2A channel quality. Since only the link related to s 2 in the legitimate links is affected by the A2G/G2A channel, and the ergodic rate of s 2 contributes relatively less to the ergodic sum rate, the effect of a larger m on the ergodic sum rate of the legitimate nodes is minimal. Additionally, the eavesdroppers are located near the legitimate users and the ergodic rate of s 2 being intercepted is also constrained by the weaker link in the DF two-hop link. Hence, the variation in m has no significant effect on the ergodic sum rate at the eavesdroppers. Based on this, all schemes exhibit good robustness to changes in m.
Figure 6 shows the variation in ESSR for each scheme under different strengths of the residual interference caused by full-duplex operation. The proposed NF consistently achieves the best ESSR across different values of ρ R S I . As ρ R S I increases, the ESSRs of the proposed NN, NF, and FN gradually decrease, while the ESSR of the CNC remains unchanged. This is because the proposed MNJJ is affected by residual self-interference, and an increase in residual interference strength reduces the ergodic rate of legitimate information without impacting the eavesdropper. In contrast, the CNC scheme is not influenced by these factors.
Figure 7 illustrates the variation in ESSR for the proposed MNJJ scheme with the number of iterations of the JPAIC algorithm, with the NN and NF in Case I as examples. The figure shows that the ESSR achieved by the proposed JPAIC algorithm quickly stabilizes after a relatively small number of iterations, indicating its good convergence performance. Note that this convergence analysis also applies to Case II.
Figure 8 compares the ESSR of the proposed JPAIC algorithm with that of the FPS, where the proposed JPAIC maximizes the ESSR under the constraint of the ESR for each data stream. The coincidence of the ESSR curve with the corresponding theoretical optimal value (TOV) demonstrates the effectiveness of JPAIC, where the TOV is obtained via an exhaustive search under precision constraints. For the NN and NF, using the proposed JPAIC achieves a better ESSR compared to using FPS because it determines the optimal power allocation and interference power coefficients. An interesting observation is that in Location 1, the ESSR for the FN using both JPAIC and FPS is zero, as the FN struggles to meet the ESR constraints for all data streams. In Location 2, the FN only fails to ensure the security of all data streams at high transmission power. This is because, in Location 2, the legitimate nodes have better channel quality than the eavesdroppers for acquiring information, but high transmission power also allows the eavesdroppers to obtain more legitimate information.

5.2. Case II

Figure 9 shows the ESSRs for the CNC and the proposed MNJJ with the NN, NF, and FN under the condition that legitimate users are aware of each other’s AN. In Case II, the ESSR of the proposed MNJJ is superior to that of the CNC. Additionally, the proposed FN performs slightly better than the NN and NF at low to moderate transmission power, but the reverse is true at high transmission power. This is because interference initiated by U 1 and the UAV in t 1 weakens the achievable ergodic rates of s 1 and s 2 at the legitimate nodes due to self-interference, and the ergodic rate of s 2 contributes relatively less to the overall achievable ergodic rate. Therefore, the FN can more effectively achieve better ESSR at low to moderate transmission power. However, at high transmission power, the FN cannot prevent eavesdroppers from obtaining more legitimate information due to insufficient interference, resulting in a lower ESSR compared to the NN and NF. Overall, the FN is suitable for small P s in Case II, while the NF is a more robust choice under all conditions. Figure 10 shows the impact of the shape parameter m on the ESSR of each scheme in Case II. For reasons similar to those in Figure 5, the ESSR remains essentially unchanged with the increase in m. Figure 11 demonstrates that in Case II, the residual self-interference strength remains an important factor affecting the ESSR of the proposed MNJJ.
Figure 12 compares the ESSR of the proposed JPAIC with that of the FPS in Case II. From this figure, the effectiveness of the proposed JPAIC in optimizing the ESSR of the proposed MNJJ is validated. Notably, when legitimate users are closer to the corresponding information sources than the eavesdroppers, the FN scheme using the FPS fails to ensure secure transmission of all data streams at high transmission power. However, the proposed JPAIC can address this issue. Therefore, it is evident that the proposed JPAIC not only maximizes the ESSR of the proposed MNJJ but also enhances the robustness of the ESSR performance of the proposed MNJJ. Note that when global channel state information is available at the BS, the BS can use a mini phase before information transmission to send appropriate signaling to U 1 and the UAV to control whether U 1 and the UAV should turn on jamming. Based on the above simulation validation and discussion, we know that even if global channel state information is not available at the BS, the system can preset U 1 and the UAV to be in the turn-on jamming and turn-off jamming state (i.e., NF) during the first phase to achieve robust and good ESSR performance.

6. Conclusions

This work investigated the physical layer secure transmission in a UAV-assisted NOMA-CDRT system for emergency rescue scenarios. In this system, the BS serves a user in its cell while also using a UAV relay to serve a user in a cell with damaged communication facilities, with eavesdroppers near all users threatening communication security. To ensure secure transmission, we proposed three types of AN-based MNJJ schemes for the considered system, namely NN, NF, and FN. Additionally, the closed-form expressions of the ESSR for the proposed MNJJ schemes were derived under the conditions where legitimate nodes are unaware of AN (i.e., Case I) and aware of AN (i.e., Case II). A JPAIC algorithm using PSO was also designed to further maximize the ESSR while ensuring the secure transmission of each data stream. The simulation results showed that the ESSR of the proposed MNJJ was superior to that of the CNC, and the proposed JPAIC maximized the ESSR of the proposed MNJJ and outperformed the FPS. Furthermore, in Case I, the NF was a preferable secure transmission scheme, while in Case II, the FN provided the best ESSR at low to moderate transmission power, but the NF remained a more robust choice across the entire transmission power range. In future work, we will extend the proposed scheme to multi-antenna scenarios and further enhance its security performance through beamforming design.

Author Contributions

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

Funding

This work was supported in part by the Natural Science Foundation of Jiangsu Province under Grant BK20220438 and Grant BK20220439; in part by the National Natural Science Foundation of China under Grant 62301268; in part by the Natural Science Foundation of the Higher Education Institutions of Jiangsu Province under Grant 22KJB510033, under Grant 23KJB510031, and Grant 22KJB510005; in part by the Startup Foundation for Introducing Talent of NUIST under Grant 2023r015 and Grant 2023r134; in part by Henan Key Laboratory of Visible Light Communications under Grant HKLVLC2023-A01; and in part by the Henan Province Science and Technology Research Project under Grant 222102210097.

Data Availability Statement

Data are contained within the article.

Conflicts of Interest

The authors declare no conflicts of interest.

Abbreviations

This paper uses the following abbreviations:
A2GAir-to-ground
AFAmplify-and-forward
ANArtificial noise
AWGNAdditive white Gaussian noise
BSBase station
CDFCumulative distribution function
CDRTCoordinated direct and relay transmission
CNCConventional NOMA-CDRT
DFDecode-and-forward
ESRErgodic secrecy rate
ESSRErgodic secrecy sum rate
FPSFixed power setting
G2AGround-to-air
G2GGround-to-ground
JPAICJoint power allocation and interference control
LoSLine-of-sight
MNJJMulti-node joint jamming
NOMANon-orthogonal multiple access
OMAOrthogonal multiple access
PDFProbability density function
PSOParticle swarm optimization
SICSuccessive interference cancellation
SINRSignal-to-interference-plus-noise ratio
STAR-RISSimultaneously transmitting and reflecting reconfigurable intelligent surface
SWIPTSimultaneous wireless information and power transfer
TOVTheoretical optimal value
UAVUnmanned aerial vehicle

Appendix A. Proof of Theorem 1

Proof. In this case, we have κ i 1 = 1 , χ u 1 1 = 1 , and χ r 1 = 1 . Therefore, by using S R s 1 , (5), and (8), the ergodic rates of s 1 at U 1 and E 1 for the NN in Case I can be expressed as L R s 1 NN I = E 1 2 log 2 ( 1 + U x 1 I 1 ) and E R x 1 NN I = E 1 2 log 2 ( 1 + V x 1 I 1 ) , respectively, where U s 1 I 1 H s u 1 1 , G ( L s u 1 G ) 1 ρ s a 1 H r u 1 1 , A ( L r u 1 A ) 1 b r 1 ρ m + H u 1 u 1 1 , G ρ R S I + 1 and V s 1 I 1 H s e 1 1 , G ( L s e 1 G ) 1 ρ s a 1 H r e 1 1 , A ( L r e 1 A ) 1 b r 1 ρ m + H u 1 e 1 1 , G ( L u 1 e 1 G ) 1 b u 1 1 ρ m + 1 . Based on [43] (Equation (3.351.3)), the CDF of U s 1 I 1 can be calculated as
F U s 1 I 1 ( u ) = Pr ( U s 1 I 1 < u ) = 1 0 0 exp ( ( Ω 1 x + Ω 2 y + Ω 3 ) u ) f H r u 1 1 , A ( x ) f H u 1 u 1 1 , G ( y ) d x d y = 1 Ω 1 u m r u 1 + 1 m r u 1 exp ( Ω 3 u ) Ω 2 u + 1 ,
where Ω 1 , Ω 2 , and Ω 3 are defined in (18). Substituting (A1) into (14), and performing the double factorization operation according to (15), we obtain
L R s 1 NN I = 1 2 ln 2 0 exp ( Ω 3 u ) ( 1 + u ) ( 1 + Ω 2 u ) ( 1 + Ω 1 u / m r u 1 ) m r u 1 d z = m r u 1 m r u 1 2 ln 2 ( Ω 2 1 ) Ω 1 m r u 1 { i 1 = 1 m r u 1 Ω 1 m r u 1 Ω 1 i 1 Ω 1 Ω 2 m r u 1 Ω 2 Ω 1 i 1 Φ 1 + Ω 1 Ω 2 m r u 1 Ω 2 Ω 1 m r u 1 Φ 2 Ω 1 m r u 1 Ω 1 m r u 1 Φ 3 } ,
where Φ 1 = 0 exp ( Ω 3 u ) ( u + m r u 1 / Ω 1 ) i ¯ 1 d u , Φ 2 = 0 exp ( Ω 3 u ) u + 1 / Ω 2 d u , Φ 3 = 0 exp ( Ω 3 u ) u + 1 d u , and i ¯ 1 = m r u 1 i 1 + 1 . By sequentially applying the variable substitution ε = u + m r u 1 Ω 1 and [43] (Equation (3.351.4)) to Φ 1 , we obtain
Φ 1 = exp m r u 1 Ω 3 Ω 1 { ( 1 ) i ¯ 1 Ω 3 i ¯ 1 1 Ei ( Ω 3 m r u 1 / Ω 1 ) ( i ¯ 1 1 ) ! + exp ( Ω 3 m r u 1 / Ω 1 ) ( m r u 1 / Ω 1 ) i ¯ 1 1 i 2 = 0 i ¯ 1 2 ( Ω 3 m r u 1 / Ω 1 ) i 2 ( i ¯ 1 i 2 2 ) ! ( i ¯ 1 1 ) ! } .
Incorporating [43] (Equation (3.352.4)) into Φ 2 and Φ 3 , respectively, we easily obtain Φ 2 = exp ( Ω 3 Ω 2 ) Ei ( Ω 3 Ω 2 ) and Φ 3 = exp ( Ω 3 ) Ei ( Ω 3 ) . Inserting Φ 1 , Φ 2 , and Φ 3 into (A2), we obtain L R s 1 NN I . Since U s 1 I 1 and V s 1 I 1 have similar forms, E R s 1 NN I can be directly determined as E R s 1 NN I = L R s 1 NN I m r u 1 m r e 1 , Ω 1 Ω 4 , Ω 2 Ω 5 , Ω 3 Ω 6 , where Ω 1 , Ω 2 , and Ω 3 are defined in (17). By combining L R s 1 NN I , E R s 1 NN I , and S R s 1 NN I , the proof of Theorem 1 is complete. □

Appendix B. Proof of Theorem 2

Proof. By using [43] (Equation (3.326.2)), the CDF of U s 2 I 1 1 can be calculated as
F U s 2 I 1 1 ( u ) = Pr ( U s 2 I 1 1 < u ) = 1 exp Ω 13 a 2 u a 2 a 1 u 0 0 exp a 2 u ( Ω 11 x + Ω 12 y ) a 2 a 1 u f H r u 1 1 , A ( x ) f H u 1 u 1 1 , G ( y ) d x d y = F ˜ U s 2 I 1 1 ( u ) , u < a 2 a 1 , 1 , u a 2 a 1 ,
where F ˜ U s 2 I 1 1 ( u ) , Ω 11 , Ω 12 , and Ω 13 can be found in (22a) and Theorem 1.
Similarly, the CDF of U s 2 I 1 2 can be written as
F U s 2 I 1 2 ( u ) = Pr ( U s 2 I 1 2 < u ) = 1 0 0 exp ( m s r ( Ξ 1 ( u ) x + Ξ 2 ( u ) y ) + Ξ 3 ( u ) ) × i 3 = 0 m s r 1 m s r i 3 i 3 ! Ξ 1 ( u ) x + Ξ 2 ( u ) y + Ξ 3 ( u ) i 3 f H u 1 r 1 , A ( x ) f H r r 1 , A ( y ) d x d y .
Applying the binomial expansion to Ξ 1 ( u ) x + Ξ 2 ( u ) y + Ξ 3 ( u ) i 3 and further utilizing [43] (Equation (3.326.2)), we can calculate (A5) as
F U s 2 I 1 2 ( u ) = F ˜ U s 2 I 1 2 ( u ) , u < a 2 a 1 , 1 , u a 2 a 1 ,
where F ˜ U s 2 I 1 2 ( u ) is defined in (22b), and Ξ 1 ( u ) , Ξ 2 ( u ) , and Ξ 3 ( u ) can be found in Theorem 1.
Using the binomial expansion and [43] (Equation (3.326.2)), the CDF of U s 2 I 1 3 can be calculated as
F U s 2 I 1 3 ( u ) = Pr ( U s 2 I 1 3 < u ) = 0 1 exp ( m r u 2 ( Ω 15 u y + Ω 16 u ) ) i 6 = 0 m r u 2 1 ( i 6 ! ) 1 ( m r u 2 ( Ω 15 u y + Ω 16 u ) ) i 6 f H u 2 u 2 2 , G ( y ) d y = 1 exp ( m r u 2 Ω 16 u ) i 6 = 0 m r u 2 1 i 7 = 0 i 6 i 6 i 7 Γ ( i 7 + 1 ) ( Ω 15 ) i 7 ( m r u 2 Ω 16 v ) i 6 i 6 ! ( Ω 16 ) i 7 ( m r u 2 Ω 15 v + 1 ) i 7 + 1 ,
where Ω 15 and Ω 16 can be found in Theorem 1.
Based on the order statistics, we can use (A4), (A5), and (A6) to obtain the CDF of U s 2 I 1 as F U s 2 I 1 ( u ) = 1 ( 1 F U s 2 I 1 1 ( u ) ) ( 1 F U s 2 I 1 2 ( u ) ) ( 1 F U s 2 I 1 3 ( u ) ) . Furthermore, we have F U s 2 I 1 ( u ) = F ˜ U s 2 I 1 ( u ) for u < a 2 a 1 and F U s 2 I 1 ( u ) = 1 for u a 2 a 1 , where F ˜ U s 2 I 1 ( u ) refers to Theorem 1.
Using (14) and Gaussian–Chebyshev quadrature, we can calculate L R s 2 NN I as
L R s 2 NN I = 1 2 ln 2 0 a 2 a 1 1 F ˜ U s 2 I 1 ( u ) 1 + u d u = a 2 π 4 ln 2 a 1 N 1 n 1 = 1 N 1 1 ( φ n 1 ) 2 1 F ˜ U s 2 I 1 ( u n 1 ) 1 + u n 1 .
Because V s 2 I 1 1 and V s 2 I 1 2 have the similar forms to U s 2 I 1 3 , the CDFs F V s 2 I 1 1 ( v ) and F V s 2 I 1 2 ( v ) can be easily obtained by following the steps in (A7), which are provided in (22d) and (22e), respectively. Additionally, by comparing U s 2 I 1 1 and V s 2 I 1 3 , we find that the expression of U s 2 I 1 1 for a 1 = 0 has a similar form to V s 2 I 1 3 . Based on U s 2 I 1 1 , V s 2 I 1 3 , and (22a), the CDF of V s 2 I 1 3 can be directly expressed as (22f).
Using the order statistics, we can calculate the CDF of V s 2 I 1 as
F V s 2 I 1 ( v ) = ( 1 ( 1 F U s 2 I 1 2 ( v ) ) ( 1 F V s 2 I 1 2 ( v ) ) ) F V s 2 I 1 1 ( v ) F V s 2 I 1 3 ( v ) = F ˙ V s 2 I 1 ( v ) = ( 1 ( 1 F ˜ U s 2 I 1 2 ( v ) ) ( 1 F V s 2 I 1 2 ( v ) ) ) F V s 2 I 1 1 ( v ) F V s 2 I 1 3 ( v ) , v < a 2 a 1 , F ¨ V s 2 I 1 ( v ) = F V s 2 I 1 1 ( v ) F V s 2 I 1 3 ( v ) , v a 2 a 1 .
According to (14), the ergodic rate of E R s 2 NN I can be written as
E R s 2 NN I = 1 2 ln 2 0 a 2 a 1 1 F ˙ V s 2 I 1 ( v ) 1 + v d v + 1 2 ln 2 a 2 a 1 1 F ¨ V s 2 I 1 ( v ) 1 + v d v .
Applying the Gaussian–Chebyshev quadrature to the first term of the above equation, and subsequently applying the variable substitution θ = arctan v and Gaussian–Chebyshev quadrature to the second term, we obtain the expression for E R s 2 NN I as given in (21). Combining L R s 2 NN I and E R s 2 NN I , we can obtain S R s 2 NN I . □

References

  1. Mozaffari, M.; Saad, W.; Bennis, M.; Nam, Y.H.; Debbah, M. A Tutorial on UAVs for Wireless Networks: Applications, Challenges, and Open Problems. IEEE Commun. Surv. Tutor. 2019, 21, 2334–2360. [Google Scholar] [CrossRef]
  2. Wang, D.; Yuan, L.; Pang, L.; Xu, Q.; He, Y. Age of Information-Inspired Data Collection and Secure Upload Assisted by the Unmanned Aerial Vehicle and Reconfigurable Intelligent Surface in Maritime Wireless Sensor Networks. Drones 2024, 8, 267. [Google Scholar] [CrossRef]
  3. Li, D.; Bao, N. Delay-Doppler Robust Spectrum Sharing of UAV and Terrestrial Systems Aided by Assistive Slots. IEEE Trans. Veh. Technol. 2021, 70, 7692–7704. [Google Scholar] [CrossRef]
  4. Lin, Z.; Lin, M.; de Cola, T.; Wang, J.-B.; Zhu, W.-P.; Cheng, J. Supporting IoT With Rate-Splitting Multiple Access in Satellite and Aerial-Integrated Networks. IEEE Internet Things J. 2021, 8, 11123–11134. [Google Scholar] [CrossRef]
  5. Vaezi, M.; Azari, A.; Khosravirad, S.R.; Shirvanimoghaddam, M.; Azari, M.M.; Chasaki, D.; Popovski, P. Cellular, Wide-Area, and Non-Terrestrial IoT: A Survey on 5G Advances and the Road Toward 6G. IEEE Commun. Surv. Tutor. 2022, 24, 1117–1174. [Google Scholar] [CrossRef]
  6. Lou, Y.; Sun, R.; Cheng, J.; Qiao, G.; Wang, J. Physical-Layer Security for UAV-Assisted Air-to-Underwater Communication Systems with Fixed-Gain Amplify-and-Forward Relaying. Drones 2022, 6, 341. [Google Scholar] [CrossRef]
  7. He, Y.; Wang, D.; Huang, F.; Zhang, R.; Min, L. Aerial-Ground Integrated Vehicular Networks: A UAV-Vehicle Collaboration Perspective. IEEE Trans. Intell. Transp. Syst. 2024, 25, 5154–5169. [Google Scholar] [CrossRef]
  8. Wang, D.; Zhou, F.; Lin, W.; Ding, Z.; Al-Dhahir, N. Cooperative Hybrid Non-Orthogonal Multiple Access Based Mobile-Edge Computing in Cognitive Radio Networks. IEEE Trans. Cogn. Commun. Netw. 2022, 8, 1104–1117. [Google Scholar] [CrossRef]
  9. Xu, Y.; Tang, J.; Li, B.; Zhao, N.; Niyato, D.; Wong, K.K. Adaptive Aggregate Transmission for Device-to-Multi-Device Aided Cooperative NOMA Networks. IEEE J. Sel. Areas Commun. 2022, 40, 1355–1370. [Google Scholar] [CrossRef]
  10. Wang, D.; Wu, M.; Chakraborty, C.; Min, L.; He, Y.; Guduri, M. Covert Communications in Air-Ground Integrated Urban Sensing Networks Enhanced by Federated Learning. IEEE Sensors J. 2024, 24, 5636–5643. [Google Scholar] [CrossRef]
  11. Li, X.; Wang, Q.; Zeng, M.; Liu, Y.; Dang, S.; Tsiftsis, T.A.; Dobre, O.A. Physical-Layer Authentication for Ambient Backscatter-Aided NOMA Symbiotic Systems. IEEE Trans. Commun. 2023, 71, 2288–2303. [Google Scholar] [CrossRef]
  12. Zhao, N.; Li, Y.; Zhang, S.; Chen, Y.; Lu, W.; Wang, J.; Wang, X. Security Enhancement for NOMA-UAV Networks. IEEE Trans. Veh. Technol. 2020, 69, 3994–4005. [Google Scholar] [CrossRef]
  13. Qian, L.P.; Zhang, W.; Wang, Q.; Wu, Y.; Yang, X. Alternative Optimization for Secrecy Throughput Maximization in UAV-Aided NOMA Networks. IEEE Wirel. Commun. Lett. 2022, 11, 2580–2584. [Google Scholar] [CrossRef]
  14. Wang, H.M.; Zhang, X. UAV Secure Downlink NOMA Transmissions: A Secure Users Oriented Perspective. IEEE Trans. Commun. 2020, 68, 5732–5746. [Google Scholar] [CrossRef]
  15. Yu, K.; Feng, Z.; Yu, J.; Chen, T.; Peng, J.; Li, D. Secure Ultra-Reliable and Low Latency Communication in UAV-Enabled NOMA Wireless Networks. IEEE Trans. Veh. Technol. 2024, 1–14. [Google Scholar] [CrossRef]
  16. Yapıcı, Y.; Rupasinghe, N.; Güvenç, İ.; Dai, H.; Bhuyan, A. Physical Layer Security for NOMA Transmission in mmWave Drone Networks. IEEE Trans. Veh. Technol. 2021, 70, 3568–3582. [Google Scholar] [CrossRef]
  17. Lu, W.; Ding, Y.; Gao, Y.; Chen, Y.; Zhao, N.; Ding, Z.; Nallanathan, A. Secure NOMA-Based UAV-MEC Network Towards a Flying Eavesdropper. IEEE Trans. Commun. 2022, 70, 3364–3376. [Google Scholar] [CrossRef]
  18. Guo, L.; Jia, J.; Chen, J.; Wang, X. Secure Communication Optimization in NOMA Systems With UAV-Mounted STAR-RIS. IEEE Trans. Inf. Forensics Secur. 2024, 19, 2300–2314. [Google Scholar] [CrossRef]
  19. Diao, D.; Wang, B.; Cao, K.; Dong, R.; Cheng, T. Enhancing Reliability and Security of UAV-Enabled NOMA Communications with Power Allocation and Aerial Jamming. IEEE Trans. Veh. Technol. 2022, 71, 8662–8674. [Google Scholar] [CrossRef]
  20. Sun, X.; Yang, W.; Cai, Y. Secure Communication in NOMA-Assisted Millimeter-Wave SWIPT UAV Networks. IEEE Internet Things J. 2020, 7, 1884–1897. [Google Scholar] [CrossRef]
  21. 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]
  22. Diao, D.; Wang, B.; Cao, K.; Weng, J.; Dong, R.; Cheng, T. Secure Wireless-Powered NOMA Communications in Multi-UAV Systems. IEEE Trans. Green Commun. Netw. 2023, 7, 1205–1216. [Google Scholar] [CrossRef]
  23. Zhang, J.; Wang, J.; Li, X.; Li, S.; Yuan, Z.; Pan, G. Secrecy Analysis for NOMA-Based Multi-Antenna Satellite-UAV-Terrestrial SWIPT Systems. IEEE Trans. Green Commun. Netw. 2024, 8, 672–685. [Google Scholar] [CrossRef]
  24. Nguyen, T.T.; Hoang, T.M.; Tran, X.N. Secrecy Performance Optimization for UAV-Based Cognitive Relay NOMA System. IEEE Trans. Intell. Veh. 2024, 9, 4011–4024. [Google Scholar] [CrossRef]
  25. Zheng, X.; Zhang, J.; Pan, G. On Secrecy Analysis of Underlay Cognitive UAV-Aided NOMA Systems With TAS/MRC. IEEE Internet Things J. 2022, 9, 22631–22642. [Google Scholar] [CrossRef]
  26. Vo, V.N.; Nguyen, L.M.D.; Tran, H.; Dang, V.H.; Niyato, D.; Cuong, D.N.; Luong, N.C.; So-In, C. Outage Probability Minimization in Secure NOMA Cognitive Radio Systems With UAV Relay: A Machine Learning Approach. IEEE Trans. Cogn. Commun. Netw. 2023, 9, 435–451. [Google Scholar] [CrossRef]
  27. Kim, J.B.; Lee, I.H. Non-Orthogonal Multiple Access in Coordinated Direct and Relay Transmission. IEEE Commun. Lett. 2015, 19, 2037–2040. [Google Scholar] [CrossRef]
  28. Xu, Y.; Cheng, J.; Wang, G.; Leung, V.C.M. Adaptive Coordinated Direct and Relay Transmission for NOMA Networks: A Joint Downlink-Uplink Scheme. IEEE Trans. Wirel. Commun. 2021, 20, 4328–4346. [Google Scholar] [CrossRef]
  29. Lv, L.; Jiang, H.; Ding, Z.; Yang, L.; Chen, J. Secrecy-Enhancing Design for Cooperative Downlink and Uplink NOMA with an Untrusted Relay. IEEE Trans. Commun. 2020, 68, 1698–1715. [Google Scholar] [CrossRef]
  30. Lv, L.; Li, Z.; Ding, H.; Zhou, Y.; Chen, J. Secure Coordinated Direct and Untrusted Relay Transmissions Via Interference Engineering. Sci. China Inf. Sci. 2022, 65, 182304. [Google Scholar] [CrossRef]
  31. Lei, H.; She, X.; Park, K.H.; Ansari, I.S.; Shi, Z.; Jiang, J.; Alouini, M.S. On Secure CDRT With NOMA and Physical-Layer Network Coding. IEEE Trans. Commun. 2023, 71, 381–396. [Google Scholar] [CrossRef]
  32. Lin, Z.; Niu, H.; An, K.; Wang, Y.; Zheng, G.; Chatzinotas, S.; Hu, Y. Refracting RIS Aided Hybrid Satellite-Terrestrial Relay Networks: Joint Beamforming Design and Optimization. IEEE Trans. Aerosp. Electron. Syst. 2022, 58, 3717–3724. [Google Scholar] [CrossRef]
  33. Chen, Y.; Zhao, N.; Ding, Z.; Alouini, M.S. Multiple UAVs as Relays: Multi-Hop Single Link Versus Multiple Dual-Hop Links. IEEE Trans. Wirel. Commun. 2018, 17, 6348–6359. [Google Scholar] [CrossRef]
  34. Gaafar, M.; Khafagy, M.G.; Amin, O.; Schaefer, R.F.; Alouini, M.S. Full-Duplex Relaying With Improper Gaussian Signaling Over Nakagami- m Fading Channels. IEEE Trans. Commun. 2018, 66, 64–78. [Google Scholar] [CrossRef]
  35. Liu, Y.; Qin, Z.; Elkashlan, M.; Gao, Y.; Hanzo, L. Enhancing the Physical Layer Security of Non-Orthogonal Multiple Access in Large-Scale Networks. IEEE Trans. Wirel. Commun. 2017, 16, 1656–1672. [Google Scholar] [CrossRef]
  36. Khan, A.S.; Chatzigeorgiou, I.; Lambotharan, S.; Zheng, G. Network-Coded NOMA with Antenna Selection for the Support of Two Heterogeneous Groups of Users. IEEE Trans. Wirel. Commun. 2019, 18, 1332–1345. [Google Scholar] [CrossRef]
  37. Xu, Y.; Cheng, J.; Wang, G.; Leung, V.C.M. Coordinated Direct and Relay Transmission for Multiuser Networks: NOMA or Hybrid Multiple Access? IEEE Wirel. Commun. Lett. 2021, 10, 976–980. [Google Scholar] [CrossRef]
  38. Xu, Y.; Li, B.; Zhao, N.; Chen, Y.; Wang, G.; Ding, Z.; Wang, X. Coordinated Direct and Relay Transmission with NOMA and Network Coding in Nakagami-m Fading Channels. IEEE Trans. Commun. 2021, 69, 207–222. [Google Scholar] [CrossRef]
  39. Jia, S.; Wang, R.; Xu, Y.; Lou, Y.; Zhang, D.; Sato, T. Secrecy Analysis of ABCom-Based Intelligent Transportation Systems with Jamming. IEEE Trans. Intell. Transp. Syst. 2024, 25, 2880–2892. [Google Scholar] [CrossRef]
  40. Lin, Z.; Niu, H.; He, Y.; An, K.; Zhong, X.; Chu, Z.; Xiao, P. Self-Powered Absorptive Reconfigurable Intelligent Surfaces for Securing Satellite-Terrestrial Integrated Networks. China Commun. 2024, 21, 276–291. [Google Scholar]
  41. Li, D.; Yang, X.; Zhou, F.; Wang, D.; Al-Dhahir, N. Mode Adaptive Secure UAV Relay Transmissions. IEEE Trans. Green Commun. Netw. 2023, 7, 787–799. [Google Scholar] [CrossRef]
  42. Lin, Z.; Lin, M.; Champagne, B.; Zhu, W.-P.; Al-Dhahir, N. Secrecy-Energy Efficient Hybrid Beamforming for Satellite-Terrestrial Integrated Networks. IEEE Trans. Commun. 2021, 69, 6345–6360. [Google Scholar] [CrossRef]
  43. Gradshteyn, I.S.; Ryzhik, I.M. Table of Integrals, Series, and Products, 7th ed.; Academic Press: New York, NY, USA, 2007. [Google Scholar]
Figure 1. A concise research framework of this paper.
Figure 1. A concise research framework of this paper.
Drones 08 00449 g001
Figure 2. Three-dimensional coordinate framework of a UAV-aided NOMA-CDRT system, including one BS, one UAV relay, two users, and two eavesdroppers.
Figure 2. Three-dimensional coordinate framework of a UAV-aided NOMA-CDRT system, including one BS, one UAV relay, two users, and two eavesdroppers.
Drones 08 00449 g002
Figure 3. Illustration of the proposed MNJJ scheme for a UAV-aided NOMA-CDRT system.
Figure 3. Illustration of the proposed MNJJ scheme for a UAV-aided NOMA-CDRT system.
Drones 08 00449 g003
Figure 4. Comparison of the ESSRs of the CNC scheme and the proposed MNJJ scheme with the NN, NF, and FN in Case I.
Figure 4. Comparison of the ESSRs of the CNC scheme and the proposed MNJJ scheme with the NN, NF, and FN in Case I.
Drones 08 00449 g004
Figure 5. Impact of the A2G/G2A channel shape parameter m on the ESSRs of the CNC scheme and the proposed MNJJ scheme with the NN, NF, and FN in Case I when P s = 20 dBm.
Figure 5. Impact of the A2G/G2A channel shape parameter m on the ESSRs of the CNC scheme and the proposed MNJJ scheme with the NN, NF, and FN in Case I when P s = 20 dBm.
Drones 08 00449 g005
Figure 6. Impact of ρ R S I on the ESSRs of the CNC scheme and the proposed MNJJ scheme with the NN, NF, and FN in Case I when P s = 20 dBm.
Figure 6. Impact of ρ R S I on the ESSRs of the CNC scheme and the proposed MNJJ scheme with the NN, NF, and FN in Case I when P s = 20 dBm.
Drones 08 00449 g006
Figure 7. Examples of the convergence analysis of the proposed JPAIC algorithm with P s = 20 dBm. (a) Example 1: NN in Case I with Location 2. (b) Example 2: NF in Case I with Location 2.
Figure 7. Examples of the convergence analysis of the proposed JPAIC algorithm with P s = 20 dBm. (a) Example 1: NN in Case I with Location 2. (b) Example 2: NF in Case I with Location 2.
Drones 08 00449 g007
Figure 8. Comparison of the ESSR performance of the proposed JPAIC algorithm and FPS in Case I.
Figure 8. Comparison of the ESSR performance of the proposed JPAIC algorithm and FPS in Case I.
Drones 08 00449 g008
Figure 9. Comparison of the ESSRs of the CNC scheme and the proposed MNJJ scheme with the NN, NF, and FN in Case II.
Figure 9. Comparison of the ESSRs of the CNC scheme and the proposed MNJJ scheme with the NN, NF, and FN in Case II.
Drones 08 00449 g009
Figure 10. Impact of the A2G/G2A channel shape parameter m on the ESSRs of the CNC scheme and the proposed MNJJ scheme with the NN, NF, and FN in Case II when P s = 20 dBm.
Figure 10. Impact of the A2G/G2A channel shape parameter m on the ESSRs of the CNC scheme and the proposed MNJJ scheme with the NN, NF, and FN in Case II when P s = 20 dBm.
Drones 08 00449 g010
Figure 11. Impact of ρ R S I on the ESSRs of the CNC scheme and the proposed MNJJ scheme with the NN, NF, and FN in Case II when P s = 20 dBm.
Figure 11. Impact of ρ R S I on the ESSRs of the CNC scheme and the proposed MNJJ scheme with the NN, NF, and FN in Case II when P s = 20 dBm.
Drones 08 00449 g011
Figure 12. Comparison of the ESSR performance of the proposed JPAIC algorithm and FPS in Case II.
Figure 12. Comparison of the ESSR performance of the proposed JPAIC algorithm and FPS in Case II.
Drones 08 00449 g012
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.

Share and Cite

MDPI and ACS Style

Xu, Y.; Jia, S.; Guo, J.; Zhu, J.; Liu, L.; Zhang, Z. Multi-Node Joint Jamming Scheme for Secure UAV-Aided NOMA-CDRT Systems: Performance Analysis and Optimization. Drones 2024, 8, 449. https://doi.org/10.3390/drones8090449

AMA Style

Xu Y, Jia S, Guo J, Zhu J, Liu L, Zhang Z. Multi-Node Joint Jamming Scheme for Secure UAV-Aided NOMA-CDRT Systems: Performance Analysis and Optimization. Drones. 2024; 8(9):449. https://doi.org/10.3390/drones8090449

Chicago/Turabian Style

Xu, Yao, Shaobo Jia, Jichong Guo, Jianyue Zhu, Lilan Liu, and Zhizhong Zhang. 2024. "Multi-Node Joint Jamming Scheme for Secure UAV-Aided NOMA-CDRT Systems: Performance Analysis and Optimization" Drones 8, no. 9: 449. https://doi.org/10.3390/drones8090449

Article Metrics

Back to TopTop