Skip to main content
Log in

A reliable relay selection scheme for SSK modulation in cooperative communication systems

  • Published:
Wireless Networks Aims and scope Submit manuscript

Abstract

Space shift keying (SSK) modulation is a scheme in which the indices of active transmit antennas play an essential role in carrying information bits. In SSK modulation, the communication channel acts as modulating unit. Therefore, using the conventional relay selection schemes based on channel coefficients are impossible in cooperative systems using SSK modulation. In this paper, we propose a novel relay selection scheme that is applicable in cooperative systems using SSK modulation. The proposed scheme is based on calculating and measuring the Euclidean distances between received signal and all active or inactive channel coefficients. The proposed relay selection scheme is applied for a cooperative communication system with multiple relay nodes and a direct link between source and destination. The analytical expressions are derived to calculate the average bit error rate over Rayleigh fading channels. The analytical and simulation results show that this relay selection scheme can provide a full cooperative diversity order, for SSK modulation. In addition, we show that this scheme can be used at destination as a signal selection method, to select the best received signal from different paths. The analytical results are validated using Monte Carlo simulation studies.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7

Similar content being viewed by others

References

  1. Chau, Y., & Yu, S.-H. (2001). Space modulation on wireless fading channels. In Vehicular technology conference, 2001. VTC 2001 Fall. IEEE VTS 54th (Vol. 3, pp. 1668–1671).

  2. Di Renzo, M., Haas, H., Ghrayeb, A., Sugiura, S., & Hanzo, L. (2014). Spatial modulation for generalized mimo: Challenges, opportunities, and implementation. Proceedings of the IEEE, 102(1), 56–103.

    Article  Google Scholar 

  3. Di Renzo, M., Haas, H., & Grant, P. M. (2011). Spatial modulation for multiple-antenna wireless systems: A survey. IEEE Communications Magazine, 49(12), 182–191.

    Article  Google Scholar 

  4. Mesleh, R., Ikki, S., & Alwakeel, M. (2011). Performance analysis of space shift keying with amplify and forward relaying. IEEE Communications Letters, 15(12), 1350–1352.

    Article  Google Scholar 

  5. Wen, M., Cheng, X., Poor, H., & Jiao, B. (2014). Use of SSK modulation in two-way amplify-and-forward relaying. IEEE Transactions on Vehicular Technology, 63(3), 1498–1504.

    Article  Google Scholar 

  6. Narayanan, S., Di Renzo, M., Graziosi, F., & Haas, H. (2013). Distributed spatial modulation for relay networks. In Vehicular technology conference (VTC Fall), 2013 IEEE 78th (pp. 1–6).

  7. Xie, X., Zhao, Z., Peng, M., & Wang, W. (2012). Spatial modulation in two-way network coded channels: Performance and mapping optimization. In Personal indoor and mobile radio communications (PIMRC), 2012 IEEE 23rd international symposium on (pp. 72–76).

  8. Mesleh, R., & Ikki, S. (2013). Performance analysis of spatial modulation with multiple decode and forward relays. IEEE Wireless Communications Letters, 2(4), 423–426.

    Article  Google Scholar 

  9. Som, P., & Chockalingam, A. (2014). Bit error probability analysis of SSK in DF relaying with threshold-based best relay selection and selection combining. IEEE Communications Letters, 18(1), 18–21.

    Article  Google Scholar 

  10. Sugiura, S., Chen, S., Haas, H., Grant, P. M., & Hanzo, L. (2011). Coherent versus non-coherent decode-and-forward relaying aided cooperative space-time shift keying. IEEE Transactions on Communications, 59(6), 1707–1719.

    Article  Google Scholar 

  11. Sendonaris, A., Erkip, E., & Aazhang, B. (2003a). User cooperation diversity. Part I. System description. IEEE Transactions on Communications, 51(11), 1927–1938.

    Article  Google Scholar 

  12. Sendonaris, A., Erkip, E., & Aazhang, B. (2003b). User cooperation diversity. Part II. Implementation aspects and performance analysis. IEEE Transactions on Communications, 51(11), 1939–1948.

    Article  Google Scholar 

  13. Laneman, J., Tse, D., & Wornell, G. W. (2004). Cooperative diversity in wireless networks: Efficient protocols and outage behavior. IEEE Transactions on Information Theory, 50(12), 3062–3080.

    Article  MathSciNet  MATH  Google Scholar 

  14. Jing, Y., & Jafarkhani, H. (2009). Single and multiple relay selection schemes and their achievable diversity orders. IEEE Transactions on Wireless Communications, 8(3), 1414–1423.

    Article  Google Scholar 

  15. Koyuncu, E., Jing, Y., & Jafarkhani, H. (2008). Distributed beamforming in wireless relay networks with quantized feedback. IEEE Journal on Selected Areas in Communications, 26(8), 1429–1439.

    Article  Google Scholar 

  16. Zhao, Y., Adve, R., & Lim, T. J. (2007). Improving amplify-and-forward relay networks: Optimal power allocation versus selection. IEEE Transactions on Wireless Communications, 6(8), 3114–3123.

    Google Scholar 

  17. Bletsas, A., Shin, H., & Win, M. (2007). Outage optimality of opportunistic amplify-and-forward relaying. IEEE Communications Letters, 11(3), 261–263.

    Article  Google Scholar 

  18. Zhao, Y., Adve, R., & Lim, T. J. (2006). Symbol error rate of selection amplify-and-forward relay systems. IEEE Communications Letters, 10(11), 757–759.

    Article  Google Scholar 

  19. Lin, Z., Erkip, E., & Stefanov, A. (2006). Cooperative regions and partner choice in coded cooperative systems. IEEE Transactions on Communications, 54(7), 1323–1334.

    Article  Google Scholar 

  20. Sreng, V., Yanikomeroglu, H., & Falconer, D. (2003). Relayer selection strategies in cellular networks with peer-to-peer relaying. In Vehicular technology conference, 2003. VTC 2003-Fall. 2003 IEEE 58th (Vol. 3, pp. 1949–1953).

  21. Bletsas, A., Khisti, A., Reed, D., & Lippman, A. (2006). A simple cooperative diversity method based on network path selection. IEEE Journal on Selected Areas in Communications, 24(3), 659–672.

    Article  Google Scholar 

  22. Ribeiro, A., Cai, X., & Giannakis, G. (2005). Symbol error probabilities for general cooperative links. IEEE Transactions on Wireless Communications, 4(3), 1264–1273.

    Article  Google Scholar 

  23. Esmaeili, M., & Mohammadi, A. (2016). Characterization of IDF and SDF relaying protocols in SSK modulation systems. Wireless Personal Communications, 1–22. doi:10.1007/s11277-016-3719-5.

  24. Brennan, D. G. (1959). Linear diversity combining techniques. Proceedings of the IRE, 47(6), 1075–1102.

    Article  Google Scholar 

  25. Jeganathan, J., Ghrayeb, A., & Szczecinski, L. (2008). Spatial modulation: Optimal detection and performance analysis. IEEE Communications Letters, 12(8), 545–547.

    Article  Google Scholar 

  26. Younis, A., Di Renzo, M., Mesleh, R., & Haas, H. (2011). Sphere decoding for spatial modulation. In Communications (ICC), 2011 IEEE international conference on (pp. 1–6).

  27. Jeganathan, J., Ghrayeb, A., Szczecinski, L., & Ceron, A. (2009). Space shift keying modulation for MIMO channels. IEEE Transactions on Wireless Communications, 8(7), 3692–3703.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Mohammad Esmaeili.

Appendices

Appendix 1

In this appendix, it is proved that, when \(N_{t}>2\), one of the \(x_{min,1}\) or \(x_{min,2}\) equals \(\left| n \right| ^{2}\) with high probability, where n is the noise of the received signal. Assume that \(x_{min}\) is a vector with the elements of \(x_{min,q}\) which are the values of \(d_{i}\)’s in increasing order, where \(q=1,2,\ldots ,N_{t}\). The probability that \(x_{min,1}=\left| n \right| ^{2}\) is equal to the correct detection probability by optimum detector and is obtained as

$$\begin{aligned} Pr\left( x_{min,1}=\left| n \right| ^{2} \right) =1-\left( 1+\frac{2\sigma _{h}^{2}\rho _{s}}{N_{0}\left( N_{t}-1 \right) } \right) ^{-1}. \end{aligned}$$
(28)

Using the probability theory, the probability that \(x_{min,2}=\left| n \right| ^{2}\) is calculated by

$$\begin{aligned} Pr\left( x_{min,2}=\left| n \right| ^{2} \right)&= \left( 1+\frac{2\sigma _{h}^{2}\rho _{s}}{N_{0}\left( N_{t}-1 \right) } \right) ^{-1}\nonumber \\&\quad \times \left[ 1-\left( 1+\frac{2\sigma _{h}^{2}\rho _{s}}{N_{0}\left( N_{t}-2 \right) } \right) ^{-1} \right] . \end{aligned}$$
(29)

Therefore, using the probability theory, the general expression of \(Pr\left( x_{min,q}=\left| n \right| ^{2} \right)\) is derived as

$$\begin{aligned} Pr\left( x_{min,q}=\left| n \right| ^{2} \right)&= \left[ 1-\left( 1+\frac{2\sigma _{h}^{2}\rho _{s}}{N_{0}\left( N_{t}-q \right) } \right) ^{-1} \right] \nonumber \\&\quad \times \prod _{j=1}^{q-1} \left( 1+\frac{2\sigma _{h}^{2}\rho _{s}}{N_{0}\left( N_{t}-j \right) } \right) ^{-1} \end{aligned}$$
(30)

It should be noted that the probability that \(x_{min,1}=\left| n \right| ^{2}\) or \(x_{min,2}=\left| n \right| ^{2}\) is equal to \(Pr\left( x_{min,1}=\left| n \right| ^{2} \right) +Pr\left( x_{min,2}=\left| n \right| ^{2} \right)\).

It is obvious from (30) that \(Pr\left( x_{min,q}=\left| n \right| ^{2} \right)\) decreases more with increasing q. For \(q>2\) and \(\rho _{s}> 10\) dB, the value of \(Pr\left( x_{min,q}=\left| n \right| ^{2} \right)\) is negligible in (30), in comparison to the value of \(Pr\left( x_{min,1}=\left| n \right| ^{2} \right) +Pr\left( x_{min,2}=\left| n \right| ^{2} \right)\). Therefore, with high probability one of the \(x_{min,1}\) or \(x_{min,2}\) is equal to \(\left| n \right| ^{2}\).

Appendix 2

In this appendix, we want to derive the error probability presented in (24). Using optimum detection, when \(\left| n_{sd} \right| ^{2}+\left| n_{r_{j}d} \right| ^{2}>\mathop {\min }\nolimits _{i=1,\ldots ,N_{t} } \left\{ \left| y_{sd}-\sqrt{\rho }g_{i} \right| ^{2}+\left| y_{r_{j}d}-\sqrt{\rho }f_{j,i} \right| ^{2} \right\}\), an error will take place at the destination. We define w as \(w=\left| n_{sd} \right| ^{2}+\left| n_{r_{j}d} \right| ^{2}\). The random variable w is sum of two independent exponential random variables with variances of \(N_{0}\). The PDF of w is obtained as

$$\begin{aligned} f_{W}\left( w \right) =\left( \frac{1}{N_{0}} \right) ^{2}w~exp\left( \frac{-w}{N_{0}} \right) . \end{aligned}$$
(31)

As mentioned before, for large values of \(\rho\), the value of \(\mathop {\min }\nolimits _{i=1,\ldots ,N_{t} } \left\{ \left| y_{sd}-\sqrt{\rho }g_{i} \right| ^{2}+\left| y_{r_{j}d}-\sqrt{\rho }f_{j,i} \right| ^{2} \right\}\), is approximated as \(\rho \mathop {\min }\nolimits _{i=1,\ldots ,N_{t} } \left\{ \left| g_{t}-g_{i} \right| ^{2}+\left| f_{j,t}-f_{j,i} \right| ^{2} \right\} =\rho \mathop {\min } \left\{ r_{i} \right\}\), where \(r_{i}=\left| g_{t}-g_{i} \right| ^{2}+\left| f_{j,t}-f_{j,i} \right| ^{2}\) is sum of two independent exponential random variables, with variances of \(2\sigma _{g}^{2}\) and \(2\sigma _{f}^{2}\), respectively. The PDFs of \(r_{i}\)’s are obtained by

$$\begin{aligned} f_{R_{i}}\left( r_{i} \right) = \left\{ \begin{array}{ll} \left( \frac{1}{2\sigma _{g}^{2}} \right) ^{2}r_{i}~exp\left( \frac{-r_{i}}{2\sigma _{g}^{2}} \right) &{}\quad 2\sigma _{g}^{2} = 2\sigma _{f}^{2} \\ \frac{exp\left( \frac{-r_{i}}{2\sigma _{f}^{2}} \right) -exp\left( \frac{-r_{i}}{2\sigma _{g}^{2}} \right) }{2\sigma _{f}^{2}-2\sigma _{g}^{2}} &{}\quad 2\sigma _{g}^{2} \ne 2\sigma _{f}^{2}. \end{array}\right. \end{aligned}$$
(32)

The parameter v is defined as \(v=\mathop {\min }\nolimits _{i=1,\ldots ,N_{t} } \left\{ r_{i} \right\}\). Then, the CDF of v is obtained by

$$\begin{aligned} F_{V}\left( v \right)&= Pr\left( \mathop {\min }\limits _{i=1,\ldots ,N_{t} } \left\{ r_{i} \right\} \leqslant v \right) \nonumber \\&= 1-\left[ \int _{v}^{\infty }f_{R_{i}}\left( r_{i} \right) dr_{i} \right] ^{N_{t}-1}. \end{aligned}$$
(33)

By obtaining the CDF of v, the PDF \(f_{V}\left( v \right)\) is calculated as

$$\begin{aligned} f_{V}\left( v \right)&= \frac{dF_{V}\left( v \right) }{dv} \nonumber \\&= \left( N_{t}-1 \right) \left[ \int _{v}^{\infty }f_{R_{i}}\left( r_{i} \right) dr_{i} \right] ^{N_{t}-2} f_{R_{i}}\left( v \right) . \end{aligned}$$
(34)

Then, substituting (32) into (34) yields (25) and (26) for \(2\sigma _{g}^{2}\ne 2\sigma _{f}^{2}\) and \(2\sigma _{g}^{2}=2\sigma _{f}^{2}\), respectively. Finally, having \(f_{W}\left( w \right)\) from (31) and \(f_{V}\left( v \right)\) from (34), \(Pr\left( E_{d} \right| C_{r})\) in (24) is completely calculated.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Esmaeili, M., Mohammadi, A. A reliable relay selection scheme for SSK modulation in cooperative communication systems. Wireless Netw 24, 1927–1937 (2018). https://doi.org/10.1007/s11276-017-1448-7

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11276-017-1448-7

Keywords

Navigation