Abstract
In this paper, considering the interferences from primary transmitter to secondary receiver and from secondary transmitter to primary receiver, we derive the upper and lower bounds of outage probability for underlay cognitive opportunistic multi-relay networks. Theoretical and simulation results show the upper and lower bounds converge to the exact outage probability at high interference-to-noise (INR) region. Because the interference from primary transmitter to secondary receiver is considered, an outage floor at high signal-to-noise ratio (SNR) occurs when INR increases proportionally with SNR.
Similar content being viewed by others
Avoid common mistakes on your manuscript.
1 Introduction
Cognitive radio is considered as an efficient technology to solve the spectrum scarcity problem. In cognitive radio, the secondary users (SUs) and primary users (PUs) can share the spectrum with underlay or overlay model [1, 2]. In underlay model, the SU is allowed to transmit concurrently with the PU provided that the cochannel interference from SU to PU is below a tolerable threshold. Due to the interference power constraint and the wireless channel fading, the quality of service (QoS) of the SU cannot be guaranteed. To improve the performance of SU, cognitive relay networks which provide extra spatial diversity [3, 4] for the SU has been proposed in [5–13].
In [7] and [8], considering the dependence introduced by the interference power constraint, a tight lower bound and the exact outage probability (OP) are derived for decode-and-forward (DF) underlay cognitive relay networks, respectively. In [9] and [10], a closed-form OP of amplify-and-forward (AF) cognitive relay networks is obtained under average and maximum interference power constraint, respectively. In [11], a tight approximate OP is derived for AF cognitive two-way relay networks. However, the interference from primary transmitter to secondary receiver is not considered in the above mentioned literatures. In fact, when the secondary receiver is near to the primary transmitter, the cochannel interference from the primary transmitter may be too strong to be ignored.
Recently, the effect of PU interference on the secondary AF and DF cognitive radio networks has been investigated in [12] and [13], respectively, assuming that only single relay is involved and direct link is not available. However, multi-relay networks are more general in practical situation and direct link should be considered in some scenario. In this paper, considering the interferences from primary transmitter to secondary receiver and from secondary transmitter to primary receiver, the maximum transmit power constraint of SU, and the dependence introduced due to interference power constraint, we derive the upper and lower bound expressions of the OP for the underlay cognitive opportunistic multi-relay networks with direct link. The opportunistic relaying scheme [14, 15], where only the “best” relay is selected to forward message and the “best” relay can be selected with a distributed algorithm, is employed in this paper. Furthermore, we obtain the approximate OP at high signal-to-noise ratio (SNR) to find the diversity order of cognitive multi-relay networks.
The rest of the paper is organized as follows. The system model is described in Sect. 2. The upper and lower bounds outage probability are derived in Sect. 3. In Sect. 4, the asymptotic outage performance is investigated. The simulation results are illustrated in Sect. 5, and the conclusions are provided in Section 6.
2 System Model
Consider an underlay cognitive multi-relay network with the coexistence of primary and secondary links, as illustrated in Fig. 1 [7, 8]. The primary link employs the direct transmission while the secondary link employs opportunistic decode-and-forward (DF) relaying transmission. The primary link consists of a transmitter \((c)\) and a receiver \((p)\). The secondary link consists of a source \((s)\), \(K\) relays \((r_1,r_2,\ldots ,r_K)\), and a destination \((d)\). For the secondary link, the DF cooperative relaying protocol and half-duplex mode are adopted. The transmission of secondary link is divided into two phases. In the first phase, the source \((s)\) broadcasts its message to the \(K\) relays and the destination \((d)\). In the second phase, only the relay in the successfully decoding relay set which has maximum signal-to-interference-plus-noise ratio (SINR) is selected to forward the message to the destination \((d)\). The destination combines the messages of the direct link and opportunistic relaying link with maximum ratio combining (MRC) scheme [16]. To ensure the QoS of PU, the transmit power of SU should satisfy both the maximum transmit power constraint \(Q\) and maximum tolerable interference power constraint \(I_p\). The wireless channel between transmitter node \(i (c, s, r_{1}, \ldots , r_{K})\) and receiver node \(j (p, r_{1}, \ldots , r_{K}, d)\) is independent Rayleigh flat fading channel with variance \(1/\lambda _{ij}\). Thus, the channel gain \(g_{ij}=|h_{ij}|^2\) is exponential distributed with probability density function (PDF) \(f_{g_{ij}}(x)=\lambda _{ij}\exp (-\lambda _{ij}x)u(x)\) \(\left( g_{ij}\sim \mathcal{E }(\lambda _{ij}) \right) \), where \(u(x)\) is the Heaviside (unit) step function, i.e., \(u(x)=1 \) for \(x\ge 0 \) and \(u(x)=0\) for \(x<0\). In this paper, we assume that all relays are located close to one another (optimal clustering) [17], which implies \(\lambda _{sr_{k}}=\lambda _{sr}\), \(\lambda _{r_{k}d}=\lambda _{rd},\, \lambda _{cr_{k}}=\lambda _{cr}\), and \(\lambda _{r_{k}p}=\lambda _{rp},\, k\in \{1,2,\ldots ,K\}\).
3 Outage Performance Analysis
3.1 Outage Probability
Under both the maximum transmit power constraint \(Q\) and maximum tolerable interference power constraint \(I_p\), the allowed maximum instantaneous transmit powers of the source \((s)\) and the \(k^{th}\) relay \((r_{k}),\, k\in \{1,2,\ldots ,K\}\), are \(P_{s}=\min \{I_{p}/g_{sp},Q\}\) and \(P_{r_{k}}=\min \{I_{p}/g_{r_{k}p},Q\}\), respectively. Taking the interference from PU into account, the SINR of the link from transmitter node \(i (s, r_{1}, \ldots , r_{K})\) and receiver node \(j (r_{1}, \ldots , r_{K}, d)\) is given by
where \(P_{c}\) is the transmit power of PU transmitter; \(N_{0}\) is the variance of Gaussian noise at receiver node \(j\); \(\gamma _{Q}=Q/N_0\); \(\gamma =I_ {p}/N_ {0}\) and \(\gamma _{I}=P_c/N_0\) are defined as the average signal-to-noise ratio (SNR) and average interference-to-noise ratio (INR), respectively.
From (1), it is noted that \(\gamma _{sd},\, \gamma _{s r_k}, \,\gamma _{r_{k}d}\), and \(\gamma _{r_{m}d}\, (k\ne m, k, m\in \{1,2,\ldots , K\})\) are dependent because of the common interference power constraint as shown in [8] and the interference from PU.
Define \(\gamma _{\text{ th }}\) to be the outage threshold SINR for SU. In the first phase of relaying transmission, the successful decoding set, denoted as \(\mathcal{D }_{l}\), is defined as \(\mathcal{D }_{l}=\{r_{k}: \gamma _{sr_{k}} \ge \gamma _{\text{ th }}, k\in \{1,2,\ldots ,K\}\} \), where the cardinality of \(\mathcal{D }_{l}\) is \(l\). The probability of \(\mathcal{D }_{l}\) is given by [15]
In the second phase of relaying transmission, the relay which has the maximum \(\gamma _{r_{k}d}\), denoted as \(r_b\), is selected from \(\mathcal{D }_{l}\) to forward the message, i.e., \(r_b = \arg \mathop {\max \limits _{{r_k} \in \mathcal{D }_{l}}} {\gamma _{{r_k}d}}\). According to the total probability law, the OP is given by [7, 15]
where \(I_{1}(l)\) denotes the outage probability given the cardinality of \(\mathcal{D }_{l}\).
For notational convenience, let \(X=g_{cd}+1/\gamma _I,\, Y=g_{sp}, \,Z_k=g_{sr_k}/(g_{cr_k}+1/\gamma _I),\, V=\mathop {\max }\limits _{{r_k} \in {\mathcal{D }_{l}}} \min \{\gamma /g_{r_kp}, \gamma _{Q}\}\cdot g_{r_kd}\). Then, \(\gamma _{sr_{k}}=\min \{\gamma /Y, \gamma _{Q}\}Z_k/\gamma _I,\, \gamma _{sd}=\min \{\gamma /Y, \gamma _{Q}\}\cdot g_{sd}/(\gamma _I X)\), and \(\gamma _{r_{b}d}=V/(\gamma _I X)\). The PDF of \(X\) is \(f_{X}(x)=\lambda _{cd}\exp (-\lambda _{cd}(x-1/\gamma _I))u(x-1/\gamma _I)\). According to [7, 8], the cumulative distribution function (CDF) of \(Z_{k}\) and \(V\) are
Substituting (2) into (3), \(I_{1}(l)\) is rewritten as
Now, relaying on the relation between \(\gamma _{Q}\) and \(\gamma /Y\), (6) can further be written as
where
To facilitate the subsequent analysis, the following lemmas are presented.
Lemma 1
Let \(m \in \mathbb N ,\, u, p \in \mathbb R \), and \(a > b\). The integral \(\mathcal{J }(a,b,u,m,p)=\int _{a}^{b} e^{-p x}/{(x+u)^m} dx\) is
for \(p>0\);
for \(p\le 0, m\ne 0\);
for \(p=0, m=0\);
for \(p<0, m=0\),
where \(\text{ Ei }(\bullet )\) is the exponential integral function [18, Eq. (8.211)] and \(\varGamma (\bullet ,\bullet )\) is the upper incomplete gamma function [18, Eq. (8.350.2)].
Proof
When \(p>0\), replacing \((x+u)p\) with \(t\) and following [18, Eq. (8.350.2)], the final result is obtained. When \(p\le 0, m\ne 0\), replacing \(x+u\) with \(t\) and following [18, Eq. (2.324.2)], the final result is obtained. \(\square \)
Lemma 2
Let \(m \in \{0,1\},\, n \in \mathbb N \). The integral \(\mathcal{L }(a,u,w,m,n,p)=\int _{a}^{\infty } \frac{e^{-p x}}{(x+u)^m (y+w)^n} dx\) is
for \(u\ne w, m=1, n\ne 0\);
for \(u\ne w, m=0\);
for the others.
Proof
By employing the partial fraction expansion method and Lemma 1, the final result is derived. \(\square \)
Lemma 3
Let \(u \in \mathbb R \), and \(a > b\). The integral \(\mathcal K (a,b,p)=\int _{a}^{b} e^{-p x} f_V(x) dx\) is
Proof
By employing the integration-by-parts method and Lemma 1, the final result can be obtained. \(\square \)
By interchanging the order of integration, \(I_2\) in (8) can be expressed as
where \( a_1=\frac{\lambda _{cd}\gamma _{Q}}{\lambda _{rd}\gamma _{\text{ th }} \gamma _{I}}\) and the last equality stems from Lemma 3.
Substituting (4) into \(I_3,\, I_3\) is expressed as
where \(b_1=\frac{\lambda _{cr}\gamma _{Q}}{\lambda _{sr} \gamma _{\text{ th }}\gamma _{I}}\).
Define the VOX plane as the plane spanned by the \(X\) and the \(V\) axes. The integral region of \(I_4\) on the VOX plane is ABDE, where ABDE denotes the region bounded by the lines \(x=1/\gamma _I,\, v=0\), and \(v=\gamma _{\text{ th }}\gamma _I x\), as shown in Fig. 2. It is noted that the integral region ABDE can be divided into the regions ABF and FBDE. By interchanging the order of integration, \(I_4\) can be expressed as
Unfortunately, there is no closed-form expression for \(I_4\) due to the correlation between \(Y\) and \(V\). However, by slightly enlarging and shrinking the integration regions of \(I_4\), the following results can be obtained.
Lemma 4
By slightly enlarging the integration region of \(I_4\) from \(\varOmega _1=\{\gamma /\gamma _Q \le y < \infty , ABDE\}\) to \(\varOmega _2=\{\gamma /\gamma _Q \le y < \infty , AOE\}\) and shrinking the integration region of \(I_4\) to \(\varOmega _3=\{\gamma /\gamma _Q \le y < \infty , ABCDE\}\) as shown in Fig. 2, the upper and lower bounds of \(I_4\) are obtained as
where \(a_2=\frac{\lambda _{cd}\gamma }{\lambda _{sd}\gamma _{th}\gamma _{I}}\) and \(b_2=\frac{\lambda _{cr}\gamma }{\lambda _{sr}\gamma _{th}\gamma _{I}}\).
Proof
See Appendix 1. \(\square \)
Now, combining (3), (11), (12), (14), and (15), the upper and lower bounds on the OP for underlay cognitive opportunistic multi-relay networks are
To reveal how the interference caused by PU impacts the performance of SU, we investigate the asymptotic behavior of OP.
Theorem 1
The relationship between the lower bound OP and the upper bound OP at high INR region is
when \(\gamma \) and \(\gamma _{Q}\) are fixed or \(\rho =\gamma /\gamma _{I}\) and \(\rho _Q=\gamma _{Q}/\gamma _I\) are fixed.
Proof
See Appendix 2. \(\square \)
Theorem 1 states that the lower and upper bounds of OP converge to the exact OP at high INR region. This is because that the gap between the lower bound and the upper bound is determined by the area of \(\varOmega _2-\varOmega _3=\{\gamma /\gamma _Q \le y < \infty , \text{ BODC }\}\). It is noted that the area of \(\varOmega _2-\varOmega _3\) decreases with the increase of \(\gamma _I\), which implies the gap tends to 0 with the increase of \(\gamma _I\).
3.2 Approximate Outage Probability at High SNR
In this subsection, a simple expression of \(P_{\text{ out }}\) is derived at high SNR.
Let \(\gamma _{Q}=\mu \gamma \) [10], where \(\mu \) is a constant. When \(\gamma \rightarrow \infty \), in (11), using the Taylor expansion,
When \(\gamma \rightarrow \infty \), in (12),
After some mathematical manipulation, when \(\gamma \rightarrow \infty \), OP is approximated as
where \(\tau \in \{\text{ UB },\text{ LB } \}\), \(a_3=\frac{\lambda _{sp}\lambda _{cd}\gamma }{\lambda _{sd} \gamma _{\text{ th }}\gamma _{I}}\) and \(b_3=\frac{\lambda _{sp}\lambda _{cr}\gamma }{\lambda _{sr} \gamma _{\text{ th }}\gamma _{I}}\), \(c_3=\frac{\lambda _{rp}\lambda _{cd}\gamma }{\lambda _{rd} \gamma _{\text{ th }}\gamma _{I}}\), \(\delta (\text{ UB })=\varGamma (l+1)\varGamma (K-l+2, \frac{\lambda _{sp}}{\mu })e^{\frac{\lambda _{cd}}{\gamma _I}}\), \(\delta (\text{ LB })=\varGamma (l+1,\frac{\lambda _{cd}}{\gamma _I})\varGamma (K-l+2, \frac{\lambda _{sp}}{\mu })e^{\frac{\lambda _{cd}}{\gamma _I}} -(\frac{\lambda _{cd}}{\gamma _I})^{l} \varGamma (K-l+2, \frac{\lambda _{sp}}{\mu }) +\varGamma (K-l+2, \frac{\lambda _{sp}}{\mu }) (1+\frac{\lambda _{cd}}{\gamma _I}) [(\frac{\lambda _{cd}}{\gamma _I})^{l}e^{-\frac{\lambda _{cd}}{\gamma _I}}+\gamma (l+1,\frac{\lambda _{cd}}{\gamma _I})]\), and \(\gamma (\bullet ,\bullet )\) is the lower incomplete gamma function [18, Eq. (8.350.1)]. (21) implies the full diversity order of \(K+1\) is achieved.
4 Simulation Results
In this section, we present Monte Carlo simulation results to verify our analysis. The simulation tool is MATLAB. In the simulations, as shown in Fig. 3, a two dimensional network topology is assumed where the primary transmitter \((c)\), the primary receiver \((p)\), the secondary source \((s)\), the secondary relays, and the secondary destination \((d)\) are located at the coordinates \((0.7,0.7),\, (0.5,0.5),\, (0,0),\, (0.5,0)\), and \((1,0)\), respectively [12]. The fading variances are assigned by adopting a path loss model of the form \(\lambda _{ij}=d_{ij}^{-4}\) where \(d_{ij}\) is the distance between the transmitter node \(i \,(c,\, s,\, r_{1}, \ldots ,\, r_{K})\) and receiver node \(j (p, r_{1}, \ldots , r_{K}, d)\). We assume that all the relays are located close to one another (optimal clustering) [17]. The distance between any two relays is negligible compared with that between the relays and the nodes \(c,\, p,\, s\), and \(d\). Thus, we have \(\lambda _{sr_{k}}=\lambda _{sr},\, \lambda _{r_{k}d}=\lambda _{rd},\, \lambda _{cr_{k}}=\lambda _{cr}\), and \(\lambda _{r_{k}p}=\lambda _{rp}, \,k\in \{1,2,\ldots ,K\}\). We also assume that the PU always transmits signals and the interference caused by the PU is always exist [12, 13, 19]. In all cases, \(\gamma _{\text{ th }}=3\) and the OP is averaged over \(10^7\) different channel realizations. The simulation steps are provided in detail in Algorithm 1.
Algorithm 1: Simulation method to obtain the secondary OP of cognitive multi-relay network |
---|
(1) Initialization |
a) Initialize the secondary OP count, \(count=0\). |
b) Initialize the channel realizations, \(l=0\). |
(2) Until \(l\le 10^7\), repeat |
a) Generate the Rayleigh fading channels according to \(h_{ij}\sim \mathcal{CN }(0, 1/\lambda _{ij})\). |
b) Obtain the successful decoding set \(\mathcal{D }_l\) by judging whether the \(k^{th}\) relay satisfies \(\gamma _{sr_{k}} \ge \gamma _{\text{ th }}\). |
c) Select the best relay in \(\mathcal{D }_l\) based on \(r_b = \arg \mathop {\max \limits _{{r_k} \in \mathcal{D }_{l}}} {\gamma _{{r_k}d}}\). |
d) If \(\gamma _{{sd}}+\gamma _{{r_b}d}<\gamma _{\text{ th }},\, count=count+1\). |
It is noted that in the computation of \(\gamma _{sr_{k}},\, \gamma _{{r_k}d}\) and \(\gamma _{{sd}}\), the interference from PU is |
included through (1). |
e) \(l=l+1\). |
(3) Obtain the secondary OP, \(P_{\text{ out }}=count/10^7 \). |
In Fig. 4, we present the analytical and simulated OP versus average SNR for different values of \(K\) and \(\gamma _{I}\). From Fig. 4, it is observed that the OP improves with the increase of \(K\) when the average INR \(\gamma _{I}\) is fixed. It is also found that only when \(\gamma _I<-8\) dB or \(\gamma <10\) dB, the proposed upper and lower bounds have noticeable difference with the simulation results.
In Fig. 4, OP is presented where the PU’s interference \(\gamma _{I}\) is fixed. Let \(\rho =\gamma /\gamma _{I}\) and \(\rho _{Q}=\gamma _Q /\gamma _{I}\). When \(\rho \) and \(\rho _{Q}\) are fixed, i.e., the signal-to-interference ratio (SIR) is fixed, we present the analytical and simulated OP versus average INR for different values of \(K\) in Fig. 5. From Fig. 5, it is found that an outage floor at high INR occurs in contrast to the results in [7–11]. This is because the interference from PU is considered. It is also observed that the gap between the upper bound and the simulation values decreases with the increase of \(\gamma _I\). The reason is that the increment area from enlarging the integration region of \(I_4\) decreases with the increase of \(\gamma _I\). It is also observed that the gap between the lower and upper bounds OP is approximately equal to 0 when \(\gamma _I > 0\) dB, which implies the lower and upper OP can be regard as the exact OP as long as \(\gamma _I\) is moderately large. When \(\rho _Q\) and \(K\) is fixed, the OP improves with the increase of \(\rho \). This is because that in (1), \(\min \{\rho /g_{ip}, \rho _{Q}\}\approx \rho /g_{ip} \) for small \(\lambda _{ip},\, i \in \{s, r_1, \ldots , r_K\}\), which implies the OP is dominated by \(\rho \).
5 Conclusions
In this paper, we theoretically derive the upper and lower bounds of OP for the underlay cognitive opportunistic multi-relay networks considering the interferences from primary transmitter to secondary receiver and from the secondary transmitter to the primary receiver, the maximum transmit power constraint of SU, and the dependence introduced due to interference power constraint. The upper and lower bounds of OP are derived by enlarging and shrinking the integration regions. It is found that the gap between the upper and lower bounds tends to 0 when the INR is large. It is also found that because the interference from primary transmitter to secondary receiver is considered, an outage floor at high SNR occurs when the INR increases proportionally with SNR.
References
Zhao, Q., & Sadler, B. M. (2007). A survey of dynamic spectrum access. IEEE Signal Processing Magazine, 24(3), 79–89.
Li, D. (2012). Joint power and rate control combined with adaptive modulation in cognitive radio networks. Wireless Personal Communications, 63(3), 0929–6212.
Laneman, J. N., Tse, D. N. C., & Wornell, G. W. (2004). Cooperative diversity in wireless networks: Efficient protocols and outage behavior. IEEE Transactions on Information Theory, 50(12), 3062–3080.
Huang, G., Luo, L., Zhang, G., Yang, P., Tang, D., & Qin, J. (2012). QoS-driven jointly optimal subcarrier pairing and power allocation for decode-and-forward OFDM relay systems. Wireless Personal Communications, 1–22. doi: 10.1007/s11277-012-0894-x (published online).
Zhang, Q., Jia, J., & Zhang, J. (2009). Cooperative relay to improve diversity in cognitive radio networks. IEEE Communications Magazine, 47(2), 111–117.
Farraj, A. K., & Hammad, E. M. (2012). Impact of quality of service constraints on the performance of spectrum sharing cognitive users. Wireless Personal Communications, 1–16. doi: 10.1007/s11277-012-0606-6 (published online).
Luo, L., Zhang, P., Zhang, G., & Qin, J. (2011). Outage performance for cognitive relay networks with underlay spectrum sharing. IEEE Communications Letters, 15(7), 710–712.
Yan, Z., Zhang, X., & Wang, W. (2011). Exact outage performance of cognitive relay networks with maximum transmit power limits. IEEE Communications Letters, 15(12), 1317–1319.
Xia, M., & Aissa, S. (2012). Cooperative AF relaying in spectrum-sharing systems: Performance analysis under average interference power constraints and Nakagami-m fading. IEEE Transactions on Communications, 60(6), 1523–1533.
Duong, T. Q., da Costa, D., Elkashlan, M., & Bao, V. N. Q. (2012). Cognitive amplify-and-forward relay networks over Nakagami-m fading. IEEE Transactions on Vehicular Technology, 61(5), 2368–2374.
Yang, L., Alouini, M. S., & Qaraqe, K. (2012). On the performance of spectrum sharing systems with two-way relaying and multiuser diversity. IEEE Communications Letters, 16(8), 1240–1243.
Duong, T. Q., Bao, V. N. Q., Tran, H., Alexandropoulos, G. C., & Zepernick, H. J. (2012). Effect of primary network on performance of spectrum sharing AF relaying. IET Electronics Letters, 48(1), 25–27.
Yang, P., Luo, L., & Qin, J. (2012). Outage performance of cognitive relay networks with interference from primary user. IEEE Communications Letters, 16(10), 1695–1698.
Bletsas, A., Khisti, A., Reed, D. P., & Lippman, A. (2006). A simple cooperative diversity method based on network path selection. IEEE Journal on Selected Areas in Communications, 24(3), 659–672.
Bletsas, A., Shin, H., & Win, M. Z. (2007). Cooperative communications with outage-optimal opportunistic relaying. IEEE Transactions on Wireless Communications, 6(9), 3450–3460.
Win, M. Z., & Winters, J. H. (2001). Virtual branch analysis of symbol error probability for hybrid selection/maximal-ratio combining in Rayleigh fading. IEEE Transactions on Wireless Communications, 49(11), 1926–1934.
Al-Karaki, J. N., & Kamal, A. E. (2004). Routing techniques in wireless sensor networks: A survey. IEEE Wireless Communications, 11(6), 6–28.
Gradshteyn, I. S., & Ryzhik, I. M. (2007). Table of integrals, series, and products (7th ed). London: Academic.
Heinzelman, W. B., Chandrakasan, A. P., & Balakrishnan, H. (2002). An application-specific protocol architecture for wireless microsensor networks. IEEE Transactions on Wireless Communications, 1(4), 660–670.
Rudin, W. (1964). Principles of mathematical analysis (2nd ed.). New York: McGraw-Hill.
Acknowledgments
This work was supported by the National Natural Science Foundation of China (61173148, 61102070, and 61202498), the Industry-University-Research Project of Guangdong Province and the Ministry of Education, China (2011B090400581), the Natural Science Foundation of Guangdong Province (S2011040004135), the Scientific and Technological Project of Guangzhou City (12C42051578 and 11A11060133), and Guangxi Natural Science Foundation (2012GXNSFBA053162).
Author information
Authors and Affiliations
Corresponding author
Appendices
Appendix 1: Proof of Lemma 4
Note that \(I_4\) in (10) can be rewritten as
where
and \(\varOmega _1=\{\gamma /\gamma _Q \le y < \infty , \text{ ABDE }\}\). It is noted that \(0 \le \psi (x,y,z)<\infty \) and \(\psi (x,y,z)\) is a continuous function. According to additivity of integration on intervals [20, Theorem 6.12], the integral \(\int \!\!\int \!\!\int _{\varOmega _1}\psi (x,y,z)dxdydz\) increases with the increase of the area of \(\varOmega _1\) when \(\varOmega _1\in \varOmega =\{ 0 \le x,y,z<\infty \}\). Thus, by enlarging the integration region from \(\varOmega _1\) to \(\varOmega _2=\{\gamma /\gamma _Q \le y < \infty , \text{ AOE }\}\) shown in Fig. 2 and interchanging the order of integration, \(I_4\) is upper bounded by
Integrating with respect to \(x,\, \varphi \) is expressed as
where the correlation between \(Y\) and \(V\) is decoupled due to the integration regions enlarging. Substituting (4) and (25) into (24), \(I_4\) is expressed as
where
in which \(a_2=\frac{\lambda _{cd}\gamma }{\lambda _{sd}\gamma _{th}\gamma _{I}}\) and \(b_2=\frac{\lambda _{cr}\gamma }{\lambda _{sr}\gamma _{th}\gamma _{I}}\). Using Lemma 3, \(J_1\) can be expressed as
Using the binomial theorem, \(J_2\) is given as
By invoking Lemma 2, \(J_2\) can be obtained as
Substituting (29) and (31) into (26), the upper bound of \(I_4\) is obtained.
Furthermore, by shrinking the integration region of \(I_4\) to \(\varOmega _3=\{\gamma /\gamma _Q \le y < \infty , \text{ ABCDE }\}\), \(I_4\) is lower bounded by
where
Following the derivation of \(I_4^{\text{ UB }}\), we obtain \(O_1=O_3 \cdot O_4\) and \(O_2=O_5 \cdot J_2\), where
Substituting (35)-(37) into (32), the lower bound of \(I_4\) is obtained.
Appendix 2: Proof of Theorem 1
From (16) and (17), the outage gap between the lower and upper bounds is formulated as
It is noted that \(\varOmega _2-\varOmega _3=\{\gamma /\gamma _Q \le y < \infty , \text{ BODC }\}\) and interchanging the order of integration, \(\varDelta I_4\) can be expressed as
Integrating with respect to \(x,\, \chi \) is expressed as
When \(\gamma \) and \(\gamma _{Q}\) are fixed, \(\gamma _I \rightarrow \infty \), using the Taylor expansion, \(\chi \) is approximated as
Substituting (41) into (39), we obtain
which implies \(\mathop {\lim }\limits _{\gamma _I \rightarrow \infty } \left( P_{out}^{\text{ UB }}-P_{out}^{\text{ LB }} \right) =0\). When \(\rho =\gamma /\gamma _{I}\) and \(\rho _Q=\gamma _{Q}/\gamma _I\) are fixed, the similar result can be obtained.
Rights and permissions
About this article
Cite this article
Yang, P., Zhang, Q., Luo, L. et al. Outage Performance of Underlay Cognitive Opportunistic Multi-relay Networks in the Presence of Interference from Primary User. Wireless Pers Commun 74, 343–358 (2014). https://doi.org/10.1007/s11277-013-1288-4
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11277-013-1288-4