Next Article in Journal
Assessing Service Quality and Customer Satisfaction of Electric Utility Provider’s Online Payment System during the COVID-19 Pandemic: A Structural Modeling Approach
Next Article in Special Issue
Modelling of ML-Enablers in 5G Radio Access Network-Conceptual Proposal of Computational Framework
Previous Article in Journal
Optimal Solution for Frequency and Voltage Control of an Islanded Microgrid Using Square Root Gray Wolf Optimization
Previous Article in Special Issue
Interference Challenges and Management in B5G Network Design: A Comprehensive Review
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Outage Performance of Interference Cancellation-Aided Two-Way Relaying Cognitive Network with Primary TAS/SC Communication and Secondary Partial Relay Selection

1
Faculty of Electronics Technology, Industrial University of Ho Chi Minh City, Ho Chi Minh City 700000, Vietnam
2
Wireless Communications Research Group, Faculty of Electrical and Electronics Engineering, Ton Duc Thang University, Ho Chi Minh City 700000, Vietnam
3
Communication and Signal Processing Research Group, Faculty of Electrical and Electronics Engineering, Ton Duc Thang University, Ho Chi Minh City 700000, Vietnam
4
Faculty of Physics, Universityof Education, Hue University, Thua Thien Hue 530000, Vietnam
5
Posts and Telecommunications Institute of Technology, Ho Chi Minh City 700000, Vietnam
*
Author to whom correspondence should be addressed.
Electronics 2022, 11(22), 3645; https://doi.org/10.3390/electronics11223645
Submission received: 20 September 2022 / Revised: 16 October 2022 / Accepted: 4 November 2022 / Published: 8 November 2022
(This article belongs to the Special Issue New Challenges in 5G Networks Design)

Abstract

:
In this paper, we propose a two-way relaying scheme using digital network coding in an underlay cognitive radio network. In the proposed scheme, the transmit antenna selection and selection techniques are combined using a primary transmitter and a primary receiver, respectively. In the secondary network, two source nodes that cannot directly communicate attempt to exchange their data with each other. As a result, the relaying technique using partial relay selection is applied to assist the data exchange. Particularly, at the first time slot, the selected secondary relay applies an interference cancellation technique to decode the data received from the secondary sources. Then, the selected relay uses digital network coding to send XOR-ed data to the sources at the second time slot. We first derive the outage probability of the primary network over block the Rayleigh fading channel. Then, the transmit power of the secondary transmitters including the source and relay nodes are calculated to guarantee the quality of service of the primary network. Finally, the exact closed-form formulas of the outage probability of the secondary sources over the block Rayleigh fading channel are derived, and then verified by computer simulations using the Monte Carlo method.

1. Introduction

In recent years, cognitive radio networks (CRNs) [1] have become an attractive topic that has gained significant attention among researchers. Underlay spectrum sharing (or underlay CRN) is one efficient technique that allows secondary users (SUs) to access bands licensed to primary users (PUs). To satisfy a pre-determined interference constraint, SUs must adjust the transmit power, using the instantaneous channel state information (CSI) of the interference links from SUs to PUs [2,3,4,5,6]. However, it is difficult to implement spectrum-sharing methods in [2,3,4,5,6] due to the requirement of high synchronization between PUs and SUs. In [7,8,9], the transmit power of the secondary transmitters is calculated using the expected values of CSI under the constraint of a target outage probability (OP) of the primary network. Due to the limited transmit power and co-channel interference from the primary operation, the performance of the secondary network is severely degraded [9]. To improve the secondary performance, relaying schemes using intermediate relays (see [10,11,12,13,14,15]) are commonly employed. Particularly, whilst some published works [6,7,10] studied dual-hop relaying underlay CNRs, others [2,8] considered multi-hop relaying ones. To further enhance the performance of the secondary network in dual-hop relaying models, relay selection methods were investigated in [3,16,17,18]. The authors in [16,17] proposed partial relay selection (PRS) methods, where the best relay was selected using the CSI of the source–relay links. In contrast to PRS, the full-relay selection (FRS) method in [18] used the CSI of the source–relay and relay–destination links to find the best relay. Therefore, the implementation of PRS is much simpler than that of FRS, and hence, in this paper, the PRS is employed to enhance the OP performance for the secondary network. However, published works [2,3,6,7,8,9,10,16,17,18] have not studied the non-orthogonal multiple access (NOMA) technique which can significantly increase the data rate for the secondary network.
In [4,5,19,20,21,22,23,24,25], the underlay CRNs using NOMA were reported. Applying NOMA, a secondary source can communicate with different secondary destinations at the same time and the same frequency, and the secondary destinations have to perform the interference cancellation technique (ICT) to extract their desired signals. As a result, NOMA provides a much higher data rate and multiplexing gain for the underlay CRNs, as compared with conventional orthogonal multiple access (OMA). In [19], a dual-hop underlay CRN using NOMA was introduced, where a secondary source could send its data to two secondary destinations thanks to an amplify-and-forward (AF) secondary relay. Compared to the corresponding OMA scheme, the scheme proposed in [19] obtained better performance, in terms of OP and throughput. The published works [4,5] proposed that dual-hop cooperative decode-and-forward (DF) underlay CRNs adopted NOMA. The authors in [20] evaluated the throughput of a multi-user underlay CRN using the user selection method. In addition, the published work [20] proposed an intelligent switching strategy between NOMA and OMA. In [21], the authors proposed a CSI-based power control for an adaptive NOMA/OMA switching scheme in the uplink underlay CRNs. In [22], PRS was applied for the NOMA-assisted underlay CRNs to increase the reliability of data transmission between a secondary base station and multiple secondary users. In addition, the authors in [22] also studied the impact of the imperfect SIC on pairwise error probability (PEP). In [23], the OP of a cooperative NOMA scheme with the imperfect SIC in the underlay CRNs was evaluated. Th published work [24] proposed the cognitive NOMA scenario for Internet of Things (IoTs) networks using short-packet communications under joint impact of imperfect CSI and SIC problems. The authors in [25] considered a reconfigurable intelligent surface (RIS)-aided cognitive NOMA model, where RIS (instead of the secondary relays) was deployed to serve two secondary destinations. However, the published works [4,5,19,20,21,22,23,24,25] were only concerned with one-way relaying underlay CRNs.
Two-way relaying (TWR) [26] is an efficient method that provides higher throughput for bidirectional communication networks. In TWR, two sources attempt to exchange their data via the assistance of one or many common relays. In conventional dual-hop TWR networks [27], the data exchange is performed via 04 orthogonal time slots, and hence the obtained data rate is 02/04 (02 data/04 time slots). In digital network coding (DNC) TWR or three-phase TWR [27,28,29,30,31], the sources use the first two time slots to send their data to the common relay. Then, this relay attempts to decode the received data, performs the XOR operation, and finally transmits the XOR-ed data to the sources at the third time slot. The DNC TWR approach can reduce one transmission time slot, and hence the obtained data rate is 02/03 (02 data/03 time slots). The authors in [27,28] proposed max–min relay selection approaches to reduce the bit error rate (BER) for the DNC TWR networks. In [29], the three-phase TWR model using FRS, with the presence of untrusted relays, was reported. The published works [30,31] studied the OP performance of the DNC TWR networks operating in the radio-frequency energy harvesting (RF-EH) environment. Moreover, both PRS and FRS were considered and evaluated in [31]. Analog network coding (ANC) TWR or two-phase TWR was introduced in [32], where two source nodes used the first time slot to transmit their data to the common relay. At the second time slot, the relay amplified the received signals, and then sent the amplified signal to both sources. Therefore, the ANC TWR scheme obtained the data rate of 02/02 (02 data/02 time slots). However, in the two-phase TWR, when amplifying the received signals, noises are also amplified and accumulated at the sources. Unlike ANC TWR, the relay in DNC TWR can perfectly remove noises due to the decoding operation. However, the disadvantage of DNC TWR is that this technique must use three time slots for each data exchange. To enhance the data rate for DNC TWR, the published works [33,34,35] applied the interference cancellation technique (ICT) at the common relay, and hence the schemes proposed in [33,34,35] also obtained the data rate of 02/02.
This paper proposes the DNC TWR scheme operating in the underlay spectrum sharing mode. In the primary network, the transmit antenna selection (TAS) and selection combining (SC) techniques are used at the transmitter and receiver nodes, respectively. In the secondary network, the DNC TWR approach with PRS and ICT is used to enhance the OP performance.

1.1. Related Works

In contrast to [27,28,29,30,31], in this paper, ICT is used to reduce one transmission time slot for the DNC TWR networks. Unlike [33,34,35], our proposed scheme applies PRS to the secondary network. Moreover, this paper considers block fading channels, in which channel coefficients do not change during one data transmission cycle, but independently change after each cycle. Although the published works [27,36,37] were concerned with TWR in the underlay CRNs, these references did not study ICT. Moreover, Ref. [36] studied the two-phase TWR model exploiting a direct link between the sources, while Ref. [37] considered a single-relay model operating on the RF-EH environment. The authors in [38] proposed the underlay TWR scheme using RIS and full-duplex transmission. However, Ref. [38] did not study relay selection as well as ICT.
To the best of our knowledge, the published works [39,40] are the most relevant to the topic of this paper. Indeed, [39,40] both considered the DNC TWR underlay CRNs using ICT. In [39], the secondary relay node was selected to maximize the channel capacity at both sources as well as to minimize the collection time of CSI. However, the main differences between this paper and Ref. [39] are given as follows: (i) different relay selection methods were proposed in this paper and [39]; (ii) in [39], block fading channel was not considered; (iii) the secondary transmitters in [39] used the instantaneous CSI of the cross-interference links to adjust their transmission power. Then, it is worth noting that this paper was developed from our previous work [40], and the main difference between this paper and [40] can be listed as follows: (i) this paper applies PRS for the secondary network; (ii) the block fading channel was not considered in [40]; (iii) the transmit power adjustment method for the secondary transmitters in this paper is different to that in [40]; and (iv) the mathematical derivations in this paper are more challenging because we study the PRS and block fading channel.

1.2. Motivation and Main Contribution

The motivation and main contribution of this paper can be summarized as follows:
  • We propose the TAS/SC technique for the primary network to enhance the OP performance for the primary network as well as to increase the spectrum access possibility of the secondary network.
  • Based on the exact closed-form expression of the OP of the primary network, we derived the closed-form expressions of the transmit power for the secondary source and relay nodes under the condition that the minimum QoS of the primary network must be guaranteed.
  • The PRS method is applied to the secondary network to enhance the OP performance at the secondary sources.
  • We derive new exact closed-form formulas of OP at the source nodes over the block Rayleigh fading channel, which are checked and corrected with Monte Carlo simulations.
We organize this paper as follows: the introduction is in Section 1. The proposed system model is illustrated in Section 2. In Section 3, we analyzed the performance of the primary and secondary networks. The results and discussion are given in Section 4. Finally, the conclusions and useful recommendations are provided in Section 5.

2. System Model

In Figure 1, we present the system model of the proposed underlay CRN applying TAS/SC for the primary network, and the DNC TWR and PRS techniques for the secondary network. In the primary network, the N T -antenna primary transmitter (PT) uses TAS to serve the N R -antenna primary receiver PR using SC. In the secondary network, the secondary sources S S 1 and S S 2 exchange their data (denoted by x 1 and x 2 , respectively) with each other thanks to M secondary relays (denoted by S R m , where m = 1 , 2 , , M ). In addition, only one relay (denoted by S R b ) is selected to assist the S S 1 S S 2 data exchange. Assume that S S 1 and S S 2 cannot directly communicate with each other due to the great distance between them, and all secondary nodes only have one antenna. As mentioned earlier, the data exchange is performed via two orthogonal time slots: (i) S S 1 and S S 2 , at the first time slot send its data to S R b which then uses ICT to decode the received data; (ii) if S R b can correctly decode both x 1 and x 2 , it performs the XOR operation, i.e., x = x 1 x 2 , and then sends the XOR-ed data x to S S 1 and S S 2 at the second time slot. If S R b only correctly decodes x 1 (or x 2 ), it will transmit x 1 (or x 2 ) to S S 2 (or S S 1 ) at the second time slot.
The proposed scheme can be applied to wireless sensor networks and wireless ad hoc networks. For example, in wireless sensor networks, the secondary nodes are sensors while the primary nodes are base stations and/or mobile users in cellular mobile networks. Because of the limited size, the sensor nodes are only equipped with one antenna. Moreover, the sensor networks have to operate on the USS mode to be able to access the bands licensed to the primary nodes.
Let h AB denote the channel coefficient of the A B link, where A is a transmitter and B is a receiver, i.e., A SS 1 , SS 2 , SR m , P T u , B SS 1 , SS 2 , SR m , P R v , P T u u = 1 , 2 , , N T denotes the u -th antenna of PT and P R v v = 1 , 2 , , N R denotes the v -th antenna of PR. Then, we denote g AB as the corresponding channel gain: g AB = h AB 2 , and d AB as a link distance between A and B. We can assume that the secondary relays are close to each other, i.e., they are in one cluster. Hence, we can write that d AS R m = Δ d ASR and d S R m B = Δ d SRB , A , B , m . Moreover, we can also assume that the secondary relays are closer to S S 1 than to S S 2 (i.e., d S S 1 SR d S S 2 SR ), and S S 1 is closer to PR than S S 2 (i.e., d S S 1 PR d S S 2 PR ).
Remark 1.
In the case where d S S 1 P R < d S S 2 P R , we simply change the role of S S 1 by that of S S 2 , and vice versa. Then, considering ultra-dense wireless networks [41,42] where there are a lot of nodes that are between the radio range of S S 1 and S S 2 , they can be considered the potential relays. Among these relays, we focused on the M nodes which are nearer to S S 1 than S S 2 .
Because all the A-B channels are Rayleigh fading, the probability density function (PDF) and cumulative distribution function (CDF) of g AB can be written, respectively, as
f g AB x = Ω AB exp Ω AB x , F g AB x = 1 exp Ω AB x ,
where Ω AB = d AB μ and μ 2 μ 8 denotes a path-loss exponential.
For the ease of presentation and analysis, we assume that the random variables (RVs) g P T u B ( g AP R v , g AS R m and g S R m B ) are independent and identical. Therefore, we can use the following notations:
Ω P T u B = Δ Ω PTB , Ω AP R v = Δ Ω APR , Ω AS R m = Δ Ω ASR , Ω S R m B = Δ Ω SRB , u , v , m .
Remark 2.
This paper considers the block Rayleigh fading channel, where g A B remains unchanged during one data exchange cycle, but changes independently after each cycle. As a result, we have g A B g B A for all the A and B nodes.
Since d S S 1 SR d S S 2 SR , we hence apply PRS for the second hop between S S 2 and S R m as (see [31])
S R b : g S S 2 S R b = max m = 1 , 2 , , M g S S 2 S R m .
Because S S 2 and S R m are in radio range of one another, we can assume that the CSI of the S R m S S 2 links are available at S S 2 . Therefore, S S 2 can select the best relay S R m as presented in (3).
From (3), and using CDF in (1), we obtain CDF of g S S 2 S R b as
F g S S 2 S R b x = Pr max m = 1 , 2 , , M g S S 2 S R m < x = F g S S 2 S R m x M = 1 exp Ω g S S 2 SR x M = 1 + p = 1 M 1 p C M p exp p Ω g S S 2 SR x ,
where C M p denotes a binomial coefficient, i.e., C M p = M ! p ! M p ! .
Then, the corresponding PDF of g S S 2 S R b can be expressed as
f g S S 2 S R b x = M Ω g S S 2 SR exp Ω g S S 2 SR x 1 exp Ω g S S 2 SR x M 1 = p = 0 M 1 1 p C M 1 p M Ω g S S 2 SR exp p + 1 Ω g S S 2 SR x .
We now describe the operation principle of the proposed scheme. At the first time slot, S S 1 and S S 2 , respectively, send x 1 and x 2 to S R b , and PT uses the t-th antenna to send its data x P to PR. The received signals at the r-th antenna of PR and at S R b , under the impact of the cross interference, can be given, respectively, as
y P R r = P PT h P T t P R r x P + P S S 1 h S S 1 P R r x 1 + P S S 2 h S S 2 P R r x 2 + n P R r ,
y S R b = P S S 1 h S S 1 S R b x 1 + P S S 2 h S S 2 S R b x 2 + P PT h P T t S R b x P + n S R b .
In (6) and (7), P A is the transmit power of transmitter A, where A PT , S S 1 , S S 2 , n P R r and n S R b denote Gaussian noises at P R r and S R b , respectively. For the ease of presentation and analysis, we can assume that the Gaussian noises at all receivers B have zero mean and unit variance. In addition, we transmit the power P S S 1 and P S S 2 , which will be derived by closed-form expressions in the next section.
From (6), we can formulate the instantaneous signal-to-interference-plus-noise ratio (SINR) obtained at P R r as
ψ P T t , P R r = P PT g P T t P R r P S S 1 g S S 1 P R r + P S S 2 g S S 2 P R r + 1 .
From (8), the TAS/SC algorithm can be written as follows:
t , r : ψ P T t , P R r = max p = 1 , 2 , , N T max q = 1 , 2 , , N R ψ P T p , P R q .
Equation (9) implies that PT and PR cooperate to choose the best transmit and receive antennas to maximize the SINR obtained in this time slot.
For S R b , since d S S 1 SR d S S 2 SR , and hence P S S 1 P S S 2 (see Section 3.2), and S R b has to decode x 1 first. From (7), the SINR obtained for decoding x 1 is calculated as
ψ S R b , x 1 = P S S 1 g S S 1 S R b P S S 2 g S S 2 S R b + P PT g P T t S R b + 1 .
Then, if x 1 can be correctly decoded, S R b can be removed P S S 1 h S S 1 S R b x 1 in y S R b [20,21,22,23,24,25]. Then, the signal used to decode x 2 is given as
y S R b * = P S S 2 h S S 2 S R b x 2 + P PT h P T t S R b x P + n S R b .
From (11), the SINR obtained for decoding x 2 is written as
ψ S R b , x 2 = P S S 2 g S S 2 S R b P PT g P T t S R b + 1 .
Remark 3.
If S R b only correctly decodes x 1 , it will only send x 1 to S S 2 at the second time slot. It is worth noting that if S R b cannot successfully decode x 1 , it cannot perform ICT to remove x 1 , and hence x 2 is also not decoded. Moreover, in the case where S R b cannot correctly obtain x 1 and x 2 , it will do nothing at the second time slot.
Let us consider the secondary time slot, and assume that S R b can access the licensed band to transmit the data x * x * x , x 1 . In this time slot, assume that PT uses the w-th antenna to send the x P to PR. Then, the received signals at the z-th antenna of PR, at S S 1 and at S S 2 can be written, respectively, as
y P R z = P PT h P T w P R z x P + P S R b h S R b P R z x * + n P R z ,
y S S 1 = P S R b h S R b S S 1 x * + P PT h P T w S S 1 x P + n S S 1 ,
y S S 2 = P S R b h S R b S S 2 x * + P PT h P T w S S 2 x P + n S S 2 ,
where P S R b is the transmit power of S R b ( P S R b which will be derived in the next section), and n B denotes the Gaussian noises at the receiver B whose zero mean and unit variance with B P R z , S S 1 , S S 2 .
From (13), the SINR received at P R z is calculated as
φ P T w , P R z = P PT g P T w P R z P S R b g S R b P R z + 1 .
Similarly to (9), the TAS/SC algorithm in the second time slot can be written as
w , z : φ P T w , P R z = max p = 1 , 2 , , N T max q = 1 , 2 , , N R φ P T p , P R q .
Remark 4.
To realize the TAS/SC algorithms in (9) and (17), in the set-up phase, PT, S S 1 , S S 2 , and S R b send pilot signals to PR. Then, PR estimates the channel coefficients h P T p P R q , h S S 1 P R q , h S S 2 P R q , and h S R b P R q to calculate the instantaneous SINRs φ P T p , P R q . Using (9) and (17), PR can determine the best transmitting antennas at PT and its best receiving antennas, in the first and secondary slots. Finally, PR feedbacks the index of these antennas to PT. Here, we also assume that the CSI estimation at PR is perfect.
It is worth noting that various diversity transmitting/receiving techniques such as TAS/maximal ratio combining (MRC), maximal ratio transmission (MRT)/SC, and MRT/MRC can be used to enhance the OP performance for the primary network. However, the MRT and MRC techniques require both the amplitude and phase information of the channel coefficients. As a result, the implementation of the MRT and MRC techniques is more complex than that of TAS and SC. Moreover, as with using the MRT technique, PT has to use all its transmit antennas, which can cause more co-channel interference on the secondary network.
Next, for S S 1 and S S 2 , the SINRs obtained for decoding x * can be formulated, respectively, as
φ S S 1 = P S R b g S R b S S 1 P PT g P T w S S 1 + 1 , φ S S 2 = P S R b g S R b S S 2 P PT g P T w S S 2 + 1 .
We note from (18) that when x * x 1 , this means that S R b only sends x 1 to S S 2 at the second time slot, and hence S S 1 is the outage in this case. When x * x , the secondary source S S i i = 1 , 2 attempts to decode x so that it can obtain the desired data by using the XOR rule, i.e., x i x = x j , where j = 1 , 2 and j i .
This paper evaluates OP for the primary and secondary networks. For the primary network, OP in the first and second time slots can be formulated, respectively, as
O P P 1 = Pr ψ P T t , P R r < θ Pth , O P P 2 = Pr φ P T w , P R z < θ Pth ,
where θ Pth is a pre-determined threshold of the primary network.
For the secondary network, we consider OP at S S 1 and S S 2 . At first, the OP of S S 1 is formulated as
O P S S 1 = 1 Pr ψ S R b , x 1 θ Sth , ψ S R b , x 2 θ Sth , φ S S 1 θ Sth ,
where θ Sth is a pre-determined threshold of the secondary network.
In (20), Pr ψ S R b , x 1 θ Sth , ψ S R b , x 2 θ Sth , φ S S 1 θ Sth is the probability that S S 1 can correctly receive the data x 2 , i.e., x 2 is successfully obtained by S R b at the first time slot ψ S R b , x 1 θ Sth , ψ S R b , x 2 θ Sth , and the transmission from S R b to S S 1 at the second time slot is successful φ S S 1 θ Sth .
Then, the OP of S S 2 can be formulated as
O P S S 2 = 1 Pr ψ S R b , x 1 θ Sth , φ S S 2 θ Sth ,
where Pr ψ S R b , x 1 θ Sth , φ S S 2 θ Sth is the probability that x 1 is successfully decoded by S R b and S S 2 at the first and second time slots, respectively.

3. Performance Analysis

At first, we evaluate the OP of the primary network, and use this result to calculate the transmit power of S S 1 , S S 2 and S R b .

3.1. OP of the Primary Network

Combining (8), (9), and (19), the OP at the first time slot can be formulated as
O P P 1 = Pr max p = 1 , 2 , , N T max q = 1 , 2 , , N R ψ P T p , P R q < θ Pth = Pr ψ P T p , P R q < θ Pth N T N R = Pr g P T p P R q < ρ 1 g S S 1 P R q + ρ 2 g S S 2 P R q + ρ 0 I 1 N T N R ,
where
ρ 0 = θ Pth P PT , ρ 1 = P S S 1 θ Pth P PT , ρ 2 = P S S 2 θ Pth P PT .
As marked in (22), the probability I 1 can be expressed in the following form:
I 1 = 0 + 0 + F g P T p P R q ρ 1 x + ρ 2 y + ρ 0 f g S S 1 P R q x f g S S 2 P R q y d x d y .
Substituting CDF F g P T p P R q ρ 1 x + ρ 2 y + ρ 0 and PDFs f g S S 1 P R q x and f g S S 2 P R q y into (23); after some careful calculation, we obtain an exact closed-form expression of I 1 . Then, substituting this result into (22) yields
O P P 1 = 1 Ω S S 1 PR Ω S S 1 PR + Ω PTPR ρ 1 Ω S S 2 PR Ω S S 2 PR + Ω PTPR ρ 2 exp Ω PTPR ρ 0 N T N R .
Similarly, combining (16), (17), and (19), the OP of the primary network at the second time slot can be exactly computed as
O P P 2 = Pr max p = 1 , 2 , , N T max q = 1 , 2 , , N R φ P T p , P R q < θ Pth = Pr φ P T p , P R q < θ Pth N T N R = Pr g P T p P R q < ρ 3 g S R b P R q + ρ 0 N T N R = 1 Ω SRPR Ω SRPR + Ω PTPR ρ 3 exp Ω PTPR ρ 0 N T N R ,
where
ρ 3 = P S R b θ Pth P PT .
Remark 5.
We now consider a special case where the secondary users are not currently using the licensed band. Because there is no co-channel interference from the secondary network, the TAS/SC algorithms in (9) and (17) can be re-written, under the following form:
k , l : g P T k P R l = max p = 1 , 2 , , N T max q = 1 , 2 , , N R g P T p P R q .
From (26), it is straightforward to calculate the OP of the primary network as
O P P 0 = Pr P PT g P T k P R l < θ Pth = Pr max p = 1 , 2 , , N T max q = 1 , 2 , , N R g P T p P R q < ρ 0 = 1 exp Ω PTPR ρ 0 N T N R .

3.2. Transmit Power of S S 1 , S S 2 and S R b

As proposed in [7,8,9], let ε OP denote the target QoS of the primary network, i.e., O P P 1 ε OP and O P P 2 ε OP . To find the transmit power of S S 1 , S S 2 , and S R b , we have to solve the following equations: O P P 1 = ε OP and O P P 2 = ε OP . Then, using (25) to solve O P P 2 = ε OP , we have
ρ 3 = Δ 1 Ω SRPR Ω PTPR P S R b = Δ 1 θ Pth Ω SRPR Ω PTPR P PT ,
where
Δ = 1 1 ε OP 1 N T N R exp Ω PTPR ρ 0 .
Because P S R b is not negative, Equation (28) is re-written as follows:
P S R b = Δ 1 θ Pth Ω SRPR Ω PTPR P PT + ,
where x + = max 0 , x .
From (27)–(30), it is straightforward that P S R b > 0 if
Δ 1 > 0 1 exp Ω PTPR ρ 0 N T N R < ε OP O P P 0 < ε OP .
Remark 6.
Equation (31) implies that the primary network only shares the licensed band with the secondary network if the OP of the primary network without the interference from the secondary network O P P 0 is less than the required QoS. Otherwise, if O P P 0 ε O P , then S R b is not allowed to access the licensed band, i.e., P S R b = 0 . It is also noted from (30) that the transmit power of the secondary relays is the same.
Then, we consider P S S 1 and P S S 2 . Similarly to the power allocation method proposed in [7,8], we have the following formula:
P S S 1 Ω S S 1 PR = P S S 2 Ω S S 2 PR = δ .
Equation (32) presents that the average interference power at PR (due to the data transmission of S S 1 and S S 2 ) is the same or P S S 1 d S S 1 PR μ = P S S 2 d S S 2 PR μ . Therefore, if d S S 1 PR d S S 2 PR , then P S S 1 P S S 2 and vice versa. Now, combining (24) and (32), we obtain
O P P 1 = 1 P PT P PT + Ω PTPR θ Pth δ 2 exp Ω PTPR ρ 0 N T N R .
Then, solving O P P 1 = ε OP , we can find P S S 1 and P S S 2 , respectively, as
P S S 1 = Δ 1 θ Pth Ω S S 1 PR Ω PTPR P PT + , P S S 2 = Δ 1 θ Pth Ω S S 2 PR Ω PTPR P PT + .
Remark 7.
Similarly, the condition for P S S 1 , P S S 2 > 0 is O P P 0 < ε O P . Moreover, as P P T + , we have exp Ω P T P R ρ 0 1 , and then we can approximate P S R b , P S S 1 , and P S S 2 , respectively, as
P S R b P PT + Δ * 1 θ Pth Ω SRPR Ω PTPR P PT , P S S 1 P PT + Δ * 1 θ Pth Ω S S 1 PR Ω PTPR P PT , P S S 2 P PT + Δ * 1 θ Pth Ω S S 2 PR Ω PTPR P PT .
where Δ * = 1 ε OP 1 N T N R 1 . We can observe from (35) that at high transmit power P PT , the transmit power P S R b , P S S 1 , and P S S 2 linearly increases as P PT increases.

3.3. OP of the Secondary Network

This sub-section calculates O P S S 2 and O P S S 1 as in Propositions 1 and 2 below. At first, plugging (10), (12), and (18)–(21) together, we can rewrite O P S S 2 and O P S S 1 , respectively, as
O P S S 2 = 1 Pr X 1 α 1 X 2 + α 2 U + α 0 , X 2 α 6 V 2 + α 5 I 2 ,
O P S S 1 = 1 Pr X 1 α 1 X 2 + α 2 U + α 0 , X 2 α 4 U + α 3 , X 1 α 6 V 1 + α 5 I 3 ,
where X 1 = g S S 1 S R b = g S R b S S 1 , X 2 = g S S 2 S R b = g S R b S S 2 , U = g P T t S R b , V 1 = g P T w S S 1 , V 2 = g P T w S S 2 , and
α 0 = θ Sth P S S 1 , α 1 = θ Sth P S S 2 P S S 1 , α 2 = θ Sth P PT P S S 1 , α 3 = θ Sth P S S 2 , α 4 = P PT θ Sth P S S 2 , α 5 = θ Sth P S R b , α 6 = P PT θ Sth P S R b .
Proposition 1.
O P S S 2 can be expressed by an exact closed-form expression as
O P S S 2 = 1 Ω PTSR Ω PTSR + Ω S S 1 SR α 2 exp Ω S S 1 SR α 0 × p = 0 M 1 1 p C M 1 p M Ω S S 2 SR p + 1 Ω S S 2 SR + Ω S S 1 SR α 1 Ω PTS S 2 Ω PTS S 2 + p + 1 Ω S S 2 SR + Ω S S 1 SR α 1 α 6 × exp p + 1 Ω S S 2 SR + Ω S S 1 SR α 1 α 5 .
Proof. 
Setting U = u , V 2 = v 2 , we can formulate I 2 in (36), conditioned on U = u , V 2 = v 2 , as
I 2 u , v 2 = α 6 v 2 + α 5 + 1 F X 1 α 1 x 2 + α 2 u + α 0 f X 2 x 2 d x 2 .
Substituting the CDF of X 1 in (1) and PDF of X 2 in (5) into (39), after some calculation, we obtain
I 2 u , v 2 = exp Ω S S 1 SR α 0 exp Ω S S 1 SR α 2 u × p = 0 M 1 1 p C M 1 p M Ω S S 2 SR p + 1 Ω S S 2 SR + Ω S S 1 SR α 1 exp p + 1 Ω S S 2 SR + Ω S S 1 SR α 1 α 5 × exp p + 1 Ω S S 2 SR + Ω S S 1 SR α 1 α 6 v 2 .
Then, from (40), we obtain an exact closed-form expression of I 2 as follows:
I 2 = 0 + 0 + I 2 u , v 2 f U u f V 2 v 2 d u d v = Ω PTSR Ω PTSR + Ω S S 1 SR α 2 exp Ω S S 1 SR α 0 × p = 0 M 1 1 p C M 1 p M Ω S S 2 SR p + 1 Ω S S 2 SR + Ω S S 1 SR α 1 Ω PTS S 2 Ω PTS S 2 + p + 1 Ω S S 2 SR + Ω S S 1 SR α 1 α 6 × exp p + 1 Ω S S 2 SR + Ω S S 1 SR α 1 α 5 .
Substituting (41) into (36), we obtain O P S S 2 , and finish the proof.
Proposition 2.
O P S S 1 can be expressed as follows:
  • Case 1: P S S 1 > 1 + θ Sth P S R b
    O P S S 1 = 1 p = 1 M B 1 Ω PTS S 1 Ω PTS S 1 + β 1 B 2 Ω PTS S 1 Ω PTS S 1 + β 3 B 3 Ω PTS S 1 Ω PTS S 1 + β 2 + B 4 Ω PTS S 1 Ω PTS S 1 + β 4 p = 1 M A 3 Ω PTSR Ω PTSR + χ 3 . Ω PTS S 1 α 8 Ω PTS S 1 α 8 + Ω PTSR + χ 3 α 6 exp Ω PTSR + χ 3 α 5 α 7 α 8 + p = 1 M A 4 Ω PTSR Ω PTSR + χ 4 Ω PTS S 1 α 8 Ω PTS S 1 α 8 + Ω PTSR + χ 4 α 6 exp Ω PTSR + χ 4 α 5 α 7 α 8 ,
  • Case 2: P S S 1 1 + θ Sth P S R b
    O P S S 1 = 1 p = 1 M C 1 Ω PTSR Ω PTSR + β 5 C 2 Ω PTSR Ω PTSR + β 6 p = 1 M A 3 Ω PTSR Ω PTSR + χ 3 p = 1 M A 3 Ω PTSR α 6 Ω PTSR + χ 3 α 6 + Ω PTS S 1 α 8 exp Ω PTS S 1 α 7 α 5 α 6 p = 1 M A 4 Ω PTSR Ω PTSR + χ 4 + p = 1 M A 4 Ω PTSR α 6 Ω PTSR + χ 4 α 6 + Ω PTS S 1 α 8 exp Ω PTS S 1 α 7 α 5 α 6 ,
    where
    A 2 = 1 p + 1 C M p Ω S S 1 SR α 1 Ω S S 1 SR α 1 + p Ω S S 2 SR exp p Ω S S 2 SR α 0 Ω S S 1 SR α 1 + p Ω S S 2 SR α 6 α 1 , β 1 = Ω S S 1 SR α 6 , β 2 = Ω S S 1 SR α 1 + p Ω S S 2 SR α 6 α 1 , χ 1 = p Ω S S 2 SR α 4 , χ 2 = p Ω S S 2 SR α 2 α 1 , A 3 = 1 p + 1 C M p exp Ω S S 1 SR α 7 p Ω S S 2 SR α 3 , A 4 = 1 p + 1 C M p Ω S S 1 SR α 1 Ω S S 1 SR α 1 + p Ω S S 2 SR exp p Ω S S 2 SR α 0 Ω S S 1 SR α 1 + p Ω S S 2 SR α 7 α 1 , χ 3 = Ω S S 1 SR α 8 + p Ω S S 2 SR α 4 , χ 4 = Ω S S 1 SR α 1 + p Ω S S 2 SR α 8 p Ω S S 2 SR α 2 α 1 , B 1 = A 1 Ω PTSR Ω PTSR + χ 1 , B 2 = A 1 Ω PTSR Ω PTSR + χ 1 exp Ω PTSR + χ 1 α 5 α 7 α 8 B 3 = A 2 Ω PTSR Ω PTSR + χ 2 , B 4 = A 2 Ω PTSR Ω PTSR + χ 2 exp Ω PTSR + χ 2 α 5 α 7 α 8 β 3 = Ω PTSR + χ 1 α 6 α 8 , β 4 = Ω PTSR + χ 2 α 6 α 8 , C 1 = A 1 Ω PTS S 1 Ω PTS S 1 + β 1 exp Ω PTS S 1 + β 1 α 7 α 5 α 6 , β 5 = χ 1 α 6 + Ω PTS S 1 + β 1 α 8 α 6 C 2 = A 2 Ω PTS S 1 Ω PTS S 1 + β 2 exp Ω PTS S 1 + β 2 α 7 α 5 α 6 , β 6 = χ 2 α 6 + Ω PTS S 1 + β 2 α 8 α 6 .
Proof. 
At first, by setting U = u , V 1 = v 1 , we can write I 3 in (37), conditioned on U = u , V 2 = v 2 , as
I 3 u , v 1 = Pr X 1 α 1 X 2 + α 2 u + α 0 , X 2 α 4 u + α 3 , X 1 α 6 v 1 + α 5 .
Then, I 3 u , v 1 can be formulated in two conditions: (C1) α 8 u + α 7 < α 6 v 1 + α 5 ; and (C2) α 8 u + α 7 α 6 v 1 + α 5 , respectively, as
I 3 u , v 1 | C 1 = α 6 v 1 + α 5 + f X 1 x 1 α 4 u + α 3 x 1 α 2 u α 0 α 1 f X 2 x 2 d x 2 d x 1 = α 6 v 1 + α 5 + f X 1 x 1 F X 2 x 1 α 2 u α 0 α 1 F X 2 α 4 u + α 3 d x 1 ,
I 3 u , v 1 | C 2 = α 8 u + α 7 + f X 1 x 1 α 4 u + α 3 x 1 α 2 u α 0 α 1 f X 2 x 2 d x 2 d x 1 = α 8 u + α 7 + f X 1 x 1 F X 2 x 1 α 2 u α 0 α 1 F X 2 α 4 u + α 3 d x 1 .
Substituting the PDF of X 1 given in (1), and CDF of X 2 given in (4) into (45), after some calculation, we obtain a closed-form expression of I 3 u , v 1 | C 1 as follows:
I 3 u , v 1 | C 1 = p = 1 M A 1 exp β 1 v 1 exp χ 1 u p = 1 M A 2 exp β 2 v 1 exp χ 2 u .
For I 3 u , v 1 | C 2 in (46), similarly, we have
I 3 u , v 1 | C 2 = p = 1 M A 3 exp χ 3 u p = 1 M A 4 exp χ 4 u .
Then, by averaging I 3 u , v 1 , with respect to U and V 1 , we can obtain I 3 in Case 1 and Case 2 as
  • Case 1: P S S 1 > 1 + θ Sth P S R b or α 5 > α 7
In this case, we have
I 3 = 0 + f V 1 v 1 0 α 6 v 1 + α 5 α 7 α 8 f U u I 3 u , v 1 | C 1 d u d v 1 J 1 + 0 + f V 1 v 1 α 6 v 1 + α 5 α 7 α 8 + f U u I 3 u , v 1 | C 2 d u d v 1 J 2 .
Considering J 1 as marked in (49); combining (1) and (45), we can write
J 1 = 0 + f V 1 v 1 p = 1 M B 1 exp β 1 v 1 p = 1 M B 2 exp β 3 v 1 p = 1 M B 3 exp β 2 v 1 + p = 1 M B 4 exp β 4 v 1 d v 1 .
Next, substituting the PDF of V 1 given in (1) into (50), we obtain J 1 as
J 1 = p = 1 M B 1 Ω PTS S 1 Ω PTS S 1 + β 1 B 2 Ω PTS S 1 Ω PTS S 1 + β 3 B 3 Ω PTS S 1 Ω PTS S 1 + β 2 + B 4 Ω PTS S 1 Ω PTS S 1 + β 4 .
Similarly, we can exactly calculate J 2 in (49) as
J 2 = p = 1 M A 3 Ω PTSR Ω PTSR + χ 3 . Ω PTS S 1 α 8 Ω PTS S 1 α 8 + Ω PTSR + χ 3 α 6 exp Ω PTSR + χ 3 α 5 α 7 α 8 p = 1 M A 4 Ω PTSR Ω PTSR + χ 4 Ω PTS S 1 α 8 Ω PTS S 1 α 8 + Ω PTSR + χ 4 α 6 exp Ω PTSR + χ 4 α 5 α 7 α 8 .
  • Case 2: P S S 1 1 + θ Sth P S R b or α 5 α 7
Similarly to Case 1, we can formulate I 3 in this case as follows:
I 3 = 0 + f U u α 8 u + α 7 α 5 α 6 + f V 1 v 1 I 3 u , v 1 | C 1 d v 1 d u J 3 + 0 + f U u 0 α 8 u + α 7 α 5 α 6 f V 1 v 1 I 3 u , v 1 | C 2 d v 1 d u J 4 .
Similarly to the derivation of J 1 and J 2 , we can obtain J 3 and J 4 in (53), respectively, as
J 3 = p = 1 M C 1 Ω PTSR Ω PTSR + β 5 C 2 Ω PTSR Ω PTSR + β 6 ,
J 4 = p = 1 M A 3 Ω PTSR Ω PTSR + χ 3 p = 1 M A 3 Ω PTSR α 6 Ω PTSR + χ 3 α 6 + Ω PTS S 1 α 8 exp Ω PTS S 1 α 7 α 5 α 6 p = 1 M A 4 Ω PTSR Ω PTSR + χ 4 + p = 1 M A 4 Ω PTSR α 6 Ω PTSR + χ 4 α 6 + Ω PTS S 1 α 8 exp Ω PTS S 1 α 7 α 5 α 6 .
Substituting (49), (51), and (52) into (37), and substituting (53)–(55) into (37), we obtain O P S S 1 in Case 1 and in Case 2, respectively. Therefore, we finish the proof here.  □

4. Simulation Results

In a simulation environment, we the fix positions of S S 1 , S S 2 , PT, and PR at (0,0), (1,0), (0.65,1), and (0.65,0.5), respectively, while that of the secondary relays is x R , 0 , and where 0 < x R 0.5 . With these positions, we can see that d S S 1 SR d S S 2 SR and d S S 1 PR > d S S 2 PR . In this section, the system parameters are fixed as follows: the path-loss exponent equals 3 μ = 3 , the outage threshold of the primary network equals 1 θ Pth = 1 , the target QoS of the primary network equals 0.001 ε OP = 0.001 , and the outage threshold of the secondary network equals 0.001 θ Sth = 0.001 . Finally, in the figures presented below, the markers denote the simulated results (Sim), and the solid lines denote the theoretical results (Theory).

4.1. OP of the Primary Network and Transmit Power of the Secondary Transmitters

Figure 2 and Figure 3, respectively, present the OP of the primary network and transmit power of the secondary transmitters as a function of P PT in dB. In these figures, the secondary nodes are located at (0.3,0), i.e., x R = 0.3 . At first, we can see from these figures that at low P PT values, the QoS of the primary network is not satisfied (i.e., O P P 0 > ε OP ), and hence the secondary transmitters are not allowed to access the spectrum, (i.e., P S S 1 = P S S 2 = P S R b = 0 ). It is worth noting that without the secondary operation, the OP values at PR equals to O P P 0 . Then, let us consider the case where the transmit power P PT is high enough and the QoS of the primary network is satisfied. In this case, S R b , S S 1 and S S 2 can access the licensed band to transmit the data, using the maximum transmit power as given in (30) and (34). Therefore, the OP at PR is equal to ε OP , i.e., O P P 1 = O P P 2 = ε OP . As seen, when N T = 1 and N R = 3 , the secondary network can access the licensed band when P PT 1 dB , and when N T = N R = 2 , the secondary network can access the licensed band when P PT 1 dB . We also see that N T = N R = 2 provides better OP performance for the primary network as well as increases the spectrum access possibility for the secondary network, as compared with N T = 1 and N R = 3 . Moreover, with N T = N R = 2 , the transmit power of the secondary transmitters is also higher than those with N T = 1 and N R = 3 . Looking at Figure 3, we also see that the transmit power of all secondary transmitters increases as P PT increases. Moreover, as proven in (35), the transmit power of all secondary transmitters linearly increases at high P PT region. From Figure 2, we can observe that the simulation results validate the theoretical ones of O P P 1 , O P P 2 , and O P P 0 derived in Section 3.
Now, we consider an optimization problem for the primary OP performance, where the total number of transmit and receive antennas is fixed by N T + N R = N tot , and N tot is a constant. From (24), (25), and (27), O P P 1 , O P P 2 , and O P P 0 obtain the lowest value when
N T = N tot 2 , if N tot is even N tot 1 2 or N tot + 1 2 , if N tot is odd
For example, in Figure 2 and Figure 3, since N tot = 4 , the optimal values of N T and N R are N T = N R = 2 .

4.2. OP of the Secondary Network

This sub-section studies the OP of the secondary network with N T = N R = 2 . As presented in Figure 2 and Figure 3, P PT should be higher than −1 (dB) so that the secondary transmitters are allowed to use the licensed band.
In Figure 4, we present the OP at the secondary sources as a function of P PT in dB with different values of the number of relays (M), and with x R = 0.3 . At first, we can see that the simulation results verify the correction of the expressions of O P S S 1 and O P S S 2 derived in Section 3. Then, we can see that O P S S 2 is lower than O P S S 1 because the datum x 1 has not yet been decoded by S R b at the first time slot. It is also seen from Figure 4 that the OP of S S 1 and S S 2 is lower with the increase in the number of relays (M). However, as observed in O P S S 2 , with M = 3 and M = 8, O P S S 2 only changes slightly. Finally, we can observe that O P S S 1 and O P S S 2 decrease with the increase in P PT . However, both O P S S 1 and O P S S 2 rapidly converged to saturation values as P PT is sufficiently high. Moreover, the saturation values do not depend on P PT , which means that the diversity order is equal to zero. To explain the saturation points in Figure 4, we first rewrite the SINRs given in (10), (12), and (18) at a high P PT regime as follows:
ψ S R b , x 1 P PT + P S S 1 g S S 1 S R b P S S 2 g S S 2 S R b + P PT g P T t S R b , ψ S R b , x 2 P PT + P S S 2 g S S 2 S R b P PT g P T t S R b ,
φ S S 1 P PT + P S R b g S R b S S 1 P PT g P T w S S 1 , φ S S 2 P PT + P S R b g S R b S S 2 P PT g P T w S S 2 .
From (35), (57), and (58), we can see that SINRs ψ S R b , x 1 , ψ S R b , x 2 , φ S S 1 , and φ S S 2 at high P PT values do not depend on P PT , and this is the reason why O P S S 1 and O P S S 2 converge to the saturation values.
Figure 5 presents O P S S 1 and O P S S 2 as functions of the number of relays (M) with different positions of the secondary relays and with P PT = 10 (dB). As seen from Figure 5, O P S S 1 and O P S S 2 are lower with the increase in M. However, when M is high enough, O P S S 1 and O P S S 2 converge to saturation values. For example, when x R = 0.4 , O P S S 2 O P S S 1 converges to the constants as M 2 M 6 . Figure 5 also illustrates that, as M increases, the performance gap between O P S S 1 and O P S S 2 is smaller. Therefore, an increasing M also provides the performance fairness between S S 1 and S S 2 . Finally, it can be observed that position of the secondary relays significantly affects O P S S 1 and O P S S 2 . As seen from Figure 5, O P S S 1 and O P S S 2 with x R = 0.2 are much lower than those with x R = 0.4 .
To more clearly show the impact of x R on the OP performance of the secondary sources, in Figure 6, we present O P S S 1 and O P S S 2 as changing x R from 0.1 to 0.5. In this figure, P PT is fixed by 10 (dB). We first see that both O P S S 1 and O P S S 2 increase as x R increases, which means that the proposed scheme performs well when the secondary relays are near the source S S 1 . Figure 6 also shows that O P S S 1 and O P S S 2 are lower with higher values of M, and the simulation results match very well with the analytical ones.

5. Conclusions

In this paper, we proposed the underlay CRN using TAS/SC to enhance the OP performance for the primary network, and using DNC TWR, ICT, and PRS to enhance the performance of the secondary network, in terms of OP and data rate. Additionally, we derived the closed-form expressions of the transmit power of the secondary transmitters and exact closed-form expressions of OP at the secondary sources over the Rayleigh fading channel. To check the correction of the derived formulas, Monte Carlo simulations were realized. Because all the derived expressions are in closed-form, they can be easily used to design and optimize the considered network. Then, as proven in Section 4, enhancing the primary OP performance with TAS/SC also increased the spectrum access possibility and transmit power of the secondary transmitters as well as increased the second OP performance. However, under the impact of the co-channel interference from the primary network, the secondary network only obtains the coding gain (i.e., the diversity gain equal to zero). The results show that the OP performance of the secondary network could be improved by increasing the number of secondary relays and placing the relays near one of the secondary sources. Finally, it is worth noting that increasing the number of secondary relays also provides performance fairness for the secondary sources.

Author Contributions

The main contributions of P.M.N., H.D.H., and P.V.T. were to review related works and conceive the main ideas; the main contributions of L.-T.T. and T.T.D. were to execute the performance evaluation and Monte Carlo simulations; the main contributions of T.T.D. and T.H. were to revise and finalize the manuscript. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Mitola, J.; Maguire, G.Q. Cognitive Radio: Making Software Radios More Personal. IEEE Pers. Commun. 1999, 6, 13–18. [Google Scholar] [CrossRef] [Green Version]
  2. Nguyen, T.V.; An, B. Cognitive Multihop Wireless Powered Relaying Networks Over Nakagami- m Fading Channels. IEEE Access 2019, 7, 154600–154616. [Google Scholar] [CrossRef]
  3. Nguyen, T.V.; Tran, T.N.; Shim, K.; Thien, H.T.; An, B. A Deep-Neural-Network-Based Relay Selection Scheme in Wireless-Powered Cognitive IoT Networks. IEEE Internet Things J. 2021, 8, 7423–7436. [Google Scholar] [CrossRef]
  4. Nguyen, T.T.; Vu, T.H.; Nguyen, T.V.; Costa, D.B.d.; Ho, C.D. Underlay Cognitive NOMA-Based Coordinated Direct and Relay Transmission. IEEE Wirel. Commun. Lett. 2021, 10, 854–858. [Google Scholar] [CrossRef]
  5. Vu, T.H.; Nguyen, T.V.; Costa, D.B.d.; Kim, S. Performance Analysis and Deep Learning Design of Underlay Cognitive NOMA-Based CDRT Networks with Imperfect SIC and Co-Channel Interference. IEEE Trans. Commun. 2021, 69, 8159–8174. [Google Scholar] [CrossRef]
  6. Phong, N.N.; Thanh, T.L.; Trung, D.Q.; Nallanathan, A. Secure Communications in Cognitive Underlay Networks Over Nakagami-m Channel. Phys. Commun. 2017, 25, 610–618. [Google Scholar]
  7. Duy, T.T.; Khan, L.C.; Binh, N.T.; Nhat, N.L. Intercept Probability Analysis of Cooperative Cognitive Networks Using Fountain Codes and Cooperative Jamming. EAI Trans. Ind. Netw. Intell. Syst. 2021, 8, 1–9. [Google Scholar] [CrossRef]
  8. Tran, T.D.; Ngoc, P.T.D.; Phuong, T.T. Performance Enhancement for Multihop Cognitive DF and AF Relaying Protocols under Joint Impact of Interference and Hardware Noises: NOMA for Primary Network and Best-Path Selection for Secondary Network. Wirel. Commun. Mob. Comput. 2021, 2021, 1–15. [Google Scholar] [CrossRef]
  9. Thanh, T.L.; Tan, N.N.; Trung, D.T.; Phuong, T.T.; Voznak, M.; Aravanis, A.I. Broadcasting in Cognitive Radio Networks: A Fountain Codes Approach. IEEE Trans. Veh. Technol. 2022, 71, 11289–11294. [Google Scholar] [CrossRef]
  10. Nam, P.M.; Do, D.T.; Tung, N.T.; Tin, P.T. Energy Harvesting Assisted Cognitive Radio: Random Location-Based Transceivers Scheme and Performance Analysis. Telecommun. Syst. 2018, 65, 123–132. [Google Scholar] [CrossRef]
  11. Nguyen, T.H.; Jung, W.S.; Tu, L.T.; Chien, T.V.; Yoo, D.; Ro, S. Performance Analysis and Optimization of the Coverage Probability in Dual Hop LoRa Networks with Different Fading Channels. IEEE Access 2020, 8, 107087–107102. [Google Scholar] [CrossRef]
  12. Ha, D.H.; Duy, T.T.; Son, P.N.; Thuong, L.T.; Voznak, M. Security-Reliability Trade-Off Analysis for Rateless Codes-Based Relaying Protocols Using NOMA, Cooperative Jamming and Partial Relay Selection. IEEE Access 2021, 9, 131087–131108. [Google Scholar] [CrossRef]
  13. Nguyen, T.N.; Nguyen, V.S.; Nguyen, H.G.; Tu, L.T.; Chien, T.V.; Nguyen, T.H. On the Performance of Underlay Device-to-Device Communications. Sensors 2022, 22, 1456. [Google Scholar] [CrossRef] [PubMed]
  14. Tuan, P.V.; Son, P.N. Intelligent Reflecting Surface Assisted Transceiver Design Optimization in Non-linear SWIPT Network with Heterogeneous Users. Wirel. Netw. 2022, 28, 1889–1908. [Google Scholar] [CrossRef]
  15. Thien, H.T.; Tuan, P.V.; Koo, I. A Secure-Transmission Maximization Scheme for SWIPT Systems Assisted by an Intelligent Reflecting Surface and Deep Learning. IEEE Access 2022, 10, 31851–31867. [Google Scholar] [CrossRef]
  16. Fredj, K.B.; Aissa, S. Performance of Amplify-and-Forward Systems with Partial Relay Selection under Spectrum-Sharing Constraints. IEEE Trans. Wirel. Commun. 2012, 11, 500–504. [Google Scholar] [CrossRef]
  17. Jaafar, W.; Ohtsuki, T.; Ajib, W.; Haccoun, D. Impact of the CSI on the Performance of Cognitive Relay Networks with Partial Relay Selection. IEEE Trans. Veh. Technol. 2016, 65, 673–684. [Google Scholar] [CrossRef]
  18. Duy, T.T.; Alexandropoulos, G.C.; Vu, T.T.; Vo, N.S.; Duong, T.Q. Outage Performance of Cognitive Cooperative Networks with Relay Selection over Double-Rayleigh Fading Channels. IET Commun. 2016, 10, 57–64. [Google Scholar] [CrossRef]
  19. Arzykulov, S.; Nauryzbayev, G.; Tsiftsis, T.A.; Maham, B. Performance Analysis of Underlay Cognitive Radio Nonorthogonal Multiple Access Networks. IEEE Trans. Veh. Technol. 2019, 68, 9318–9322. [Google Scholar] [CrossRef]
  20. Jee, A.; Janghel, K.; Prakriya, S. Performance of Adaptive Multi-User Underlay NOMA Transmission with Simple User Selection. IEEE Trans. Cogn. Commun. Netw. 2022, 8, 871–887. [Google Scholar] [CrossRef]
  21. Gupta, M.; Prakriya, S. Performance of CSI-based Power Control and NOMA/OMA Switching for Uplink Underlay Networks with Imperfect SIC. IEEE Trans. Cogn. Commun. Netw. 2022. [CrossRef]
  22. Bariah, L.; Muhaidat, S.; Al-Dweik, A. Error Performance of NOMA-Based Cognitive Radio Networks with Partial Relay Selection and Interference Power Constraints. IEEE Trans. Commun. 2020, 68, 765–777. [Google Scholar] [CrossRef]
  23. Im, G.; Lee, J.H. Outage Probability for Cooperative NOMA Systems with Imperfect SIC in Cognitive Radio Networks. IEEE Commun. Lett. 2019, 23, 692–695. [Google Scholar] [CrossRef]
  24. Vu, T.H.; Nguyen, T.V.; Nguyen, T.T.; Sim, S. Performance Analysis and Deep Learning Design of Wireless Powered Cognitive NOMA IoT Short-Packet Communications with Imperfect CSI and SIC. IEEE Internet Things J. 2022, 9, 10464–10479. [Google Scholar] [CrossRef]
  25. Vu, T.H.; Nguyen, T.V.; Da Costa, D.B.; Kim, S. Reconfigurable Intelligent Surface-Aided Cognitive NOMA Networks: Performance Analysis and Deep Learning Evaluation. IEEE Trans. Wirel. Commun. 2022. [Google Scholar] [CrossRef]
  26. Popovski, P.; Yomo, H. Physical Network Coding in Two-Way Wireless Relay Channels. In Proceedings of the 2007 IEEE International Conference on Communications, Glasgow, UK, 24–28 June 2007; pp. 1–6. [Google Scholar]
  27. Duy, T.T.; Kong, H.Y. Exact Outage Probability of Cognitive Two-Way Relaying Scheme with Opportunistic Relay Selection under Interference Constraint. IET Commun. 2012, 6, 2750–2759. [Google Scholar] [CrossRef]
  28. Yonghui, L.; Louie, R.H.Y.; Vucetic, B. Relay Selection with Network Coding in Two-Way Relay Channels. IEEE Trans. Veh. Technol. 2010, 59, 4489–4499. [Google Scholar]
  29. Son, P.N.; Kong, H.Y. Exact Outage Probability of Two-Way Decode-and-Forward Scheme with Opportunistic Relay Selection Under Physical Layer Security. Wirel. Pers. Commun. 2014, 77, 2889–2917. [Google Scholar] [CrossRef]
  30. Son, P.N.; Kong, H.Y. Improvement of The Two-way Decode-and-forward Scheme by Energy Harvesting and Digital Network Coding Relay. Trans. Emerg. Telecommun. Technol. 2017, 28, 1–14. [Google Scholar] [CrossRef]
  31. Tan, N.N.; Minh, T.H.Q.; Tran, P.T.; Voznak, M.; Duy, T.T.; Nguyen, T.; Tin, P.T. Performance Enhancement for Energy Harvesting Based Two-Way Relay Protocols in Wireless Ad-hoc Networks with Partial and Full Relay Selection Methods. Ad-hoc Networks 2019, 54, 178–187. [Google Scholar]
  32. Song, L.; Hong, G.; Jiao, B.; Debbah, M. Joint Relay Selection and Analog Network Coding Using Differential Modulation in Two-Way Relay Channels. IEEE Trans. Veh. Technol. 2010, 59, 2932–2939. [Google Scholar] [CrossRef] [Green Version]
  33. Huynh, T.P.; Son, P.N.; Voznak, M. Exact Outage Probability of Two-way Decode-and-forward NOMA Scheme with Opportunistic Relay Selection. KSII Trans. Internet Inf. Syst. 2019, 13, 5862–5887. [Google Scholar]
  34. Son, P.N.; Tran, T.D. A New Approach for Two-Way Relaying Networks: Improving Performance by Successive Interference Cancellation, Digital Network Coding and Opportunistic Relay Selection. Wirel. Netw. 2020, 26, 1315–1329. [Google Scholar] [CrossRef]
  35. Dao, T.T.T.; Son, P.N. Cancel-decode-encode Processing On Two-way Cooperative NOMA Schemes In Realistic Conditions. Wirel. Commun. Mob. Comput. 2021, 2021, 1–15. [Google Scholar] [CrossRef]
  36. Thanh, T.L.; Tiep, M.H. Cooperative Spectrum-Sharing with Two-way AF Relaying In The Presence of Direct Communications. EAI Endorsed Trans. Ind. Netw. Intell. Syst. 2018, 5, 1–9. [Google Scholar] [CrossRef]
  37. Tung, N.T.; Nam, P.M.; Tin, P.T. Performance Evaluation of a Two-way Relay Network with Energy Harvesting and Hardware Noises. Digit. Commun. Netw. 2021, 7, 45–54. [Google Scholar] [CrossRef]
  38. Thuy, D.T.T.; Son, P.N. Multi-Constraint Two-way Underlay Cognitive Network Using Reconfigurable Intelligent Surface. Wirel. Netw. 2022, 28, 2017–2030. [Google Scholar]
  39. Son, P.N.; Duy, T.T.; Khuong, H.V. SIC-coding Schemes For Underlay Two-way Relaying Cognitive Networks. Wirel. Commun. Mob. Comput. 2020, 2020, 1–17. [Google Scholar] [CrossRef]
  40. Duy, T.T.; Son, P.N.; Truong, S.N.; Truong, P.Q.; Phan, V.; Ho-Van, K.; Tuan, P.V.; Khanh, L. Outage Probability of Interference Cancellation Based Two-Way Relaying Cognitive Radio Protocol with Primary MIMO Communication. In Proceedings of the International Conference on Communications and Electronics—ICCE, Phu Quoc Island, Vietnam, 15 July 2020; pp. 1–6. [Google Scholar]
  41. Alzubaidi, O.T.H.; Hindia, M.N.; Dimyati, K.; Noordin, K.A.; Wahab, A.N.A.; Qamar, F.; Hassan, R. Interference Challenges and Management in B5G Network Design: A Comprehensive Review. Electronics 2022, 11, 2842. [Google Scholar] [CrossRef]
  42. Taha, D.H.Y.; Haci, H.; Serener, A. Novel Channel/QoS Aware Downlink Scheduler for Next-Generation Cellular Networks. Electronics 2022, 11, 2895. [Google Scholar] [CrossRef]
Figure 1. The DNC TWR model in the proposed underlay CRN.
Figure 1. The DNC TWR model in the proposed underlay CRN.
Electronics 11 03645 g001
Figure 2. OP of the primary network as a function of P PT (dB) when x R = 0.3 .
Figure 2. OP of the primary network as a function of P PT (dB) when x R = 0.3 .
Electronics 11 03645 g002
Figure 3. Transmit power of the secondary transmitters as a function of P PT (dB) when x R = 0.3 .
Figure 3. Transmit power of the secondary transmitters as a function of P PT (dB) when x R = 0.3 .
Electronics 11 03645 g003
Figure 4. OP of the secondary sources versus P PT (dB) when x R = 0.3 .
Figure 4. OP of the secondary sources versus P PT (dB) when x R = 0.3 .
Electronics 11 03645 g004
Figure 5. OP of the secondary sources as a function of M when P PT = 10 (dB).
Figure 5. OP of the secondary sources as a function of M when P PT = 10 (dB).
Electronics 11 03645 g005
Figure 6. OP of the secondary sources as a function of x R when P PT = 10 (dB).
Figure 6. OP of the secondary sources as a function of x R when P PT = 10 (dB).
Electronics 11 03645 g006
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Minh Nam, P.; Hung, H.D.; Tu, L.-T.; Tuan, P.V.; Duy, T.T.; Hanh, T. Outage Performance of Interference Cancellation-Aided Two-Way Relaying Cognitive Network with Primary TAS/SC Communication and Secondary Partial Relay Selection. Electronics 2022, 11, 3645. https://doi.org/10.3390/electronics11223645

AMA Style

Minh Nam P, Hung HD, Tu L-T, Tuan PV, Duy TT, Hanh T. Outage Performance of Interference Cancellation-Aided Two-Way Relaying Cognitive Network with Primary TAS/SC Communication and Secondary Partial Relay Selection. Electronics. 2022; 11(22):3645. https://doi.org/10.3390/electronics11223645

Chicago/Turabian Style

Minh Nam, Pham, Ha Duy Hung, Lam-Thanh Tu, Pham Viet Tuan, Tran Trung Duy, and Tan Hanh. 2022. "Outage Performance of Interference Cancellation-Aided Two-Way Relaying Cognitive Network with Primary TAS/SC Communication and Secondary Partial Relay Selection" Electronics 11, no. 22: 3645. https://doi.org/10.3390/electronics11223645

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop