Skip to content


  • Research
  • Open Access

Relay selection for DF-based cooperative vehicular systems

EURASIP Journal on Wireless Communications and Networking20152015:30

  • Received: 30 January 2014
  • Accepted: 6 January 2015
  • Published:


In this paper, error performance analysis of decode-and-forward (DF)-based cooperative vehicular networks with relay selection is investigated. All of the links in the system are modeled as cascaded Nakagami-m distributed random variables which provide a realistic description of an intervehicular channel. We employ virtual-noise (VN)-based demodulation, maximum likelihood (ML) demodulation, cooperative maximal ratio combining (C-MRC), and log-likelihood-ratio-based transmissions in mitigating error propagation effect encountered in DF cooperative networks. In order to obtain more effective solutions and improve the system performance, we introduce hybrid anti-error propagation approaches, namely VN-MRC, VN-ML, and VN-LLR in which relay selection criterion is derived by using conditional bit error rate (BER) expressions of VN technique while data detection is performed by utilizing maximal ratio combining (MRC), ML detection, C-MRC and LLR transmission methods. The performance analyses and the numerical results for cascaded Nakagami-m channels have shown that VN-LLR approach provides significant performance improvement with respect to the other considered techniques in DF cooperative vehicular systems with relay selection.


  • Cooperative communication
  • Decode and forward
  • Relay selection
  • Maximal ratio combining
  • Virtual noise
  • Maximum likelihood
  • Log-likelihood ratio
  • Cooperative maximal ratio combining
  • Cascaded Nakagami-m fading

1 Introduction

In most of the wireless applications, the users may not be able to support multiple antennas due to the size, complexity, and power limitations. The fundamental challenges of wireless medium such as time-varying characteristics of the channels and multiuser interference can be mitigated with cooperative diversity which depends on the concept of cooperation among distributed single-antenna wireless nodes and emerged recently as an alternative to multi-antenna systems to obtain spatial diversity [1-3]. The main idea behind cooperative diversity systems is that the source and the destination terminals communicate with each other with the help of intermediate nodes called relay terminals. Various cooperative relaying schemes exist in literature and two of the most well-known are amplify-and-forward (AF) and decode-and-forward (DF) protocols. In AF relaying, the relay terminal transmits a scaled version of received signal without decoding the message. In DF relaying, the relay terminal decodes its received signal and then re-encodes it for transmission to the destination [1-4]. The fundamental destructive effect encountered in AF-based wireless networks is the re-transmission of the amplified version of the noise terms while the most important problem in DF-based cooperative systems is the error propagation due to the decoding errors at relay terminals which cause reduction in the effective signal-to-noise ratio (SNR) at the destination.

Performance of wireless relay networks can further be improved by selection of cooperating relays [5,6]. In most of the relay selection-based cooperative network structures in the literature, the data transmission is realized with single relay selection. Bletsas et al. have proposed a relay selection algorithm for multi-relay systems in [7] where the best relay is chosen for transmission. In [8], the authors propose a relay selection criterion in which the relay with the maximum SNR in relay-to-destination link cooperates. Relay selection approaches based on scaled harmonic means of the instantaneous SNRs of source-to-relay and relay-to-destination [9] links also exist in the literature.

In AF cooperative systems, Anghel and Kaveh showed that maximal ratio combining (MRC) is the optimum detection technique at destination [10]. On the other hand, MRC may not supply full diversity gain in DF cooperative systems because of the error propagation. Although, maximum likelihood (ML) technique may be impractical in some scenarios, it was shown in [2] that ML detection achieves full diversity level for single-relay DF-based cooperative systems. Laneman and Wornell proposed a piecewise linear (PL) approximation [11] which removes non-linear behavior of the optimum ML receiver [11,12] and simplifies the mathematical analyses. However, this approach still requires considering all possible symbol detection cases at the relays as well as the destination which increases the complexity of the receiver exponentially with the modulation order and the number of users. In [13], Yi and Kim showed that cooperative maximal ratio combining (C-MRC) technique has nearly the same performance as the optimum ML technique with less complexity and they combined the C-MRC technique with the relay selection. Another recent demodulation technique developed for combating error propagation problem is virtual noise (VN)-based detection [14]. This technique depends on the idea of considering the detection errors at the relay as addition of virtual noise at the destination node. This new concept removes the computational complexity encountered in realization of ML-based receivers and provides full diversity advantage. In [14], VN-based demodulation approach has been applied to different cooperative communication scenarios. In [15-20], log-likelihood-ratio (LLR)-based transmission model which is also known as decode-amplify-forward (DAF) protocol or soft information relaying has been proposed as another promising method for alleviating the effect of error propagation. In this approach, the soft estimates of the corresponding transmitted symbols are forwarded in an analog manner to combine the coding gain in DF protocol and the soft representation of the data in AF technique. Here, relay will first soft decode the received signal, amplify the LLR values of each bit at the output of the decoder, and finally transmit them to destination [18].

Experimental results and theoretical analyses demonstrate that classical fading channels, i.e., Rayleigh, Rician, Nakagami, and the related second-order channel statistics proposed originally for a base station-to-mobile link fail to provide an accurate model for intervehicular links [21,22]. Instead, cascaded fading channel models have been proposed which provide a more realistic description of vehicle-to-vehicle channels or mobile-to-mobile channels where two or more independent fading processes are assumed to be generated by independent groups of scatterers around the two mobile terminals [22,23].

The cascaded Rayleigh fading channel [24] obtained by the product of N-independent Rayleigh distributed random variables is one of the important forms of cascaded fading models. For N = 2, it reduces to double Rayleigh fading distribution which has been considered in [25-27]. Afterwards, this model has been extended to the cascaded Nakagami-m channel in [28-31]. Cascaded Rayleigh and cascaded Nakagami-m fading channels are also studied in cooperative communication systems [32] and references there in. Cascaded Weibull fading channel is investigated in [33] and cascaded generalized-K fading channel is further introduced and investigated in [34]. The outage and the SER performance of two-way communication are examined over cascaded Nakagami-m fading channels in [35]. Moreover, the performance of VN-based detection technique for mitigating error propagation in wireless relay systems employing DF protocol is investigated in [36].

In this paper, we consider a DF-based cooperative vehicular communication system model with relay selection where the underling channels between cooperation nodes are modeled as cascaded Nakagami-m distribution. After investigating the error performance of MRC and C-MRC detectors, we introduce VN-MRC-, VN-ML-, and VN-LLR-based system models with relay selection. The reminder of this paper is organized as follows: Section 2 presents the system and channel model. In Section 3, we focus on the relay selection methods and performance analysis of considered system. In Section 4, the numerical results are presented. Finally, the concluding remarks are given in Section 5.

2 System and channel model

We consider intervehicular cooperative communication system with a source (S), a destination (D), and M relay (R) vehicles as shown in Figure 1. Every terminal operates in half-duplex mode and is equipped with a single antenna.
Figure 1
Figure 1

System model.

The normalized distances between the source and kth relay, kth relay and destination, and source and destination are represented by \( {d}_{S{R}_k} \), \( {d}_{R_kD} \), and d S D , respectively. The complex fading coefficients of SR k , R k D, and SD links are denoted by \( \alpha {}_{S{R}_k}, \) \( {\beta}_{{\mathrm{R}}_k\mathrm{D}} \), and α SD , respectively. The magnitude of all of the links follow cascaded Nakagami-m distribution which is the product of N Nakagami-m distributions as \( {\alpha}_{\mathrm{S}{\mathrm{R}}_k} = {\alpha}_{\mathrm{S}{\mathrm{R}}_k}^1 \dots {\alpha}_{\mathrm{S}{\mathrm{R}}_k}^N, \) \( {\beta}_{{\mathrm{R}}_k\mathrm{D}} = \kern0.5em {\beta}_{{\mathrm{R}}_k\mathrm{D}}^1\kern0.1em \dots \kern0.32em {\beta}_{{\mathrm{R}}_k\mathrm{D}}^N, \) \( {\alpha}_{\mathrm{SD}} = {\alpha}_{\mathrm{SD}}^1\kern0.22em \dots \kern0.32em {\alpha}_{\mathrm{SD}}^N \) where N is the degree of cascading. The probability density function (PDF) of Nakagami-m distribution is given by [37]:
$$ {p}_Z(z)=\frac{2{m}^m{z}^{2m\mathit{\hbox{-}} 1}}{\varGamma (m){\varOmega}^m} \exp \left(\mathit{\hbox{-}}\frac{m{z}^2}{\varOmega}\right) $$
where \( Z\in \left\{{\alpha}_{SD}^1,\dots, {\alpha}_{SD}^N,{\alpha}_{S{R}_k}^1,\dots, {\alpha}_{S{R}_k}^N,{\beta}_{R_kD}^1,\dots, {\beta}_{R_kD}^N\right\} \), Γ(.) is the Gamma function [37], Ω = E{Z 2}, m = Ω/E{Z 2  ‐ Ω 2 } ≥ 0.5 is the Nakagami-m fading parameter and E{.} is the statistical expectation operation. Note that m = 1 case corresponds to the Rayleigh distribution. By using (1), the PDF of cascaded Nakagami-m fading channel can be given as [28]:
$$ {p}_V(v)=\frac{2}{v{\prod}_{i=1}^N\varGamma \left({m}_i\right)}{G}_{0,N}^{N,0}\left({v}^2{\displaystyle \prod_{i=1}^N\left({m}_i/{\varOmega}_i\right)\left|{}_{m_1,\dots, {m}_N}^{-}\right.}\right) $$
where \( V\in \left\{{\alpha}_{\mathrm{S}\mathrm{D}},\kern0.5em {\alpha}_{\mathrm{S}{\mathrm{R}}_k},\kern0.5em {\beta}_{{\mathrm{R}}_k\mathrm{D}}\right\} \) and \( {G}_{.,.}^{.,.}(.) \) is the Meijer-G function [28]. In this paper, destination node is assumed to have full channel state information of the system via pilot signaling, determines the relay with best channel condition and declares the index of the selected relay to all relays through the feedback link.
The transmission is accomplished in two phases. In the first phase, the source transmits its binary phase-shift keying (BPSK) modulation symbol block x and the received signals by the relays and destination can be given as:
$$ {y}_{S{R}_k}=\sqrt{E_s}x{\alpha}_{S{R}_k}+{n}_{S{R}_k}, $$
$$ {y}_{SD}=\sqrt{E_s}x{\alpha}_{SD}+{n}_{SD}, $$
where E s is the average transmitted energy per symbol and \( {n}_{{\mathrm{SR}}_k} \) and n SD represent noise terms at the kth relay and the destination, respectively. In the second phase, the selected relay terminal estimates the signal received at the first phase and then transmits the estimated symbol block \( {\hat{x}}_k \) to the destination. The received signal at the destination can be written as:
$$ {y}_{R_kD}=\sqrt{E_s}{\widehat{x}}_k{\beta}_{R_kD}+{n}_{R_kD}, $$
$$ {\widehat{x}}_k= \arg \underset{x\in \left\{-1,1\right\}}{ \min }{\left|{y}_{S{R}_k}-\sqrt{E_s}x{\alpha}_{S{R}_k}\right|}^2 $$
and \( {n}_{{\mathrm{R}}_k\mathrm{D}} \) is the noise term at the destination. All noise terms in (3) to (5) are the additive white Gaussian noise (AWGN) components modeled as complex random variables with zero mean and variance of N 0/2 per dimension. Then, the instantaneous SNRs of the S → R k , R k  → D, and S → D links can be given as \( {\gamma}_{S{R}_{{}_k}}={E}_s{\left|{\alpha}_{S{R}_k}\right|}^2/{N}_0,\ {\gamma}_{R_kD}={E}_s{\left|{\beta}_{R_kD}\right|}^2/{N}_0 \) and γ SD  = E s |α SD |2/N 0, respectively.

3 Relay selection criteria and symbol error rate analysis

In this section, mathematical expression of the relay selection criteria and performance analyses of the considered schemes are provided.

3.1 MRC-based model

In MRC-based relaying model, the end-to-end bit error rate (BER) in S → R k  → D link, \( {P}_{\mathrm{eq}}^{\mathrm{b}}\left({\gamma}_{{\mathrm{SR}}_k},\kern0.5em {\gamma}_{{\mathrm{R}}_k\mathrm{D}}\right) \) can be determined by [38]:
$$ {P}_{eq}^b\left({\gamma}_{S{R}_k},{\gamma}_{R_kD}\right)=\left[1-{P}_{S{R}_k}^b\left({\gamma}_{S{R}_k}\right)\right]{P}_{R_kD}^b\left({\gamma}_{R_kD}\right)+\left[1-{P}_{R_kD}^b\left({\gamma}_{R_kD}\right)\right]{P}_{S{R}_k}^b\left({\gamma}_{S{R}_k}\right) $$
In (7), \( {P}_{\mathrm{S}{\mathrm{R}}_k}^b \) and \( {P}_{{\mathrm{R}}_kD}^b \) are the BERs of S → R k and R k  → D links which can be calculated by \( {P}_{S{R}_k}^b=Q\left(\sqrt{2{\gamma}_{S{R}_k}}\right) \) and \( {P}_{R_kD}^b=Q\left(\sqrt{2{\gamma}_{R_kD}}\right) \), respectively, for BPSK modulation where \( Q(x)=\left(1/\sqrt{2\pi}\right){\displaystyle {\int}_x^{\infty } \exp \left(-{t}^2/2\right)dt} \). The equivalent SNR of S → R k  → D link γ eq, k can be expressed by [38]:
$$ {\gamma}_{eq,k}=\frac{1}{\eta}\left\{{Q}^{-1}\left[{P}_{eq}^b\left({\gamma}_{S{R}_k},{\gamma}_{R_kD}\right)\right]\right\} $$
where η = 2 for BPSK modulation. Therefore, the relay selection criterion for MRC-based system model can be expressed as:
$$ k=\underset{k^{\mathit{\prime}}\in \left\{1,2,\dots, M\right\}}{\mathrm{argmax}}{\gamma}_{eq,{k}^{\mathit{\prime}}} $$
where k denotes the index of the selected relay. At the destination, MRC technique is used to combine the signals y SD and \( {y}_{{\mathrm{R}}_k\mathrm{D}} \). Thus, the combined signal at the destination can be given as:
$$ {y}_D={\omega}_{SD}{y}_{SD}+{\omega}_{R_kD}{y}_{R_kD} $$
Here, ω SD and \( {\omega}_{R_kD} \) are the weighting coefficients which are the functions of αSD and \( {\beta}_{{\mathrm{R}}_k\mathrm{D}} \). Substituting \( {\omega}_{SD}={\alpha}_{{}_{SD}}^{*} \) and \( {\omega}_{R_kD}={\beta}_{{}_{R_kD}}^{*} \) into (10), the combined signal at the destination can be given as:
$$ {y}_D={\alpha}_{SD}^{*}{y}_{SD}+{\beta}_{R_kD}^{*}{y}_{R_kD} $$
where (.)* denotes the complex conjugate operator. The received SNR at the destination can be expressed as γ tot  = γ b  + γ SD where γ b  = γ eq,k and the PDF of γ tot can be calculated by:
$$ p\left({\gamma}_{tot}\right)={\displaystyle {\int}_0^{\gamma_{tot}}{p}_{\gamma_{SD}}(x){p}_{\gamma_b}\left({\gamma}_{tot}-x\right)dx} $$
The end-to-end probability of error can be written as [39]:
$$ {P}_e={P}_{prop}{P}_{S{R}_k}+\left(1-{P}_{S{R}_k}\right){P}_{MRC}, $$
where P prop denotes the probability of error propagation and P MRC is the error probability of combined signals. P prop can be approximated for BPSK modulation by [39]:
$$ {P}_{prop}\approx {\overline{\gamma}}_b/\left({\overline{\gamma}}_b+{\overline{\gamma}}_{SD}\right) $$
where \( {\overline{\gamma}}_b \) and \( {\overline{\gamma}}_{SD} \) are the expected values of γ b and γ SD , respectively. Similarly, \( {P}_{S{R}_k} \) is the probability of error in the S → R k link which can be given by:
$$ {P}_{S{R}_k}={\displaystyle {\int}_0^{\infty}\frac{1}{2} erfc\left(\sqrt{x}\right){p}_{\gamma_{S{R}_k}}(x)dx} $$
Here, \( {p}_{\gamma_{S{R}_k}}\left(\cdot \right) \) is the PDF of \( {\gamma}_{S{R}_k} \) and erfc(.) is complementary error function. \( {p}_{\gamma_{S{R}_k}}(x) \) can be given as [28]:
$$ {p}_{\gamma_{\mathrm{S}{\mathrm{R}}_{\mathrm{k}}}}(x)=\frac{1}{x{\displaystyle {\prod}_{i=1}^N\varGamma \left({m}_i\right)}}{G}_{0,N}^{N,0}\left(\frac{x}{{\overline{\gamma}}_{\mathrm{S}{\mathrm{R}}_k}}{\displaystyle \prod_{i=1}^N{m}_i}\left|{}_{m_1,\dots, {m}_N}^{-}\right.\right), $$
where \( {\overline{\gamma}}_{S{R}_k} \) is \( {\overline{\gamma}}_{S{R}_k}=\left({E}_s/{N}_0\right){\displaystyle \prod_{i=1}^N{m}_i} \). By using:
$$ \mathrm{erfc}(x)=\frac{1}{\sqrt{\pi }}{G}_{1,2}^{2,0}\left(x\left|{}_{0,0.5}^1\right.\right) $$
with the help of [40] (Eq., the expression (15) can be calculated as:
$$ {P}_{\mathrm{S}{\mathrm{R}}_k}=\frac{1}{2\sqrt{\pi }{\displaystyle {\prod}_{i=1}^N\varGamma \left({m}_i\right)}}{G}_{2,N+1}^{N,2}\left(\frac{1}{{\overline{\gamma}}_{\mathrm{S}{\mathrm{R}}_k}}{\displaystyle \prod_{i=1}^N{m}_i}\left|{}_{m_1,\dots {m}_N,0}^{1,0.5}\right.\right) $$
The error probability of combined source-destination and relay-destination signals P MRC can be expressed as [39]:
$$ {P}_{MRC}={\displaystyle \underset{0}{\overset{\infty }{\int }}\frac{1}{2} erfc\left(\sqrt{\gamma_{tot}}\right)p\left({\gamma}_{tot}\right)d{\gamma}_{tot}} $$

The error probability of the considered system can be obtained by substituting (14), (18), and (19) into (13).

3.2 C-MRC-based model

The decision rule at the destination for C-MRC-based model can be written as [38]:
$$ \widehat{x}= \arg { \min}_{x\in {A}_x}{\left|{\omega}_{SD}{y}_{SD}+{\omega}_{R_kD}{y}_{R_kD}-\left({\omega}_{SD}{\alpha}_{SD}+{\omega}_{R_kD}{\beta}_{R_kD}\right)x\right|}^2 $$
where A x  = {−1, + 1} for BPSK modulation. In the previous section, it is mentioned that, in the MRC technique, weighting coefficients were chosen as \( {\omega}_{SD}={\alpha}_{SD}^{*} \) and \( {\omega}_{R_kD}={\beta}_{R_kD}^{*} \) to maximize the SNR at the output of combiner. This choice may decrease the average SNR obtained at the destination especially when detection errors occur at the relay terminal. In order to solve this problem C-MRC technique is proposed in which ω SD is fixed to \( {\alpha}_{{}_{SD}}^{*} \), while \( {\omega}_{{\mathrm{R}}_k\mathrm{D}} \) is determined by [38]:
$$ {\omega}_{R_kD}\left({\alpha}_{S{R}_k},{\beta}_{R_kD}\right)=\left({\gamma}_{eq,k}/{\gamma}_{R_kD}\right){\beta}_{R_kD}^{*} $$

In (21), γ eq,k is the equivalent SNR given in (8).

Note that in high SNR regime, we obtain γ eq  ≈ γ min where \( {\gamma}_{\min } = \min \left\{{\gamma}_{{\mathrm{R}}_k\mathrm{D}},\kern0.5em {\gamma}_{{\mathrm{SR}}_k}\right\} \). And finally, the best relay can be chosen by the help of (9).

3.3 VN-MRC model

The main idea of VN-based model is the introduction of virtual noise component at the destination. In this approach, detection errors at the relay are modeled as the addition of virtual noise [14]. In this case, we rewrite the received signal at the destination in the second phase as:
$$ \begin{array}{l}{y}_{R_kD}=\sqrt{E_s}\widehat{x}\;{\beta}_{R_kD}+{n}_{R_kD}\\ {}\kern1.75em =\sqrt{E_s}x\;{\beta}_{R_kD}+\sqrt{E_s}{e}_r\;{\beta}_{R_kD}+{n}_{R_kD}\\ {}\kern1.75em =\sqrt{E_s}x\;{\beta}_{R_kD}+{n}_v+{n}_{R_kD},\end{array} $$
where n v is the virtual noise which is independent from additive white Gaussian noise \( {n}_{R_kD} \) and modeled by a zero-mean complex random variable. The variance of term e r in (22) is \( {N}_0/{\left|{\alpha}_{S{R}_k}\right|}^2 \) [14]. The combined signal at the destination in case of VN-based detection can be given as [14]:
$$ {y}_D={\omega}_{SD}{y}_{SD}+{\omega}_{R_kD}{y}_{R_kD} $$
where the weighting coefficients are determined by:
$$ {\omega}_{SD}={\alpha}_{SD}^{*}/{N}_0 $$
$$ {\omega}_{R_kD}={\beta}_{R_kD}^{*}/{N}_0\left(1+{\left|{\beta}_{R_kD}\right|}^2/{\left|{\alpha}_{S{R}_k}\right|}^2\right). $$
Note that this combining approach eliminates the decoding complexity in the classical ML-based detectors that increases exponentially with the number of the components in the signal constellation. The conditional BER of the proposed system for a given relay in VN with MRC-based model can be expressed as:
$$ {P}_k=\left(1-Q\left(\sqrt{2{\gamma}_{SR}}\right)\right)Q\left(\sqrt{\frac{2{\left({\gamma}_{SD}+{\gamma}_{EQ}\right)}^2}{\gamma_{SD}+{\gamma}_{EQ}^{\mathit{\prime}}}}\right)+Q\left(\sqrt{2{\gamma}_{SR}}\right)Q\left(\sqrt{\frac{2{\left({\gamma}_{SD}-{\gamma}_{EQ}\right)}^2}{\gamma_{SD}+{\gamma}_{EQ}^{\mathit{\prime}}}}\right) $$
$$ {\gamma}_{EQ}=\frac{{\left|{\alpha}_{S{R}_k}\right|}^2{\left|{\beta}_{R_kD}\right|}^2}{\left({\left|{\alpha}_{S{R}_k}\right|}^2+{\left|{\beta}_{R_kD}\right|}^2\right){N}_0},{\gamma}_{EQ}^{\mathit{\prime}}=\frac{{\left|{\alpha}_{S{R}_k}\right|}^4{\left|{\beta}_{R_kD}\right|}^2}{\left({\left|{\alpha}_{S{R}_k}\right|}^2+{\left|{\beta}_{R_kD}\right|}^2\right){N}_0}. $$
The conditional BER expression given in (26) can be used as the best relay selection criterion which can be given by:
$$ k=\underset{k^{\mathit{\prime}}\in \left\{1,2,\dots, M\right\}}{ \arg \max }{P}_{k^{\mathit{\prime}}}. $$

Note that this selection criterion in (28) will also be employed in VN-ML and VN-LLR models given in the following sections.

3.4 VN-ML model

After choosing the best relay with the help of criterion in (28), ML technique can be used at the destination for detection. In [11,12], LLR of the ML detection for uncoded DF cooperation with binary modulations is given as:
$$ \mathrm{L}\mathrm{L}\mathrm{R}={t}_0+\psi \left({t}_1\right) $$
$$ \psi \left({t}_1\right)= \ln \frac{\left(1-{\varepsilon}_r\right){e}^{t_1}+{\varepsilon}_r}{\varepsilon_r{e}^{t_1}+\left(1-{\varepsilon}_r\right)}. $$
Here, ε r is the average BER at the kth relay, and it can be calculated for BPSK signaling as [41]:
$$ {\varepsilon}_r=Q\left(\sqrt{\frac{2{E}_s}{N_0}}\left|{\alpha}_{S{R}_k}\right|\right), $$
t 0 and t 1 are log-likelihood ratios of direct and relay links, respectively, for BPSK modulation, which can be given by [41]:
$$ {t}_0=\frac{4\sqrt{E_s}\Re \left\{{y}_{SD}{\alpha}_{SD}^{*}\right\}}{N_0} $$
$$ {t}_1=\frac{4\sqrt{E_s}\Re \left\{{y}_{R_kD}{\beta}_{R_kD}^{*}\right\}}{N_0}. $$
As mentioned before, in some scenarios, performance analysis of ML technique can be really hard because of the nonlinear behavior of the ML detection given in (29). To overcome this problem, an alternative detector is proposed in [12] which is called as detector with piecewise-linear (PL) combiner. This approximation can be expressed as:
$$ \psi \left({t}_1\right)\approx {\psi}_{PL}\left({t}_1\right)=\left\{\begin{array}{c}\hfill {T}_1,\kern5em {t}_1\ge {T}_1\hfill \\ {}\hfill {t}_1,\kern2em -{T}_1<{t}_1<{T}_1\hfill \\ {}\hfill -{T}_1,\kern5em {t}_1\le -{T}_1\hfill \end{array}\right\} $$
where T 1 = ln[(1 − ε r )/ε r ] and ε r  < 1/2.

3.5 VN-LLR model

In this approach, after the relay selection is realized by using Equation 28, the soft information is transmitted to the destination by amplifying (scaling) and forwarding the LLRs at the output of the decoder (decoder-LLR) [17] instead of making binary hard decisions.

After choosing the best relay with the help of (28), the signal at the relay is given as [18]:
$$ {x}_R(i)={l}_R{E}_{LLR}\kern0.5em ,\kern0.75em i = 1,\dots, Q $$
where Q is the length of source packet, l R is the decoder-LLR at the relay and E LLR is the energy of l R . l R and E LLR can be calculated as:
$$ {l}_R=\frac{4\sqrt{E_s}}{N_0}\Re \left\{{y}_{S{R}_k}{\alpha}_{S{R}_k}\right\}, $$
$$ {E}_{LLR}=\frac{E_sQ}{{\displaystyle \sum_{i=1}^Q{\left|{l}_R\right|}^2}}. $$
In the second phase, the relay terminal transmits LLR information l R to the destination. Thus, the received signal at the destination can be expressed as:
$$ {y}_{R_kD}=\sqrt{E_{LLR}}{l}_R\kern0.1em {\beta}_{R_kD}+{n}_{R_kD} $$
where \( {n}_{{\mathrm{R}}_k\mathrm{D}} \) is the noise term which is AWGN component modeled as complex random variable with zero mean and variance of N 0/2 per dimension. Finally, the optimal signal combination at the destination is expressed as:
$$ {l}_{coop}={l}_{SD}+{l}_{R_kD} $$
where l SD and \( {l}_{R_kD} \) are the LLRs of source-destination and kth relay-destination channels, respectively, and can be calculated by using [17] as:
$$ {l}_{R_kD}=\frac{16{E}_s{\left|{\alpha}_{S{R}_k}\right|}^2{\left|{\beta}_{R_kD}\right|}^2{E}_{LLR}}{16{E}_s{\left|{\alpha}_{S{R}_k}\right|}^2{\left|{\beta}_{R_kD}\right|}^2{E}_{LLR}^2+{N}_0^2{\left|{\beta}_{R_kD}\right|}^2}\Re \left\{{y}_{R_kD}{\beta}_{R_kD}^{*}\right\} $$
$$ {l}_{SD}=\frac{4\sqrt{E_s}}{N_0}\Re \left\{{y}_{SD}{\alpha}_{SD}^{*}\right\} $$

4 Simulation results

In this section, we present the Monte Carlo simulation results to show the performance of the proposed schemes in intervehicular DF-based cooperative communication system with relay selection. Without the loss of generality, the distance between source and destination is normalized to 1 and error performance of considered system is obtained for different normalized locations of the relays. The links between S → D, S → R k , and R k  → D are modeled as cascaded Nakagami-m distribution. The degree of cascading and the fading parameter are chosen as N = 1, 2, 4 and m = 2, 3, respectively. The variance of fading coefficient between two terminal (i, j) is determined by using a path-loss model in the form of \( {\sigma}_{\;i\;j}^2=\kern0.72em {d}_{\kern0.24em i\;j}^{\kern0.36em -\upsilon } \), and the path loss coefficient is assigned as υ = 4 [12]. BPSK modulation is considered and the number of relays is chosen to be M = 2 and 3. The SNR comparisons are done at a BER of 10−5.

In Figure 2, the average BER performance curves of the considered systems in case of M = 3, N = 2, m = 2, and d SR = 0.9 are presented. It is seen from this figure that VN-LLR-based relay selection scheme provides approximately 3.2, 1.7, 1.4, and 1 dB performance improvements compared to the system models with MRC, VN-MRC, C-MRC, and VN-ML, respectively.
Figure 2
Figure 2

Error performance curves for when the relays are closed to the destination. M = 3, N = 2, m = 2, and d SR = 0.9.

In order to determine the effect of fading parameter on the performance of the system, we propose the numerical results for M = 3, N = 2, m = 3, and d SR = 0.9 in Figure 3. As seen from this figure, VN-LLR-based relay selection scheme outperforms MRC, VN-MRC, C-MRC, and VN-ML techniques by about 2.4, 2, 1.6, and 1.2 dB, respectively. The numerical results for m = 2 and m = 3 in Figures 2 and 3 also show that the SNR gains supplied by the m = 3 case compared to the m = 2 case are approximately 2.6, 1.4, 1.4, 1.5, and 1.7 dB for MRC, VN-MRC, C-MRC, VN-ML, and VN-LLR approaches, respectively.
Figure 3
Figure 3

Numerical result for M= 3, N= 2, m= 3, and d SR= 0.9.

Figure 4 depicts the simulated average BER of MRC, VN-MRC, and VN-LLR techniques with relay locations d SR = 0.1 and 0.9, degree of cascading N = 2, fading parameter m = 2, and number of relays M = 2. It is seen that when the relay is located closed to destination, i.e., d SR = 0.9, an SNR loss occurs with respect to the scheme with d SR = 0.1. The amounts of these SNR losses are 0.7 dB for VN-LLR, 2.4 dB for VN-MRC, and 4.5 dB for MRC. As it can be seen from this figure, the probability of detection error at the relay increases when the distance of SR link increases, since the average SNR of this link decreases. It is also observed from Figure 4 that all of the models give nearly the same average BER performance when the relay is located closed to the source, i.e., d SR = 0.1, since the quality of S → R link is quite well in this channel settings.
Figure 4
Figure 4

Error performance curves for different relay locations when m= 2, N= 2, and M= 2.

In Figure 5, the average BER curves of MRC, VN-MRC, and VN-LLR techniques with relay locations d SR = 0.1 and 0.9, degree of cascading N = 2, fading parameter m = 2, and number of relay M = 3 are presented. It is seen that the system performance increases as the number of relay increases. The BER performance of the system decreases nearly about 1.8, 3.5, and 0.2 dB for MRC, VN-MRC, and VN-LLR techniques, respectively, as the relay terminals gets closer to the destination.
Figure 5
Figure 5

Error performance curves for different relay locations when m= 2, N= 2, and M= 3.

The performance comparison of all of the models for different values of cascading parameter N is demonstrated in Figure 6. It is seen that all approaches provide better average BER performance with decreased degree of cascading (N). The performance improvement with decreased cascading parameter is nearly about 3.4, 2.8, and 2.7 dB for VN-MRC, VN-ML, and VN-LLR, respectively.
Figure 6
Figure 6

Error performance curves for different values of N when relays are closed to the destination. m = 2, M = 3.

5 Conclusions

In this paper, the performance analysis of intervehicular cooperative communication system with relay selection is examined where the links between S → D, S → R k , and R k  → D have cascaded Nakagami-m distribution. The simulation results are presented when MRC, C-MRC, VN-MRC, VN-ML, and VN-LLR methods are used at destination. One can observe from the results that the performance of considered system increases with decrement of degree of cascading N, increment of fading parameter m and number of relay M. It is also seen that the best performance is obtained in case of the VN-LLR technique.



The work of authors are supported by the Scientific and Technological Research Council of Turkey under Project 113E229.

Authors’ Affiliations

Department of Electronics and Communications Engineering, Yildiz Technical University, Istanbul, 34220, Turkey
Department of Electrical and Electronics Engineering, Selcuk University, Konya, 42030, Turkey


  1. J Laneman, D Tse, G Wornell, Cooperative diversity in wireless networks: efficient protocols and outage behaviour. IEEE Trans. Inf. Theory 50(12), 3062–3080 (2002)View ArticleMathSciNetGoogle Scholar
  2. A Sendonaris, E Erkip, B Aazhang, User cooperation diversity part I: system description. IEEE Trans. Commun. 51(11), 1927–1938 (2003)View ArticleGoogle Scholar
  3. A Sendonaris, E Erkip, B Aazhang, User cooperation diversity part II: implementation aspects and performance analysis. IEEE Trans. Commun. 51(11), 1939–1948 (2003)View ArticleGoogle Scholar
  4. A Nosratinia, TE Hunter, Diversity through coded cooperation. IEEE Trans Wireless Commun 5(2), 283–289 (2006)View ArticleMathSciNetGoogle Scholar
  5. A Adinoyi, Y Fan, H Yanikomeroglu, HV Poor, F Al-Shaalan, Performance of selection relaying and cooperative diversity. IEEE Trans Wireless Commun 8(12), 5790–5794 (2009)View ArticleGoogle Scholar
  6. GC Alexandropoulos, A Papadogiannis, K Berberidis, Performance analysis of cooperative networks with relay selection over Nakagami-m fading channels. IEEE Signal Process Lett 17(5), 441–444 (2010)View ArticleGoogle Scholar
  7. A Bletsas, A Khisti, DP Reed, A Lippman, A simple cooperative diversity method based on network path selection. IEEE J Select Areas Commun 24(3), 659–672 (2006)View ArticleGoogle Scholar
  8. E Beres, R Adve, Selection cooperation in multi-source cooperative networks. IEEE Trans Wireless Commun 7(1), 118–127 (2008)View ArticleGoogle Scholar
  9. AS Ibrahim, AK Sadek, W Su, KJR Liu, Cooperative communications with relay selection: when to cooperate and whom to cooperate with? IEEE Trans Wireless Commun 7(7), 2814–2827 (2008)View ArticleGoogle Scholar
  10. PA Anghel, M Kaveh, Exact symbol error probability of a cooperative network in a Rayleigh- fading environment. IEEE Trans Wireless Commun 3(5), 1416–1421 (2004)View ArticleGoogle Scholar
  11. J Laneman, GW Wornell, Energy-efficient antenna-sharing and relaying for wireless networks (Paper presented at the Proceedings of the IEEE Wireless Communications and Networking Conference, Chicago, 2000)Google Scholar
  12. D Chen, J Laneman, Modulation and demodulation for cooperative diversity in wireless systems. IEEE Trans Wireless Commun 5(7), 1785–1794 (2006)View ArticleGoogle Scholar
  13. Z Yi, IM Kim, Diversity order analysis of the decode-and-forward cooperative networks with relay selection. IEEE Trans Wireless Commun 7(5), 1792–1799 (2008)View ArticleMathSciNetGoogle Scholar
  14. D Kim, H-M Kim, G-H Im, Improved network-coded cooperative transmission with low-complexity adaptation to wireless channels. IEEE Trans. Commun. 59(10), 2916–2926 (2011)View ArticleGoogle Scholar
  15. HV Khuong, HY Kong, LLR-based decode-and-forward protocol for relay networks and closed-form BER expressions. IEICE Trans Fundamentals E89–A(6), 1832–1836 (2006)View ArticleGoogle Scholar
  16. P Weitkemper, D Wübben, V Kühn, K-D Kammeyer, Soft information relaying for wireless networks with error-prone source-relay link (Paper presented at the 7th international ITG conference on source and channel coding (SCC), Ulm, Germany, 2008)Google Scholar
  17. X Bao, J Li (Tiffany), Efficient message relaying for wireless user cooperation: decode-amplify-forward (DAF) and hybrid DAF and coded-cooperation. IEEE Trans Wireless Commun 6(11), 3975–3984 (2007)View ArticleGoogle Scholar
  18. X Bao, J Li, (Tiffany), Decode-amplify-forward (DAF, a new class of forwarding strategy for wireless relay channels (Paper presented at the IEEE 6th workshop on signal processing advances in wireless communications, New York, USA, 2005)Google Scholar
  19. S Ibi, N Takada, S Sampei, Bit-wise partial noise elimination in cooperative decode-amplify-forward relay node (Paper presented at the IEEE 75th vehicular technology conference, VTC Spring, Yokohoma, 2012)Google Scholar
  20. MA Karim, J Yuan, Z Chen, J Li, Soft information relaying in fading channels. IEEE Wireless Commun Lett 1(3), 233–236 (2012)View ArticleGoogle Scholar
  21. AS Akki, F Haber, A statistical model of mobile-to-mobile land communication channel. IEEE Trans. Veh. Technol. 35(1), 2–7 (1986)View ArticleGoogle Scholar
  22. IZ Kovacs, Dissertation, Aalborg University, 2002.Google Scholar
  23. Y Chen, GK Karagiannidis, H Lu, N Cao, Novel approximations to the statistics of products of independant random variables and their applications in wireless communications. IEEE Trans. Veh. Technol. 61(2), 443–454 (2012)View ArticleGoogle Scholar
  24. J Salo, H El-Sallabi, P Vainikainen, The distribution of the product of independent Rayleigh random variables. IEEE Trans. Antennas Propag. 54(2), 639–643 (2006)View ArticleMathSciNetGoogle Scholar
  25. V Erceg, SJ Fortune, J Ling, A Rustako, R Valenzuela, Comparisons of computer-based propagation prediction tool with experimental data collected in urban microcellular environments. IEEE J Sel Areas Commun 15(4), 677–684 (1997)View ArticleGoogle Scholar
  26. M Uysal, Maximum achievable diversity order for cascaded Rayleigh fading channels. IET Electronics Lett 41(23), 1289–1290 (2005)View ArticleGoogle Scholar
  27. Z Tirkan, M Shirkhani, A Taherpour, M Uysal, Performance of cooperative amplify-and-forward protocols in vehicular ad-hoc networks (Paper presented at the international conference on wireless communications and signal Processing (WCSP), Huangshan, 2012)Google Scholar
  28. GK Karagiannidis, NC Sagias, PT Mathiopoulos, N*Nakagami: A novel stochastic model for cascaded fading channels. IEEE Trans. Commun. 55(8), 1453–1458 (2007)View ArticleGoogle Scholar
  29. S Ahmed, LL Yang, L Hanzo, Probability distributions of products of Rayleigh and Nakagami-m variables using Mellin transform (Paper presented at the international conference on communications (ICC), Kyoto, 2011)Google Scholar
  30. PM Shankar, Performance of N*Nakagami cascaded fading channels in dual selection combining diversity (Paper presented at the 7th international IEEE wireless communication. Mobile computer conference (IWCMC), Istanbul, 2011)Google Scholar
  31. Z Zheng, L Wei, J Hamalainen, Novel approximations to the statistics of general cascaded Nakagami-m channels and their applications in performance analysis (Paper presented at the IEEE international conference on communications (ICC), Budapest, 2013)Google Scholar
  32. H Ilhan, M Uysal, I Altunbas, Cooperative diversity for inter-vehicular communication: Performance analysis and optimization. IEEE Trans. Veh. Technol. 58(7), 3301–3310 (2009)View ArticleGoogle Scholar
  33. NC Sagias, GS Tombras, On the cascaded Weibull fading channel model. J. Frankl. Inst. 344(1), 1–11 (2007)View ArticleMATHMathSciNetGoogle Scholar
  34. I Trigui, A Laourine, S Affes, A Stephenne, On the performance of cascaded generalized K fading channels (Paper presented at the IEEE global telecommunications conference, GLOBECOM, Honolulu, 2009)Google Scholar
  35. H Ilhan, Performance analysis of two-way AF relaying systems over cascaded Nakagami-m fading channels. IEEE Signal Process Lett 19(6), 332–335 (2012)View ArticleGoogle Scholar
  36. AI Akin, H Ilhan, O Ozdemir, Relay selection for decode-and-forward cooperative vehicular networks with virtual noise modeling (Paper presented at the 13th international conference on ITS telecommunications (ITST), Tampere, 2013)Google Scholar
  37. MK Simon, MS Alouini, Digital Communication Over Fading Channels, 2nd edn. (Wiley, Hoboken, New Jersey, 2005)Google Scholar
  38. T Wang, A Cano, GB Giannakis, High-performance cooperative demodulation with decode-and-forward relays. IEEE Trans. Commun. 55(7), 1427–1438 (2007)View ArticleGoogle Scholar
  39. K Tourki, M-S Alouini, H-C Yang, Exact performance analysis of decode-and-forward opportunistic relaying (Paper presented at the IEEE 11th international workshop on signal processing advances in wireless communications (SPAWC), Marrakech, 2010)Google Scholar
  40. Wolfram Research, MeijerG available online at (Accessed August 15th, 2013)41
  41. A Goldsmith, Wireless Communications (Cambridge University Press, New York, 2005)View ArticleGoogle Scholar