# On the performance of cognitive full-duplex relaying under spectrum sharing constraints

- Samuel B. Mafra†
^{1}Email author, - Hirley Alves†
^{1, 2}, - Daniel B. Costa
^{3}, - Richard D. Souza†
^{1}, - Evelio M. G. Fernandez
^{4}and - Matti Latva-aho
^{2}

**2015**:169

https://doi.org/10.1186/s13638-015-0397-z

© Mafra et al.; licensee Springer. 2015

**Received: **30 November 2014

**Accepted: **23 May 2015

**Published: **12 June 2015

## Abstract

In this paper, a new full-duplex (FD) relaying scheme for a cooperative cognitive underlay network is proposed. The secondary network is composed of one secondary transmitter, one full-duplex secondary relay, and one secondary destination. The relay employs the selective-decode-and-forward (SDF) protocol. The secondary destination jointly decodes the signals from the secondary transmitter and the FD secondary relay so that the direct link can be seen as useful information rather than interference. The analysis includes the effect of the interference from the primary transmitter and the self-interference at the relay. Under equal power allocation strategy, closed-form expressions for the outage probability are derived for the proposed FD cooperative cognitive scheme, and the feasibility of FD relaying under cognitive constraints is shown. Our results also reveal that the proposed full-duplex joint-decoding (FDJD) cognitive network considerably outperforms the known full-duplex dual-hop (FDDH) scheme. Moreover, we propose an optimal power allocation (OPA) scheme. On the basis of the signal-to-interference-plus noise of the secondary network, the OPA strategy can choose between two modes of operation, cooperation between source and relay or source transmission only. Our results show that the FDJD scheme under the proposed OPA policy presents the best performance among all schemes investigated in this paper.

## Keywords

## 1 Introduction

With the objective of obtaining a more efficient utilization of the radio spectrum, in a cognitive radio network, the unlicensed users (also referred to as secondary users) may communicate using frequencies of the licensed spectrum [1–4]. The most practical cognitive radio protocols are interweave and underlay [1]. In the interweave protocol, the unlicensed users monitor the radio spectrum and communicate over spectrum holes without causing interference to the licensed users (primary users). Differently from the interweave protocol, in the underlay protocol, the secondary network may transmit concurrently with the primary network as long as the primary communication is not compromised. In this scenario, a maximum allowable interference level at the primary receiver is defined so that the secondary users (SUs) must take into account this threshold during the transmission in order to adjust their transmit powers. This allows a more efficient use of the frequency spectrum since the interference is limited at the primary receiver [1–4].

Recently, cooperative communications emerged as an alternative technique to boost the performance of communication systems [5, 6]. The idea behind this strategy is to make use of one or more nodes, known as relay(s), to help the communication between source and destination. The result is a virtual antenna array formed by single antenna devices. Thus, through cooperation, the same benefits obtained in multiple-input multiple-output (MIMO) systems can be achieved. The relay behavior is governed by cooperative protocols which can operate either on half-duplex (HD) or on full-duplex (FD) modes, using parallel or repetition coding, selective or incremental strategies, etc. [5, 7–9]. Specifically, in HD mode, the relay transmits and receives in orthogonal channels, whereas in FD mode, the transmission and reception are performed at the same time and at the same frequency band. Owing to this fact, HD relays require the use of additional system resources, while FD relays arise as a viable option to alleviate this problem. However, although ideal FD relaying can achieve higher capacity than HD relaying [8], its use introduces self-interference since perfect isolation between transmitted and received signals is hard to be guaranteed [8–12].

Nevertheless, the works [9–17] showed that FD is feasible even in the presence of high self-interference levels. Even though sophisticated signal processing techniques are employed at the FD node, it is unfortunate that the self-interference cannot be completely mitigated [10, 11]. Experimental results in [10] showed that with advanced signal processing together with antenna isolation techniques, self-interference can be considerably reduced but not to the noise level. Thus, residual interference still remains, and it can be modeled as a fading channel as investigated in [9, 11–17]. For instance, in [13], it is shown that FD relaying is feasible even if the relay experiences strong self-interference, while enhancing capacity when compared with HD relaying. In [14, 15], the authors compare the performance of selective and incremental cooperative HD protocols to FD cooperative protocols. The authors show that FD operation can considerably increase performance in terms of outage probability as well as throughput even in the presence of strong self-interference. More general fading settings such as Rice and Nakagami-m fading are investigated in [16, 17]. The common conclusions among [9–17] are that FD operation is feasible and that overall performance can be considerably enhanced with respect to HD relaying.

### 1.1 Cooperative cognitive networks

Motivated by the great benefits acquired through cognitive radio and cooperative techniques, several works analyzed the performance of cooperative cognitive networks under spectrum sharing constraints, as for instance [18–29]. Nevertheless, a common characteristic of these works is that all proposed schemes operate under HD mode with exception of [29]. For instance, [18] assumes an underlaid cooperative secondary network in a multi-node primary network. The authors consider that the secondary user adjusts its transmit power according to maximal interference link; however, neglecting the direct link between secondary source and destination. In [19], the authors assume that the dual-hop cooperative secondary network suffers with the primary interference and draw a discussion on how it impacts on the secondary performance.

Further, in [20], the outage probability of a dual-hop cognitive relay network under general fading setting is analyzed. Thus, assuming two different strategies to determine the transmit power of the secondary network, the authors show that the diversity order is dominated by the minimum fading severity between the two hops of the secondary network. A similar setting was investigated in [21], where the authors account for the direct link at the secondary cooperative network and show that the diversity order is solely dependent on the fading severity parameters of the secondary network. In [22], the authors ignore the direct link but include the interference of the primary network in their analysis of outage probability showing the impact on performance because of the interference from the primary network. The authors in [23] exploit the primary network retransmissions in order to increase performance of the underlaid network. The results show that cooperation at the underlaid layer considerably increases performance without harming the performance of the primary network.

In [24], the performance of a multi-relay secondary network is evaluated revealing that the diversity gain is defined by the number of available relays. Correspondingly, in [25], outage probability and ergodic capacity are evaluated constrained by the interference of the primary network. The authors show that the interference can be combated with the inclusion of more relays at the secondary network. In [26], the authors evaluate the outage probability and power allocation for a cognitive network with multiple primary transmitters and primary receivers; the secondary network is composed of a cooperative network with multiple relays, and the direct link at the secondary network is also considered. The number of primary users has a very severe impact on the performance of the proposed scheme. In [27], the outage probability is evaluated for a cognitive scenario where a relay helps the transmissions of the primary users as well as the secondary users. The results show that the outage probability decreases in comparison to schemes without cooperation in both networks. In [28], the authors evaluate two spectrally efficient schemes for a secondary cooperative network with multiple (*L*) destinations, in which the best destination is selected. Such schemes consider incremental DF relaying protocol. The proposed schemes achieve full-diversity order, being equal to *L*+1.

Even though we acknowledge the extensive contributions of the previous works [18–28], it should be emphasized that they only considered HD relays, which is spectrally inefficient due to multiplexing loss. Thus, conversely to all previous works, in [29], the authors considered a scenario in which the secondary cooperative network utilizes a FD relay subject to self-interference. In [29], after matched filtering, the interference from the primary network is assumed to be seen as an additional Gaussian noise at the secondary one. Based on such assumption, [29] carried out a closed-form outage analysis for a FD dual-hop (FDDH) relaying scheme, in which the self-interference at the relay was taken into account and the direct link was seen as interference by the secondary destination.

In [30], in a non-cognitive radio scenario, the authors evaluate the outage probability of a cooperative network, where the signal of the direct link is exploited at the secondary destination and the relay employs the selective-decode-and-forward (SDF) protocol. In [31], the authors evaluate the protocols proposed in [30], for a scenario subject to Nakagami-m fading. The proposed protocols have better performance in terms of outage probability than half-duplex and other full-duplex protocols. In [32], we evaluated the performance of the scheme proposed in [30] assuming a cooperative cognitive network operating in a spectrum sharing scenario with a FD relay subject to self-interference. However, the interference of the primary network into the secondary network was not considered in the analysis and the relay employed the fixed-decode-and-forward (FDF) protocol. Moreover, in [32], only equal power allocation (EPA) between source and relay is considered. The results show that the proposed joint-decoding full-duplex dual-hop secondary network outperforms its dual-hop full-duplex [29] and joint-decoding half-duplex counterparts, even in the presence of strong self-interference.

### 1.2 Proposed scheme and summary of contributions

In this paper, we consider a similar scenario as in [29, 32], in which the transmission through the direct link is exploited at the secondary destination and the interference of the primary network into the secondary network is taken into account. However, as in [30], the relay employs the SDF protocol. Additionally, an optimal power allocation (OPA) policy is proposed. The OPA strategy can choose between two modes of operation: (i) cooperation between source and relay or (ii) source transmission only. The proposed scheme, named as FD joint-decoding (FDJD) relaying, is compared with the FDDH scheme presented in [29] as well as with the standard HD relaying scheme. Closed-form expressions for the outage probability under EPA are derived and insightful discussions are drawn. Monte Carlo simulations are also presented in order to corroborate the proposed analysis.

Another contribution of this paper is to show that the proposed FDJD relaying scheme can considerably outperform the method proposed in [29] for the whole signal-to-noise ratio (SNR) range. Our results also show that the proposed FDJD method performs better than the HD scheme even in the presence of strong self-interference.

The remainder of this paper is organized as follows: Section 2 introduces the system model, while in Section 3, an analytical performance analysis of the proposed scheme is carried out in terms of outage probability. In Section 4, an OPA strategy is introduced for the FDJD scheme. In Section 5, representative numerical results are provided and insightful discussions are drawn. Finally, Section 6 concludes the paper.

#### 1.2.1 1.2.1 Notations and functions

Mathematical expectation is denoted by E[·]; Pr[·] stands for probability; *f*
_{
W
}(·) and *F*
_{
W
}(·) represent the probability density function (PDF) and cumulative distribution function (CDF) of a given random variable (RV) *W*, respectively.

## 2 System model

### 2.1 Network model

*T*

_{ s }(source), one FD secondary relay

*r*, one secondary destination

*D*

_{ s }(destination), one primary transmitter

*T*

_{ p }, and one primary destination

*D*

_{ p }, as depicted in Fig. 1. The cognitive network operates in a spectrum sharing environment, where the secondary users are able to transmit their messages, if the interference on the primary network is below a certain threshold

*I*

_{ th }[1–3]. The transmit power constraints will be detailed later.

### 2.2 Relay operation

The main motivation behind FD schemes is the potential to overcome the spectral inefficiency of the HD ones, since the whole communication process occurs within one time slot. Nevertheless, such great potential comes at a price of self-interference, since it is a strenuous task to isolate transmit and received powers [10, 11]. In the last few years, great efforts have been done on the mitigation of the self-interference [9–11]; however, these works also show that self-interference cannot be completely removed but considerably attenuated—even though employing sophisticated schemes of interference cancelation. Thus, there remains residual self-interference at the relay, that is modeled as a fading channel which, by its turn, allows the emulation of various (non)line-of-sight configurations arising from antenna isolation and interference cancelation techniques [9, 10, 15–17].

In FD mode, conversely to the HD schemes, the relay receives and transmits simultaneously in the same frequency band [8]. Thus, in a first phase—known as broadcast phase (BC)—the source broadcasts its message to the relay as well as to the destination. Simultaneously, the relay starts the decode-and-forward process—known as multiple access phase (MAC). In this second phase, the destination receives both signals from source and relay as in a multiple access channel [8].

#### 2.2.1 2.2.1 Encoding/decoding

We rely on a variation of the DF scheme initially proposed in [33] and later extended to fading scenarios [8, 15]. The DF protocol proposed in [33] is based on a combination of block Markov encoding at source and relay, associated with coding for cooperative multiple access channel and superposition coding [8, 33]. As pointed out in [8], the same achievable rates for the DF protocol proposed in [33]—named irregular encoding/successive decoding [8]—can be achieved through different strategies: regular encoding/sliding-window decoding [34] and regular encoding/backward decoding [30, 35]. As indicated in [8], the latter is more suitable for quasi-static fading channels.

*L*blocks. Notice that

*x*denotes the message sent by the source, while \(\tilde {x}\) is the re-encoded message at the relay. There is a delay between source and relay transmission—which we assume to be of one block in this work. We recall that the backward decoding scheme is generalized in [30] for any number of delayed and total number of blocks. In that work, it is shown that performance is not affected as long as the ratio between delay and number of blocks is small.

#### 2.2.2 2.2.2 Selective-decode-and-forward

In [30], the authors extended the traditional DF protocol to its variant, in which the relay only forwards the message if correctly decoded—such variant is named SDF, and is well known in the literature for the HD case [5]. Hereafter, we assume that the relay employs the SDF in FD mode. Further details are given later in Section 3.1.

### 2.3 Channel model

*t*, the received signals at the secondary relay and at the secondary destination are, respectively,

where *P*
_{
i
} represents the transmit power, and indexes *i*∈{*p*,*s*,*r*} and *j*∈{*r*,*s*,*p*} represent the transmitter/receivers, with *p* denoting the primary transmitter or receiver, *s* the secondary transmitter or receiver, and *r* the relay. Note that *x*[*t*] is the message sent by the source, and \(\tilde {x} \triangleq x[t-D]\) is the message sent by *r* after a processing delay *D*. Additionally, *x*
_{
p
}[*t*] is the message sent by *T*
_{
p
}, and \(n_{j}[t] \sim \mathcal {CN}(0,{\sigma ^{2}_{n}})\) stands for the complex additive white Gaussian noise at node *j* with variance \({\sigma ^{2}_{n}}=N_{0}\), where *N*
_{0} is the one-sided noise power spectral density. We assume hereafter to be *D*=1. The quasi-static fading channels are denoted by *h*
_{
ij
}, and all channels undergo independent, identically distributed (i.i.d.) circularly symmetric complex Gaussian distribution with zero mean and variances *σ*
_{
ij
}. The average fading power is \(\lambda _{\textit {ij}} \triangleq \mathbb {E}\left [|h_{\textit {ij}}|^{2}\right ] \triangleq d_{\textit {ij}}^{-\nu } \, \sigma _{\textit {ij}}\), where *d*
_{
ij
} represents the distance between nodes *i* and *j*, and *υ* is the path-loss exponent (*υ*≥2). Moreover, as aforementioned, the residual self-interference is modeled as a fading channel such that \(h_{\textit {rr}} \thicksim \mathcal {CN}(0\,,\, \sigma _{\textit {rr}})\), with average fading power \(\lambda _{\textit {rr}} \triangleq P_{r}\, \delta \, \sigma _{\textit {rr}}\), where *δ* represents the interference cancelation factor which arises from the association of antenna cancelation and interference cancelation techniques. Hereafter, for simplicity of notation, let us define \(g_{\textit {ij}} \doteq \left | h_{\textit {ij}} \right |^{2}\).

As aforementioned, the message is divided into *L* blocks, as shown in Fig. 2. Note that after the destination receives the *L*-th block from the relay, the destination is able to perform backward decoding and jointly decode the messages from source and relay [8, 30]. As pointed out in [12], this delay is large enough to guarantee that the simultaneously received signals are uncorrelated, and therefore can be jointly decoded.

Inspired by [29], after matched filtering, we can approximate the interference from the primary network by an additional noise, whose variance depend solely on the channel statistics of the primary network [29]—which can be estimated by the secondary network. This is a common assumption in the literature, as can be seen in [36–39]. Keeping this in mind, we can consider the primary interference as having a Gaussian distribution with zero mean and variance \(\sigma ^{2}_{\textit {pr}}= P_{p}\lambda _{\textit {pr}}\) at the relay and variance \(\sigma ^{2}_{\textit {ps}} = P_{p}\lambda _{\textit {ps}}\) at the destination. Then, according to ([29], Eq. 7), the overall Gaussian noise variance at the destination including the effect of the interference from the primary transmitter is \({\sigma ^{2}_{s}}={\sigma ^{2}_{n}}+\sigma ^{2}_{\textit {ps}}\), while at relay, we have \({\sigma ^{2}_{r}}={\sigma ^{2}_{n}}+\sigma ^{2}_{\textit {pr}}\).

#### 2.3.1 2.3.1 Spectrum sharing environment

*I*

_{ th }. Since a FD relay is employed, the secondary transmitter and the secondary relay transmit their messages simultaneously, which means that primary destination receives interference from both secondary transmitters at the same time. Bearing this in mind, the transmission power of the secondary transmitter and the secondary relay must be constrained as [29]:

*I*

_{ th }. Thus, the secondary transmitter and the secondary relay have their transmit powers limited, respectively, by [29]:

## 3 Outage probability analysis

In this section, we present the outage probability analysis, but first, let us define the attempted transmission rate and outage probability as follows.

###
**Definition**
**1**.

**Attempted transmission rate**: the transmission rate in bits/s/Hz, which is denoted by.

###
**Definition**
**2**.

**Outage probability**: the probability of a failure in the communication between nodes

*i*and

*j*[40], so that an outage can be defined as the event that the mutual information between nodes

*i*and

*j*, \(\mathcal {I}_{\textit {ij}}\), is lower than the attempted transmission rate [40]. Assuming unitary bandwidth and Gaussian inputs, the outage probability is [40],

Next, we introduce the proposed protocol—FDJD. We also include the outage formulations for the cases of the FDDH and HD schemes, which are already known [14, 15, 29] and are used as benchmarks for the proposed scheme. The derivations are included for the sake of completeness.

### 3.1 Full-duplex joint-decoding (FDJD)

The proposed cooperative communication scheme—FDJD—relies on the help of a FD relay such that the direct link is seen as useful information rather than interference at the destination. Thus, when the source-relay link is in outage, the message can still be successfully received through the direct link. Note that in the FDDH scheme [29], the direct link is never seen as useful information, but as interference at the destination. In the FDJD scheme, the direct link can be seen as useful information because we assume a more elaborated transmission scheme, as detailed in [30, 31] which makes use of backward decoding, that is superior than the one used in FDDH scheme [29].

First, the source broadcasts its message to relay and destination. Then, after a processing delay *D*, during the multiple access phase, the relay forwards the received message to the destination. Note that if the source-relay link is in outage, then the relay remains silent; otherwise, it forwards the message to the destination. By its turn, the destination jointly decodes the signals received from source and relay [8, 15, 17, 30], which is an iterative process dependent of block decoding [8, 30]—whose purposed is to combine the transmissions from source and relay—using advanced detection techniques and the acquired knowledge from previously received frames [30]. Additionally, based on [30] and in order to make a fair comparison with the schemes FDDH [29] and HD [5], we set *D*=1. In other words, there is a delay of one block among the messages sent by the secondary transmitter and the relay. Recall that small delays do not affect the overall performance of the FD protocol for a large *L* [8, 30].

Next, we assess the overall mutual information of the FD scheme in the following lemma.

###
**Lemma**
**1**.

###
*Proof*.

Under the SDF protocol, the transmission rate is maximized accordingly to the direct link or to the cooperative link as introduced in [5] for the HD schemes. Under FD mode, the authors in [30] show that the mutual information can be written in similar fashion when backward decoding is applied.

Note that in (9), the signals coming from source and relay are seen as useful information by the destination. Moreover, also note that the self-interference at the relay is taken into account in (7). Next, given Definition 2, the overall outage probability of the FDJD scheme is given as follows.

###
**Theorem**
**1**.

###
*Proof*.

All RVs are i.i.d., which allows us to write the overall outage probability as a function of the outage probabilities of the individual links. Moreover, from [15, 30], we know that the outage event from the backward decoding of source and relay messages can be represented by \(\mathcal {O}^{\text {JD}}_{\textit {rs}}\), which includes the joint-decoding processes at the destination.

In order to assess (10) in Theorem 1, we investigate next the outage probability of the individual links.

###
**Lemma**
**2**.

where \(\epsilon = 2^{\mathcal {R}}-1\) and \(\mu _{s}=I_{\textit {th}}/(2 {\sigma ^{2}_{s}})\).

###
*Proof*.

*Z*

_{ kl }as

*Z*

_{ kl }=

*g*

_{ kl }/

*g*

_{ kp }, with

*k*={

*s*,

*r*} and

*l*={

*s*,

*r*} whose PDF and CDF are given in Appendix 1. Let us also define

*W*=

*Z*

_{ ss }+

*Z*

_{ rs }whose PDF

*f*

_{ W }(

*w*) and CDF

*F*

_{ W }(

*w*) are introduced in Appendix 2. Bearing this in mind, the outage probability of the link between relay and destination can be written as

Thus, after a few algebraic manipulations into (15), we attain (11), which concludes the proof.

where \(\epsilon =2^{\mathcal {R}}-1\) and \(\mu _{r}=I_{\textit {th}} \,/\, 2 {\sigma ^{2}_{r}}\).

###
**Remark**
**1**.

With the objective of obtaining a more general approach, we consider, differently of [29], that the channel between the source and the relay has average fading power *λ*
_{
sr
} different of one.

where \(\epsilon = 2^{\mathcal {R}}-1\) and \(\mu _{s}=I_{\textit {th}}/\left (2 {\sigma ^{2}_{s}}\right)\).

Finally, the overall outage probability of the FDJD scheme can be attained by plugging (11), (16), and (18) into (10).

### 3.2 Full-duplex dual hop (FDDH)

Differently from the proposed FDJD scheme, in the FDDH scheme, the direct link is seen as interference at the destination [29].

Additionally, \(\mathcal {O}^{\text {DH}}_{\textit {sr}} = \Pr \left [ \mathcal {I}^{\text {DH}}_{\textit {sr}} < \mathcal {R} \right ]\) is written as in (16). Notice that \(\mathcal {O}^{\text {DH}}_{\textit {rs}} = \Pr \left [ \mathcal { I}^{\text {DH}}_{\textit {rs}} < \mathcal {R}\right ]\) is also given as in (16) but with the following substitutions: *λ*
_{
rr
} by *λ*
_{
ss
}, *λ*
_{
sr
} by *λ*
_{
rs
}, *λ*
_{
sp
} by *λ*
_{
rp
}, and *λ*
_{
rp
} by *λ*
_{
sp
}.

### 3.3 Half-duplex (HD)

Differently from FD schemes, in the HD mode, the secondary transmissions occur within two time slots according to the SDF protocol [5], therefore incurring in multiplexing loss. In the first time slot, the source broadcasts its message, while in the second time slot, the relay acts only if the source message was decoded free of error. Thus, at the destination, both messages are combined and jointly decoded—which can be seen as maximal ratio combining [5].

*ε*by

*ε*. The outage probability of the source-relay link can be expressed as [41]

while the outage probability of the source-destination link is given by (24), but replacing *μ*
_{
r
} by *μ*
_{
s
} and *λ*
_{
sr
} by *λ*
_{
ss
}, with \(\varepsilon =2^{2\mathcal {R}}-1\).

## 4 Power allocation policies

In this section, we propose an OPA for the proposed FDJD cognitive network. We consider that in an OPA policy, the secondary nodes may obtain the information of the channels to the primary network by direct feedback from the primary receiver [3].

Moreover, we recall that under the FDJD scheme, the direct link is seen as a useful source of information, and therefore the proposed power allocation strategy can choose between two modes of operation: (i) cooperation between source and relay or (ii) source transmission only.

where *γ*
_{
coop
}= min{*γ*
_{
sr
}, *γ*
_{
JD
}} is the SINR when the cooperation is favorable. In this case, *γ*
_{
JD
} is the SINR of the virtual link between source, relay, and destination as seen at the destination after joint-decoding.

### 4.1 OPA policy for FDJD relaying

- 1.
The relay cooperates with the secondary transmission and the destination jointly decodes the signals from source and relay. For the cooperative case, the maximum of

*γ*_{ coop }occurs when the links between source and relay, and the virtual link between source, relay, and destination present the same achievable rate. If one of the links works with greater achievable rate than the other, there is an excess of the SINR in one of the links and consequently a waste of power that could be allocated to increase the achievable rate of the weaker link. In order to ensure that two links achieve the same rate, we must enforce that the SINRs seen at the relay and at the destination are equal. We consider that the channels remain constant for at least*L*+*D*time slots, to ensure the optimal power allocation. - 2.
If the equivalent SINR with the two links working with the same capacity is lower than the SINR when the source communicates with the destination without the help of the relay, the secondary source transmits the message without the help of the relay. In this case, the whole available power is allocated to the source and the relay is momentarily put in idle mode.

*γ*

_{ sr },

*γ*

_{ ss }, and

*γ*

_{ JD }, as

where \(P_{r}^{\star }\) and \(P_{s}^{\star }\), respectively, are the optimal transmit powers for the relay and the secondary transmitter when the cooperation is favorable. The transmit power for the secondary transmitter when the relay is turned off is represented by \(P_{s}^{\star ss}\). We recall that after the whitening filter, the noise powers at source and relay are, respectively, \({\sigma ^{2}_{s}}={\sigma ^{2}_{n}}+\sigma ^{2}_{\textit {ps}}\) and \({\sigma ^{2}_{r}}={\sigma ^{2}_{n}}+\sigma ^{2}_{\textit {pr}}\).

In the following, we introduce a procedure that calculates the OPA for the FDJD scheme as shown by Algorithm 1. Notice that the relay is put in idle mode if direct transmission is more favorable. Moreover, by Algorithm 1, we observe that first, the transmit powers assuming cooperative and non-cooperative transmissions are calculated, and then the SINRs \({\gamma }^{}_{\textit {coop}}\) and \({\gamma }^{}_{\textit {ss}}\) are compared.

###
**Theorem**
**2**.

###
*Proof*.

Isolating \(P_{r}^{\star }\) from (30) and putting it into (29), we attain a quadratic equation, whose roots give (31). Once \(P_{s}^{\star }\) is attained, we readily obtain (32) from (30).

On the other hand, when the cooperation is not favorable such that \({\gamma }^{}_{\textit {coop}}<{\gamma }^{}_{\textit {ss}}\) or \(P_{s}^{\star } < 0\) or \(P_{r}^{\star } < 0\), the relay is turned off, remaining idle until the next time slot when the process is repeated.

Further, once the optimal transmit powers is attained, we can assess the outage probability under OPA policy as follows.

###
**Theorem**
**3**.

###
*Proof*.

where \({\gamma }^{}_{\textit {ss}}\) is given in (26).

### 4.2 OPA policy for FDDH relaying

## 5 Numerical results and discussions

In this section, some numerical representative results along with insightful discussions regarding the performance of the proposed scheme are presented. Unless stated otherwise, for the plots we assume—without loss of generality—path-loss model \(d_{\textit {ij}}^{-\upsilon }\) with exponent *υ*=4, where \(d_{\textit {sr}}=\frac {1}{4}, d_{\textit {sp}}=1, d_{\textit {ss}}=\frac {1}{2}, d_{\textit {rs}}=\frac {1}{4}, d_{\textit {rp}}=1\), *σ*
_{
rr
}=1, *δ*=−40 dB, \(\mathcal {R}=4\) bpcu, *P*
_{
p
}=10 dB, and *N*
_{0}=1. We also consider that the relay is positioned in a straight line between source and destination.

*I*

_{ th }imposed by the primary network. We also account for different levels of self-interference

*δ*∈{0,−10,−20,−60} dB, and assume

*P*

_{ p }=5 dB and \(\mathcal {R}_{s}=6\) bpcu. Monte Carlo simulations regarding the EPA policy are represented by red circles. Notice that the simulations agree very well with the analytic results. Moreover, as we can see from Fig. 3, FD relaying is feasible once the performance increases with the increase of the quality of the interference cancelation at the relay, which is reflected in low values for

*δ*.

*I*

_{ th }such that the proposed schemes are compared to FDDH [29], considering EPA and OPA, and to the half-duplex HD method. The proposed EPA FDJD scheme outperforms even the OPA FDDH proposed by [29]. Such performance gain comes from the additional diversity seen by the destination because the direct link is seen as useful information rather than interference. Furthermore, the proposed OPA FDJD has the best performance among all schemes, and we observe a larger diversity gain in comparison with FDDH.

*I*

_{ th }. Moreover, the proposed OPA FDJD has the best performance among all schemes for the whole \(\mathcal {R}\) range, which means that under OPA policy, the FDJD protocol can operate at a much higher rate given an outage probability threshold.

*d*

_{ sp }=1,

*d*

_{ rp }=1,

*d*

_{ pr }=1,

*d*

_{ ps }=1, \(\mathcal {R}=4\) bpcu,

*P*

_{ p }=10 dB, and

*δ*=−40 dB. On the other hand, Fig. 7 considers the relay near the secondary destination. In this case, \(d_{\textit {sr}}=\frac {3}{8}, d_{\textit {ss}}=\frac {1}{2}, d_{\textit {rs}}=\frac {1}{8}\). From the figures, we can see that regardless of the relay positioning, the proposed FDJD scheme has the best performance among all the schemes considered.

*P*

_{ p }. We consider \(d_{\textit {sr}}=\frac {1}{4}, d_{\textit {ss}}=\frac {1}{2}, d_{\textit {rs}}=\frac {1}{4}\),

*d*

_{ sp }=1,

*d*

_{ rp }=1,

*d*

_{ pr }=1,

*d*

_{ ps }=1, \(\mathcal {R}=4\) bpcu,

*I*

_{ th }=10 dB, and

*δ*=−40 dB. From the figure, we can see that the OPA FDJD scheme outperforms the others schemes, even though suffering strong interference from the primary network.

*I*

_{ th }for three different positions of the relay: (a) exactly in between the secondary transmitter and destination \(\left (d_{\textit {sr}}=\frac {1}{4}, d_{\textit {ss}}=\frac {1}{2}, d_{\textit {rs}}=\frac {1}{4}\right)\); (b) near to secondary transmitter \(\left (d_{\textit {sr}}=\frac {1}{8}, d_{\textit {ss}}=\frac {1}{2}, d_{\textit {rs}}=\frac {3}{8}\right)\); and (c) near to secondary destination \(\left (d_{\textit {sr}}=\frac {3}{8}, d_{\textit {ss}}=\frac {1}{2}, d_{\textit {rs}}=\frac {1}{8}\right)\). In (a), the FDJD scheme allocates more power for the secondary transmitter than for the relay. Recall that in FDJD, the direct link is seen as a useful source of information and also the relay can be put in idle mode, differently from the FDDH scheme where the relay is always fully operational. This also explains the fact that under the FDDH protocol, more power is allocated to the relay than to the source. While in (b), the OPA FDJD scheme allocates more power for the relay than in (a); once in this case, cooperation is preferred over direct transmission because the relay is closer to the source. We recall that the source-relay link is the bottleneck of cooperative relaying schemes; since the source and relay are closer, less outage events may occur which turns cooperation favorable. Next, in (c) and conversely to (b), the OPA FDJD strategy allocates more power for the secondary transmitter than the relay because the SINR

*γ*

_{ coop }is similar to the SINR of the direct link.

### 5.1 Throughput analysis

In this subsection, the spectrum efficiency of the full-duplex schemes are compared. The throughput of the full-duplex scheme sch∈ {EPA FDDH, OPA FDDH, EPA FDJD, OPA FDJD} (*T*
_{
sch
}) is given by \(T_{\mathsf {sch}}=\mathcal {R}(1-\mathcal {O}_{\mathsf {sch}})\), where the outage probabilities of EPA and OPA FDJD schemes are given by (10) and (37), while the outage probabilities for EPA and OPA FDDH schemes are written as in (20) and (48).

*T*

_{ sch }as a function of the primary interference threshold

*I*

_{ th }for the FDJD and FDDH schemes, with \(\mathcal {R}=4\) bpcu,

*P*

_{ p }=10 dB, and

*δ*=−40 dB. From this figure, we can see that the proposed FDJD scheme has the best performance. Furthermore, the throughput of EPA DH saturates for

*I*

_{ th }>20 dB. This is caused by the increment of the self-interference at the relay and the interference of the direct link. Notice that even though suffering similar self-interference levels as the EPA DH, both JD protocols are able to decrease the effects of the self-interference.

## 6 Conclusions

This paper proposes a new FD scheme for a cognitive underlay network subject to self-interference as well as primary interference. The secondary destination jointly decodes the signals from the secondary transmitter and the relay—which differs from other works proposed in the literature where the direct link is seen as interference rather than useful information. We introduced new closed-form expressions for the outage probability of the proposed FD cooperative cognitive network under EPA policy. We first evaluated the FD schemes under EPA policy and show the feasibility of FD relaying under cognitive constraints. Our results showed that the proposed FDJD scheme considerably outperforms the known FDDH scheme and can operate at a much higher rate regime than other schemes. We propose a new optimal power allocation policy for the FDJD scheme. The OPA strategy can choose between two modes of operation, cooperation between source and relay or source transmission only. Our results show that the FDJD scheme under the proposed OPA policy presents the best performance among all schemes investigated in this paper.

## 7 Appendices

## 8 Appendix 1: PDF and CDF of *Z*
_{
kl
}

Let *Z*
_{
kl
} be a RV defined as *Z*
_{
kl
}=*g*
_{
kl
} / *g*
_{
kp
}, where \(g_{\textit {ij}} \thicksim \mathsf {Exp}(\lambda _{\textit {ij}})\) and *k*={*s*,*r*} and *l*={*s*,*r*}. Then, based on standard statistical methods [42], we readily attain the PDF of *Z*
_{
kl
} as \(f_{Z_{\textit {kl}}}(z_{\textit {kl}}) = \lambda _{\textit {kl}}\lambda _{\textit {kp}} \,/\, \left (\lambda _{\textit {kl}} + \lambda _{\textit {kp}} \, z_{\textit {kl}}\right)^{2}\), while the CDF \(F_{Z_{\textit {kl}}}(z_{\textit {kl}}) =1 - \lambda _{\textit {kl}} \,/\, \left (\lambda _{\textit {kl}} + \lambda _{\textit {kp}} \, z_{\textit {kl}}\right)\).

## 9 Appendix 2: PDF and CDF of W

*W*=

*Z*

_{ ss }+

*Z*

_{ sr }and \(f_{Z_{\textit {kl}}}(z_{\textit {kl}}) = \frac {\lambda _{\textit {kl}}\lambda _{\textit {kp}}}{\left (\lambda _{\textit {kl}} + \lambda _{\textit {kp}} z_{\textit {kl}}\right)^{2}}\) [29]. Thus, the PDF

*f*

_{ W }(

*w*) is attained, with the help of ([43] Eq.(2.154), (2.155)), as

while the CDF *F*
_{
W
}(*w*) is obtained by integrating (49) from 0 to \(\frac {\epsilon }{\mu _{s}}\), which results in (11).

## Declarations

### Acknowledgements

This work was partially supported by the University of Oulu Graduate School, Infotech Oulu Graduate School, Academy of Finland, Araucaria Foundation (Brazil), CAPES (Brazil), and CNPq (Brazil).

## Authors’ Affiliations

## References

- A Goldsmith, SA Jafar, I Maric, S Srinivasa, Breaking spectrum gridlock with cognitive radios: an information theoretic perspective. Proc. IEEE. 97(5), 894–914 (2009).View ArticleGoogle Scholar
- S Srinivasa, SA Jafar, The throughput potential of cognitive radio: a theoretical perspective. IEEE Commun. Mag. 45(5), 73–79 (2007).View ArticleGoogle Scholar
- A Ghasemi, ES Sousa, Fundamental limits of spectrum-sharing in fading environments. IEEE Trans. Wireless Commun. 6(2), 649–658 (2007).View ArticleGoogle Scholar
- L Lu, X Zhou, U Onunkwo, G Li, Ten years of research in spectrum sensing and sharing in cognitive radio. EURASIP J. Wirel. Commun. Netw. 2012(1), 28 (2012).View ArticleGoogle Scholar
- JN Laneman, DNC Tse, GW Wornell, Cooperative diversity in wireless networks: efficient protocols and outage behavior. IEEE Trans. Inf. Theory. 50(12), 3062–3080 (2004).MATHMathSciNetView ArticleGoogle Scholar
- A Nosratinia, TE Hunter, A Hedayat, Cooperative communication in wireless networks. IEEE Commun. Mag. 42(10), 74–80 (2004).View ArticleGoogle Scholar
- H Alves, R Souza, G Fraidenraich, M Pellenz, Throughput performance of parallel and repetition coding in incremental decode-and-forward relaying. Wirel. Netw. 18(8), 881–892 (2012).View ArticleGoogle Scholar
- G Kramer, M Gastpar, P Gupta, Cooperative strategies and capacity theorems for relay networks. IEEE Trans. Inf. Theory. 51(9), 3037–3063 (2005).MATHMathSciNetView ArticleGoogle Scholar
- T Kwon, S Lim, S Choi, D Hong, Optimal duplex mode for df relay in terms of the outage probability. IEEE Trans. Veh. Technol. 59(7), 3628–3634 (2010).View ArticleGoogle Scholar
- M Duarte, C Dick, A Sabharwal, Experiment-driven characterization of full-duplex wireless systems. IEEE Trans. Wireless Commun. 11(12), 4296–4307 (2012).View ArticleGoogle Scholar
- T Riihonen, S Werner, R Wichman, Mitigation of loopback self-interference in full-duplex mimo relays. IEEE Trans. Signal Process. 59(12), 5983–5993 (2011).MathSciNetView ArticleGoogle Scholar
- T Riihonen, S Werner, R Wichman, Hybrid full-duplex/half-duplex relaying with transmit power adaptation. IEEE Trans. Wireless Commun. 10(9), 3074–3085 (2011).View ArticleGoogle Scholar
- T Riihonen, S Werner, R Wichman, Optimized gain control for single-frequency relaying with loop interference. IEEE Trans. Wireless Commun. 8(6), 2801–2806 (2009).View ArticleGoogle Scholar
- H Alves, G Fraidenraich, RD Souza, M Bennis, M Latva-aho, in
*Wireless Communications and Networking Conference (WCNC), 2012 IEEE*. Performance analysis of full duplex and selective and incremental half duplex relaying schemes (Paris, France, 2012), pp. 771–775. doi:10.1109/WCNC.2012.6214475. - H Alves, RD Souza, G Fraidenraich, Outage, throughput and energy efficiency analysis of some half and full duplex cooperative relaying schemes. Trans. Emerg. Telecommun. Technol. 25(11), 1114–1125 (2014).View ArticleGoogle Scholar
- Y Zhu, Y Xin, P-Y Kam, Outage probability of rician fading relay channels. IEEE Trans. Veh. Technol. 57(4), 2648–2652 (2008).View ArticleGoogle Scholar
- H Alves, D Benevides da Costa, RD Souza, M Latva-aho, Performance of block-markov full duplex relaying with self interference in nakagami-m fading. IEEE Wireless Commun. Lett. 2(3), 311–314 (2013).View ArticleGoogle Scholar
- TQ Duong, PL Yeoh, VNQ Bao, M Elkashlan, N Yang, Cognitive relay networks with multiple primary transceivers under spectrum-sharing. IEEE Signal Process. Lett. 19(11), 741–744 (2012).View ArticleGoogle Scholar
- TQ Duong, VNQ Bao, H Tran, GC Alexandropoulos, H-J Zepernick, Effect of primary network on performance of spectrum sharing AF relaying. Electron. Lett. 48(1), 25–27 (2012).View ArticleGoogle Scholar
- TQ Duong, D Benevides da Costa, M Elkashlan, VNQ Bao, Cognitive amplify-and-forward relay networks over nakagami-m fading. IEEE Trans. Veh. Technol. 61(5), 2368–2374 (2012).View ArticleGoogle Scholar
- TQ Duong, D Benevides da Costa, TA Tsiftsis, C Zhong, A Nallanathan, Outage and diversity of cognitive relaying systems under spectrum sharing environments in nakagami-m fading. IEEE Commun. Lett. 16(12), 2075–2078 (2012).View ArticleGoogle Scholar
- W Xu, J Zhang, P Zhang, C Tellambura, Outage probability of decode-and-forward cognitive relay in presence of primary user’s interference. IEEE Commun. Lett. 16(8), 1252–1255 (2012).View ArticleGoogle Scholar
- S Mafra, R Souza, J Rebelatto, E Fernandez, H Alves, Cooperative overlay secondary transmissions exploiting primary retransmissions. EURASIP J. Wirel. Commun. Netw. 2013(1), 196 (2013).View ArticleGoogle Scholar
- VNQ Bao, TQ Duong, D Benevides da Costa, GC Alexandropoulos, A Nallanathan, Cognitive amplify-and-forward relaying with best relay selection in non-identical rayleigh fading. IEEE Commun. Lett. 17(3), 475–478 (2013).View ArticleGoogle Scholar
- J Si, Z Li, H Huang, J Chen, R Gao, Capacity analysis of cognitive relay networks with the PU’s interference. IEEE Commun. Lett. 16(12), 2020–2023 (2012).View ArticleGoogle Scholar
- X Jia, M Zhou, X Dang, L Yang, H Zhu, Adaptive power allocation and outage performance of cognitive best relay cooperation systems with multiple primary transceiver pairs and direct path between cognitive source and destination. EURASIP J. Wirel. Commun. Netw. 2014(1), 122 (2014).View ArticleGoogle Scholar
- F Zhao, X Sun, H Chen, R Bie, Outage performance of relay-assisted primary and secondary transmissions in cognitive relay networks. EURASIP J. Wirel. Commun. Netw. 2014(1), 60 (2014).View ArticleGoogle Scholar
- EE Benitez Olivo, DP Moya Osorio, DB Costa da, JC Silveira Santos Filho, Outage performance of spectrally efficient schemes for multiuser cognitive relaying networks with underlay spectrum sharing. IEEE Trans. Wireless Commun. 13(12), 6629–6642 (2014). doi:10.1109/TWC.2014.2360204.View ArticleGoogle Scholar
- H Kim, S Lim, H Wang, D Hong, Optimal power allocation and outage analysis for cognitive full duplex relay systems. IEEE Trans. Wireless Commun. 11(10), 3754–3765 (2012).View ArticleGoogle Scholar
- M Khafagy, A Ismail, M-S Alouini, S Aissa, On the outage performance of full-duplex selective decode-and-forward relaying. IEEE Commun. Lett. 17(6), 1180–1183 (2013).View ArticleGoogle Scholar
- MG Khafagy, A Tammam, M Alouini, S Aissa, Efficient cooperative protocols for full-duplex relaying over nakagami-m fading channels. IEEE Trans. Wireless Commun. (2015). doi:10.1109/TWC.2015.2406712.
- S Mafra, H Alves, RD Souza, D Benevides da Costa, E Fernandez, M Latva-aho, in 31st Brazilian Telecommunications Symposium - SBrT’13. On the performance of cognitive full-duplex relaying systems under spectrum sharing constraints (Fortaleza, Brazil, 2013).Google Scholar
- T Cover, AE Gamal, Capacity theorems for the relay channel. IEEE Trans. Inf. Theory. 25(5), 572–584 (1979).MATHView ArticleGoogle Scholar
- A Carleial, Multiple-access channels with different generalized feedback signals. IEEE Trans. Inf. Theory. 28(6), 841–850 (1982).MATHView ArticleGoogle Scholar
- C-M Zeng, F Kuhlmann, A Buzo, Achievability proof of some multiuser channel coding theorems using backward decoding. IEEE Trans. Inf. Theory. 35(6), 1160–1165 (1989).MATHMathSciNetView ArticleGoogle Scholar
- A Jovicic, P Viswanath, Cognitive radio: an information-theoretic perspective. IEEE Trans. Inf. Theory. 55(9), 3945–3958 (2009).MathSciNetView ArticleGoogle Scholar
- E Pei, S Wang, Z Zhang, Capacity and optimal power allocation for spectrum-sharing with primary transmission consideration in fading channels. IEEE Commun. Lett. 15(4), 389–391 (2011).View ArticleGoogle Scholar
- X Gong, SA Vorobyov, C Tellambura, Optimal bandwidth and power allocation for sum ergodic capacity under fading channels in cognitive radio networks. IEEE Trans. Signal Process. 59(4), 1814–1826 (2011).MathSciNetView ArticleGoogle Scholar
- A Punchihewa, VK Bhargava, C Despins, Capacity and power allocation for cognitive mac with imperfect channel estimation. IEEE Trans. Wireless Commun. 10(12), 4001–4007 (2011).View ArticleGoogle Scholar
- G Caire, D Tuninetti, The throughput of hybrid-arq protocols for the gaussian collision channel. IEEE Trans. Inf. Theory. 47(5), 1971–1988 (2001).MATHMathSciNetView ArticleGoogle Scholar
- VNQ Bao, DH Bac, in
*ICT Convergence (ICTC), 2011 International Conference On*. A unified framework for performance analysis of df cognitive relay networks under interference constraints (Seoul, South Korea, 2011), pp. 537–542. doi:10.1109/ICTC.2011.6082656. - A Papoulis, SU Pillai,
*Probability, Random Variables, and Stochastic Processes*(Tata McGraw-Hill, New York, 2002).Google Scholar - IS Gradshteyn, IM Ryzhik,
*Table of Integrals, Series, and Products, Fifth Edition*(Academic Press, New-York, 2007).Google Scholar

## Copyright

This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly credited.