Abstract
Relay selection (RS), enhanced dynamic decode-and-forward (EDDF), and network coding (NC) have been proven to effectively improve the performance of cooperative communications systems. This motivates us to combine these three techniques to see how they can improve the performance of cooperative communications systems. In this study, we adopt the RS protocol proposed by Bletsas, Khisti, Reed and Lippman in 2006. The protocol features an EDDF and NC system for two-hop two-way multirelay networks. All nodes are single-input single-output and half-duplex (i.e., they cannot transmit and receive data simultaneously). The outage probability and its asymptotic behavior at a high SNR, diversity gain, coding gain at a high SNR, multiplexing gain of the sum rate, and spectrum efficiency of the RS-DDF&NC and RS-EDDF&NC schemes were analyzed. In this paper, we present comparisons of the outage probability in various scenarios under the Rayleigh fading channel. Our results demonstrate that the RS protocol with the EDDF and NC scheme exhibits optimal performance regarding outage probability based on the considered DF relay scheme if there exist sufficient relays. In addition, the performance loss is large if a relay is selected randomly. This demonstrates the importance of RS strategies.
Similar content being viewed by others
References
Sendonaris, A., Erkip, E., & Aazhang, B. (1998). Increasing uplink capacity via user cooperation diversity. In Proceedings IEEE international symposium on information theory, Cambridge, MA (p. 156) .
Zheng, L., & Tse, D. N. C. (2003). Diversity and multiplexing: a fundamental tradeoff in multiple antenna channels. IEEE Transactions on Information Theory, 49, 1073–1096.
Laneman, J., Tse, D., & Wornell, G. W. (2004). Cooperative diversity in wireless networks: efficient protocols and outage behavior. IEEE Transactions on Information Theory, 50, 3062–3080.
Laneman, J., & Wornell, G. W. (2003). Distributed space-time-coded protocols for exploiting cooperative diversity in wireless networks. IEEE Transactions on Information Theory, 49, 2415–2425.
Azarian, K., El-Gamal, H., & Schniter, P. (2005). On the achievable diversity-multiplexing tradeoff in half-duplex cooperative channels. IEEE Transactions on Information Theory, 51, 4152–4172.
Prasad, N., & Varanasi, M. K. (2010). High performance static and dynamic cooperative communication protocols for the half duplex fading relay channel. IEEE Transactions on Wireless Communications, 9, 328–337.
Wang, L.-C., Liu, W.-C., & Wu, S.-H. (2011). Analysis of diversity-multiplexing tradeoff in a cooperative network coding system. IEEE Transactions on Communications, 59, 2373–2376.
Fertl, P., Hottinen, A., & Matz, G. (2008) Perturbation-based distributed beamforming for wireless relay networks. In Proceedings IEEE global communications conference, New Orleans, LA (pp. 1–5).
Bletsas, A., Khisti, A., Reed, D., & Lippman, A. (2006). A simple cooperative diversity method based on network path selection. IEEE Journal on Selected Areas of Communication, 24, 659–672.
Han, Z., Himsoon, T., Siriwongpairat, W., & Liu, K. (2009). Resource allocation for multiuser cooperative OFDM networks: Who helps whom and how to cooperate. IEEE Transactions on Vehicular Technology, 58, 2378–2391.
Muñoz, O., Vidal, J., & Agustin, A. (2005) Non-regenerative MIMO relaying with channel state information [cellular example]. In Proceedings IEEE international conference accoustic, speech and signal processing, Philadelphia, PA (pp. 361–364).
Jing, Y., & Jafarkhani, H. (2009). Single and multiple relay selection schemes and their achievable diversity orders. IEEE Transactions on Wireless Communications, 8, 1414–1423.
Krikidis, I., Thompson, J., Mclaughlin, S., & Goertz, N. (2008). Amplify-and-forward with partial relay selection. IEEE Communications Letters, 12(4), 235–237. https://doi.org/10.1109/LCOMM.2008.071987.
Madan, R., Mehta, N.B., Molisch, A. F., & Zhang, J. (2006). Cth17-2: Energy-efficient cooperative relaying over fading channels with simple relay selection. In IEEE Globecom 2006 (pp. 1–6). https://doi.org/10.1109/GLOCOM.2006.130.
Ibrahim, A. S., Sadek, A. K., Su, W., & Liu, K. J. R. (2008). Cooperative communications with relay-selection: when to cooperate and whom to cooperate with? IEEE Transactions on Wireless Communications, 7(7), 2814–2827. https://doi.org/10.1109/TWC.2008.070176.
Bel, A., Vicario, G. S.-G. J. L., & Seco-Granados, G. The benefits of relay selection in WiMAX networks, ICT-MobileSummit08.
Fan, L., Lei, X., Yang, N., Duong, T. Q., & Karagiannidis, G. K. (2017). Secrecy cooperative networks with outdated relay selection over correlated fading channels. IEEE Transactions on Vehicular Technology, 66(8), 7599–7603. https://doi.org/10.1109/TVT.2017.2669240.
Li, M., Yin, H., Huang, Y., & Wang, Y. (2018). Impact of correlated fading channels on cognitive relay networks with generalized relay selection. IEEE Access, 6, 6040–6047. https://doi.org/10.1109/ACCESS.2017.2762348.
Cai, G., Fang, Y., Han, G., Xu, J., & Chen, G. (2018). Design and analysis of relay-selection strategies for two-way relay network-coded DCSK systems. IEEE Transactions on Vehicular Technology, 67(2), 1258–1271. https://doi.org/10.1109/TVT.2017.2751754.
Ahlswede, R., Cai, N., Li, S. Y. R., & Yeung, R. W. (2000). Network information flow. IEEE Transactions on Information Theory, 46(4), 1204–1216.
Prasad, N., & Varanasi, M. K. (2004). Diversity and multiplexing tradeoff bounds for cooperative diversity schemes. In Proceedings IEEE international symposium information theory, Chicago, IL (p. 271).
Li, Y., Louie, R. H. Y., & Vucetic, B. (2010). Relay selection with network coding in two-way relay channels. IEEE Transactions on Vehicular Technology, 59, 4489–4499.
Bletsas, A., Shin, H., Win, M., Lippman, A. (2006). Cooperative diversity with opportunistic relaying. In Proceedings IEEE wireless communications and networking conference, Las Vegas, NV (pp 1034–1039).
Lee, J., Wang, H., Andrews, J. G., & Hong, D. (2011). Outage probability of cognitive relay networks with interference constraints. IEEE Transactions on Wireless Communications, 10(2), 390–395. https://doi.org/10.1109/TWC.2010.120310.090852.
El-Moutaouakkil, Z., Tourki, K., Qaraqe, K. A., & Saoudi, S. (2012). Exact outage probability analysis for relay-aided underlay cognitive communications. In 2012 IEEE vehicular technology conference (VTC fall) (pp. 1–5). https://doi.org/10.1109/VTCFall.2012.6399044.
Bao, V. N. Q., & Tran, D. T. (2012) Performance analysis of cognitive underlay DF relay protocol with \(K\)th best partial relay selection. In The 2012 international conference on advanced technologies for communications (pp. 130–135). https://doi.org/10.1109/ATC.2012.6404245.
Liu, W.-C., Chen, Y.-N. (2012) . Dynamic decode and forward with network coding. In 2012 75th IEEE Vehicular technology conference (VTC Spring) (pp. 1–5).
Liu, W.-C., & Shih, C.-H. (2015). The performance of systems featuring dynamic decode-and-forward and network coding. Wireless Personal Communication, 80(1), 521–541. https://doi.org/10.1007/s11277-014-2024-4.
Wikipedia, Exclusive or—Wikipedia, the free encyclopedia, (Online; Accessed 19-Sept-2016) (2016). https://en.wikipedia.org/w/index.php?title=Exclusive_or&oldid=737876378.
Wikipedia, Floor and ceiling functions—Wikipedia, the free encyclopedia, (Online; Accessed 19-Sept.-2016) (2016). https://en.wikipedia.org/w/index.php?title=Floor_and_ceiling_functions&oldid=738350457.
Rappaport, T. S. (1996). Wireless communications: Principles and practice (2nd ed.). Upper Saddle River: Prentice Hall.
Wikipedia, Gamma function—Wikipedia, the free encyclopedia, (Online; accessed 1-September-2016) (2016). https://en.wikipedia.org/w/index.php?title=Gamma_function&oldid=736970096.
Wikipedia, Hypergeometric function—Wikipedia, the free encyclopedia, (Online; accessed 1-Sept.-2016) (2016). https://en.wikipedia.org/w/index.php?title=Hypergeometric_function&oldid=731322890.
Wikipedia, Riemann sum—Wikipedia, the free encyclopedia, (Online; accessed 5-July-2016) (2016). https://en.wikipedia.org/w/index.php?title=Riemann_sum&oldid=717589707.
Alamouti, S. M. (1998). A simple transmit diversity technique for wireless communications. IEEE Journal on Selected areas in Communications, 16(8), 1451–1458.
Forney, G. D, Jr., & Ungerboeck, G. (1998). Modulation and coding for linear Gaussian channels. IEEE Transactions on Information Theory, 44, 2384–2415.
Wikipedia, Power series — Wikipedia, the free encyclopedia, (Online; accessed 21-Oct.-2016) (2016). https://en.wikipedia.org/w/index.php?title=Power_series&oldid=743563194.
Acknowledgements
The authors thank Professor Chiu-Chu Melissa Liu for providing the proof of Lemma 1. This work was supported by the National Science Council, Taiwan, under contract NSC 101-2221-E-194-037.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Appendices
Appendix 1: Proof of Lemma 1
Let \(X_l = |h_{\mathrm{A},l}|^2\) and \(Y_l = |h_{\mathrm{B},l}|^2\) for \(l = 1, \ldots , L\). Then, \(X_1, \ldots , X_L\), \(Y_1, \ldots , Y_L\) are independent identically distributed (i.i.d.) exponential random variables with the parameter \(\lambda = 1\). The PDFs of \(X_l\) and \(Y_l\) are
and
respectively.
Define \(S_l = \min \{X_l, Y_l\}\) and \(T_l = \max \{X_l, Y_l\}, \quad l = 1, \ldots , L.\) Then, the joint PDF of \(S_l\) and \(T_l\) is
The PDF of \(S_l\) is
The conditional PDF of \(T_l\) given \(S_l\) is
Let
Define \(Z_1 = X_{l_0}, \quad Z_2 = Y_{l_0}, \quad U = \min \{Z_1, Z_2\},\) and \(V = \max \{Z_1, Z_2\}.\) Then,
The cumulative distribution function (CDF) of U is
The PDF of U is
If \(u \ge v \ge 0\), then the joint PDF of U and V is
where \(f_{V|U}(v|u)\) is the conditional PDF of V given U. We have
We also have
Therefore,
Appendix 2: Proof of Theorem 1
The probability of event \( O_{\mathrm{A,B}}^{\mathrm{DDF \& NC}}\) is
The equality (b) holds because \(|h_{\mathrm{A},{\mathrm{B}}}|^2\) is an exponential random variable with a rate parameter of 1. Moreover,
where the integration region \({{\mathcal {R}}}\) is
where
and
Equations (85) and (86) come from (7) and (11), respectively, with the assumption \(\rho _{\mathrm{A},l^*}= \rho _{\mathrm{B},l^*}= \rho \). From (79)–(86), we find that \({{\mathcal {R}}}\) is symmetric about the line \(z_1 = z_2\) and restricted in the first quadrant on the \(z_1\)–\(z_2\) plane. The integrand of (78), \(f_{Z_1,Z_2}(z_1,z_2)\), is also a symmetric function of \(z_1\) and \(z_2\). Therefore,
where
We can further derive \({{\mathcal {R}}} \cap {{\mathcal {R}}}_{\pi /4}\) as
First, we must find the intersection point \(P_1\) of the boundary of \({{\mathcal {R}}}_4\) and the line \(z_2 = z_1\). The boundary of \({{\mathcal {R}}}_4\) is
Substituting \(z_2 = z_1\) into (90) yields
The region \({{\mathcal {R}}}_5\) is illustrated in Fig. 16, where \(N_s\) is the number of stairs. The value of \(N_s\) can be easily found as in (33).
The boundary of \({{\mathcal {R}}}_1\) is
Solving (92) yields
The next step is to find \(z_{1, i}\) and \(z_{2, i}\) for \(i \ge 2\). Noting that the edge of each stair is located at \(z_1 = z_{1, i}\) for \(i = 2, 3,\ldots , N_s+1\). Let the boundary of \({{\mathcal {R}}}_5\) be \(f_5(z_1, z_2) = 0\). Then,
must have Dirac delta functions at \(z_1 = z_{1, i}\) for \(i = 2, 3,\ldots , N_s+1\). After some calculation, we find
for \(i \ge 2\). Substituting \(z_{1, i}\) in \(f_5(z_1, z_2) = 0\) can yield \(z_{2, i}\) for \(i \ge 2\), as shown in (31).
Third, the following must be computed:
We first calculate the integration up to \(z_1 = z_{1, 2}\). Let
Then,
Because of space limitations, we do not detail the integration here. Next, consider the integration region
Then,
Similarly, for the integration region
we have
for \(i = 3, 4,\ldots , N_s\). For the integration region
we have
Summing up (98), (102), and (104) yields
Finally,
which is equal to (28).
Appendix 3: Proof of Theorem 2
First, consider the first term of (28):
where the approximation results from the power series [37] expansion for the second line of (107) about the point \(\rho = \infty \) to order \(\rho ^1\).
Similarly, the second term of (28) can be approximated as
To find an approximation of the third term of (28), we must first find an approximation of \(z_{2,i}\) for \(i \ge 2\). When \(\rho \) is very large,
is very small. Therefore,
and
Similarly,
Substituting (111) and (112) into
which comes from (31), leads to
Solving (114) yields
Therefore, the third term of (28) can be approximated as
Using the technique of power series expansion again, we approximate the fourth term of (28) as
Substituting (107), (108), (116), and (117) into (28) yields (35). Note that (116) can be ignored because it contains the term \(\rho ^{-(L + 2)}\). When \(\rho \) is very large, \(\rho ^{-(L + 1)} \gg \rho ^{-(L + 2)}\).
Appendix 4: Proof of Theorem 3
The diversity gain [2] of the RS-DDF&NC scheme is
Appendix 5: Proof of Theorem 4
When we do not use coding (i.e., we do not use DDF or NC), only RS is performed. The system block diagram is shown in Figs. 17 and 18.
First, consider the outage event of User A. If the links from User B to User A and those from relay \(l^*\) to User A are both in outage, then User A cannot receive the information of User B. Therefore, the outage event of User A can be expressed as follows:
Similarly, User B cannot receive the information of User A when the links from User A to User B and those from relay \(l^*\) to User B are both in outage. We express the outage event of User B as follows:
In the next step, we analyze the outage events between User A, User B, and relay \(l^*\). The outage event between Users A and B is
Clearly, \(O_{\mathrm{B,A}}^{\mathrm{RS}}= O_{\mathrm{A,B}}^{\mathrm{RS}}\) because \(h_{\mathrm{B},\mathrm{A}}= h_{\mathrm{A},\mathrm{B}}\).
Then, we consider the outage event between relay \(l^*\) and User A:
Similarly,
The outage event of the overall system can be expressed as
Therefore, the outage probability of RS can be expressed as
Because of space limitations, we do not detail the derivation here. The first integral in (125) is equal to
The double integral in (125) is equal to
Substituting (126) and (127) into (125) yields
When \(\rho \) is large, using the Taylor series to expand (128) up to the first-order term results in
From (35), we know
From (129), we know
When \( P_{\mathrm{out}}^{\mathrm{RS}}= P_{\mathrm{out}}^{\mathrm{RS-DDF \& NC}}= P_{\mathrm{out}}\), we let the SNR of RS be \(\rho ^{\mathrm{RS}}\) and that of the RS-DDF&NC scheme be \( \rho ^{\mathrm{RS-DDF \& NC}}\). Then, the coding gain of the RS-DDF&NC scheme is
Appendix 6: Proof of Theorem 5
Both Users A and B transmit at rate R; therefore, the sum rate is \(R_{\Sigma } = 2R\). The multiplexing gain of \(R_{\Sigma }\) is
According to Theorem 3, the diversity gain of the RS-DDF&NC scheme is
Equation (134) can be rewritten as
Substituting (135) into (133) yields (38).
Appendix 7: Proof of Theorem 6
When the SNR is high, \(\rho \) is very large. The multiplexing gain
is a very small positive number. Therefore, \(r < 0.5\) and the EDDF and DDF protocols are identical ([6], Theorem 3). Thus, the RS-DDF&NC and RS-EDDF&NC schemes have the same asymptotic behavior.
Rights and permissions
About this article
Cite this article
Liu, WC. Performance Analysis of Relay Selection with Enhanced Dynamic Decode-and-Forward and Network Coding in Two-Way Relay Channels. Wireless Pers Commun 109, 909–944 (2019). https://doi.org/10.1007/s11277-019-06597-3
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11277-019-06597-3