DOI QR코드

DOI QR Code

Optimal Power Allocation and Relay Selection for Cognitive Relay Networks using Non-orthogonal Cooperative Protocol

  • Lan, Peng (College of Information Science and Engineering, Shandong Agricultural University) ;
  • Chen, Lizhen (College of Information Science and Engineering, Shandong Agricultural University) ;
  • Zhang, Guowei (Administration Center of Shandong Academy of Information & Communication Technology) ;
  • Sun, Fenggang (College of Information Science and Engineering, Shandong Agricultural University)
  • Received : 2015.07.06
  • Accepted : 2016.03.13
  • Published : 2016.05.31

Abstract

In this paper, we investigate joint power allocation and relay selection (PARS) schemes in non-orthogonal cooperative protocol (NOCP) based cognitive relay networks. Generally, NOCP outperforms the orthogonal cooperative protocol (OCP), since it can provide more transmit diversity. However, most existing PARS schemes in cognitive relay networks focus on OCP, which are not suitable for NOCP. In the context of NOCP, we first derive the joint constraints of transmit power limit for secondary user (SU) and interference constraint for primary user (PU). Then we formulate optimization problems under the aforementioned constraints to maximize the capacity of SU in amplify-and-forward (AF) and decode-and-forward (DF) modes, respectively. Correspondingly, we derive the closed form solutions with respect to different parameters. Numerical results are provided to verify the performance improvement of the proposed PARS schemes.

Keywords

1. Introduction

Since most spectrum is used in a bursty fashion, cognitive radio (CR) proposed by Mitola [1], aims to improve the spectrum utilization efficiency by allowing secondary users (SUs) to share primary user’s (PU’s) spectrum as long as SU’s transmit power does not exceed the interference tolerance of PU [2]. To use the spectrum efficiently while alleviate the interference to PU, cooperative relaying technique is now considered as a potential means for SU [3].

Various cooperative relaying schemes have been proposed to achieve the benefits such as improvement in link quality and reliability, and increase in coverage [4-8]. Among these schemes, amplify-and-forward (AF) and decode-and-forward (DF) schemes are the two widely used relaying protocols in cooperative networks [4]. Traditionally, orthogonal cooperative protocol (OCP) is mainly adopted in two-hop cooperative networks, where source and relay transmit signals in two adjacent non-overlapping timeslots alternately. Meanwhile, non-orthogonal cooperative protocol (NOCP) has been proposed in [9], where both source and relay transmit signals simultaneously in the second timeslot. It is shown in [9] that NOCP always outperforms OCP, as more transmit diversity gain can be achieved. To fully utilize the efficiency, we consider NOCP based CR relay networks, where a set of cognitive relays assist the secondary transmission while sharing the spectrum with PU.

In CR relay networks, it is essential to improve SU’s performance through power allocation and relay selection (PARS). Under traditional OCP, various PARS schemes have been studied to meet different requirements [10-16]. To maximize the system capacity, a joint PARS scheme was investigated in [10] under limited interference constraint for PU. In CR AF relay network with multiple SUs, joint relay assignment and power allocation was further proposed in [11] to maximize the sum capacity of SUs. In addition to the interference constraint, the transmit power for SU is also constrained by transmit power limit in practice. Under the joint consideration of the interference constraint for PU and transmit power limit for SU, a simplified power allocation (PA) scheme was proposed in [12] for CR multi-node relay networks. In [13], the authors studied the PA scheme for CR networks with two SUs in both direct and relay-aided transmission scenarios. Further, to make a tradeoff between the achievable rate and the network lifetime, a distributed PARS scheme was studied in [14] for CR cooperative networks. The authors in [15] proposed the joint PARS schemes under guaranteed primary outage constraint in cognitive DF relay networks. For cognitive two-way communication, an optimal PARS scheme was proposed in [16] where a pair of cognitive transceivers communicate with each other assisted by a set of two-way relays.

To the best of our knowledge, few works have referred to the PARS schemes for NOCP based CR relay networks. Recently, the works in [17] and [18] studied the PA schemes in CR relay networks, where multiple non-orthogonal AF relays transmit over the same frequency band simultaneously. The authors in [19] further considered PA schemes in CR non-orthogonal two-way relay networks. The “non-orthogonal” in the mentioned studies [17-19] represents that multiple relays transmit over the same (non-orthogonal) frequency band. Moreover, the direct link between source and destination is not considered, i.e., source and relays should transmit in different non-overlapping (orthogonal) timeslots. Consequently, the mentioned studies are non-orthogonal in frequency domain, while orthogonal in the time domain. They still belong to the case of OCP protocol in essence. The studies in [20][21] considered NOCP protocol with AF and DF modes respectively. However, they focused on traditional cooperative communications systems, and the context of CR is not involved.

In NOCP based CR relay networks, secondary destination will get signals simultaneously from ST and SR in the second timeslot, while secondary destination will only get data from SR in OCP based CR relay networks. Consequently, the NOCP cooperative protocol shows great superiority as compared to the OCP protocol, for it can provide more transmit diversity. However, in the context of interference limited cognitive scenarios, the interference constraint for PU will undoubtedly be affected. Specifically, the interference for PU is caused by ST and SR simultaneously in the second timeslot. With the alterative interference constraint for PU, the PARS schemes will be different from that in OCP based CR relay networks.

In this paper, we investigate the NOCP based CR relay networks and propose the PARS schemes to maximize the SU’s capacity for the AF and DF relay protocols, respectively. The main contributions of this paper are summarized as follows.

The rest of this paper is organized as follows. In Section 2, we introduce the NOCP based CR relay network, and discuss power constraints for both ST and SR. In Section 3 and Section 4, we study PARS schemes to maximize the SU’s capacity in AF and DF protocols, respectively. In Section 5, we present numerical results to illustrate the performance of the proposed PARS schemes. Then we conclude the paper in Section 6. The main notations used in this paper are summarized in Table 1.

Table 1.Notations

 

2. System and Channel Model

As is shown in Fig. 1, we consider a cognitive relay network involving a primary system and a secondary system. In the primary system, a primary transmitter (PT) sends data to a primary destination (PD). The secondary system is a cooperative relay system, which consists of a secondary transmitter (ST), a secondary destination (SD) and N secondary relays (SRs). In the system, the secondary transmission involves two timeslots. In the first timeslot, ST broadcasts messages to SRs and SD. While in the second timeslot, both ST and the selected best relay (BR) communicate to SD. Due to the simultanteous transmission of ST and BR in the second timeslot, this protocol is called NOCP protocol as in [9].

Fig. 1.System Model of NOCP based cognitive relay networks.

In order to guarantee the QoS requirement of the primary transmission, the transmit powers of ST and BR should be constrained to reduce the interference to PD. Assume that SU intends to reuse PU’s frequency band to transmit its signal to SD. The channel coefficeint between any transmitter i ∈ {ST,BR,PT} and any receiver j ∈ {SD,SR,PD} is denoted as hi-j, which is invariant during the two successive timeslots. All the links are independently and identically distributed (i.i.d.) zero-mean Rayleigh flat fading and can be obtained by pilot aided channel estimation or CSI feedback [22,24]. The thermal noise at receiver nj is modeled as additive white Gaussian noise (AWGN) with zero mean and variance The noise-whitening filter [25] is applied at SR and SD, so the interference at SU from PU can be modeled as zero mean AWGN with variance respectively. Thus, the received signals at the i-th relay SRi and SD during the first timeslot can be denoted as

where ySRi and ySD,1 are the received signals at SRi and SD, PST,1 represents the transmit power of ST, xS,1 is the transmitted signal of SU, uSRi and uSD represent the whitening noise at SRi and SD caused by PT.

In the second timeslot, the received signals will be forwarded to SD with the help of SRs. In practice, two commonly used protocols for the relay retransmission are: AF and DF.

Case 1. AF mode: If the i-th relay is selected to forward the original signal, the received signal is multiplied by the gain of the i-th relay with Gi, and then it is retransmitted to SD. Thus, in the second timeslot, the received signal at SD can be expressed as

where is the received signal of SD, PSTi,2 represents the transmit power of ST corresponding to the i-th relay and xS,2 is a new signal transmitted by SU in the second timeslot [9][21]. It is clear from (3) that the choice of the relay gain Gi determines the equivalent SINR of SD. One choice for the gain was given in [4] as

and (3) can now be reformulated as

with

Let the receiver normalizes ySD,1 and by factors υ and ωi. This normalization does not alter the SINR but simplifies the ensuing presentation. Combining (2) and (3), the effective input-output relation can be summarized as [9]

where is the received signal vector, HAFi is the effective 2×2 channel matrix given by

is the transmitted signal vector, and n is the circularly symmetric complex Gaussian noise vector with E[n] = 0 and E[nnH] = I2.

Case 2. DF mode: For the case of DF mode, the received signal at SD in the second timeslot can be expressed as

The input-output relation for DF mode can now be summarized as

where is the received signal vector, HDFi is the effective 2×2 channel matrix given by [9]

Interference Constraint: In the context of interference limited cognitive scenarios, the transmit power of SU should be approximately controlled to protect PU. Here we take both the interference constraint I for PU and transmit power limit Pmax for SU into consideration. With the considered NOCP protocol, ST transmits with power, PST,1 in the first timeslot and the interference caused to PD is PST,1|hST-PD|2 While in the second timeslot, ST and SRi transmit simultaneously with respective powers PSTi,2 and PSRi, the resulted interference to PD is PSTi,2|hST-PD|2 + PSRi|hSRi-PD|2. Then the transmit powers of ST and SRi should satisfy

Equal Power Allocation Scheme: According to the constraints (12a) and (12c), the maximum feasible transmit power for ST in the first timeslot is With respect to the constraints (12b), a simple but not optimal way to satisfy the interference constraint without cooperation between ST and SR would be to set the predetermined interference to half of the threshold, i.e., PSTi,2|hST-PD|2 ≤ I/2 and PSRi|hSRi-PD|2 ≤ I/2. Considering (12c), the feasible powers of PSTi,2 and PSRi are and We denote this scheme as the equal power allocation (EPA) on average scheme [26]. The EPA scheme allocates powers individually without the coordination between ST and SR, therefore, it cannot reach an optimal performance.

 

3. Optimal Power Allocation and Relay Selection Scheme for CR Systems with AF NOCP Protocol

In this section, based on the analysis of the system capacity, the PARS algorithm for CR relay networks with AF NOCP protocol is proposed.

3.1 Problem Statement

We employ an ergodic block-fading channel model and an i.i.d. Gaussian codebook. The capacity of the AF NOCP CR system is

Substitute (8) into (13) and further (13) can be simplified as

Let

The PARS scheme can be formulated with (12a), (12b), (12c), and (15) as

3.2 PARS Scheme Realization

As can be seen, (16a) is a linear increasing function with PSTi,1. Take (17a) and (17c) into account, the best power of PST,1 should be For simplicity, let in this case, The PARS problem can be rewritten as

Define the feasible region of the power allocation as

The power allocation problem of (18a), (19a) and (19b) can now be simplified as

Assume the edge of Ω is ΩSub, which is defined as

In the ensuing analysis, we use the following lemma, which will reduce the complexity of the power allocation algorithms, the proof of the lemma is shown in Appendix.

Lemma: The optimal power consumption from ST and SR is on the edge ofΩ, in this case, the power allocation algorithm can be simplified as

Based on this lemma, with different channel conditions, there will be five different cases for PA as shown in Fig. 2, where the circles identify the potential location of the optimal PA values of PSTi,2 and PSRi. The optimal power allocation will be one of the black circles of the five different cases as summarized in Table 2.

Fig. 2.Optimal power allocation values of PSTi,2 and PSRi for AF protocol with different channel conditions.

Table 2.Summarization of optimal power allocation of PSTi,2 and PSRi for AF NOCP CR system with different channel conditions

Once the optimal power allocation is performed, ST can select the relay that maximizes the capacity according to (16b) and then inform the selected relay to assist the transmission of the secondary link. For clarity, the proposed power allocation and relay selection scheme for AF NOCP CR systems is summarized in Algorithm 1.

 

4. Optimal Power Allocation and Relay Selection Scheme for CR systems with DF NOCP Protocol

In this section, we study the PARS algorithm for the CR system with DF NOCP protocol and derive the optimal solution to maximize the system capacity.

4.1 Problem Statement

Define

Combine (11) with (24), we have

The capacity for the DF NOCP CR system [9] is

Therefore, the problem of PARS scheme to maximize the capacity can be formulated as

4.2 PARS Scheme Realization

As can be seen, (29a) is an increasing function with PST,1, PSTi,2 and PSTi. Take (30a) and (30c) into account, the best transmit power of PST,1 should be To optimize the system performance, without considering the constraints in (28) and we first aim at power allocation to maximize R(i)Total, later the constraints of (28) will be considered and the power allocation will be adjusted to maximize R(i)DF.

Define we have

Let the optimal power allocation for maximizing R(i)Total be then the power allocation problem can be formulated as

Define the power allocation problem can be further converted to

Without considering the power limits (30c), to obtain the optimal solution, the constraint (30b) should be satisfied with equality, which can be easily proved by the contradiction. The optimal power allocation for this case are denoted as which should satisfy

Thus, by substituting (34) into (33), can be further expressed as

Define for the case should be set as zero and all the power will be allocated to SRi, and when will be maximized while is set as zero. The power allocation scheme is summarized as

When the peak power constraints in (30c) are considered, the optimal power allocation to maximize R(i)Total should be further adjusted. For the case the power allocation is the same as (36). However, when the feasible way is to decrease the transmit power at SRi and let it be Pmax. Taking into consideration that gi (PSTi,2, PSRi) is an increasing function of PSTi,2, and according to the constraints of (30b) and (30c), the optimal power allocation of PSTi,2 should be adjusted as When from a reasoning similar analysis with the case the optimal power allocation for ST and SRi are adjusted. Integrated from the above cases, the optimal solutions maximizing R(i)Total can be obtained as

Based on the above analysis, the optimal power allocation that can maximize R(i)Total is solved. However, only when the constraint R(i)Relay > R(i)Total - R(i)Direct is satisfied, R(i)DF = R(i)Total and (37) is the optimal power allocation for DF NOCP CR systems. Once this constraint is not satisfied, the PA scheme needs to be revised to maximize R(i)DF.

For the case R(i)Relay ≤ R(i)Total - R(i)Direct, we have R(i)DF = R(i)Relay + R(i)Direct. Since has already been achieved as which directly decides the value of R(i)Relay, the power allocation should be adjusted to increase PSTi,2, further increase the value of R(i)Direct and also the value of R(i)DF. In all, three cases are analyzed as follows.

Case 1: when the best power allocation that maximizes R(i)Total is In this case, and the power allocation scheme maximizing R(i)Total will be the best to maximize the capacity R(i)DF.

However, if the optimal power allocation needs to be adjusted. We first neglect the power constraint of (30b), and it is easy to prove by contradiction that there will be an equilibrium point satisfying

Therefore, the equilibrium point can be calculated as

Take into consideration the maximum power limit constraints of (30c), the best power allocation with is given as

Case 2: when the best power allocation is is already the largest. If there exist two different possible situations.

Case 3: when no matter will always be set to the largest transmit power allowed by the system, just as shown in (37). In this case, the best power allocation should be the same as (37) and no power allocation adjust is needed.

For the simplicity of analysis, let and integrated from the above analysis, the optimal solutions for the original problem (29a) with constraints (30a), (30b), and (30c) can be obtained as shown in Table 3. Once the optimal power allocation is performed, ST can select the relay that maximizes the capacity according to (29b) and then inform the selected relay to assist the transmission of the secondary link.

Table 3.Summarization of optimal power allocation of PSTi,2 and PSRi for DF NOCP CR system with different channel conditions

For clarity, the proposed power allocation and relay selection scheme for DF NOCP CR systems is summarized in Algorithm 2.

 

5. Simulation Results

In this section, we evaluate the performance of the proposed PARS schemes through Monte-Carlo simulations for AF and DF NOCP CR systems, respectively, and compare them with the schemes using equal power allocation (EPA) with relay selection for NOCP CR systems, and the scheme using PA in [23] with relay selection for OCP CR systems. It is noted that the proposed schemes and the scheme in [23] can be performed in either a centralized or a distributed manner as in [27]. All of these schemes need to obtain the channel conditions of the interference link from SU to PU and the transmission link of SU by pilot aided channel estimation or CSI feedback. Consequently, they have almost the same implementation complexity in terms of acquiring channel conditions. However, once all the channel conditions are obtained, the proposed schemes have slightly more computational complexity than the scheme in [23], this is because that the proposed schemes need to trade off the powers between ST and SR in the second timeslot while the scheme in [23] doesn’t. We will show that the proposed schemes can provide much superior performance than the scheme in [23], which is verified by simulation results later. We assume that the channel coefficients are i.i.d. and follow Rayleigh distribution. The following parameters are used throughout this section:

Fig. 3 describes SU capacity versus SU transmit power limit Pmax with N = 4 relays and I = -18 dBW. As the figure shows, with the increase of Pmax, the proposed PARS schemes achieve better capacity performance as compared to the traditional schemes for the NOCP and OCP systems in both the DF and AF relaying modes. As Pmax increases, the performance difference among the three different schemes becomes obvious. However, with the increase of Pmax, the performance improvement of the secondary system firstly increases, and after a certain level of Pmax, the performance improvement slows down. This phenomenon can be explained as follow: when Pmax is in small region, the transmit power of SU will be dominantly decided by Pmax, and will become larger with the increase of Pmax on condition that the interference constraint of PU is satisfied. However, with the continuous increase of Pmax, the interference constraint of PU becomes the dominant factor to determine SU transmit power, which will scarcely achieve to Pmax.

Fig. 3.SU capacity versus SU transmit power limit Pmax

Fig. 4 shows SU capacity versus the PU maximum interference tolerance level I with N = 4 relays and Pmax = −8 dBW. It can be seen from Fig. 4, with the increase of I, the system performance is improved for the reason that more transmit power is allowed for SU. However, the difference among the three different schemes is neglectable when I is in low regions, especially for the NOCP protocol system. With the increase of I, the performance difference becomes obvious. The capacity ceiling is achieved when I is in high regions, which is due to the fact that when I is large, the SU transmit power is dominantly decided by the SU maximum power, which is a constant and do not vary with PU interference tolerance level.

Fig. 4.SU capacity versus PU maximize tolerance interference I

In Fig. 5, we compare capacity obtained by SU system under different schemes with increasing number of relays and keeping interference threshold as I = -18 dBW, and the maximum transmit power Pmax = −8 dBW. As the result shows, the performance of the proposed schemes outperforms the others. It should be noted in Fig. 5 that the capacity increases linearly with the increase of the relays number, as more spatial diversity is gained. Also it can be observed from the result that with relay selection, the performance of the system with DF protocol improved significantly as compared with the AF protocol system.

Fig. 5.SU capacity versus secondary relays number N

 

6. Conclusions

In this paper, the optimal power allocation and relay selection schemes are studied to improve the channel capacity of SU for non-orthogonal cooperative protocol based CR relay networks with both the AF and DF protocols respectively, subject to interference constraint for PU and transmit power limit for SU. In AF non-orthogonal cooperative protocol based CR relay networks, the optimal solution is proved to be at the edge of the constrained conditions and an intuitional solution is provided. In DF non-orthogonal cooperative protocol based CR relay networks, the corresponding optimal solution is achieved according to the channel quality of the direct link and relay-assisted link. Finally, the closed form expressions for the power allocation and relay selection schemes are derived with respect to different parameters. The performance of the proposed schemes was illustrated for different operating conditions and shown to outperform the other schemes.

References

  1. J. Mitola and G. Q. Maguire, “Cognitive radio: making software radios more personal,” IEEE Personal Communications, vol. 6, no. 4, pp. 13-18, 1999. Article (CrossRef Link) https://doi.org/10.1109/98.788210
  2. S. Haykin, “Cognitive radio: brain-empowered wireless communications,” IEEE Journal on Selected Areas in Communications, vol. 23, no. 2, pp. 201-220, 2005. Article (CrossRef Link) https://doi.org/10.1109/JSAC.2004.839380
  3. O. Simeone, Y. Bar-Ness, and U. Spagnolini, “Stable throughput of cognitive radios with and without relaying capability,” IEEE Transactions on Communications, vol. 55, no. 12, pp. 2351-2360, 2007. Article (CrossRef Link) https://doi.org/10.1109/TCOMM.2007.910699
  4. J. N. Laneman, D. N. C. Tse, and G. W. Wornell, “Cooperative diversity in wireless networks: efficient protocols and outage behavior,” IEEE Transactions on Information Theory, vol. 50, no. 12, pp. 3062-3080, 2004. Article (CrossRef Link) https://doi.org/10.1109/TIT.2004.838089
  5. Y. W. Hong, W. J. Huang, F. H. Chiu, and C. C. J. Kuo, “Cooperative communications in resource-constrained wireless networks,” IEEE Signal Processing Magazine, vol. 24, no. 3, pp. 47-57, 2007.Article (CrossRef Link) https://doi.org/10.1109/MSP.2007.361601
  6. D. B. Costa and S. Aissa, “Cooperative dual-hop relaying systems with beamforming over Nakagami-m fading channels,” IEEE Transactions on Wireless Communications, vol. 8, no. 8, pp. 3950-3954, 2009. Article (CrossRef Link) https://doi.org/10.1109/TWC.2009.081353
  7. J. S. Chen and J. X. Wang, “Cooperative transmission in wireless networks using incremental opportunistic relaying strategy,” IET Communications, vol. 3, no. 12, pp. 1948-1957, 2009. Article (CrossRef Link) https://doi.org/10.1049/iet-com.2009.0168
  8. C. Zhai, H. J. Xu, J. Liu, L. N. Zheng, and Y. Zhou, “Performance of opportunistic relaying with truncated ARQ over Nakagami-m fading channels,” Transactions on Emerging Telecommunications Technologies, vol. 23, no. 1, pp. 50–66, 2012. Article (CrossRef Link) https://doi.org/10.1002/ett.1508
  9. R. U. Nabar, H. Bolcskei, and F. W. Kneubhler, “Fading relay channels: performance limits and space-time signal design,” IEEE Journal on Selected Areas in Communications, vol. 22, no. 6, pp. 1099-1109, 2004. Article (CrossRef Link) https://doi.org/10.1109/JSAC.2004.830922
  10. L. Li, X. Zhou, H. Xu, G. Li, D. Wang, and A. Soong, “Simplified relay selection and power allocation in cooperative cognitive radio systems,” IEEE Transactions on Wireless Communications, vol. 10, no. 1, pp. 33-36, 2011. Article (CrossRef Link) https://doi.org/10.1109/TWC.2010.101810.100311
  11. M. Naeem, U. Pareek, D. C. Lee, and A. Anpalagan, “Power allocation and relay assignment for shared-band nonregenerative relaying in cognitive radio systems,” IEEE Transactions on Vehicular Technology, vol. 62, no. 6, pp. 2853-2859, 2013. Article (CrossRef Link) https://doi.org/10.1109/TVT.2013.2249673
  12. M. Choi, J. Park, and S. Choi, “Simplified power allocation scheme for cognitive multi-node relay networks,” IEEE Transactions on Wireless Communications, vol. 11, no. 6, pp. 2008-2012, 2012. Article (CrossRef Link) https://doi.org/10.1109/TWC.2012.050112.111621
  13. L. Lu, Y. Li, and G. Wu, “Optimal power allocation for CR networks with direct and relay-aided transmissions,” IEEE Transactions on Wireless Communications, vol. 12, no. 4, pp. 1-11, 2013. Article (CrossRef Link) https://doi.org/10.1109/TWC.2013.022113.120908
  14. C. Luo, F. R. Yu, H. Ji, and V. C. M. Leung, "Distributed relay selection and power control in cognitive radio networks with cooperative transmission," in Proc. of 2010 IEEE International Conference on Communications (ICC), pp. 1-5, 2010.Article (CrossRef Link)
  15. P. Lan, F. G. Sun, L. Z. Chen, P. Xue, and J. L. Hou, “Power allocation and relay selection for cognitive relay networks with primary QoS constraint,” IEEE Wireless Communication Letters, vol. 2, no. 6, pp. 583-586, 2013. Article (CrossRef Link) https://doi.org/10.1109/WCL.2013.080813.130469
  16. P. Ubaidulla and S. Aissa, “Optimal relay selection and power allocation for cognitive two-way relaying networks,” IEEE Wireless Communication Letters, vol. 1, no. 3, pp. 225-228, 2012. Article (CrossRef Link) https://doi.org/10.1109/WCL.2012.032312.120095
  17. M. Elsaadany, "Optimal power allocation in cognitive networks using non-orthogonal AF relays," in Proc. of IEEE 39th conference on Local Computer Networks (LCN), pp. 410-413, 2014. Article (CrossRef Link)
  18. M. Elsaadany and W. Hamouda, “Performance analysis of non-orthogonal AF relaying in cognitive networks,” IEEE Wireless Communication Letters, vol. 4, no. 4, pp. 373-376, 2015. Article (CrossRef Link) https://doi.org/10.1109/LWC.2015.2421910
  19. Y. Cao and C. Tellambura, “Joint distributed beamforming and power allocation in underlay cognitive two-way relay links using second-order channel statistics,” IEEE Transactions on Signal Processing, vol. 62, no. 22, pp. 5950-5961, 2014. Article (CrossRef Link) https://doi.org/10.1109/TSP.2014.2358953
  20. S. Kim, S. Choi, and D. Park, “Optimal beamforming with combining for the non-orthogonal amplify-and-forward (NAF) protocol in cooperative communication systems,” IEEE Transactions on Wireless Communications, vol. 10, no. 4, pp. 1038-1043, 2011. Article (CrossRef Link) https://doi.org/10.1109/TWC.2011.012411.100841
  21. Y. Zhang, Y. Xu, and Y. Cai, “Power allocation for non-orthogonal decode-and forward cooperation protocol,” Science in China Series F: Information Sciences, vol. 52, no. 6, pp. 1037-1042, 2009.Article (CrossRef Link) https://doi.org/10.1007/s11432-009-0018-8
  22. L. Lu, Y. Li, and G. Wu, “Optimal power allocation for CR networks with direct and relay-aided transmissions,” IEEE Transactions on Wireless Communications, vol. 12, no. 4, pp. 1–11, 2013. Article (CrossRef Link) https://doi.org/10.1109/TWC.2013.022113.120908
  23. T. W. Ban, W. Choi, B. C. Jung, and D. K. Sung, “Multi-user diversity in a spectrum sharing system,” IEEE Transactions on Wireless Communications, vol. 8, no. 1, pp. 102-106, 2009. Article (CrossRef Link) https://doi.org/10.1109/T-WC.2009.080326
  24. J.-P. Hong, B. Hong, T.W. Ban, and W. Choi, “On the cooperative diversity gain in underlay cognitive radio systems,” IEEE Transactions on Communications, vol. 60, no. 1, pp. 209–219, 2012. Article (CrossRef Link) https://doi.org/10.1109/TCOMM.2011.101411.100677
  25. P. Ubaidulla and S. Aissa, “Optimal relay selection and power allocation for cognitive two-way relaying networks,” IEEE Wireless Communication Letters, vol. 1, no. 3, pp. 225-228, 2012. Article (CrossRef Link) https://doi.org/10.1109/WCL.2012.032312.120095
  26. H. Kim, S. Lim, H. Wang, and D. Hong, “Optimal power allocation and outage analysis for cognitive full duplex relay systems,” IEEE Transactions on Wireless Communications, vol. 11, no. 10, pp. 3754-3765, 2012. Article (CrossRef Link) https://doi.org/10.1109/TWC.2012.083112.120127
  27. A. Bletsas, H. Shin, and M. Z. Win, “Outage optimality of opportunistic amplify-and-forward relaying,” IEEE Communication Letters, vol. 11, no. 3, pp. 261–263, 2007. Article (CrossRef Link) https://doi.org/10.1109/LCOMM.2007.061589