Abstract
This work proposes a non-orthogonal selection cooperation scheme with interference for multi-source and single destination cooperative networks. In our model, the source nodes can cooperate for one another, i.e., each source node plays the dual role of a source and a relay, thus there is no need for relays. In addition, the source nodes can be continuously transmitted and without dedicated timeslots for cooperative transmissions, which can save system resources and improve spectral efficiency. However, by this way, it will introduce interference with the non-orthogonal transmission mechanism. To overcome this problem, we use general reception scheme in source nodes and successive interference cancellation technology in the destination node, which can reduce the effect of interference effectively. For interference-limited networks, we also derive the theoretical upper bound and lower bound of outage probability of our method. Through the outage probability analysis and comparison, the results show that the spectral efficiency is improved while the system still keeps acceptable transmission reliability.
Similar content being viewed by others
References
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.
Laneman, J. N., & Wornell, G. W. (2003). Distributed space-time-coded protocols for exploiting cooperative diversity in wireless networks. IEEE Transactions on Information Theory, 49(10), 2415–2425.
Hu, J., & Beaulieu, N. C. (2007). Closed-form expressions for the outage and error probabilities of decode-and-forward relaying in dissimilar Rayleigh fading channels. In Proceedings of the IEEE international conference on communications (pp. 5553–5557). Scotland, United kingdom: Glasgow.
Datsikas, C. K., Sagias, N. C., Lazarakis, F. I., & Tombras, G. S. (2008). Outage analysis of decode-and-forward relaying over Nakagami-m fading channels. IEEE Signal Processing Letters, 15, 41–44.
Ikki, S. S., & Ahmed, M. H. (2009). Performance analysis of multi-branch decode-and-forward cooperative diversity networks over Nakagami-m fading channels. In Proceedings of the IEEE international conference on communications (pp. 1–6). Germany: Dresden.
Suraweera, H. A. P., Smith, J., & Armstrong, J. (2006). Outage probability of cooperative relay networks in Nakagami-m fading channels. IEEE Communications Letters, 10(12), 834–836.
Duy, T. T., & Kong, H. Y. (2014). Adaptive cooperative decode-and-forward transmission with power allocation under interference constraint. Wireless Personal Communications, 74(2), 401–414.
Lee, K. C., Li, C. P., Wang, T. Y., & Li, H. J. (2014). Performance analysis of dual-hop amplify-and-forward systems with multiple antennas and co-channel interference. IEEE Transactions on Wireless Communications, 13(6), 3070–3087.
Altieri, A., Vega, L. R., Piantanida, P., & Galarza, C. G. (2014). On the outage probability of the full-duplex interference-limited relay channel. IEEE Journal Selection Areas Communications, 32(9), 1765–1777.
Ilhan, H. (2015). Performance analysis of cooperative vehicular systems with co-channel interference over cascaded Nakagami-m fading channels. Wireless Personal Communications, 83(1), 203–214.
Das, P., Mehta, N. B., & Singh, G. (2015). Novel relay selection rules for average interference-constrained cognitive AF relay networks. IEEE Transactions on Wireless Communications, 14(8), 4304–4315.
Suraweera, N., & Beaulieu, N. C. (2015). Optimum combining in dual-hop AF relaying for maximum spectral efficiency in the presence of co-channel interference. IEEE Transactions on Communications, 63(6), 2071–2080.
Raja, A., & Viswanath, P. (2011). Diversity-multiplexing tradeoff of the two-user interference channel. IEEE Transactions on Information Theory, 57(9), 5782–5793.
Zahavi, D., Zhang, L. L., Maric, I., Dabora, R., Goldsmith, A. J., & Cui, S. G. (2015). Diversity-multiplexing tradeoff for the interference channel with a relay. IEEE Transactions on Information Theory, 61(2), 963–982.
Weber, S. P., Andrews, J. G., Yang, X., & Veciana, G. D. (2007). Transmission capacity of wireless ad hoc networks with successive interference cancellation. IEEE Transactions on Information Theory, 53(8), 2799–2814.
Sen, S., Santhapuri, N., Choudhury, R., & Nelakuditi, S. (2013). Successive interference cancellation: Carving out MAC layer opportunities. IEEE Transactions on Mobile Computers, 12(2), 346–357.
Zhang, B., El-Hajjar, M., & Hanzo, L. (2014). Opportunistic relay selection for cooperative relaying in cochannel interference contaminated networks. IEEE Transactions on Vehicular Technology, 63(5), 2455–2461.
Shi, S. L., Yang, L. X., & Zhu, H. B. (2014). A novel cooperative transmission scheme based on superposition coding and partial relaying. International Journal of Communication Systems, 27(11), 2889–2908.
Liu, Y., Man, Y., Song, M., Zhang, H. T., & Wang, L. (2015). A cooperative diversity transmission scheme by superposition coding relaying for a wireless system with multiple relays. Wireless Networks, 21(6), 1801–1817.
Rezaei, S. S. C., Gharan, S. O., & Khandani, A. K. (2010). Relay scheduling in the half-duplex Gaussian parallel relay channel. IEEE Transactions on Information Theory, 56(6), 2668–2687.
Malik, S., Kim, C., Hwang, I., Kim, B., & Moon, S. (2012). Interference cancellation using improved precoding for cooperative relay in multiuser MIMO LTE-advanced. Telecommunications Review, 22(5), 732–747.
Vakil, S., & Liang, B. (2008). Cooperative diversity in interference limited wireless networks. IEEE Transactions on Wireless Communications, 7(8), 3185–3195.
Bletsas, A., Dimitriou, A. G., & Sahalos, J. N. (2010). Interference-limited opportunistic relaying with reactive sensing. IEEE Transactions on Wireless Communications, 9(1), 14–20.
Wang, H., Yang, S. Z., & Lin, J. Z. (2009). A distributed selection cooperation protocol with feedback and its DMT in nakagami-m fading channels. IEEE Communications Letters, 13(11), 844–846.
Ding, Z. G., Krikidis, I., & Rong, B. (2012). On combating the half-duplex constraint in modern cooperative networks protocols and techniques. IEEE Wireless Communications, 19(6), 20–27.
Argyriou, A. (2015). Multi-source cooperative communication with opportunistic interference cancelling relays. IEEE Transactions on Communications, 63(11), 4086–4096.
Kim, E. C., Cha, J. S., & Kim, J. Y. (2009). Successive interference cancellation for cooperative communication systems. In International conference on convergence and hybrid information technology (pp. 652–656).
Miridakis, N. I., & Vergados, D. D. (2013). A survey on the successive interference cancellation performance for single-antenna and multiple-antenna OFDM systems. IEEE Communications Surveys & Tutorials, 15(1), 312–335.
Acknowledgements
The authors would like to thank the support of the National Natural Science Foundation of China (Grant No. 61301125), and the Fundamental and Advanced Research Program of Chongqing (Grant No.cstc2015jcyjA40023).
Author information
Authors and Affiliations
Corresponding author
Appendices
Appendix 1: Proof of Lemma 1 and Its Two Corollaries
It is noted that throughout the derivation, if an exponential random variable with parameter \(\lambda\), and its mean value is \(1/\lambda\), then the probability density function (PDF)
Lemma 1
Let X and Y be independent exponential random variables with parameters \({\lambda _1}\) and \({\lambda _2}\), respectively. Let \(Z = {k_1}X - {k_2}Y\) \(({k_1}> 0, {k_2} > 0)\), then the cumulative distribution function (CDF) of Z \((z > 0)\)
Proof
Let \(X' = {k_1}X\), \(Y' = {k_2}Y\), then \(X'\) and \(Y'\) obey exponential distribution with parameters \(\frac{{{\lambda _1}}}{{{k_1}}}\) and \(\frac{{{\lambda _2}}}{{{k_2}}}\), respectively, and \(Z = X' - Y'\). In order to solve \({F_Z}(z)\), we should solve the CDF of the difference between \(X'\) and \(Y'\), then we have
the non-zero range of the integral above
\(\square\)
Only considering \(z > 0\), we have \(y > 0\). Then
Corollary 1
Let \({\left| {{\alpha _1}} \right| ^2}\) and \({\left| {{\alpha _2}} \right| ^2}\) be independent exponential random variables with parameters \({\lambda _1}\) and \({\lambda _2}\), respectively. And let \(P> 0, R> 0, {N_0} > 0\), then
Proof
Let \({k_1} = P\), \({k_2} = g \cdot P\), \(Z = g \cdot {N_0}\), according to the result of Lemma 1, we have (42) and the proof is complete. \(\square\)
Corollary 2
Let \({\left| {{\alpha _1}} \right| ^2}\) and \({\left| {{\alpha _2}} \right| ^2}\) be independent exponential random variables with parameters \({\lambda _1}\) and \({\lambda _2}\), respectively. And let \(P> 0, R> 0, {N_0} > 0\), then we can obtain
Proof
Let \(X = {\left| {{\alpha _1}} \right| ^2}\), \(Y = {\left| {{\alpha _2}} \right| ^2}\), \({p_1}\), \({p_2}\), \({p_3}\) represent the probability to be solved above, respectively, then we obtain
To solve the integrals above, we divide them into \(g > 1\) and \(g \leqslant 1\).
\(g > 1\), we have
For \({p_3}\), the integration area of y is \((x + \frac{{g \cdot {N_0}}}{P}, + \infty )\), and the integration area of x is \((0, \frac{{g \cdot {N_0}}}{P})\). Thus, we get
\(g \leqslant 1\), we have
For \({p_3}\), the integration area of y is \((g \cdot x + \frac{{g \cdot {N_0}}}{P}, + \infty )\), and the integration area of x is \((0, \frac{{g \cdot {N_0}}}{P})\). Although the integration area has been changed, the integration interval is the same, and the result is also same with \(g > 1\). \(\square\)
Combining (50) and (53), we get (44). And combining (51) and (54), we get (45). According to (52) and the integration interval is consistent in both cases, we get (46). Then we obtain the desired results.
Appendix 2: Proof of Lemma 2
Lemma 2
Let \({\left| {{\alpha _1}} \right| ^2},{\left| {{\alpha _2}} \right| ^2}, \ldots ,{\left| {{\alpha _N}} \right| ^2}\) be independent exponential random variables with parameters \({\lambda _1},{\lambda _2}, \ldots ,{\lambda _N}\), respectively. Let \({\left| {{\alpha _s}} \right| ^2}\) be an independent exponential random variable with parameter \({\lambda _s}\) and \({\left| {{\alpha _b}} \right| ^2} = \max \{ {\left| {{\alpha _1}} \right| ^2},{\left| {{\alpha _2}} \right| ^2}, \ldots ,{\left| {{\alpha _N}} \right| ^2}\}\), \(P> 0, R> 0, {N_0} > 0\), then we can obtain
Proof
Set \(X = {\left| {{\alpha _b}} \right| ^2}\), \(Y = {\left| {{\alpha _s}} \right| ^2}\), p represents the probability to be solved, then we have
where
For the last step in (58), in order to expand \({F_X}(x)\), we use the following formula
Next, we divide (56) into \(g > 1\) and \(g \leqslant 1\). \(\square\)
\(g > 1\), the integration area of x is \((y, g \cdot y + \frac{{g \cdot {N_0}}}{P})\), and the integration area of y is \((0, + \infty )\). Then we have
\(g \leqslant 1\), the integration area of x is \((y, g \cdot y + \frac{{g \cdot {N_0}}}{P})\), and the integration area of y is \((0, \frac{{g \cdot {N_0}}}{{P(1 - g)}})\). Thus, we just resolve the integral of y in (60), then we obtain
Combining (60) and (61) completes the proof.
Appendix 3: Proof of Lemma 3
Lemma 3
Let \({\left| {{\alpha _1}} \right| ^2},{\left| {{\alpha _2}} \right| ^2}, \ldots ,{\left| {{\alpha _N}} \right| ^2}\) be independent exponential random variables with parameters \({\lambda _1},{\lambda _2}, \ldots ,{\lambda _N}\), respectively. Let \({\left| {{\alpha _s}} \right| ^2}\) be an independent exponential random variable with parameter \({\lambda _s}\) and \({\left| {{\alpha _b}} \right| ^2} = \max \{ {\left| {{\alpha _1}} \right| ^2},{\left| {{\alpha _2}} \right| ^2}, \ldots ,{\left| {{\alpha _N}} \right| ^2}\}\), \(P> 0, R> 0, {N_0} > 0\), then we can obtain
where
Proof
Let \(X = {\left| {{\alpha _b}} \right| ^2}\), \(Y = {\left| {{\alpha _s}} \right| ^2}\), p represents the probability to be solved, then we have
where
Next, we divide (64) into \(g > 1\) and \(g \leqslant 1\).
\(g > 1\) the integration area is shown in Fig. 11a. We can see from Fig. 11a, the integration area of x is \((0, + \infty )\), and the integration area of y is \((x, g \cdot x + \frac{{g \cdot {N_0}}}{P})\). Then we have
\(g \leqslant 1\), the integration area is shown in Fig. 11b. We an see from Fig. 11b, the integration area of y is \((x, g \cdot x + \frac{{g \cdot {N_0}}}{P})\), and the integration area of x is \((0, \frac{{g \cdot {N_0}}}{{P(1 - g)}})\). Thus, we just resolve the integral of x in (67), then we obtain
\(\square\)
Rights and permissions
About this article
Cite this article
Wang, H., Wei, X. & Li, M. A Non-Orthogonal Selection Cooperation Protocol with Interference in Multi-Source Cooperative Networks. Wireless Pers Commun 97, 2097–2130 (2017). https://doi.org/10.1007/s11277-017-4598-0
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11277-017-4598-0