See discussions, stats, and author profiles for this publication at: https://www.researchgate.

net/publication/346372223

Secrecy Enhancement of Cooperative NOMA Networks With Two-Way

Untrusted Relaying

Article  in  IEEE Access · November 2020

DOI: 10.1109/ACCESS.2020.3040951

CITATIONS READS

3 191

6 authors, including:

Mona Awad Shady M. Ibraheem

Tanta University Menoufia University
1 PUBLICATION   3 CITATIONS    13 PUBLICATIONS   46 CITATIONS   

SEE PROFILE SEE PROFILE

Sameh A. Napoleon W. Saad

Tanta University Menoufia University
27 PUBLICATIONS   98 CITATIONS    79 PUBLICATIONS   370 CITATIONS   

SEE PROFILE SEE PROFILE

Some of the authors of this publication are also working on these related projects:

Heterogeneous Cloud-RAN Deployment Based on Hybrid FSO/mmW Fronthaul Transport Network for 5G Mobile Systems View project

D2D communication View project

All content following this page was uploaded by Shady M. Ibraheem on 02 December 2020.

The user has requested enhancement of the downloaded file.

 This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOI
10.1109/ACCESS.2020.3040951, IEEE Access

Date of publication xxxx 00, 0000, date of current version xxxx 00, 0000.
Digital Object Identifier xxxx/ACCESS.2020.DOI

Secrecy Enhancement of Cooperative

NOMA Networks with Two-Way
Untrusted Relaying
MONA AWAD1,2 , SHADY M. IBRAHEEM1,3 , SAMEH A. NAPOLEON2 , WALEED SAAD3,4 ,
MONA SHOKAIR3 , AND MOHAMED E. NASR.2 , (LIFE SENIOR MEMBER, IEEE)
1
Telecom Egypt, Egypt
2
Department of Electronics and Communications Engineering, Faculty of Engineering, Tanta University, Egypt
3
Department of Communications Engineering, Faculty of Electronic Engineering, Menoufia University, Egypt
4
Department of Electrical Engineering, College of Engineering, Shaqra University, Dawadmi, Ar Riyadh, KSA
Corresponding author: Shady M. Ibraheem (e-mail: shadymam@gmail.com; shady.ebrahiem@te.eg).
“This research is supported in part by the Menoufia University and TELECOM EGYPT (We) Grant under Scientific Research, Code.
3343327.”

ABSTRACT The two-way relaying (TWR) technique has been confirmed to achieve higher spectral
efficiency and average sum rate compared with the one-way relaying (OWR) technique in ultra-dense next
generation networks with limited spectal resources. In this paper, an enhanced secrecy cooperative TWR
scheme for cooperative non-orthogonal multiple access (NOMA) networks against untrusted relaying is
highlighted. Specifically, with the application of NOMA principle, a base station (Bs) communicates with
two trusted users, i.e., namely a near and a far users, where the communication with the far user takes place
only via an untrusted relay (UR) employing both TWR and analog network coding (ANC) mechanisms. To
minimize information leakage at the UR, the far user transmits its uplink signal simultaneously with Bs’s
downlink signal to confuse the eavesdropping capability of the UR by increasing inter-user interference
(IUI). To investigate the benefits of the proposed scheme, asymptotic lower bound expressions of the
ergodic secrecy sum rate (ESSR) of uplink/downlink rates and their scaling law are derived to characterize
the secrecy performance. The system parameters have been carefully studied to maitain the desired ESSR
performance where we obtain an optimal value for the uplink power sharing coefficient with an arbitrary
known value of the downlink one. Analytical and simulation results show that the proposed scheme
can achieve scaling gain of 18 ln ρ of positive ESSR over the untrusted OWR scheme with adaptive
uplink/downlink jamming and a significant gain over the other conventional NOMA uplink/downlink
schemes in two time slots of communication.

INDEX TERMS Non-orthogonal multiple access (NOMA), two-way relaying (TWR) techniques, un-
trusted relay (UR), ergodic secrecy sum rate (ESSR) and inter-user interference (IUI).

I. INTRODUCTION signals of multiple users to occupy the same resource block

HE ever-extending massive connectivity, low latency,
T high spectral efficiency demands makes non-orthogonal
multiple access (NOMA) techniques having the urgent ne-
cessity to be performed to break the orthogonality require-
ment in time/frequency/code resources by partially overlap-
ping wireless signals with a tolerable level of interference
[1]. In the context of increasing the multiplexing gain by
exploiting different domains, NOMA have been recently
classified into power-domain and code-domain NOMA. The
key concept of the power-domain NOMA is to enable the
(time/frequency/code) but with different power levels. In
particular, NOMA exploits superposition coding (SC) at
the transmitters to transmit superimposed signals within the
same resource while the receivers of better channel con-
ditions carry out successive interference cancellation (SIC)
technique to separate superimposed signals of the poorer
ones before decoding their own signals [2]. Thus, NOMA can
support massive connectivity [3, 4], achieve higher spectral
efficiency [5-8] and improve the user fairness [9-11].
Cooperative NOMA is an effective approach to enhance

VOLUME 4, 2016 1

This work is licensed under a Creative Commons Attribution 4.0 License. For more information, see https://creativecommons.org/licenses/by/4.0/
 This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOI
10.1109/ACCESS.2020.3040951, IEEE Access
Mona et al.: Preparation of Papers for IEEE TRANSACTIONS and JOURNALS
the network coverage extension and the reception reliability
of the users of poor channel conditions by exploiting the
spatial diversity. Particularly, cooperative NOMA can be
classified in terms of the elements of the network into: user-
aided and relay-aided cooperative NOMA. In user-aided co-
operative NOMA, the users of better channel conditions act
as a relay to enhance the reception capability of the users of
poorer channel conditions as they previously have to decode
the signals intended to the poorer users. There exist several
studies concerning this topic [12-16]. In [12] the outage per-
formance of user-aided cooperative NOMA was investigated
where it was shown to be better than the non-cooperative
case. To improve the performance of cell-edge users in a
cellular NOMA network, the cell-center users can act as
relays in both half-duplex (HD) and full-duplex (FD) modes
of operation to achieve a diversity gain [13]. Cooperative FD
NOMA based user-aided relaying was proposed in [5, 14] to
further save the resources and improve the spectral efficiency.
Employing a user in cooperative relaying may consume its
dedicated power and degrade its life time. Thus, energy
harvesting (EH) techniques were exploited in cooperative
NOMA which termed as simultaneous wireless information
and power transfer (SWIPT) to compensate the user for the
required power of relaying [15]. A joint power allocation
and splitting factor design was proposed in [16] to enhance
the system throughput and user fairness. On the other hand,
relay-aided cooperative NOMA schemes have gained also a
considerable attention in practical design of NOMA networks
[17-19]. This can be implemented by deploying dedicated re-
lays to increase the diversity. Coordinated direct and relayed
transmission based cooperative NOMA was proposed in for
both downlink and uplink communications [17, 18]. In [19]
a multi-relay multi-antenna NOMA system was proposed to
further increase the spectral efficiency.
The above contributions considered only one-way relay-
ing (OWR) or unidirectional communication protocol which
does not fulfill the dense mode of NOMA network op-
eration. Two-way relaying (TWR) permits a simultaneous
bidirectional communication to further improve the spectral
efficiency. HD and FD TWR NOMA based networks were
proposed in [20, 21] where the outage probability, diversity
analysis and network throughput were derived and compared
with OWR networks. A joint rate splitting and user grouping
protocol for multi-pair TWR NOMA network was proposed
in [22] for better utilization of resources and enhanced
throughput. In [23] a joint antenna and relay selection scheme
was proposed to enhance the transmission reliability for mul-
tiple access and time division broadcast relaying strategies in
a TWR NOMA based networks where the optimal transmit
power allocation was obtained.
However, due to the broadcast nature of wireless signals
in a cooperative NOMA network, confidential information in
this network is vulnerable to two main types of attack: 1)
external eavesdropping: in which an illegitimate attacker that
is not belonged to the network elements tries to overhear con-
fidential signals and decode them for its own sake, 2) internal
2 VOLUME 4, 2016
This work is licensed under a Creative Commons Attribution 4.0 License. For more information, see https://creativecommons.org/licenses/by/4.0/
(untrusted) eavesdropping: in which a legitimate element in
the network tries to decode confidential information of the
other elements. There exist recent works that considered
the external eavesdropping in NOMA networks. The secrecy
performance and power allocation analysis was investigated
in [24-28]. The beamforming design in multiple input single
output (MISO) and multiple input multiple output (MIMO)
NOMA networks to minimize information leakage was in-
vestigated in [29-35]. Exploiting relay selection and FD
relaying techniques to confront external eavesdropping in
cooperative NOMA networks was proposed in [5, 36-40].
Secure TWR NOMA based networks were also of a consid-
erable interest. In [41, 42] the security issue of NOMA based
TWR networks with artificial noise jamming (AN-jamming)
were analyzed.
However, the above works considered the external eaves-
dropping in NOMA networks while the impact of internal
eavesdropping on the secrecy performance may be more dan-
gerous as the network elements that share the same resource
blocks may distrust each other. In the context of untrusted
users, the authors of [43] investigated the case of untrusted
far user that can decode confidential information of the near
user via SIC where the secrecy outage probability of the near
user and the outage probability of the far user were derived.
The authors of [44] considered the case of multiple relay
selection schemes to enhance the secrecy performance of a
cooperative NOMA network of untrusted far user. The se-
crecy performance of a MISO NOMA system with untrusted
far user was proposed in [30]. Unlike [30, 43, 44], two joint
beamforming and power allocation schemes were proposed
in [45] for a cooperative NOMA network with both untrusted
near user and external eavesdroppers.
To enhance the secrecy performance in a HD untrusted
OWR cooperative NOMA network, a novel NOMA-inspired
jamming and relaying approach was proposed in [8] where
the base station sends a superimposed mixture of destination
and jamming signals and a positive secrecy sum rate can be
always guaranteed. In [46, 47] the secrecy performance of
cooperative NOMA networks with untrusted relay (UR) was
studied in which a base station communicates with two users
and one random user or the two users or the base station emit
an AN-jamming signal to combat the UR. As the emitting
of AN-jamming signal may degrade the eavesdropping capa-
bility of the UR, it may cause a simultaneous degradation in
the reception quality of the other elements of the network.
To overcome this issue, a novel secrecy-enhancing design
for cooperative uplink/downlink NOMA with an UR was
proposed in [48] where the near and far users send an
adaptive jamming signal of a similar symbol structure. Thus,
enabling legitimate users to cancel out the jamming signal
while preventing the UR from eavesdropping.
However, in cooperative NOMA networks with multiple
superimposed signals, the use of internal network interfer-
ence can be a sufficient mean to degrade the eavesdropping
capability and enhance the secrecy rate [49]. Thus, impos-
ing an intended jamming signal may increase interference
 This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOI
10.1109/ACCESS.2020.3040951, IEEE Access
Mona et al.: Preparation of Papers for IEEE TRANSACTIONS and JOURNALS
sources rather than combat eavesdropping which leads to in-
efficient information decoding at receivers, and this motivates
our work as follows.
A. MOTIVATIONS AND CONTRIBUTIONS
The recent work of cooperative NOMA network with un-
trusted relaying focused on transmitting jamming signals
simultaneously along with information signals to confuse
eavesdropping against untrusted relaying. However, this may
confuse the legitimate channels themselves and we have the
following observations:
• Exploiting inter-user interference (IUI) inherent in co-
operative NOMA networks can deteriorate the eaves-
dropping capability more than confusing legitimate de-
coding of information signal. Therefore, IUI can play
the role of cooperative jamming by performing a trade-
off design between the minimization of IUI at legitimate
receivers and the maximization of IUI at the eavesdrop-
pers to enhance the secrecy performance. This can be
achieved by hindering SIC at the eavesdropper, partic-
ularly, by mixing a superimposed version of adaptive
jamming and information signals, i.e., making a com-
posite signal, at the UR. Consequently, the UR cannot be
able to determine the decoding order of the mixed signal
which can significantly degrade its ability to retrieve the
confidential information signals coherently.
• Employing TWR in cooperative NOMA networks en-
ables a bidirectional communication which leads to bet-
ter utilization of the resources and recover the spectral
efficiency loss inherent to OWR. In addition, combining
TWR with NOMA forces the UR to exchange a dense
information between nodes against the facility of its
decoding process.
Motivated by the previous observations, in this pa-
per, we propose an enhanced secrecy performance of up-
link/downlink cooperative TWR NOMA network against
untrusted relaying. In particular, the base station (Bs) com-
municates with the near (NU) and the far users (FU) where
the communication with FU takes place by untrusted TWR.
The main contributions can be summarized as follows:
• An uplink/downlink cooperative TWR NOMA scheme
against untrusted relaying is proposed in which Bs
transmits a superimposed downlink signal for NU and
FU where the communication to FU takes place via an
UR. Meanwhile, FU transmits its uplink signal to the
UR. The received signals at the UR incurs an IUI with
unknown decoding order which impair the ability of the
UR to separate and decode the composite signal and
confuses its eavesdropping capability. Then, amplify
and forward (AF) relaying is employed at the UR to
forward the received signals to the destinations. To this
end, an unavoidable level of IUI can be created at the
UR when it tries to decode each user symbol coherently
while the decoding quality at legitimate users is not
affected.
VOLUME 4, 2016
This work is licensed under a Creative Commons Attribution 4.0 License. For more information, see https://creativecommons.org/licenses/by/4.0/
• To evaluate the secrecy performance and investigate the
benefits of the proposed scheme, an analytical expres-
sion of a lower bound on the uplink/downlink ergodic
secrecy sum rate (ESSR) is derived. We demonstrate
that a positive ESSR can be guaranteed by the proposed
scheme with the least utilization of resources to com-
plete an uplink/downlink communication. To gain more
insights, an asymptotic scaling law of the ESSR is deter-
mined at high ρ where ρ is the transmit signal to noise
ratio (SNR). It can be clarified that the proposed scheme
can achieve an uplink/downlink scaling gain of ln ρ
over two time slots of communication. Furthermore, the
simulation results confirm the accuracy of the derived
formulas and the superiority of the proposed scheme
over the benchmark schemes.
• We obtain an optimal value of the uplink sharing power
coefficient that maximizes the ESSR for an arbitrary
constant value of downlink power coefficient to inves-
tigate the impact of IUI on the eavesdropping capability
of the UR. First, we prove that the ESSR is a unimodal
maximal function, then, the optimal value is obtained by
carrying out an iterative algorithm based on the golden
search method.
B. ORGANIZATION
The reminder of the paper is organized as follows. In sec-
tion II, we present the proposed cooperative TWR NOMA
scheme with its design structure and channel modeling. The
secrecy performance evaluation is investigated in section III
and verified by simulation results in section IV. Then, the
paper is concluded in section V.
II. SYSTEM MODEL AND DESIGN
Consider the security issue of a cooperative TWR NOMA
wireless network that consists of one base station, Bs, the
near user, NU and far user, FU1 , that communicates with Bs
via an AF-UR employing TWR and analog network coding
(ANC) [50] techniques as shown in Fig.1. All these nodes are
equipped with a single antenna and operate in HD mode of
operation.
It is assumed (as in [17]) that the link between Bs and
FU is absent due to heavy shadowing loss and only the
AF-UR is responsible for delivering information between
Bs and FU. However, the UR is only trusted at the service
level while it is not allowed to decode any confidential
information at the data link processing level. This means that
the UR is only permitted to perform AF protocol TWR that
involves reliable channel state information (CSI) feedback
and estimation as well as signal amplification and forwarding
(e.g., it is assumed that full CSI is owned by the transmitting
nodes via pilot estimation processes prior to information
1 Two user NOMA model has been adopted by the third generation
partnership project long-term evolution (3GPP-LTE) to minimize large inter-
user interference and complex analysis inherent to multi-user NOMA model
for practical implementation of cooperative NOMA networks, e.g., see [3].
3
 This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOI
10.1109/ACCESS.2020.3040951, IEEE Access

Mona et al.: Preparation of Papers for IEEE TRANSACTIONS and JOURNALS

TABLE 1. System parameters

Near user

Parameter Description
hBN
P The transmit power budget quantity of the downlink
or the uplink communication.
hRN hNF hab The channel fading coefficient between node a and
Far user node b.
gab The channel gain coefficient between node a and
hRF
node b.
hBR λab The normalized average channel gain between node
a and node b.
AF-UR employing TWR
The base station CN (0, λ) A circularly-symmetric complex Gaussian distribu-
The uplink signal of the first phase
tion of zero mean and variance equal to λ.
The downlink signal of the first phase
Information transmission of the second phase
N0 The thermal noise variance at the receiving nodes.
na The AWGN distribution at the receiving node a.
α The power sharing (allocation) coefficient of the
FIGURE 1. The proposed cooperative TWR NOMA scheme with an AF-UR. downlink communication.
 The power sharing (allocation) coefficient of the up-
link communication.
transmission [48]2 ). To this end, the UR may try to intercept ρ The transmit signal to noise ratio (SNR) of the trans-
mit power budget P .
confidential information exchanged between nodes during xaD The downlink symbol for the node a.
uplink/downlink communications for its own sake. Hence, it xaU The uplink symbol for the node a.
is necessary to minimize the information leakage at UR3 . To γax The signal to interference noise ratio (SINR) at the
receiving node a for decoding the symbol x.
do this, FU simultaneously exploits transmitting its NOMA ya The received signal at the node a.
uplink signal as a noise signal to increase IUI at the UR and Cax The achievable rate at the receiving node a for decod-
impair its eavesdropping capability. ing the symbol x.
E (.) The mean or expectation function.
From a practical perspective, the proposed scheme can be E (CX ) The average rate (ergodic rate) of CX with respect to
vastly founded in some applicable cellular networks. The the random variable X.
intended network can consist of a Bs which is capable of EX (.) The mean or expectation function with respect to the
exchanging information with a pair of two types of residential random variable X.
P (.) The probability function.
and roadway users. The Bs is directly linked to the residential fX (x) The probability density function (PDF) of the random
user whereas it communicates with the roadway user via an variable X.
UR located near the road signs. Each type of user has a FX (x) The cumulative density function (CDF) of the random
variable X.
hierarchical secrecy demand against the UR which can be cu- β The amplification factor of the UR.
rious to decode its received signals before forwarding them. K 1 (.) The modified Bessel’s function of the first order and
Thus, the transmission rates are dynamically determined by the second kind.
CESSR Ergodic secrecy sum rate (ESSR).
the transmit nodes to maintain those secrecy demands. lower
CESSR Lower bound (LB) of the ESSR.
The communications’ channels are assumed to experience
independent and identical distributed (i.i.d) quasi-static fad-
ing, i.e., channels’ coefficients remain constants within a tion with normalized average channel gains λi i.e., λi , i ∈
resource block of time but independently vary from block to {BN, BF, RN, RF, N F }.
another. Each uplink/downlink and relaying transmission is Two communication phases (two time slots) are needed
bounded by a transmit power budget of P while an additive to complete information uplink/downlink transmission. This
white Gaussian noise (AWGN) is considered at each receiv- can be described in the following two subsections where the
ing node with mean equals to zero and variance equals to N0 . system parameters used in this paper are summarized in Table
Considering channel reciprocity, let the channel coeffi- 1.
cients between B ↔ N , B ↔ R, R ↔ N , R ↔ F
and N ↔ F links that are denoted as hBN , hBR , hRN , A. FIRST PHASE
hRF and hN F , respectively, follow circularly-symmetric
In this phase, Bs transmits simultaneously its downlink sym-
complex Gaussian random variables with zero means and
bols xN D and xF D of NU and FU with power sharing
variances equal to λBN , λBR , λRN , λRF and λN F , respec-
coefficients of α and 1 −nα, respectively, straightforwardly
tively (hi ∼ CN (0, λi ) , i ∈ {BN, BF, RN, RF, N F }). 2
o n
2
o
2
This means that = |hi | follows an exponential distribu- to NU and UR where E |xN D | = E |xF D | = 1.
Meanwhile, FU transmits its uplink symbol which represents
2 We will discuss a two-step CSI pilot estimation in subsection D. a background noise symbol at the UR, n i.e., oxF U , with a
3 Here, we consider the AF relaying protocol in the two-way scheme due to 2
the following reasons: 1) AF relaying protocol is easy to implement where
power sharing coefficient  where E |xF U | = 1. It is
ANC can be applied efficiently to mix analog signals and reduce resource noted that NU shares the same uplink power budget, P ,
utilization; and 2) at low SNR, the AF relaying protocol can achieve better with FU with a power sharing coefficient of 1 − . Different
secrecy sum rate whatever the distance between Bs and UR is, e.g., see [46,
50]. Furthermore, by exploiting the HD TWR, a positive secrecy capacity from the cooperative AN-jamming schemes considered in
can be strictly achieved as we will see in the next section. the literature, e.g., see [46], where the AN relies on pseudo-
4 VOLUME 4, 2016

This work is licensed under a Creative Commons Attribution 4.0 License. For more information, see https://creativecommons.org/licenses/by/4.0/
 This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOI
10.1109/ACCESS.2020.3040951, IEEE Access

Mona et al.: Preparation of Papers for IEEE TRANSACTIONS and JOURNALS

random signals, FU generates its uplink signal as a noise achievable rates for decoding xF D and xN D at NU can be
background signal of deterministic waveform to the UR, e.g., respectively expressed as
xF U , which can easily decoded by NU relying on its captured 1

(1 − α) ρgBN

xF D
characteristic during CSI estimation. CN = log 1 + , (7)
2 αρgBN + 1
Following√ the NOMApprinciple, Bs transmits the signal
xB = xN D P α + xF D P (1 − α) intended for the down- 1
xN D
CN =
log (1 + αρgBN ) . (8)
link communication. Meanwhile, FU transmits the signal 2
√
xF = xF U P  intended for its uplink communication as a As such, we have considered in the first phase the over-
background noisy signal at the UR. Thus, the received signal estimated capability of eavesdropping at the UR which pro-
at UR and NU can be respectively expressed as vides a performance lower bound for the proposed system [8,
48].
yR = hBR xB + hRF xF + nR , (1)
B. SECOND PHASE
yN = hBN xB + hN F xF + nN , (2)
In this phase, the RU forwards an amplified version of its
where P is the transmit power,nR , nN ∼ CN (0, N0 ), N0 is received signals to do its main function without analyzing
the thermal noise variance of the receiving nodes. the entire information contents. Meanwhile, NU transmits its
Without loss of generality, we assume that UR and NU are uplink symbol xN U to Bs with a power allocation coefficient
more close to Bs than FU in the sense that λBN  λRF and of 1 − . By exploiting the HD characteristic of the untrusted
λBR  λRF . Thus, the SIC decoding order starts from xB TWR, the transmission of the uplink signal containing xN U
towards xF . Particularly, the UR carries out a complex joint is completely secured so that xN U can not be eavesdropped
maximum likelihood (ML) detection4 to decode its received by the UR as it is not able to transmit and receive at the
composite signal and achieve better eavesdropping capability same time. Thus, the received signal at Bs and FU can be
in a two-step decoding algorithm. In the first step, the UR respectively given by
tries to decode xF D by treating both xN D and xF U as
interference then it subtracts xF D from its observation before yB =hBR βyR + hBN xN + nB
the attempt of decoding xN D and xF U . In the second step, √ p
after a successful wiretapping of xF D , the UR performs SIC = h2BR βxN D P α + h2BR βxF D P (1 − α)
| {z }
one more time to decode xN D by treating xF U as a noise AN C cancellation term
√
before acquiring xF U . In the composite signal, xN D can +hBR hRF βxF U P 
indeed represent an additional interference when decoding p
+hBR βnR + hBN xN U P (1 − ) + nB , (9)
xF U which can present an over-estimated capability of eaves-
dropping at the UR. Thus, the achievable rates for decoding
yF =hRF βyR + hN F xN + nF
xF D , xN D and xF U at the UR can be respectively expressed √ p
as =hRF hBR βxN D P α + hRF hBR βxF D P (1 − α)
xF D 1

(1 − α) ρgBR
 √ p
CR = log 1 + , (3) + h2RF βxF U P  + hN F xN U P (1 − )
2 αρgBR + ρgRF + 1 | {z }
  AN C and prior estimation cancellation term
xN D 1 αρgBR +hRF βnR + nF , (10)
CR = log 1 + , (4)
2 ρgRF + 1 p q
1
  where xN = xN U P (1 − ), β , gBR +gRF +1/ρ
xF U 1 ρgRF denotes the amplification factor of the UR and nB ∼
CR = log 1 + , (5)
2 αρgBR + 1 CN (0, N0 ) and nF ∼ CN (0, N0 ), where N0 is the thermal
noise variance of the receiving nodes, denote the AWGN at
where ρ , NP0 is the transmit signal to noise ratio (SNR)
Bs and FU.
of the transmit power budget P . Recall that the uplink and
Since Bs has a prior knowledge of the self-amplified
downlink transmit power is bounded by P as
version of its transmitted√ signal, it can cancel
p out the term
Puplink ≤ P and Pdownlink ≤ P. (6) h2BR βxB = h2BR βxN D P α+h2BR βxF D P (1 − α) from
its observation by using ANC and prior estimation cancel-
Depending on the previous knowledge of the CSI about xF U , lation techniques. Without loss of generality, it is assumed
NU can subtract xF U from its observation such that the that the received uplink signal power of xN U is larger than
4 It is assumed that R can perform a complex joint ML detection to separate
that of xF U due to its close proximity to Bs5 . Therefore, the
and remove IUI and decode the information signals correctly [8]. If the UR decoding sequence at Bs is considered to start from xN U to
can perform more intelligent signal decoding techniques, such as the joint xF U , i.e., xN U → xF U .
separation decoding technique, to indiviually separate the intended signals,
the secure transmission may fail, and thus, the injection of a friendly jammer 5 However, the reverse case in which the received uplink signal power of
should be carried out to impair the decoding quality at the UR while the other xF U at Bs is larger than that of xN U due to the amplification process can
nodes can decode their intended signals separately. be treated similarly [48].

VOLUME 4, 2016 5

This work is licensed under a Creative Commons Attribution 4.0 License. For more information, see https://creativecommons.org/licenses/by/4.0/
 This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOI
10.1109/ACCESS.2020.3040951, IEEE Access

Mona et al.: Preparation of Papers for IEEE TRANSACTIONS and JOURNALS

After performing the NOMA SIC decoding technique, the Firstly, Bs needs to estimate gBN , gBR , gRN and gRF in
achievable rates for decoding xF U and xN U at Bs can be order to adjust the achievable rates for xN D and xF D while
respectively expressed as FU needs to estimate gBN , gBR , gRF and gN F in order to
1

(1 − ) ρgBN
 adjust the achievable rate for xF U and the proper value of
xN U
CB = log 1 + , . Then, NU needs to estimate gBN in order to adjust the
2 ρgBR gRF β 2 + (gBR β 2 + 1)
(11) achievable rate for xN U according to the power budget, i.e.,
ρgBR gRF β 2 (1 − ) P . The training steps are described as follows:
 
xF U 1
CB = log 1 + . (12)
2 (gBR β 2 + 1) • Step 1: the UR transmits a pilot signal by which Bs can

On the other hand, FU has a prior knowledge of its self- estimate gBR and FU can estimate gRF while there is
retransmitted signal, as well as, the interference signal no need for NU to estimate gRN . Then, NU transmits
2
√from its pilot signal so that Bs can estimate gBN and FU can
NU, so that it can easily cancel out the term hRF βx F U P +
p
hN F xN U P (1 − ) from its observation by using ANC estimate gN F . Thereafter, NU forwards its received pilot
technique. Recall that NU should be previously able to de- from the RU, e.g., using AF protocol, by which Bs can
code xF D according to (6) before decoding its own downlink estimate gRN upon its prior knowledge of gBN .
• Step 2: both Bs and FU transmit their pilot signals
signal which means that the achievable rate for decoding
xF D at FU should be no more than CN xF D
. From (6) and (9), by which NU can estimate gBN by treating the pilot
the achievable rate for decoding xF D at FU can be expressed power of FU as noise. Then, NU forwards its received
as pilot from Bs, e.g., using AF protocol, by which FU
1 can estimate gBN upon its prior knowledge of gN F in
CFxF D = log (1 + min (γN xF D
, γFxF D )) , (13)
2 step 1. Meanwhile, the RU employs ANC to AF their
2 received pilots from both Bs and FU, e.g., using AF
where γN xF D
= (1−α)ρg BN
αρgBN +1 and γF
xF D (1−α)ρgBR gRF β
= αρgBR gRF β 2 +(gRF β 2 +1) TWR protocol, in the sense that Bs and FU can estimate
are the signal to interference noise ratio (SINR) for decoding
gRF and gBR depending on their previous knowledge of
xF D at NU and FU, respectively.
gBR and gRF in step 1, respectively.
C. ERGODIC SECRECY SUM RATE (ESSR)
III. ESSR PERFORMANCE ANALYSIS
To characterize the statistical effectiveness of the proposed In this section, we provide a detailed analysis on the secrecy
scheme, the ESSR is adopted as a secrecy performance performance of the proposed system in terms of the ESSR. In
metric. The ESSR is defined as the rate beyond which a particular, we derive analytical expressions for lower bound
secure communication rate can be available. The ESSR and and asymptotic lower bound of the ESSR of the proposed
a lower bound on the ESSR are mathematically given by scheme which represent a sufficient approach to determine
h
CESSR , E {CFxF D − CR xF D +
} + {CN xN D xN D +
− CR } the secrecy benefits of the proposed scheme. Furthermore, we
i obtain the optimal value of the power sharing coefficient of
xF U xF U + xN U
+{CB − CR } + CB , (14) the uplink transmission, i.e., , to maximize the ESSR relying
on the iterative golden search algorithm [51] given a fixed
+ value of the power coefficient of the downlink transmission,
lower
CESSR , {E (CFxF D ) − E (CR
xF D
)}
xN D xN D xF U + xF U +
i.e., α.
+{E (CN ) − E (CR )} + {E (CB ) − E (CR )}
(a) A. A LOWER BOUND ON THE ESSR
xN U
+E (CB ) ≤ CESSR , (15)
To proceed forward, we use the definition of average rate
+
where {A} , max (0, A), for arbitrary A and (a) is based (ergodic rate), i.e., E (CX ) , EX (log (1 + x)), for a non-
on Jensen’s inequality as in [8]. negative random variable X as [52]
Remark 1. The proposed scheme can guarantee a positive Z∞
secrecy sum rate. This is enabled by exploiting the HD E (CX ) , EX (log (1 + x)) = log (1 + x) fX (x) dx
xN U
characteristic of the TWR which reveals the term CB is out 0
of the eavesdropping capability. Different from [46, 48], the Z∞
1 1 − FX (x)
proposed scheme confirms achieving a secure performance = dx,
mode to the premier uplink symbol, i.e., xN U , while complet- ln 2 1+x
0
ing an uplink/downlink communication in only two time slots. (16)
where FX (x) and fX (x) are the cumulative density func-
D. CSI REQUIREMENTS
tion (CDF) and the probability density function (PDF) of the
To obtain the required CSI prior to the uplink/downlink trans-
random variable X, respectively.
mission process, a channel training mechanism is adopted
at the transmitting nodes comprised of a two-step training Theorem 1. A closed-form approximate expression for the
lower
mechanism with a transmission of six pilots. lower bound of the ESSR, i.e., CESSR , can be given by (17) at
6 VOLUME 4, 2016

This work is licensed under a Creative Commons Attribution 4.0 License. For more information, see https://creativecommons.org/licenses/by/4.0/
 This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOI
10.1109/ACCESS.2020.3040951, IEEE Access

Mona et al.: Preparation of Papers for IEEE TRANSACTIONS and JOURNALS

the top of the next page, where CBR = λBR α, CRF = λRF ,
CBN = λBN α and λk , k = 1, . . . , 5 are given in Appendix
∗ = arg max CESSR
 lower
,
A. 

Proof. See Appendix A. such that {, α} ∈ [0, 1] ,

P , constant, (18)
The above theorem provides an efficient approach to scale
the secrecy performance of the proposed scheme in terms of In fact it is very difficult to obtain ∗ analytically due to
lower
some evaluations of simple functions. To give more insights a certain composite structure of CESSR . Instead, we divide
about the impact of the system parameters and the feasibility the main problem into a problem of a simple structure of
lower
of proposing TWR scenario upon the system to improve both CESSR based on a desired secrecy performance mode. Then,
lower
reliability and security issues, we investigate the asymptotic we investigate that CESSR has at most one maximal critical
scaling behavior of the ESSR of the proposed system when ρ point under a certain condition on  ∈ [0, 1]. Then, we find
grows to infinity. out the optimal value ∗ by the utilization of the golden search
To deal with, the approximations e1/x ≈ 1 + 1/x and algorithm for finding a maximum of a function.
lower
Ei (−1/x) ≈ − ln x can be used in (17) when x → ∞ which First, we investigate that CESSR combines an algebraic
leads to the following corollary. sum of monotonously increasing and decreasing functions of
, then, we obtain ∗ from the combined function as follows.
Corollary 1. At high transmit SNR, i.e., ρ → ∞, the ap- Based on the expression of CESSRlower
in (15), we consider the
lower
proximate expression of the ESSR in (17), i.e., lim CESSR , condition where a secrecy performance mode for all xN D ,
ρ→∞
+
scales as ln ρ. xF D , xN U and xF U symbols can be achieved, i.e., {A} ,
A. This leads to the following optimization problem
Proof. See Appendix B.  
∗ ^lower
Remark 2. It is observed that the secrecy performance of  = arg max CESSR ,

the proposed scheme benefits much from employing TWR
such that {, α} ∈ [0, 1] ,
communication in the UR when the transmit SNR grows to
infinity. An uplink/downlink communication scenario can be P , constant, (19)
performed simultaneously only in two time slots where the lower ≈ {E (C xF D ) − E (C xF D )} + E (C xN D ) −

proposed scheme can always guarantee a positive secrecy where C^ESSR F R N
xN D xF U xF U xN U

sum rate even in case of the over-estimated eavesdropping E (CR ) + {E (CB ) − E (CR )} + E (CB ).
capability of the UR.
Theorem 2. Following the methodology of obtaining C^ lower
ESSR
Considering the benchmark schemes, it can be verified that
the proposed scheme can offer an overall uplink/downlink in (15), C^
lower is a sum of two monotonically decreasing and
ESSR
ESSR scaling gain of ln ρ, a downlink ESSR scaling gain of increasing functions of  and we have the following modified
1 optimization problem
4 ln ρ over the adaptive downlink one-way relaying NOMA
network proposed in [48] with cooperative jamming and a
 
∗ ^lower
scaling gain 12 ln ρ over the same system without cooperative  = arg max CESSR ,

jamming whereas it can offer the same uplink ESSR scal-
such that α ∈ [0, 1] ,
ing gain of 41 ln ρ over the scheme proposed in [18]. This
means that the proposed system can achieve an overall up- P , constant,
link/downlink ESSR scaling gain of 18 ln ρ over the adaptive  ∈ [max (0, 1 ) , min (1, 2 )] , (20)
uplink/downlink one-way relaying NOMA network proposed gBR (αρgBR −1)−1/ρ
in [48] with the least utilization of resources. with 1 = gRFρg BR +1
ρ(ρgRF −1) and 2 = gRF .
^
lower has at most one maximal critical point inside
then, CESSR
B. THE OPTIMAL VALUE OF THE UPLINK/JAMMING ∗
 ∈ [max (0,  ) , min (1,  )], i.e., C^
1
lower is a unimodal
2
COEFFICIENT (∗ ) ESSR
maximum of .
In this subsection, we focus on finding out an optimal value
lower Proof. See Appendix C.
of  that maximizes the ESSR (e.g., CESSR ) of the proposed
system with arbitrary fixed values of Bs’s power sharing co- Remark 3. It is noted that the determination of the maximum
efficient, i.e., α, and uplink/downlink transmit power budget, critical point inside [max (0, 1 ) , min (1, 2 )] depends basi-
i.e., P 6 . cally on both the sum of the increasing rate of E (CI ) and the
In particular, it is desired to determine an optimal value ∗ decreasing rate of E (CD ) with respect to . In other words,
that satisfies the following optimization problem there exists only one maximum point ∗ that can be found
6 Unfortunately, a more general jointly optimal power allocation problem
out within [max (0, 1 ) , min (1, 2 )] according to the rate
of (,α) can be considered to maximize the ESSR of the proposed scheme of the sum of E (CI ) and E (CD ). Regarding (17), it is very
which is beyond this work. difficult to obtain an analytical expression for ∗ with respect
VOLUME 4, 2016 7

This work is licensed under a Creative Commons Attribution 4.0 License. For more information, see https://creativecommons.org/licenses/by/4.0/
 This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOI
10.1109/ACCESS.2020.3040951, IEEE Access

Mona et al.: Preparation of Papers for IEEE TRANSACTIONS and JOURNALS

λ3 ()
e− ρα
        
λ3 () (1−α) λ3 () λ1 () λ 1 ρ 1
lower
CESSR ≈ Ei − − e− ρα λ3 () Ei − − e BR Ei −
2 ln 2 ρα ρ 2 ln 2 λBR ρ
    +
1 1 λ2 () C ρ 1 1
− CRF (1 + α) e CRF ρ Ei − − e BR Ei −
CRF ρ 2 ln 2 CBR ρ
( 1        )+
e CBN ρ 1 1 CBR 1 1 1 1
+ − Ei − − e CBR ρ Ei − − e CRF ρ Ei −
2 ln 2 CBN ρ 2 ln 2 CRF − CBR CBR ρ CRF ρ
+
   
   
1 − ρ1 C 2 +1 1 1 C 1 1
  
1 1
RF
+ − e RF Ei −   − e CRF ρ Ei − − e CBR ρ Ei −
 2 ln 2 ρ 2
+1 2 ln 2 CBR − CRF CRF ρ CBR ρ 
CRF
1     
eCRF ρ
λ4 () 1 1 λ5 () λ5 ()
+ e λ4 ()ρ Ei − −e ρ Ei − . (17)
2 ln 2 λBR (1 − λ4 () λ5 ()) λ4 () ρ ρ

to the parameters of C^
lower
ESSR . Instead, we propose an iterative
that concern the untrusted relaying based NOMA and OMA
optimized algorithm based on the golden search method [51] networks.
to obtain a very convergent value of ∗ . Without loss of generality, we specify the main system
parameters utilized in [48] as follows. For instance, we set
The algorithm is summarized in the following steps as
λBN = 0.7, λBR = 0.5, λRN = 0.5, λRF = 0.5,
shown in Algorithm 1.
λN F = 0.4, α = 0.4, N0 = −100(dBm), and  = 0.4
Algorithm 1 Iterative algorithm for determining ∗ based on (i.e., denoted as PAR1).
the golden search method. In terms of the uplink/downlink ESSR performance,
we compare our proposed scheme with three benchmark
Input: α, ρ, gBR , gRF , gBN , u1 = 10−3 , Niter. = 0 and a
schemes described as follows:
maximum tolerance ε = 10−4 .
1: Calculate: 1 , 2 , 1) The adaptive uplink/downlink cooperative jamming
u√2 = min (1, 2 ) − 10−3 + max (0, 1 ) , d = NOMA based network proposed in [48]: In this


5−1
(u2 − u1 ), u3 = u1 + d and u4 = u2 − d. scheme, Bs uses the NOMA principle to√send a
2
2: While: (|u3 − u4 | > ε or Niter. < 10−3 do downlink
p superimposed signal, i.e., xN D P α +
3: Niter. = Niter. + 1; xF D P (1 − α), to communicate with NU directly
and FU by the aid of a one-way HD UR. Meanwhile,
 = u3 , calculate C^lower ^ lower ^
lower
ESSR , CESSR (u3 ) = CESSR ; FU emits an adaptive structured jamming signal during
 = u , calculate C^
4
lower , C^
lower (u ) = C^
ESSR
lower ;
ESSR 4 ESSR its idle state to overcome information leakage at the
4: If C^
lower ^lower
ESSR (u3 ) ≤ CESSR (u4 )
UR. This adaptive jamming signal has the same symbol
u2 = u3 , u3 = u4 and u4 = u2 − d; structure as the NOMA symbol structure and it is well-
5: Else if C^
lower ^lower known to the corresponding receivers. Then, the UR
ESSR (u3 ) > CESSR (u4 )
u1 = u4 , u4 = u3 and u3 = u1 + d; uses the AF technique to forward its received signal7 .
6: End if. Meanwhile, Bs sends another information signal to
7: End while. NU. In the uplink communication, both NU and FU
8: The optimal value of the uplink/jamming coefficient= sends their information signals to Bs and the UR,
∗ = u3 +u 4
. respectively. Meanwhile, NU emits in parallel a super-
2
Output:  ∗ imposed adaptive jamming signal with its information
signal. Then, the UR amplifies and forward its received
signal. Meanwhile, NU sends another information sig-
IV. SIMULATION RESULTS, DISCUSSION AND FUTURE nal to Bs. It has been verified that the proposed system
WORK in [48] outperform the proposed system in [17, 18]
A. SIMULATION RESULTS without adaptive jamming signals.
In this section, we provide numerical results to validate 2) The uplink/downlink NOMA based network with desti-
the analytical results of our enhanced secrecy performance nation aided AN-jamming proposed in [53]: Different
scheme for TWR based cooperative NOMA network with from the previous proposed scheme [48], both FU in
UR via Monte Carlo simulations with 104 iterations. In 7 Throughout this paper, the dynamic value of the amplification factor, i.e.,
particular, we discuss the secrecy performance point of view β, is adopted to maintain a realistic secrecy scheme by adapting the secrecy
of the proposed scheme in terms of the state of art schemes performance of xN D , xF D , xN U and xF U .

8 VOLUME 4, 2016

This work is licensed under a Creative Commons Attribution 4.0 License. For more information, see https://creativecommons.org/licenses/by/4.0/
 This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOI
10.1109/ACCESS.2020.3040951, IEEE Access

Mona et al.: Preparation of Papers for IEEE TRANSACTIONS and JOURNALS

downlink and Bs in uplink emit an AN-jamming signal,

denoted by xz , to jam the UR. This jamming signal
can be eliminated at each desired destination via an
interference elimination technique.
3) The conventional OMA scheme: In this scheme, Bs
sends a downlink signal to FU via the UR. Meanwhile,
FU emits an AN-jamming signal. Then, the UR uses
the AF technique to forward its received signal to FU.
Then, Bs sends a downlink information signal to NU.
In the uplink communication, the FU sends its uplink
signal to Bs via the UR. Meanwhile, Bs emits an AN-
jamming signal. Then, the UR amplifies and forward
its received signal to Bs. Then, NU sends its uplink
information signal to Bs.
Firstly, we investigate in Fig. 2 the detection capability of
FIGURE 2. A PMD performance comparison of the symbol xF U between Bs
the TWR system under PAR1 by discussing the probability and UR employing the joint complex ML detection algorithm.
of miss detection (PMD) of the symbol xF U when the UR
employs the joint complex ML detection algorithm. In Fig.
2, the PMD of Bs and the UR are plotted versus ρ when the
joint complex ML detection is employed for a predetermined
values of gBR and gRF . It is evident that the PMD of Bs
decreases rapidly and faster than the UR when the analytical
xF U xF U
condition CB − CR > 0 is met for all ρ. i.e., or equiva-
lently the condition αρ2 gBR − ρ (gBR + gRF ) − 1 > 0 is
met and the PMD gap increases with ρ. This means that  and
α should be carefully designed in order to achieve a positive
secrecy rate for xF U .
To start a comparative study on the secrecy performance
between the proposed and the benchmark schemes. The
lower
lower bound of the ESSR (i.e., CESSR ) of the proposed and
the benchmark schemes are computed firstly by summing
up the uplink and downlink secrecy rates. In Fig. 3, the
lower
analytical and simulation results CESSR for the proposed FIGURE 3. A lower bound of downlink/uplink ESSR performance comparison
and benchmark schemes are plotted under PAR1 versus ρ. between the proposed and the benchmark schemes in terms of ρ.
lower
It is evident that CESSR of proposed scheme converges to the
scale of lnρ in high ρ regime whereas benchmark 1 scheme
lower
converges to the scale of 78 ln ρ in high ρ per two time slots the CESSR curve in both scenarios converges the scale of
of an uplink/downlink communication. Furthermore, it is ev- lnρ in medium to high range of ρ. This emphasizes that
ident that benchmark 2 reaches a floor value at high ρ. This is the proposed scheme can achieve ESSR scaling gain of lnρ.
lower
because the transmitted AN-jamming signal xz an unknown Moreover, it is evident that the derived formula of CESSR
structure at the receiving nodes, degrades the reception qual- in (17) agrees well with its corresponding simulation result
ity regardless of confusing the eavesdropping capability of which verifies the asymptotic convergence of this analytical
lower formula.
the UR. Benchmark 3 scores the worst CESSR performance
among the comparative schemes. This is because it needs at Fig. 5 depicts the optimal value of the uplink/jamming
least six time slot resources to complete an uplink/downlink sharing coefficient (∗ ) of the proposed CESSRlower
by using
communication. This emphasize that the proposed scheme the method of golden search algorithm with ρ = 10. It is
lower
yields the highest CESSR with the least number of resources evident that there exists one and only one maximum value of
of a completed uplink/downlink communication.  within  ∈ [1 , min (1, 2 )] when the secrecy performance
To illustrate the impact of variation of the system param- of xN D , xF D , xN U and xF U symbols can be achieved
lower lower
eters on the CESSR of the proposed scheme, the derived as CESSR is a unimodal maximum of . Considering the
lower
formula in (17) and the simulation analysis of CESSR are impact of gRF on the performance, Fig. 5 is plotted for
plotted in Fig. 4 for two different channel gain settings, two different λRF settings, i.e., λRF = 1 shown in Fig.
i.e., namely, the previous PAR1 settings, when λi = 0.5 5a and λRF = 0.5 shown in Fig. 5b, while λi = 0.5 for
(i.e., denoted as PAR2), i ∈ {BN, BF, RN, RF, N F }) and i ∈ {BN, BF, RF, N F }) where we consider that 1 >
when λRF = 0.3 and all λi = 0.5, (i.e., denoted as PAR3), 0, 2 > 1. Although the increasing of gRF makes the symbol
i ∈ {BN, BF, RN, N F }). It is observed that the slope of xF U vulnerable to be eavesdropped by the UR, it can greatly
VOLUME 4, 2016 9

This work is licensed under a Creative Commons Attribution 4.0 License. For more information, see https://creativecommons.org/licenses/by/4.0/
 This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOI
10.1109/ACCESS.2020.3040951, IEEE Access

Mona et al.: Preparation of Papers for IEEE TRANSACTIONS and JOURNALS

a. λRF = 1.
FIGURE 4. Analytical and simulation LB results of downlink/uplink ESSR of
the proposed scheme in terms of ρ under PAR1, PAR2 and PAR3.

increase the IUI within the composite signal received by the

UR, and therefore, it can impair the eavesdropping capability
of the UR and improve the overall lower bound of the ESSR,
lower
e.g., CESSR .

B. DISCUSSION AND FUTURE WORK

In this subsection, further discussion is added to clarify
the impact of different system parameters on the secrecy
performance and investigate how the proposed scheme can be
extended to more general systems of practical considerations.
It is worthy noting that the proposed scheme relies basi-
cally on imposing unordered composite signal to increase
IUI and impair the decoding quality at the UR. Thus, sys-
tem parameters should be carefully designed to unleash the
benefits of deploying TWR technique into the UR to achieve
the desirable level of secrecy performance in the end to end
uplink/downlink communication process.
On one side, it can be observed that gRN has no impact on
the secrecy performance (i.e., or equivalently the ESSR) of
the proposed scheme as NU has a prior knowledge about both
xB and xF signals to extract its downlink signal, i.e., xN D ,
while its uplink signal, i.e., xN , cannot be eavesdropped by
the UR due to its HD limitation.
On the other side, gRF has a crucial impact on the ESSR
of the proposed scheme. It is cleared that large value of
gRF makes the uplink signal xF more vulnerable to be
eavesdropped by the UR while small value of gRF sacrifices
the interference level at the UR when it tries to decode the
superimposed xB signal for its own sake.
Furthermore, gBR (i.e., λBR ) is an important parameter of
determining 1 and 2 which should be carefully designed
to maintain the desired secrecy performance of xN D , xF D ,
xN U and xF U . In particular, for a specific α,  should be
designed within the range of max (0, 1 ) <  < min (1, 2 ).
Additionally, λBN should be also designed in the sense that
the spatial location of NU is closer to Bs than the others in
order to increase the ESSR.
10
b. λRF = 0.5.
FIGURE 5. LB of downlink/uplink ESSR of the proposed scheme in terms of 
under λRF = 1, λRF = 0.5 and λi = 0.5 for i ∈ {BN, BF, RN, N F }.
However, if those certain parameters cannot be controlled,
an external injection of a friendly jamming signal should be
devised or even switching the UR to perform OWR technique
[48] with cooperative jamming.
The proposed scheme can be extended to multi-user multi-
antenna systems. In particular, the multi-user system can
provide higher degrees of freedom and diversity gain to
enhance the ESSR by a joint user and jamming scheduling
design [55]. In multi-antenna systems, joint beamforming
and power optimization with cooperative jamming can be
applied to further achieve better ESSR in delay-tolerant
secrecy-sensitive scenarios.
Another direction of practical implementation can be ex-
tensively applied to the proposed scheme with imperfect CSI
where novel multi-pair, multi-user and multi-antenna joint
selection strategies can be performed to maintain different
secrecy targets for users of different secrecy performance
levels [56]. In general, integrating those strategies into the
proposed scheme can significantly enhance the ESSR.
VOLUME 4, 2016

This work is licensed under a Creative Commons Attribution 4.0 License. For more information, see https://creativecommons.org/licenses/by/4.0/
 This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOI
10.1109/ACCESS.2020.3040951, IEEE Access

Mona et al.: Preparation of Papers for IEEE TRANSACTIONS and JOURNALS

V. CONCLUSIONS addition, the CDF of Y N D can be expressed as

In this paper, we proposed an enhanced secrecy performance Z∞  
x (ρy + 1)
scheme of cooperative uplink/downlink NOMA networks FY N D (x) = P gBR < fgRF (y) dy
against untrusted relaying. To save resources and prevent αρ
0
eavesdropping, TWR and IUI techniques were exploited at Z∞   1
x(ρy+1)
the UR to intensify the exchange of information signals and − − y
= 1−e λBR αρ
e λRF dy
confuse the eavesdropping capability at the UR, respectively. λRF
0
To reveal the merits of the proposed scheme, we derived λBR α − x

an analytical expression for the lower bound of the up- =1− e λBR αρ , (A.3)
λRF x + λBR α
link/downlink ESSR and verified it by simulation results. The xN D
results demonstrated that the proposed scheme can achieve an where P(.) is the probability function. Hence, E (CR ) can
improvement in the uplink/downlink ESSR than the bench- be obtained as
mark schemes with the least utilization of resources. Fur- Z∞
xN D 1 λBR α exp (−x/λBR αρ)
thermore, we obtained an optimal value for the uplink power E (CR ) = dx
2 ln 2 (λRF x + λBR α) (1 + x)
sharing coefficient by holding an iterative algorithm based on 0
the golden search method. 1 λBR α
= ×
.  2 ln 2 λRF  − λBR α 
1 1
e λBR αρ Ei (−1/λBR αρ) − e λRF ρ Ei (−1/λRF ρ) .
APPENDIX A (A.4)
PROOF OF THEOREM 1. xF U
lower Consequently, E (CR )
can be simply obtained as
To find out a closed form expression for CESSR , we xN D
E (CR ) by interchanging λBR by λRF and ρ by . Fur-
firstly have to derive mathematical formulas for E (CFxF D ),
xF D xN D xN D xF U xF U thermore, the CDF of Y F D can be expressed as
E (CR ), E (CN ), E (CR ), E (CB ), E (CR ) and
E (CB ), separately. Let X F D , min (γN , γFxF D ),
xN U xF D Z∞  
2
x (ρy + 1)
X N D , αρgBN , X F U , ρg BR gRF β FY F D (x) = P gBR < fgRF (y) dy
(gBR β 2 +1) , X N U , ρ (1 − α − αx)
(1−)ρgBN (1−α)ρgBR 0
ρgBR gRF β 2 +(gBR β 2 +1) , Y F D , αρgBR +ρgRF +1 , Y N D , Z∞  
αρgBR ρgRF x(ρy+1) 1 −λy
ρgRF +1 , and Y F U , αρgBR +1 , then, we can obtain the
−λ
= 1−e BR (1−α−αx)ρ e RF dy
desired formulas as follows. λRF
− 12 0
By substituting by β , (gBR + gRF + 1/ρ) , XF U λBR (1 − α − αx) x
−
and X N U can be rewritten respectively as =1− e λBR (1−α−αx)ρ ,
λRF x + λBR (1 − α − αx)
(A.5)
ρgBR gRF xF D
XF U ,  , and E (CR ) can be obtained as
1
2gBR + gRF + ρ xF D
  E (CR )=
(1 − ) ρgBN gBR + gRF + ρ1 1−α
α x
−
λBR (1 − α − αx) e λBR (1−α−αx)ρ
Z
XNU , 1 . (A.1) 1
ρgBR gRF + 2gBR + gRF + ρ
dx
2 ln 2 ((λRF  − λBR α) x + λBR (1 − α)) (1 + x)
0
(1−α)y
Z∞ αλBR
e
−λ
BR αρ
Based on the above, the CDF of X N D can be expressed as 1 1 λRF (1−α)
= e λBR αρ ×   dy.
FX N D (x) = 1 − exp (−x/λBN αρ) where E (CN xN D
) can be 2 ln 2 y+ (λBR α−λRF )
y (y − 1)
1 λRF (1−α)
obtained directly as 1−α

(A.6)
After applying some algebraic manipulations, the method
Z∞
xN D 1 exp (−x/λBN αρ) of undetermined coefficients as used in [57-59] and using
E (CN = ) dx [[54], 3.352.2-5], we arrive at
2 ln 2 1+x
0   
  xF D λ1 () λ 1 ρ 1
exp λBN1 αρ   E (CR )= e BR Ei −
1 2 ln 2 λBR ρ
=− Ei − , (A.2)  
2 ln 2 λBN αρ 1 1
− λRF  (1 + α) e λRF ρ Ei −
λRF ρ
 
where the last term is obtained from [[54], 3.352.4] and λ2 () λ 1 αρ 1
+ e BR Ei − , (A.7)
Ei(.) is the exponential integral function [[54], 8.211.1]. In 2 ln 2 λBR αρ

VOLUME 4, 2016 11

This work is licensed under a Creative Commons Attribution 4.0 License. For more information, see https://creativecommons.org/licenses/by/4.0/
 This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOI
10.1109/ACCESS.2020.3040951, IEEE Access

Mona et al.: Preparation of Papers for IEEE TRANSACTIONS and JOURNALS

where λ1 () = (λBRλ−λ BR

RF )
, λ2 () = (λBRαλ α−λRF ) . In
BR
whereas P2 can be obtained after substituting for β in (12) as
ρgBR gRF
this regard, the CDF of X F U , (2gBR +gRF +1/ρ) can be  
accordingly expressed as (1 − α) ρgBR gRF
P2 = P >x
αρgBR gRF + gBR + (1 + ) gRF + 1/ρ
Z∞
ZZ
  1 −λ t 1 −λy
x (y + 1/ρ) = e BR e RF dt dy
FX F U (x) = P gBR < fgRF (y) dy λBR λRF
ρy − 2x (1−α)ρty
>x
0 αρty+t+(1+)y+1/ρ

Z∞ Z∞
−λ
x(y+1/ρ) 1 −λy −λ
(1+)yx+x/ρ 1 −λy
=1− e BR (ρy−2x) e RF dy = e BR (ρy(1−α−αx)−x) e RF dy
λRF λRF
2x/ρ x
ρ(1−α−αx)
Z∞ x
− ρ(1−α−αx)

1
+λ
(1+)

Z∞
−λ 2x
−
x(t+2x+1) 1 −λ t
(b) e λRF BR x/ρ(1+(1+)x/(1−α−αx))
=1−e RF ρ e λBR ρt
e RF ρ dt = e
− λBR u
λRF ρ λRF ρ (1 − α − αx)
0 0
 
u
−x 2 1
λRF  + λBR
−λ
=1−e ρ
C1 (x, ρ, ) K 1 (C1 (x, ρ, )) , ×e RF ρ(1−α−αx) du
(A.8)
 
x 1 (1+)
(c) − ρ(1−α−αx) +λ
=e λRF BR C2 (x, ρ, ) K 1 (C2 (x, ρ, )) ,
q (A.11)
where C1 (x, ρ, ) = ρ2 λx(2x+1)
BR λRF 
where K 1 (.) is the
modified Bessel’s function of the second kind. It is noted that where step (b) follows by letting ρy (1 − α − αx) −
we use [[54], 3.324.1] and the substitution ρy − 2x = t in x = u, step (c) follows by [[54], 3.324.1] after
(A.7) where the condition y > 2x/ρ should be satisfied. doing some q algebraic manipulations by C2 (x, ρ, ) =
Recall that we focus on the lower bound of the ESSR, then, 1 x(1−α−(α−(1+))x)
ρ(1−α−αx) λBR λRF .
K 1 (x) can be upper-bounded by K 1 (x) ≤ 1/x when ρ →
xF U Substituting into (A.10), we can get the CDF of X F D as
∞. Consequently, E (CB ) can be simply obtained as
 
x 1 (1+) 1
− + +λ
Z∞ FX F D (x) = 1 − e ρ(1−α−αx) λRF λBR
 
BN
−x 2
λRF  +1
xF U 1 e ρ
E (CB )= dx × C2 (x, ρ, ) K1 (C2 (x, ρ, )) . (A.12)
2 ln 2 (1 + x)
0
 
1 − ρ1 1 Recall that we search for a lower bound of the ESSR in the
 
2
λRF  +1
=− e Ei −   . sense that we can making the use of the relation K 1 (x) ≤
2 ln 2 2
ρ λRF + 1
 1/x when ρ → ∞ to simplify the analysis. Then, E (CFxF D )
(A.9) can be expressed as

xF D
It is noted that γN and γFxF D are disjoint and consist 1−α
α
Z x
− ρ(1−α−αx)

1
+λ
(1+)
+λ 1


of independent random variables and two key perceptions 1 e λRF BR BN

E (CFxF D ) = dx
of interest can be used to determine the minimum and the 2 ln 2 (1 + x)
xF D 0
maximum of γN and γFxF D . Those key perceptions are ε Z∞ u(1−α)
xF D xF D
(min (γN , γF ) > x) if and only if both γN xF D
> x and (d)e− ρα e− ρα λ3 ()
xF D xF D xF D = du, (A.13)
γF > x, and (max (γN , γF ) < x) if and only if both 2 ln 2 u (u − 1)
xF D
γN < x and γFxF D < x. Specifically, the upper bound for 1
1−α
xF D
the maximum tends to an upper bound for each of γN and
xF D
γF , whereas the lower bound for the minimum tends to a where step (d) follows by letting (1− α − αx) = 1/u
lower bound. Thus, the CDF of X F D can be expressed by and λ3 () = λRF 1
+ (1+) 1
λBR + λBN . Following similar
the following probability
procedure as (A.7) and using [[54], 3.352.2, 5], we can get

λ3 ()
e− ρα
  
λ3 ()
FXF D (x) = P (min (γNxF D
, γFxF D ) < x) E (CFxF D ) = Ei −
xF D
2 ln 2 ρα
= 1 − P (γN > x) P (γFxF D > x) . (A.10)  
(1−α) λ3 ()
| {z }| {z } − e− ρα λ3 () Ei − . (A.14)
P1 P2 ρ

x
−λ (1−)ρgBN (gBR +gRF +1/ρ)
According to (12), P1 can be obtained as e BN ρ(1−α−αx) Finally, the CDF of X N U , ρgBR gRF +2gBR +gRF +1/ρ can
12 VOLUME 4, 2016

This work is licensed under a Creative Commons Attribution 4.0 License. For more information, see https://creativecommons.org/licenses/by/4.0/
 This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOI
10.1109/ACCESS.2020.3040951, IEEE Access

Mona et al.: Preparation of Papers for IEEE TRANSACTIONS and JOURNALS

xN U
be evaluated as Thus, E (CB ) can be simply obtained as

FX N U (x) = 1 Z∞ x
λ4 () − λ ()ρ
e λRF ρ λBR e
4
xN U
ZZZ −λ t −λy −λ u E (CB ) = dx
e BR e RF e BN 2 ln 2 (x + λ4 () λ5 ()) (x + 1)
1− du dy dt 0
λBR λRF λBN 1 Z∞ x
λ4 () − λ ()ρ
( ) >x λBR e
(1−)ρu t+y+ 1 e λRF ρ 4
ρ (g)
ρty+2t+y+ 1 = dx−
ρ
2 ln 2 (1 − λ4 () λ5 ()) (x + λ4 () λ5 ())
Z∞ Z∞ (t+ ρ1 )(x−(1−)ρu)+xt e −λ u −λ t 0
− λ BN e BR
Z∞ x
λ4 () − λ ()ρ
=1− e ((1−)ρu−x(ρt+1))
dudt
λBR e
RF
λBN λBR
4
λ4 ()
dx = ×
0 x(ρt+1)
(1−)ρ
(1 − λ4 () λ5 ()) (1 + x) λBR (1 − λ4 () λ5 ())
0
Z∞ (ρt+1) x(ρt+1)
λRF ρ − λBN (1−)ρ
1
1 e
    
(e)
=1− × e λRF ρ 1 1 λ5 () λ5 ()
2 (1 − ) ρ e λ4 ()ρ
Ei − −e ρ Ei − ,
2 ln 2 λ4 () ρ ρ
0
Z∞ v
(A.16)
−λ t − (1−)ρλ
e BR xρt2 e BN (f ) 1
× e λRF v
dvdt = 1 − × where in step (g) follows after performing some algebraic
λBR λBN 2
1
−∞ manipulations, λ4 () = (1 − ) λBN and λ5 () = λBR −
Z∞ (ρt+1)
−λ
x(ρt+1)
−λ t Z∞ 2
1
. This completes the proof.
e λRF ρ
 
BN (1−)ρ BR − z− (1−)λxt λRF
e RF λBN z dzdt
λBR
0 −∞ APPENDIX B
Z∞ (ρt+1) x(ρt+1) t
λRF ρ − λBN (1−)ρ − λBR PROOF OF COROLLARY 1.
e
=1− dt At high transmit SNR, based on (15) and (17), it is evident
λBR xF D
0 that XF D , min (γN , γFxF D ) approaches a constant inde-
Z∞ pendent of ρ as both γN and γFxF D reach a constant value
xF D
 
x
−t λ +λ 1 −λ 1
1 x
λRF ρ − λBN (1−)ρ
e BN (1−) BR RF 
=1−e dt with ρ → ∞. Thus, E (CFxF D ) can be approximated in terms
λBR of its scaling with ρ as
0
1 x
λRF ρ − λBN (1−)ρ
=1−e ×
lim E (CFxF D ) ∝ constant. (B.1)
(1 − ) λBN λRF ρ→∞
.
λBR λRF x + (1 − ) λBN λRF − (1 − ) λBN λBR
(A.15) This means that E (CFxF D ) is proportional to a constant
value with ρ grows to infinity where ∝ denotes the propor-
xF D xN D xF U
where in step (e) we put ((1 − ) ρu − x (ρt + 1)) = tional sign. Similarly, E (CR ), E (CR ), E (CR ) and
xN U
v, v ∈ [−∞, ∞], step (f) follows by applying [[54], E (CB ) can be regarded to scale as a constant with the ever
v increase of ρ as Y F D , Y N D , Y F U and X N U approach a
3.324.2], some algebraic manipulations, (1−)ρλBN
= z and
xt2
≥ 0. constant value with ρ → ∞, respectively.
(1−)λRF λBN
Furthermore, by utilizing the approximations e1/x ≈ 1 +
Remark 4. It is noted that the same result can be obtained 1/x and Ei (−1/x) ≈ − ln x in (A.2) and (A.9), it is evident
mathematically for the integration in step (e) by following xN D xF U
that both E (CN ) and E (CB ) scale respectively as
similar procedure as (A.11) and using [[54], 3.324.1], we
can get for v ∈ [0, ∞] or v ∈ [−∞, 0]
 
xN D 1 1
lim E (CN )∝ ln ρ + ln ρ × O , (B.2)
ρ→∞ 2 ρ
Z∞ (ρt+1) x(ρt+1)
λRF ρ − λBN (1−)ρ −λ t Z∞ v
− (1−)ρλ
e e BR xρt2 e BN
e λRF v dvdt
(1 − ) ρ λBR λBN  
0 0 xF U 1 1
Z∞ (ρt+1) x(ρt+1)
−λ t
lim E (CB )∝ ln ρ + ln ρ × O . (B.3)
λRF ρ − λBN (1−)ρ ρ→∞ 2 ρ
e e BR K 1 (C4 (x, ρ, , t))
= dt
(1 − ) ρ λBR C4 (x, ρ, , t)
0 Combining the above results and the fact that lim E (.) =
ρ→∞
Z∞ (ρt+1) x(ρt+1) t
λRF ρ − λBN (1−)ρ − λBR
 
e lower
= dt, E lim (.) , one can find that CESSR scales with ρ as
λBR ρ→∞
0

lower 1 1
where we can making the use of the relation K 1 (x) ≤ 1/x lim CESSR ∝ ln ρ + ln ρ = ln ρ. (B.4)
ρ→∞ 2 2
q x defined as |arg (x)| < π where C4 (x, ρ, , t) =
with
−x
2t λRF (1−)λBN
. This completes the proof.
VOLUME 4, 2016 13

This work is licensed under a Creative Commons Attribution 4.0 License. For more information, see https://creativecommons.org/licenses/by/4.0/
 This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOI
10.1109/ACCESS.2020.3040951, IEEE Access

Mona et al.: Preparation of Papers for IEEE TRANSACTIONS and JOURNALS

APPENDIX C and using the fact that the sum of monotonically increasing
PROOF OF THEOREM 2. (or decreasing) functions is also an increasing (or decreasing)
lower
Recall that the secrecy performance of xN D , xF D , xN U function, it is evident that CESSR is a sum of two monoton-
and xF U can be achieved. It is evident from (4) and (8) ically decreasing and increasing functions of  and the first
xN D
that E (CR ) is a monotonically decreasing function of  part of the proof is completed.
xN D xN U
) and E (CI ) ,  E (CFxF D ) −

while E (CN ) is a constant function of . Thus, the term Let E (C D ) = E (CB
xN D xN D xF D
xN D xN D xF U
{E (CN ) − E (CR )} can be verified as a monotonically E (CR ) + {E (CN ) − E (CR )} + E (CB ) −
xF U xN U
increasing function of . E (CR ) . Recall that E (CB ) is a monotonically de-
Regarding the term {E (CFxF D ) − E (CR xF D
)}, from (3) creasing function of  which can be rewritten after some alge-
xF D
braic manipulations as E (CD ) ≡ log2 −D1  + D2 + D3 ,


E (CR ) is a monotonically decreasing function of 
whereas E (CFxF D ) is a constant function of  when γN xF D
< where D1 , D2 and D3 are arbitrary coefficients inde-
xF D xF D
γF and E (CF ) is a monotonically decreasing function pendent of . Thus, E (CD ) is a strictly decreasing func-
xF D
of  when γN > γFxF D . Then, we discuss the monotonicity tion of  ∈ [0, 1]. Furthermore, E (CI ) can be further
of the term {E (CFxF D ) − E (CR xF D
)} by following the same rewritten
 after some algebraic  manipulations as E (CI ) ≡
3 +I2 2 +I3 +I4
procedure in [[48], Appendix A] as follows: log2 I5 I41+I 3 2
6  +I7  +I8 +I9
, where I1 to I9 are arbitrary
x x x x
• If γNF D < γFF D , then, the term {E (CFF D ) − E (CRF D )} positive coefficients independent of , then, E (CI ) has neg-
is a monotonically increasing function of . ative roots and it comprises a sum of monotonically in-
x x x x
• If γNF D > γFF D , then, the term {E (CFF D ) − E (CRF D )} creasing functions of  with positive secrecy performance
xF D xF D
can be  expressed as {E (CF ) − E (C  R )} , of xN D , xF D and xF U if and only if  > gRFρg BR +1
ρ(ρgRF −1)
1 (1−α)ρgBR gRF
2 log 1 + αρgBR gRF +gBR +(1+)g RF +1/ρ
− 12 log 1 and  < gBR (αρggBR −1)−1/ρ
. Thus, E (CI ) is a strictly in-
RF
creasing function of  ∈ [max (0, 1 ) , min (1, 2 )], where
 
+ αρg(1−α)ρg 1 (1−α)ρgBR


+ρg
BR
+1 = 2 log 1 + αρg +f () − gBR (αρgBR −1)−1/ρ
BR RF
(1−α)ρgBR
 BR
gBR
1
1 = gRFρg BR +1
ρ(ρgRF −1) and 2 = gRF .
1
2 log 1 + αρgBR +f2 () , where f1 () = gRF + 1 + ^
 + 1/gRF ρ and f2 () = ρgRF + 1. Since we Consequently, C lower ≈ E (C ) + E (C ) has at most one
ESSR D I

consider the condition where a secrecy performance maximal critical point of ,  ∈ [max (0, 1 ) , min (1, 2 )]
+
mode is achieved, i.e., when {A} , A, the term and the second part of the proof is completed.
xF D xF D
{E (CF ) − E (CR )} is a monotonically increasing
function of  when f1 () increases slower than f2 (). REFERENCES
Otherwise, the term {E (CFxF D ) − E (CR xF D
)} , 0, e.g., [1] L. Dai, B. Wang, Y. Yuan, S. Han, I. Chih-Lin, and Z. Wang, "Non-
orthogonal multiple access for 5G: solutions, challenges, opportunities,
no secrecy performance for xF D can be achieved. In and future research trends," IEEE Communications Magazine, vol. 53, no.
other words, the condition f1 () − f2 () = ggBR RF
+ 9, pp. 74-81, 2015.
(1 − ρgRF )  + gRF 1
< 0 must be hold to guarantee [2] S. R. Islam, N. Avazov, O. A. Dobre, and K.-S. Kwak, "Power-domain
ρ non-orthogonal multiple access (NOMA) in 5G systems: Potentials and
that a secrecy performance for xF D can be achieved. challenges," IEEE Communications Surveys & Tutorials, vol. 19, no. 2,
Furthermore, the condition (1 − ρgRF ) < 0, i.e., or pp. 721-742, 2016.
equivalently gRF > 1/ρ, can guarantee that the term [3] Z. Ding et al., "Application of non-orthogonal multiple access in LTE and
5G networks," IEEE Communications Magazine, vol. 55, no. 2, pp. 185-
{E (CFxF D ) − E (CR xF D
)} is a monotonically increasing 191, 2017.
function of . [4] Z. Zhang, Z. Ma, M. Xiao, G. Liu, and P. Fan, "Modeling and analysis of
non-orthogonal MBMS transmission in heterogeneous networks," IEEE
Consequently, the term {E (CFxF D ) − E (CR xF D
)} is a Journal on Selected Areas in Communications, vol. 35, no. 10, pp. 2221-
monotonically increasing function of  with positive secrecy 2237, 2017.
performance when both gRF > 1/ρ and  > gRFρg BR +1
ρ(ρgRF −1)
[5] X. Yue, Y. Liu, S. Kang, A. Nallanathan, and Z. Ding, "Exploiting
full/half-duplex user relaying in NOMA systems," IEEE Transactions on
are satisfied. Communications, vol. 66, no. 2, pp. 560-575, 2017.
Next, we discuss the monotonicity of the term [6] L. Lv, J. Chen, Q. Ni, and Z. Ding, "Design of cooperative non-orthogonal
xF U xF U multicast cognitive multiple access for 5G systems: User scheduling and
{E (CB ) − E (CR )}. It is evident from (5) and (12) that
xF U xF U performance analysis," IEEE Transactions on Communications, vol. 65,
both E (CR ) and E (CB ) are monotonically increasing no. 6, pp. 2641-2656, 2017.
xF U xF U
 of . Thus, the term
functions  {E (CB ) − E (CR )} , [7] Q. Yang, H.-M. Wang, D. W. K. Ng, and M. H. Lee, "NOMA in downlink
1 ρgBR gRF 1 ρgRF SDMA with limited feedback: Performance analysis and optimization,"
2 log 1 + (2gBR +gRF +1/ρ) − 2 log 1 + αρgBR +1 can IEEE Journal on Selected Areas in Communications, vol. 35, no. 10, pp.
be verified as a monotonically increasing function of  if 2281-2294, 2017.
xF U [8] L. Lv, F. Zhou, J. Chen, and N. Al-Dhahir, "Secure cooperative communi-
and only if CB increases in a faster rate with  than
xF U gBR (αρgBR −1)−1/ρ cations with an untrusted relay: A NOMA-inspired jamming and relaying
CR , i.e.,  < gRF , otherwise, the term approach," IEEE Transactions on Information Forensics and Security, vol.
xF U xF U 14, no. 12, pp. 3191-3205, 2019.
{E (CB ) − E (CR )} , 0, e.g., no secrecy performance
[9] S. Timotheou and I. Krikidis, "Fairness for non-orthogonal multiple access
for xF U can be achieved. in 5G systems," IEEE Signal Processing Letters, vol. 22, no. 10, pp. 1647-
xN U
 it is evident from (11) that the term E (CB ) ,
Finally, 1651, 2015.
1 (1−)ρgBN (gBR +gRF +1/ρ) [10] P. Xu and K. Cumanan, "Optimal Power Allocation Scheme for Non-
2 log 1 + ρgBR gRF +2gBR +gRF +1/ρ is a monotonically Orthogonal Multiple Access With α-Fairness," IEEE Journal on Selected
decreasing function of . Combining the above discussion Areas in Communications, vol. 35, no. 10, pp. 2357-2369, 2017.

14 VOLUME 4, 2016

This work is licensed under a Creative Commons Attribution 4.0 License. For more information, see https://creativecommons.org/licenses/by/4.0/
 This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOI
10.1109/ACCESS.2020.3040951, IEEE Access
Mona et al.: Preparation of Papers for IEEE TRANSACTIONS and JOURNALS
[11] Y. Liu, M. Elkashlan, Z. Ding, and G. K. Karagiannidis, "Fairness of
user clustering in MIMO non-orthogonal multiple access systems," IEEE
Communications Letters, vol. 20, no. 7, pp. 1465-1468, 2016.
[12] Z. Ding, M. Peng, and H. V. Poor, "Cooperative non-orthogonal multiple
access in 5G systems," IEEE Communications Letters, vol. 19, no. 8, pp.
1462-1465, 2015.
[13] T. N. Do, D. B. da Costa, T. Q. Duong, and B. An, "Improving the
performance of cell-edge users in NOMA systems using cooperative
relaying," IEEE Transactions on Communications, vol. 66, no. 5, pp. 1883-
1901, 2018.
[14] Y. Zhou, V. W. S. Wong, and R. Schober, "Stable Throughput Regions of
Opportunistic NOMA and Cooperative NOMA With Full-Duplex Relay-
ing," Trans. Wireless. Comm., vol. 17, no. 8, pp. 5059–5075, 2018, doi:
10.1109/twc.2018.2837014.
[15] Y. Liu, Z. Ding, M. Elkashlan, and H. Poor, "Cooperative Non-orthogonal
Multiple Access With Simultaneous Wireless Information and Power
Transfer," IEEE Journal on Selected Areas in Communications, vol. 34,
pp. 938-953, 2016.
[16] Y. Liu, H. Ding, J. Shen, R. Xiao, and H. Yang, "Outage Performance
Analysis for SWIPT-Based Cooperative Non-Orthogonal Multiple Access
Systems," IEEE Communications Letters, vol. 23, pp. 1501-1505, 2019.
[17] J.-B. Kim and I.-H. Lee, "Non-orthogonal multiple access in coordinated
direct and relay transmission," IEEE Communications Letters, vol. 19, no.
11, pp. 2037-2040, 2015.
[18] M. F. Kader and S. Y. Shin, "Coordinated Direct and Relay Transmission
Using Uplink NOMA," IEEE Wireless Communications Letters, vol. 7,
pp. 400-403, 2018.
[19] X.-m. Chen, R. Jia, and D. W. K. Ng, "The Application of Relay to Massive
Non-Orthogonal Multiple Access," IEEE Transactions on Communica-
tions, vol. 66, pp. 5168-5180, 2018.
[20] X. Yue, Y. Liu, S. Kang, A. Nallanathan, and Y. Chen, "Modeling and
analysis of two-way relay non-orthogonal multiple access systems," IEEE
Transactions on Communications, vol. 66, no. 9, pp. 3784-3796, 2018.
[21] X. Wang, M. Jia, I. W.-H. Ho, Q. Guo, and F. C. Lau, "Exploiting full-
duplex two-way relay cooperative non-orthogonal multiple access," IEEE
Transactions on Communications, vol. 67, no. 4, pp. 2716-2729, 2018.
[22] B. Zheng, X. Wang, M. Wen, and F. Chen, "NOMA-based multi-pair two-
way relay networks with rate splitting and group decoding," IEEE Journal
on Selected Areas in Communications, vol. 35, no. 10, pp. 2328-2341,
2017.
[23] L. Lv, Q. Ye, Z. Ding, Z. Li, N. Al-Dhahir, and J. Chen, "Multi-Antenna
Two-Way Relay Based Cooperative NOMA," IEEE Transactions on Wire-
less Communications, 2020.
[24] Y. Zhang, H.-M. Wang, Q. Yang, and Z. Ding, "Secrecy Sum Rate Max-
imization in Non-orthogonal Multiple Access," IEEE Communications
Letters, vol. 20, pp. 930-933, 2016.
[25] Liu, "Enhancing the Physical Layer Security of Non-orthogonal Multiple
Access in Large-Scale Networks," 2018.
[26] Z. Xiang, W. Yang, G. Pan, Y. Cai, and Y. Song, "Physical Layer Security
in Cognitive Radio Inspired NOMA Network," IEEE Journal of Selected
Topics in Signal Processing, vol. 13, pp. 700-714, 2019.
[27] Y. Feng, S. Yan, and Z. Yang, "Secure Transmission to the Strong User
with Optimal Power Allocation in NOMA," ArXiv, vol. abs/1807.00935,
2018.
[28] B. He, A. Liu, N. Yang, and V. Lau, "On the Design of Secure Non-
Orthogonal Multiple Access Systems," IEEE Journal on Selected Areas
in Communications, vol. 35, pp. 2196-2206, 2017.
[29] L. Lv, Z. Ding, Q. Ni, and J. J. Chen, "Secure MISO-NOMA Transmission
With Artificial Noise," IEEE Transactions on Vehicular Technology, vol.
67, pp. 6700-6705, 2018.
[30] Y. Li, M. Jiang, Q. Zhang, Q. Li, and J. Qin, "Secure Beamforming in
Downlink MISO Nonorthogonal Multiple Access Systems," IEEE Trans-
actions on Vehicular Technology, vol. 66, pp. 7563-7567, 2017.
[31] Y. Feng, S. Yan, Z. Yang, N. Yang, and J. Yuan, "Beamforming Design
and Power Allocation for Secure Transmission With NOMA," IEEE
Transactions on Wireless Communications, vol. 18, pp. 2639-2651, 2019.
[32] F. Zhou, Z. Chu, H. Sun, R. Q. Hu, and L. H. Hanzo, "Artificial Noise
Aided Secure Cognitive Beamforming for Cooperative MISO-NOMA
Using SWIPT," IEEE Journal on Selected Areas in Communications, vol.
36, pp. 918-931, 2018.
[33] Z. Ding, Z. Zhao, M. Peng, and H. Poor, "On the Spectral Efficiency and
Security Enhancements of NOMA Assisted Multicast-Unicast Streaming,"
IEEE Transactions on Communications, vol. 65, pp. 3151-3163, 2017.
VOLUME 4, 2016
This work is licensed under a Creative Commons Attribution 4.0 License. For more information, see https://creativecommons.org/licenses/by/4.0/
[34] M. Tian, Q. Zhang, S. Zhao, Q. Li, and J. Qin, "Secrecy Sum Rate Opti-
mization for Downlink MIMO Nonorthogonal Multiple Access Systems,"
IEEE Signal Processing Letters, vol. 24, pp. 1113-1117, 2017.
[35] H. Lei et al., "Secrecy Outage of Ma~ Min TAS Scheme in MIMO-NOMA
Systems," IEEE Transactions on Vehicular Technology, vol. 67, pp. 6981-
6990, 2018.
[36] A. Arafa, W. Shin, M. Vaezi, and H. Poor, "Securing Downlink Non-
Orthogonal Multiple Access Systems by Trusted Relays," 2018 IEEE
Global Communications Conference (GLOBECOM), pp. 1-6, 2018.
[37] H. Lei et al., "Secrecy Outage Analysis for Cooperative NOMA Systems
With Relay Selection Schemes," IEEE Transactions on Communications,
vol. 67, pp. 6282-6298, 2019.
[38] Y. Feng, S. Yan, C. Liu, Z. Yang, and N. Yang, "Two-Stage Relay Selec-
tion for Enhancing Physical Layer Security in Non-Orthogonal Multiple
Access," IEEE Transactions on Information Forensics and Security, vol.
14, pp. 1670-1683, 2019.
[39] Y. Cao et al., "Secrecy Analysis for Cooperative NOMA Networks With
Multi-Antenna Full-Duplex Relay," IEEE Transactions on Communica-
tions, vol. 67, pp. 5574-5587, 2019.
[40] Y. Sun, D. W. K. Ng, J. Zhu, and R. Schober, "Robust and Secure Resource
Allocation for Full-Duplex MISO Multicarrier NOMA Systems," IEEE
Transactions on Communications, vol. 66, pp. 4119-4137, 2018.
[41] H. Zhang, N. Yang, K. Long, M. Pan, G. Karagiannidis, and V. C. M. Le-
ung, "Secure Communications in NOMA System: Subcarrier Assignment
and Power Allocation," IEEE Journal on Selected Areas in Communica-
tions, vol. 36, pp. 1441-1452, 2018.
[42] B. Zheng et al., "Secure NOMA Based Two-Way Relay Networks Using
Artificial Noise and Full Duplex," IEEE Journal on Selected Areas in
Communications, vol. 36, pp. 1426-1440, 2018.
[43] B. M. ElHalawany and K. Wu, "Physical-layer security of NOMA systems
under untrusted users," in 2018 IEEE Global Communications Conference
(GLOBECOM), 2018: IEEE, pp. 1-6.
[44] K. Cao, B. Wang, H. Ding, T. Li, and F. Gong, "Optimal relay selection
for secure NOMA systems under untrusted users," IEEE Transactions on
Vehicular Technology, vol. 69, no. 2, pp. 1942-1955, 2019.
[45] K. Cao, B. Wang, H. Ding, T. Li, J. Tian, and F. Gong, "Secure Transmis-
sion Designs for NOMA Systems Against Internal and External Eaves-
dropping," IEEE Transactions on Information Forensics and Security, vol.
15, pp. 2930-2943, 2020.
[46] A. Arafa, W. Shin, M. Vaezi, and H. V. Poor, "Secure relaying in non-
orthogonal multiple access: Trusted and untrusted scenarios," IEEE Trans-
actions on Information Forensics and Security, vol. 15, no. 1, pp. 210-222,
2019.
[47] Z. Xiang, W. Yang, G. Pan, Y. Cai, and X. Sun, "Secure Transmission
in Non-Orthogonal Multiple Access Networks With an Untrusted Relay,"
IEEE Wireless Communications Letters, vol. 8, pp. 905-908, 2019.
[48] L. Lv, H. Jiang, Z. Ding, L. Yang, and J. Chen, "Secrecy-Enhancing Design
for Cooperative Downlink and Uplink NOMA With an Untrusted Relay,"
IEEE Transactions on Communications, 2019.
[49] L. Lv, H. Jiang, Z. Ding, Q. Ye, N. Al-Dhahir, and J. Chen, "Intelligent
Interference Engineering for Secure Non-Orthogonal Multiple Access,"
arXiv preprint arXiv:2003.13488, 2020.
[50] Y. Li, H. Long, M. Peng, and W. Wang, "Spectrum sharing with analog
network coding," IEEE transactions on vehicular technology, vol. 63, no.
4, pp. 1703-1716, 2013.
[51] J. Kiefer, "Sequential minimax search for a maximum," Proceedings of the
American mathematical society, vol. 4, no. 3, pp. 502-506, 1953.
[52] P. K. Gopala, L. Lai, and H. El Gamal, "On the secrecy capacity of fading
channels," IEEE Transactions on Information Theory, vol. 54, no. 10, pp.
4687-4698, 2008.
[53] L. Wang, M. Elkashlan, J. Huang, N. H. Tran, and T. Q. Duong, "Secure
transmission with optimal power allocation in untrusted relay networks,"
IEEE wireless communications Letters, vol. 3, no. 3, pp. 289-292, 2014.
[54] A. Jeffrey and D. Zwillinger, Table of integrals, series, and products.
Elsevier, 2007.
[55] B. He, L. Lv, L. Lv, L. Yang and J. Chen, "Enhancing Secrecy for NOMA
Untrusted Relay Networks With User Scheduling and Jamming," in IEEE
Communications Letters, doi: 10.1109/LCOMM.2020.3019960.
[56] D. Do, T. Nguyen, K. M. Rabie, X. Li and B. M. Lee, "Throughput
Analysis of Multipair Two-Way Replaying Networks With NOMA and
Imperfect CSI," in IEEE Access, vol. 8, pp. 128942-128953, 2020, doi:
10.1109/ACCESS.2020.3008674.
15
 This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOI
10.1109/ACCESS.2020.3040951, IEEE Access

Mona et al.: Preparation of Papers for IEEE TRANSACTIONS and JOURNALS

[57] M. Shokair, W. Saad, and S. M. Ibraheem, "On the performance of MONA SHOKAIR received the B.E. and M.E. de-
downlink multiuser cognitive radio inspired cooperative noma," Wireless grees in electronics engineering from El-Menoufia
Personal Communications, vol. 101, no. 2, pp. 875-895, 2018. University, El-Menoufia, Egypt, in 1993 and 1997,
[58] Shady M. Ibraheem, Walid Bedawy, Waleed Saad, Mona Shokair. "Out- respectively. She received Ph.D. from Kyushu
age Performance of NOMA-based DF Relay Sharing Networks over University, Japan, 2005. From 2005 till 2010,
Nakagami-m Fading Channels", 2018 13th International Conference on she was lecturer in El-Menoufia University. From
Computer Engineering and Systems (ICCES), 2018. 2011 till 2015, she was Associated Prof. in El-
[59] W. Saad, M. Shokair, and S. M. Ibraheem, “On the security of relay as-
Menoufia University. Now she is Prof. in El-
sisted cognitive radio networks in the presence of primary transceiver net-
Menoufia University. She received VTS chapter
work,” Wireless Personal Communications, vol. 104, no. 3, pp. 949–977,
2019. IEEE award from Japan in 2003. She received best
paper from NRSC 2016. Now, she is working in OFDM system, WIMAX
system, cognitive radios and D2D system. She published over 180 papers.

MONA AWAD received the B.S. degree in elec-

tronics and communications engineering from
Tanta University, Egypt, 2000. Since then she
worked as a maintenance engineer in Telecom
Egypt for 18 years. Currently, she is looking for-
ward to the M.S. degree at Tanta University. Her
main research interests include massive MIMO
technologies and cognitive radio networks.

SHADY M. IBRAHEEM received the B.S. degree

in electronics and communications engineering
from Tanta University, Egypt, 2003. Since then
he worked as a maintenance engineer in Telecom
Egypt for 16 years. Currently, he is looking for-
ward to the M.S. degree at Menoufia University.
His main research interests include channel coding
and cognitive radio networks.
SAMEH A. NAPOLEON received his B.Sc. in
Electronics and Electrical Communication Engi-
neering from the Faculty of Engineering, Tanta
University, Egypt in 1999. He received the M.Sc.
and the Ph.D. from Tanta University in 2006 and
2012, respectively. He currently works as a lec-
turer at the department of electronics and commu-
nication engineering, Tanta University. His current
research interests are indoor localization, signal,
and image processing.
MOHAMED E. NASR (LSM’20) received the
B.Sc. degree (Hons.) in electronics, in 1975, the
M.Sc. degree in electronics and communication,
in 1979, and the Ph.D. degree in digital com-
munication systems, in 1985. He is currently a
Professor of digital communications and computer
networks with the Department of Electronics and
Communications, Faculty of Engineering, Tanta
University, Egypt. From 2001 to 2007, he served
as the Head of Department. He has published more
than a 140 journal and conference scientific papers. His current research
interests include speech and audio coding, packet voice transmission over
data networks, wireless communication systems, and networking security.
He was the Vice Chairman of the Twenty Fifth National Radio Science
Conference (NRSC, 2008), Tanta, Egypt. From 2006 to 2009, he was the
President of Administration Board for Information and Communication
Technology Project (ICTP) at Tanta University, and leading the technical
team to manage and modify Tanta University network. Since September
2009, he has been a Chief Information Officer (CIO) and a Coordinator
at Tanta University, until January 2010. From February 2010 to August
2014, he was the Dean of the Ras EL-Bar Higher Institute for Computers,
Damietta, and from September 2014 to August 2016, he has been the Dean of
the Alexandria Higher Institute of Engineering and Technology, Alexandria,
Egypt.

WALEED SAAD has received his BSc (Hons),

M.Sc. and Ph.D. degrees from the Faculty of Elec-
tronic Engineering Menoufia University, Menouf,
Egypt, in 2004, 2008 and 2013, respectively. He
joined the teaching staff of the Department of
Electronics and Electrical Communications of the
same faculty since 2014. He is a co-author of many
papers in national and international conference
proceedings and journals. His research areas of
interest include mobile communication systems,
computer networks, cognitive radio networks, D2D communication, OFDM
systems, interference cancellation, resource allocations, PAPR reduction,
physical and MAC layers design, and implementation of digital communi-
cation systems using FPGA.

16 VOLUME 4, 2016

This work is licensed under a Creative Commons Attribution 4.0 License. For more information, see https://creativecommons.org/licenses/by/4.0/
View publication stats