Abstract
In this paper, an overlay two-way relaying spectrum sharing protocol is proposed by employing an opportunistic source selection strategy. In this protocol, a secondary user acts as a relay and allocates a fraction of its transmit power to assist two-way communication between two primary users (PUs), thus, gaining spectrum sharing as long as without degrading the primary system performance. Moreover, to exploit the multiuser diversity inherent in the multiuser primary systems, the two PUs transmit their own messages in an opportunistic manner, depending on the instantaneous channel conditions. Specifically, at each transaction, only one of the PUs is selected for transmission such that the instantaneous mutual information on the whole primary network is maximized and as a result, the multiuser diversity gain is achieved by the primary system. Then, we derive the exact closed-form outage probabilities for both the primary and secondary systems. To gain more insights, closed-form asymptotic outage probability expressions are also derived. Based on the approximations, we further obtain analytical results on the diversity order of the primary system and the power-allocation threshold above which the spectrum sharing is allowed for secondary transmission. Numerical results are presented to verify our analysis and highlight the advantages of our proposed scheme compared to another two-phase spectrum sharing protocol based on analog network coding.
Similar content being viewed by others
Notes
Note that this is equivalent to the conventional one-way cooperative communication.
Note that only one traffic flow is supported in each transaction for the primary system of the considered protocol, therefore, for a target primary system rate \({R_{P}}\), the transmission rate of each primary user must be \(R_{P}\), rather than \(R_{P}{/}2\). More details can be found in [21, 23].
It should be noted that both primary users involve each transaction in DT scheme without spectrum sharing, while only one primary user is selected to participate in each transaction for the CR-OSS protocol. For the DT scheme, , we set the transmit power of each primary user in the DT transmission is a half of that in the CR-OSS protocol for simplicity, i.e., \({P_1} = {P_2} = {P_P}/2\). Therefore, irrespective of the protocols, the total power consumed by the primary user is equal to \({P_P}\) for each transaction.
Note that in our proposed protocol, if \(x_A\) can not be decoded at C in the first phase, i.e., \({R_{AC}} < {R_P}\) , C will remain idle in the next phase.
References
Mitola, J., & Maguire, G. Q, Jr. (1999). Cognitive radio: Making software radios more personal. IEEE Personal Communications, 6(4), 13–18.
Haykin, S. (2005). Cognitive radio: Brain-empowered wireless communications. IEEE Journal on Selected Areas in Communications, 23(2), 201–220.
Goldsmith, A., Jafar, S. A., Maric, I., & Srinivasa, S. (2009). Breaking spectrum gridlock with cognitive radios: An information theoretic perspective. Proceedings of the IEEE, 97(5), 894–914.
Haykin, S. (2005). Cognitive radio: Brain-empowered wireless communications. IEEE Journal on Selected Areas in Communications, 23(2), 201–220.
Han, Y., Pandharipande, A., & Ting, S. H. (2008). Cooperative spectrum sharing via controlled amplify-and-forward relaying. In IEEE 19th international symposium on personal, indoor and mobile radio communications, 2008. PIMRC 2008 (pp. 1–5). IEEE.
Han, Y., Pandharipande, A., & Ting, S. H. (2009). Cooperative decode-and-forward relaying for secondary spectrum access. IEEE Transactions on Wireless Communications, 8(10), 4945–4950.
Li, Q., Ting, S. H., Pandharipande, A., & Han, Y. (2011). Cognitive spectrum sharing with two-way relaying systems. IEEE Transactions on Vehicular Technology, 60(3), 1233–1240.
Wang, R., Tao, M., & Liu, Y. (2013). Optimal linear transceiver designs for cognitive two-way relay networks. IEEE Transactions on Signal Processing, 61(4), 992–1005.
Laneman, J. N., Tse, D. N., & Wornell, G. W. (2004). Cooperative diversity in wireless networks: Efficient protocols and outage behavior. IEEE Transactions on Information Theory, 50(12), 3062–3080.
Rankov, B., & Wittneben, A. (2007). Spectral efficient protocols for half-duplex fading relay channels. IEEE Journal on Selected Areas in Communications, 25(2), 379–389.
Zhang, S., Liew, S. C., & Lam, P. P. (2006). Hot topic: Physical-layer network coding. In Proceedings of the 12th annual international conference on Mobile computing and networking (pp. 358–365).
Katti, S., Rahul, H., Hu, W., Katabi, D., Mdard, M., & Crowcroft, J. (2008). XORs in the air: Practical wireless network coding. IEEE/ACM Transactions on Networking (TON), 16(3), 497–510.
Katti, S., Gollakota, S., & Katabi, D. (2007). Embracing wireless interference: Analog network coding. ACM SIGCOMM Computer Communication Review, 37(4), 397–408.
Zhang, S., Liew, S. C., & Lu, L. (2008). Physical layer network coding schemes over finite and infinite fields. In Global telecommunications conference, 2008. IEEE GLOBECOM 2008(pp. 1–6).
Kim, S. J., Mitran, P., & Tarokh, V. (2008). Performance bounds for bidirectional coded cooperation protocols. IEEE Transactions on Information Theory, 54(11), 5235–5241.
Hyadi, A., Driouch, E. M., Ajib, W., & Alouini, M. S. (2013). Overlay cognitive radio systems with adaptive two-way relaying. In Global communications conference (GLOBECOM)(pp. 937–942).
Duy, T. T., & Kong, H. Y. (2013). Performance analysis of two-way hybrid decode-and-amplify relaying scheme with relay selection for secondary spectrum access. Wireless Personal Communications, 69(2), 857–878.
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.
Yadav, S., & Upadhyay, P. (2014). Performance analysis of cognitive spectrum sharing with time division broadcast protocol. IEEE Communications Letters, 18(2), 305–308.
Li, Y., Long, H., Peng, M., & Wang, W. (2014). Spectrum sharing with analog network coding. IEEE Transactions on Vehicular Technology, 63(4), 1703–1716.
Viswanath, P., Tse, D. N. C., & Laroia, R. (2002). Opportunistic beamforming using dumb antennas. IEEE Transactions on Information Theory, 48(6), 1277–1294.
Yi, Z., & Kim, I. M. (2009). An opportunistic-based protocol for bidirectional cooperative networks. IEEE Transactions on Wireless Communications, 8(9), 4836–4847.
Liu, P., & Kim, I. M. (2010). Performance analysis of bidirectional communication protocols based on decode-and-forward relaying. IEEE Transactions on Communications, 58(9), 2683–2696.
Liu, P., Gazor, S., & Kim, I. M. (2013). An opportunistic protocol employing independent codebooks for bidirectional cooperative networks. IEEE Transactions on Vehicular Technology, 62(2), 902–908.
Gradshteyn, I. S., & Ryzhik, I. M. (2007). Table of integrals, series, and products (7th ed.). Amsterdam: Elsevier.
Acknowledgements
The research is partially supported by research grants from the Chinese NSF project (61372078), Guangdong NSF project (2014A030313549), the Shenzhen NSF project (JCYJ20160226192223251), the Key Project of Department of Education of Guangdong Province (2015KTSCX121), Foundation of Shenzhen City (KQCX20140509172609163), Natural Science Foundation of Shenzhen University (00002501), and the Science and Technology Program of Shaoguan City of China (SK20157202).
Author information
Authors and Affiliations
Corresponding author
Appendices
Appendix 1: Proof for Theorem 1
Using the law of total probability, we can write (7) as follows
where
Since X, Y, and Z are independent exponential random variables, the term \(P_{out}^{11}\) can be straightforwardly derived as
In the following, we will show the derivations of other terms in (27), i.e., \(P_{out}^{21}\), \(P_{out}^{22}\), \(P_{out}^{31}\), and \(P_{out}^{31}\).
1.1 Derivations of \(P_{out}^{21}\) and \(P_{out}^{22}\)
Let us come to \(P_{out}^{21}\) first. With some manipulations, \(P_{out}^{21}\) can be simplified as
where \(f(\theta ) = {{\left( {{\varTheta _p} - \frac{{\alpha {\eta _s}\theta }}{{(1 - \alpha ){\eta _s}\theta + 1}}} \right) } /{{\eta _p}}}, \theta \in \{ X,Y\}\). Before the calculation of \(P_{out}^{21}\), what should be done is to determine the integral region for \(P_{out}^{21}\). Let us come to the first condition in \(P_{out}^{21}\), i.e., \(Z < f(X)\) . To determine the integral in (29), it is important to see that
where \(\xi = \frac{{{\varTheta _p}}}{{[(1 + {\varTheta _p})\alpha - {\varTheta _p}]{\eta _s}}}\).
Since Z is a nonnegative random variable, the value of X must make sure that \(f(X) \ge 0\) , otherwise \(P_{out}^{ 21} = 0\) if \(f(X) < 0\) . Moreover, the second condition in \(P_{out}^{21}\) , i.e., \({{{\varTheta _p}}/{{\eta _p}}}< Y < X\) should be also satisfied. Denote \(G_{21}^{}(x,y,z)\) as the integral region for \(P_{out}^{21}\), and after some simple analysis, \(G_{21}^{}(x,y,z)\) can be obtained as follows
where ∅ denotes the empty set.
According to (36), we can divide the calculation of \(P_{out}^{21}\) into three cases in terms of \(\alpha\).
Case I \(0< \alpha < {{{\varTheta _p}}/{(1 + {\varTheta _p})}}\)
In this case, \(P_{out}^{ 21}\) can be calculated by
Substituting \(f(x) = {{\left( {{\varTheta _p} - \frac{{\alpha {\eta _s}x}}{{(1 - \alpha ){\eta _s}x + 1}}} \right) }/{{\eta _p}}}\) into \({\theta _1}\) and making the change of variable \((1 - \alpha ){\eta _s}x + 1 = t\), after some manipulations, the term \({\theta _1}\) can be rewritten as follows
Since we have no closed-form expression for the integral in (38), denoted by \(\varLambda\), we tackle this problem by making the change of variable \(s = \frac{t}{{{{(1 - \alpha ){\eta _s}{\varTheta _p}}/{{\eta _p}}} + 1 }}\) and applying the Taylor series expansion for the \(\exp (\frac{{\frac{{{\lambda _0}\alpha }}{{(1 - \alpha ){\eta _p}}}}}{t})\) within the integral in \(\varLambda\), and then after some manipulations, \(\varLambda\) can be expressed as follows
where \(E_{n}(\cdot )\) is the exponential integral function.
In order to simplify the notaion, we use a general function \({\varPhi _1}(u,w,\beta )\) defined in Theorem 1 to substitute explicit expression for \(\varLambda\). Then, the expression of \({\theta _1}\) can be expressed in a more compact form as
Taking similar steps as in (38–39), we can obtain the term \({\theta _2}\) in (37) as follows
Substituting (40) and (41) into (37) , we can obtain \(P_{out}^{ 21}\) as
Case II \(\frac{{{\varTheta _p}}}{{1 + {\varTheta _p}}}< \alpha < \frac{{{{{\eta _p}}/{{\eta _s}}} + {\varTheta _p}}}{{1 + {\varTheta _p}}}\)
According to \(G_{21}^{}(x,y,z)\), we have \({{{\varTheta _p}} / {{\eta _p}}}< Y< X < \xi\). Thus, \(P_{out}^{ 21}\) can be calculated by
By taking some similar steps employed in Case I such as change of variable and Taylor series expansion, \(P_{out}^{ 21}\) in this case can be derived as
where \(\varPhi _{2}(\cdot )\) is a function which is defined in (12) in Theorem 1.
Case III \(\min \left\{ {\frac{{{{{\eta _p}}/ {{\eta _s}}} + {\varTheta _p}}}{{1 + {\varTheta _p}}},1} \right\}< \alpha < 1\)
Obviously, in this case \(P_{out}^{ 21} = 0\), since the integral region \(G_{21}^{}(x,y,z) = \phi\) as it shown in (36).
So far, by combing (42), and (44), a piecewise solution for \(P_{out}^{ 21}\) has been obtained in terms of different power allocation factor \(\alpha\).
For the term \(P_{out}^{ 22}\), the calculation is straightforward. To be specific, one can easily obtain the integral region \(G_{22}^{}(x,y,z)\) for \(P_{out}^{ 22}\) by interchanging X and Y in (36), i.e., \(G_{22}^{}(x,y,z) = G_{21}^{}(y,x,z)\). Moreover, note that the expressions of \(P_{out}^{ 21}\) in (29) and \(P_{out}^{ 22}\) in (30) are identical in form except that X and Y are interchanged. Hence, the expression \(P_{out}^{ 22}\) can be obtained directly by interchanging \({\lambda _1}\) and \({\lambda _2}\) in the expression of \(P_{out}^{ 21}\).
1.2 Derivations of \(P_{out}^{31}\) and \(P_{out}^{32}\)
For the term \(P_{out}^{ 31}\), the integral region which is denoted by \(G_{31}^{}(x,y,z)\) can be obtained as follows
Furthermore, comparing the probabilities of \(P_{out}^{21}\) in (29) and \(P_{out}^{31}\) in (31), we notice that the only difference between them is the last two conditions, therefore, the derivation of \(P_{out}^{31}\) is analogous to that of \(P_{out}^{21}\). Specifically, we also need to divide the derivation into three cases and discuss each case separately. Due to a space limitation, we do not present the derivations of \(P_{out}^{31}\). In addition, like the derivation of \(P_{out}^{22}\), the expression of \(P_{out}^{32}\) can be obtained by interchanging \({\lambda _1}\) and \({\lambda _2}\) in the expression of \(P_{out}^{31}\).
Finally, by substituting the closed-form expressions of \(P_{out}^{11}\), \(P_{out}^{21}\), \(P_{out}^{22}\), \(P_{out}^{31}\), and \(P_{out}^{32}\) into (27), one can obtain a fragment outage probability expression in one-integral form in terms of different \(\alpha\) values, as shown in Theorem 1.
Appendix 2: Proof for Lemma 1
We rewrite the function \({\varPhi _1}(u,\omega ,\beta )\) defined in (11) as follows:
where \(\varPsi (u,\beta )\) represents the summation part of (11) and we can further rewrite it as
With the help of [25, eq. 5.1.12], for \(n\ge 1\), \(E_{n}(u\beta )\) can be expressed as
where \(\varphi (n)\) is the psi function defined in [25, eq. 8.364.5]. Moreover, noting that u, and \({v_0}\) in (11) are functions of \({\rho ^{ - 1}}\) and \(\beta\) is independent of \({\rho ^{ - 1}}\), we can see that \(u\beta\) is a function of \({\rho ^{ - 1}}\). Thus, the summation term in (47) is an infinitesimal of the secondary order. When \(\rho\) is very large, we have the following result
Furthermore, by taking Taylor expansion, \(E_1(u\beta )\) can be expressed as [25, eq.5.1.11]
With the help of \(E_0(u\beta )=e^{-u\beta }/{u\beta }\) and substituting (49) into (48), we obtain
Then, by substituting (50) into (46) and after some manipulations, we have
where the last equation holds for using the approximation \(1-exp(-x) \approx x\) for small x.
On the other hand, if we focus on the first order term in (51), then we can easily express \({\varPhi _1}(u,\omega ,\beta )\) as shown in (13).
Finally, note that \({\varPhi _2}(u,\omega ,\beta ,\gamma ) = {\varPhi _1}(u,\omega ,\beta ) - {\varPhi _1}(u,\omega ,\gamma )\) , thus substituting (51) into the right hand of the forgoing equation yields (14). This completes the proof.
Rights and permissions
About this article
Cite this article
Ding, F., Wang, H., Dai, M. et al. An Opportunistic Source Selection Spectrum Sharing Protocol for Overlay Cognitive Two-Way Relaying System. Wireless Pers Commun 96, 4427–4450 (2017). https://doi.org/10.1007/s11277-017-4394-x
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11277-017-4394-x