Abstract
In this paper, we investigate physical-layer security performance of the cooperative vehicular relaying networks, wherein the communication from a source vehicle to the destination vehicle is assisted by an amplify-and-forward (AF) relay vehicle in the presence of a passive eavesdropper vehicle. We assume that the communication links between the vehicles experience double-Rayleigh fading. We also consider two AF relaying protocols: (1) fixed gain relaying which requires partial channel state information (CSI), and (2) variable gain relaying which requires full CSI. Specifically, we derive the novel intercept probability and ergodic secrecy capacity expressions for both fixed and variable gain relaying in the presence of double-Rayleigh fading channels. The numerical and simulation results verify our theoretical and analytical findings, and show the impacts of channel conditions and relay and eavesdropper locations on the system secrecy performance.
Similar content being viewed by others
Avoid common mistakes on your manuscript.
1 Introduction
Rapid proliferation of smart vehicles leveraged with wireless communication capabilities have allowed vehicular networks to support various exciting intelligent transportation system (ITS) applications such as, traffic management, payment services, and infotainment [1,2,3]. Moreover, coupling vehicular networks with cooperative relaying communications can enhance reliability, efficiency, and coverage of ITS applications and services [4,5,6]. Such relay assisted vehicular networks can be termed as cooperative vehicular relaying networks (CVRNs). Some traditional relaying protocols such as amplify-and-forward (AF) and decode-and-forward (DF) can be applied in such networks. The AF relaying protocol has attracted significant interest over DF protocol as it is easy to implement and offers shorter latency. Moreover, based on the channel state information (CSI), it can operate under fixed gain relaying or variable gain relaying. In particular, the variable gain AF relaying requires instantaneous CSI, whereas the fixed gain relay needs only statistical CSI. Through vehicle-to-vehicle (V2V) and vehicle-to-infrastructure (V2I) modes of communication in CVRNs, information can be disseminated among the vehicles, roadside infrastructures, and users. Despite several advantages, such networks come with their own set of challenges, particularly in the domains of privacy and security [7,8,9]. Due to the inherent open nature of wireless medium, mobility, cooperativeness, and lack of central points, such networks are vulnerable to various security attacks [7] such as, eavesdropping, jamming, identity theft etc. Recently, there has been a growing interest for ensuring information security in CVRNs. Various upper-layer security mechanisms [9,10,11] are used to ensure the security in such networks. However, the dynamic nature of vehicular networks and lack of trusted central infrastructure entity can make the secret key distribution process vulnerable [12]. Moreover, such security mechanisms could become inefficient when the eavesdropper have the access to infinite computing capabilities. Amid these challenges, physical-layer security has emerged as an attractive option to compliment the existing cryptography based security infrastructure [13, 14]. It guarantees secure transmission by exploiting the inherent randomness of the wireless channel such as, fading, interferences etc. [15,16,17].
1.1 Related Works
Recently, physical-layer security in non-vehicular cooperative relaying networks have attracted considerable attention in the literature (see [18,19,20,21,22,23,24,25,26] and the references therein). However, all of them [18,19,20,21,22,23,24,25,26] are limited to the scenario where the nodes are stationary and the channel between the terminals can be distributed as Rayleigh fading or Nakagami-m fading. The authors in [27, 28] have investigated the secrecy performance of variable gain AF relay based CVRNs by considering the classical Rayleigh fading to model the V2V channel. However, cascaded fading models [29, 30] are found to be more appropriate to provide a realistic description of V2V channels, which can be produced by multiplying the channel gains of independent groups of scatterers around the mobile units. The performance of CVRNs by considering the cascaded channel modeling for V2V links have been investigated in [31,32,33,34,35,36]. Specifically, the authors in [31] have analyzed the performance of a multihop network under cascaded Rayleigh fading. The authors in [32] have evaluated the performance of DF-based multi-relay CVRNs under double-Rayleigh channels. In [33], the authors have investigated the performance of DF-based CVRN, where the end-to-end communication is assisted by both the mobile and fixed infrastructure units under mixed Rayleigh and double-Rayleigh fading. The authors in [34] have investigated the performance of CVRNs with variable gain AF relaying protocol under mixed Nakagami-m and double-Nakagami-m fading environment. Recently, the authors in [35] have analyzed the performance of a CVRN with incremental hybrid decode-amplify-and-forward relaying under double-Rayleigh fading. Further, the authors in [36] have evaluated the performance of fixed gain AF relay based CVRNs under cascaded Nakagami-m fading channels.
Although, these works [31,32,33,34,35,36] have investigated the performance of CVRNs, however, none of them has explored the security issues in CVRNs. So far, the open literature exploiting the physical-layer security aspects in the CVRNs is very limited [37,38,39,40]. The authors in [37] have evaluated the secrecy performance of non-cooperative vehicular networks under double-Rayleigh channels. In [38], the authors have evaluated the secrecy performance of DF-based CVRNs over double-Rayleigh fading channels. Very recently, the authors in [39, 40] have evaluated the performance of cooperative variable gain AF-based vehicular network under mixed Rayleigh and double-Rayleigh fading environments.
1.2 Motivation
Extensive exploration and investigation on the physical-layer security aspects in securing non-vehicular relaying networks exist in the literature [18,19,20,21,22,23,24,25,26] and is still growing on. Such networks correspond to the scenario where the communicating terminals are stationary and the channel between them can be modeled as Rayleigh distributed or Nakagami-m distributed. The physical-layer security aspects in CVRNs systems have been well studied in [27, 28, 38,39,40]. In particular, the authors in [27, 28] have evaluated the physical-layer security aspects in CVRNs, however, the analysis was carried out by assuming classical Rayleigh fading for both V2V and V2I channels. Experimentally and theoretically, it is shown that V2V links are different from V2I links, and hence the cascaded channel models are found more suited for V2V links [29]. The authors in [38] have studied the secrecy performance of DF-based CVRNs in the presence of double-Rayleigh fading. Moreover, the authors in [39] have evaluated the secrecy performance of an AF-based CVRN by considering the relay and eavesdropper as vehicular terminals (channel between them is modeled as double-Rayleigh fading), and source and destination as the fixed infrastructure (channel between them is modeled as Rayleigh fading). Further, the authors in [40] have investigated the secrecy performance of AF-based CVRNs by considering source, relay, and eavesdropper as vehicles, and destination as the fixed terminal.
Therefore, based on the open literature and to the best of authors’ knowledge, the secrecy analysis for AF-based CVRNs by considering all terminals as moving vehicle under both fixed and variable gain relaying in the presence of double-Rayleigh fading channels is yet to be investigated. Moreover, there is lack of performance evaluation measures, i.e., intercept probability and ergodic secrecy capacity (ESC) in terms of CVRNs with all vehicular communications links. Motivating ourselves from the above research gaps, we develop this treatise and want to fill these important research gaps.
1.3 Contributions
In this paper, we consider a dual-hop CVRN where the communication between a source vehicle and a destination vehicle is assisted by an AF relay vehicle in the presence of a passive eavesdropper vehicle. We consider two AF relaying strategies: (1) fixed gain relaying which requires partial CSI, and (2) variable gain relaying which requires full CSI. By modeling the vehicular communication links as double-Rayleigh fading channels, we derive the novel expressions for the intercept probability and ESC under both fixed and variable gain relaying of the considered system. With the help of numerical and simulation results, we corroborate our analytical findings. We further illustrate the effects of channel conditions and relay and eavesdropper locations on the system security performance. Our results reveal that the fixed gain AF relaying can achieve comparable secrecy performance to that of variable gain AF relaying protocol, without necessitating full CSI.
1.3.1 Notations
\({\mathbb {E}}[X]\) denotes the expectation of a random variable (RV) X. \(F_{X}(\cdot )\) and \(f_{X}(x)\) denote the cumulative distribution function (CDF) and probability density function (PDF) of X. \({\mathcal {K}}_{v}(\cdot )\) denotes the v-th order modified Bessel function of second kind [41, Eq. (8.432)], \(G^{m, n}_{p, q}\big (x\big |^{a_{1},\ldots , a_{p}}_{b_{1},\ldots , b_{q}}\big )\) is the Meijer-G function [41, Eq. (9.301)], \(_2F_{1}(\cdot ,\cdot ;\cdot ;\cdot )\) is the hypergeometric function [41, Eq. (9.111)], \(G^{m_{1}, n_{1}:n_{2}, m_{2} :n_{3}, m_{3}}_{p_{1},q_{1} :p_{2},q_{2}:p_{3},q_{3}}\big (x,y\big |^{a_{1},\ldots , a_{p_{1}}}_{b_{1},\ldots , b_{q_{1}}}\big |^{c_{1},\ldots , c_{p_{1}}}_{d_{1},\ldots , d_{q_{2}}}\big |^{e_{1},\ldots , e_{p_{3}}}_{f_{1},\ldots , f_{q_{3}}}\big )\) is the extended generalized bivariate Meijer-G function [42, Eq. (07.34.21.0081.01)], \(\varPsi (\cdot )\) denotes the psi function [41, Eq. (8.360.1)], and \(\varGamma (\cdot )\) denotes the complete gamma function [41, Eq. (8.350)].
2 System and Channel Models
We consider a secure CVRN (as shown in Fig. 1), in which a legitimate source vehicle \({\text {S}}\) communicates with the legitimate destination vehicle \({\text {D}}\) by the assistance of an AF relay vehicle \({\text {R}}\) in the presence of a passive eavesdropper vehicle \({\text {E}}\). All vehicles are equipped with a single antenna. The direct links between \({\text {S}}\) and \({\text {D}}\), and \({\text {S}}\) and \({\text {E}}\) are absent due to the heavy path-loss and shadowing. We assume that all channels are assumed to be quasi-static, reciprocal, and subject to independent and non-identically distributed (i.ni.d.) double-Rayleigh fading. In particular, the channel coefficients \(h_{\imath \jmath }\) for \(\{\imath \jmath \} \in \{{\text {SR}}, {\text {RD}}, {\text {RE}}\}\) can be modeled as the product of \(h_{\imath \jmath ,1}\) and \(h_{\imath \jmath ,2}\), where \(h_{\imath \jmath ,1}\) and \(h_{\imath \jmath ,2}\) are independent complex Gaussian random variables (RVs) having zero mean and variance \(\varOmega _{\imath \jmath ,1}\) and \(\varOmega _{\imath \jmath ,2}\), respectively. We also assume the additive white Gaussian noise (AWGN) with zero mean and \(N_{0}\) variance for each link.
The communication from \({\text {S}}\) to \({\text {D}}\) in the presence of a passive \({\text {E}}\) will be accomplished via \({\text {R}}\) in two transmission phases. In the first transmission phase, \({\text {S}}\) transmits its unit energy signal \(x_{s}\) with power \(P_{s}\). The signal received at \({\text {R}}\) can be expressed as \(y_{r}=\sqrt{P_{s}}h_{{\text {SR}}}x_{s}+n_{r}\), where \(n_{r}\) is the AWGN at \({\text {R}}\). During the second transmission phase, R amplifies the received signal \(y_{r}\) with some amplification factor \({\mathcal {G}}\), and the signal received at \({\text {D}}\) and \({\text {E}}\) can be given, respectively, as
where \(n_{d}\) and \(n_{e}\) are the AWGNs at \({\text {D}}\) and \({\text {E}}\), and the amplification factor \({\mathcal {G}}\) is selected at \({\text {R}}\) to satisfy its power constraint. If \({\text {R}}\) has instantaneous knowledge of the fading channel, \(h_{{\text {SR}}}\), it can apply variable gain relaying with \({\mathcal {G}}^{{\mathrm{v}}}=\sqrt{\frac{P_{r}}{{\mathbb {E}}_{x_{s}, n_{r}}\{|y_{r}|\}^{2}}}\), where \(P_{r}\) denotes the relay power. Otherwise, fixed gain relaying (using only statistical CSI) with \({\mathcal {G}}^{{\mathrm{f}}}=\sqrt{\frac{P_{r}}{{\mathbb {E}}_{x_{s},h_{{\text {SR}}}, n_{r}}\{|y_{r}|\}^{2}}}\) can be employed. For the fixed and variable gain relaying, the amplification factor \({\mathcal {G}}\) can be considered as
respectively. Further, using the expressions \({\mathcal {G}}^{{\mathrm{f}}}\) and \({\mathcal {G}}^{{\mathrm{v}}}\), and after some algebraic manipulations, we can express the instantaneous end-to-end signal-to-noise ratios (SNRs) at \({\text {D}}\) and \({\text {E}}\) for the fixed gain relaying as
and for the variable gain relaying as
where \(\lambda _{{\text {SR}}}=\frac{P_{s}}{N_{0}}|h_{{\text {SR}}}|^{2}\), \(\lambda _{{\text {RD}}}=\frac{P_{r}}{N_{0}}|h_{{\text {RD}}}|^{2}\), \(\lambda _{{\text {RE}}}=\frac{P_{r}}{N_{0}}|h_{{\text {RE}}}|^{2}\), and \(C=\frac{P_{r}}{N_{0}\big ({\mathcal {G}}^{{\mathrm{f}}}\big )^{2}}\) is a constant for fixed \({\mathcal {G}}^{{\mathrm{f}}}\).
Moreover, the capacities pertaining to \({\text {S}}\rightarrow {\text {R}}\rightarrow {\text {D}}\) and \({\text {S}}\rightarrow {\text {R}}\rightarrow {\text {E}}\) links of the considered system can be defined as \({\mathcal {C}}_{{\text {D}}}^{\flat }=\frac{1}{2}\log _{2}(1+\varLambda _{{\text {D}}}^{\flat })\) and \({\mathcal {C}}_{{\text {E}}}^{\flat }=\frac{1}{2}\log _{2}(1+\varLambda _{{\text {E}}}^{\flat })\), for \(\flat =\{{\text{ f }}, {\text{ v }} \}\), respectively.
Thus, the secrecy capacity of the considered system can be expressed as
where \(\flat =\{{\text{ f }}, {\text{ v }} \}\).
3 Performance Analysis
Here, we analyze the intercept probability and ergodic secrecy capacity (ESC) of the considered system for fixed and variable gain relaying under double-Rayleigh fading channels. Note that \(h_{\imath \jmath }\) for \(\{\imath \jmath \} \in \{{\text {SR}}, {\text {RD}}, {\text {RE}}\}\) is distributed as double-Rayleigh fading, therefore, the CDF and PDF for the channel gain \(|h_{ \imath \jmath }|^{2}\) are given as \(F_{|h_{\imath \jmath }|^{2}}(x) = 1- (2/\varOmega _{\imath \jmath })\sqrt{x}{\mathcal {K}}_{1}\left( (2/\varOmega _{\imath \jmath })\sqrt{x} \right)\), \(x>0\) and \(f_{|h_{\imath \jmath }|^{2}}(x)= (2/\varOmega _{ \imath \jmath }^{2}) {\mathcal {K}}_{0}\left( (2/\varOmega _{\imath \jmath })\sqrt{x} \right)\), \(x>0\),(assuming \(\varOmega _{\imath \jmath ,1}=\varOmega _{\imath \jmath ,2}=\varOmega _{\imath \jmath }\)) respectively. This will help us to conduct the analytical derivation of performance metrics under investigation in what follows.
3.1 Intercept Probability
The intercept probability is an important performance measure used to evaluate the secrecy performance of cooperative relaying networks. It is defined as the probability that the eavesdropper succeeds to intercept the signal forwarded for the legitimate receiver or in other words, the secrecy capacity falls below zero [18]. Mathematically, for the considered system under fixed and variable gain relaying, it can be written as
where \(\flat =\{{\text{ f }}, {\text{ v }} \}\).
3.1.1 Fixed Gain Relaying
For fixed gain relaying scenario, the intercept probability of the considered system can be expressed as
which after some simplifications can be expressed as
Invoking the CDF of \(\lambda _{{\text {RD}}}\) and the PDF of \(\lambda _{{\text {RE}}}\) into (10), \({\mathcal {P}}_{{\text {int}}}^{{\mathrm{f}}}\) can be expressed as
Further, making the change of variable \(y=t^{2}\) within the integral and then using [41, Eq. (6.576.4)], we can obtain the intercept probability under fixed gain relaying, \({\mathcal {P}}_{{\text {int}}}^{{\mathrm{f}}}\), as
where \(\alpha _{{\text {RD}}}=\frac{\sqrt{N_{0}}}{\sqrt{P_{r}}\varOmega _{{\text {RD}}}}\), \(\alpha _{{\text {RE}}}=\frac{\sqrt{N_{0}}}{\sqrt{P_{r}}\varOmega _{{\text {RE}}}}\), and \(\varGamma (a_{1},\ldots , a_{p})=\prod _{k=1}^{p}\varGamma (a_{k})\).
We can see from (12) that the intercept probability expression involves powers, incomplete gamma function, and hypergeometric function containing the transmit powers and average channel gains, which can be easily calculated via software packages such as Matlab or Mathematica.
3.1.2 Variable Gain Relaying
Under variable gain relaying scenario, the intercept probability of the considered system can be given by
With the fact that \(\frac{XY}{X+Y}<\min (X,Y)\), the \(\varLambda _{{\text {D}}}^{{\mathrm{v}}}\) and \(\varLambda _{{\text {E}}}^{{\mathrm{v}}}\) can be tightly upper bounded as \(\varLambda _{{\text {D}}}^{{\mathrm{v}}}<\min (\lambda _{{\text {SR}}},\lambda _{{\text {RD}}})\, {\text{ and }}\, \varLambda _{{\text {E}}}^{{\mathrm{v}}}<\min (\lambda _{{\text {SR}}},\lambda _{{\text {RE}}})\). However, it is noted that such an upper bound can be treated as tight approximation over the entire range of operating SNR. Consequently, we can express (13) as
where
where we have used the fact that \(\frac{\partial ^{n}}{\partial x^{n}}[x^{\frac{v}{2}}{\mathcal {K}}_{v}(a\sqrt{x})]=(-\frac{a}{2})^{n}x^{\frac{(v-n)}{2}}{\mathcal {K}}_{v-n}(a\sqrt{x})\) [43, Eq. (1.14.1.4)] to obtain the second equality in (16), and \(\alpha _{{\text {SR}}}=\frac{\sqrt{N_{0}}}{\sqrt{P_{s}}\varOmega _{{\text {SR}}}}\).
Now, invoking (15) and (16) into (14), and after evaluating the required integrals, the intercept probability under variable gain relaying can be obtained as per following theorem.
Theorem 1
The intercept probability for variable gain relaying scenario under double-Rayleigh fading channels can be expressed as
Proof
See “Appendix 1” for the proof. □
It can be observed from (17) that the intercept probability expression involves powers and extended generalized bivariate Meijer-G functions containing the transmit powers and average channel gains, which can be easily evaluated using the Matlab or Mathematica softwares.
3.2 Ergodic Secrecy Capacity (ESC)
It can be easily observed from (7) that the achievable secrecy capacity \({\mathcal {C}}_{{\text {SEC}}}^{\flat }=0\) when \({\mathcal {C}}_{{\text {D}}}^{\flat }\le {\mathcal {C}}_{{\text {E}}}^{\flat }\), for \(\flat =\{{\text{ f }}, {\text{ v }} \}\), therefore, the secrecy capacity can only be achieved for the case when \({\mathcal {C}}_{{\text {D}}}^{\flat }> {\mathcal {C}}_{{\text {E}}}^{\flat }\). Consequently, the ESC for the considered system under fixed and variable gain relaying can be mathematically expressed as
where \(\flat = \{{\text {f}}, {\text {v}}\}\).
3.2.1 Fixed Gain Relaying
Under fixed gain relaying scenario, the ESC using (5) and (18) can be expressed as
which can be then evaluated and presented in the following theorem.
Theorem 2
For the fixed gain relaying, the ESC can be obtained as
Proof
See “Appendix 2” for the detailed derivation. □
The expression in (20) can be easily evaluated via Matlab or Mathematica softwares. It is also worth mentioning that (20) contains the infinite series expansion, which converges fast as shown numerically in Sect. 4.
3.2.2 Variable Gain Relaying
Under variable gain relaying scenario, the ESC of the considered system is presented in Theorem 3.
Theorem 3
For variable gain relaying scenario, the ESC can be given by
where
with \(\tau _{k}=\frac{k}{M}\) and \(\tau _{k-1}=\frac{k-1}{M}\).
Proof
The proof is given in “Appendix 3”. □
The ESC expression under variable gain relaying consists of finite summations with powers, Meijer-G functions, and extended generalized bivariate Meijer-G functions consisting of transmit powers and average channel gains, which can be evaluated via Matlab or Mathematica software packages.
4 Numerical Results and Discussion
In this section, we provide our derived analytical results for intercept probability and ESC for the considered system under fixed and variable gain relaying protocols with the help of numerical results (using Mathematica) and Monte-Carlo simulations (using Matlab). We consider a path-loss model with an exponent of four. Without loss of generality, we denote \(d_{\imath \jmath }\) as the distance between the nodes \(\imath\) and \(\jmath\), where \(\imath \jmath \in \{{\text {SR}}, {\text {RD}}, {\text {RE}}\}\). We also consider a normalized square area (a two dimensional network topology), where the coordinates of node \({\text {S}}, {\text {R}}, {\text {D}}\), and \({\text {E}}\) are (0, 0) , \((x_{{\text {R}}},0)\), (1, 0) , and \((x_{{\text {E}}},y_{{\text {E}}})\), respectively. Accordingly, we have \(d_{{\text {SR}}}= x_{{\text {R}}}\), \(d_{{\text {RD}}}= 1-x_{{\text {R}}}\), and \(d_{{\text {RE}}}= \sqrt{(x_{{\text {R}}}-x_{{\text {E}}})^{2}+y_{{\text {E}}}^{2}}\). Let the mean values of the average channel gains of the links \({\text {S}}\rightarrow {\text {R}}\), \({\text {R}}\rightarrow {\text {D}}\), and \({\text {R}}\rightarrow {\text {E}}\) are denoted by \(\gamma _{{\text {SR}}}\), \(\gamma_{{\text {RD}}}\), and \(\gamma_{{\text {RE}}}\), respectively, and the main-to-eavesdropper ratio (MER) for the relay link is given as \(\lambda =\frac{\gamma_{{\text {RD}}}}{\gamma _{{\text {RE}}}}\). Accordingly, the average channel gain between the nodes \(\imath\) and \(\jmath\) is set to \(\varOmega _{\imath \jmath }=d_{\imath \jmath }^{-4}\lambda _{\imath \jmath }\), where \(\imath \jmath \in \{{\text {SR}}, {\text {RD}}, {\text {RE}}\}\). We set \(\gamma_{{\text {SR}}}=\gamma_{{\text {RD}}}=1\) and \(\gamma_{{\text {RE}}}=\frac{1}{\lambda }\). We also assume \(P_{s}=P_{r}=P\) and \(\rho =\frac{P}{N_{0}}\).
Figures 2 and 3 depict the intercept probability performance of the considered system as a function of MER under fixed and variable gain AF relaying strategies, respectively, for different eavesdropper locations (i.e., \(x_{{\text {E}}}\) and \(y_{{\text {E}}}\)) when \(\rho =10\) dB. As can be seen from Figs. 2 and 3 that the derived analytical expressions of intercept probability for fixed and variable gain relaying are matched perfectly with the simulation results over the entire MER regime. This validates the correctness of the derived analytical expressions. Also, we can observe that the system intercept probability decreases as \(\lambda\) increases for fixed and variable gain relaying. This is due to the fact that with the increase in MER (\(\lambda\)), \({\text {R}}\rightarrow {\text {E}}\) link quality worsens compared to \({\text {R}}\rightarrow {\text {D}}\) link quality. In addition, it is also seen that a shorter \({\text {R}}\rightarrow {\text {E}}\) link (small \(d_{{\text {RE}}}\)) improves the eavesdropper ability to intercept, which is because of the fact that the shorter \(d_{{\text {RE}}}\) helps in strengthening the quality of wiretap \({\text {R}}\rightarrow {\text {E}}\) link. Moreover, one can observe from Figs. 2 and 3 that the intercept probability of fixed gain relaying is nearer to that of variable gain relaying. Thus, the fixed gain relaying can bring almost comparable intercept probability performance to variable gain relaying, without the need for full CSI.
Figure 4 plots the ESC versus MER for both fixed and variable gain relaying strategies for various values of \(x_{{\text {E}}}\) and \(y_{{\text {E}}}\), when \(M=20\) and \(\rho =10\) dB. It can be seen from the plots that the derived analytical ESC results for both fixed and variable gain relaying are in good agreement with the simulation results over the entire range of operating MER. The analytical curves for ESC under variable gain relaying are obtained by truncating the infinite series expansion over index k in (20) to first few terms. As expected, the ESC performance under both relaying scenarios improves with increase in MER, irrespective of the eavesdropper location. This is owing to the better \({\text {R}}\rightarrow {\text {D}}\) link quality than \({\text {R}}\rightarrow {\text {E}}\) link quality. However, the ESC curves saturate in the high MER regime as ESC grows logarithmically with MER. Also, the ESC performance of the considered system under both the strategies degrades as \(d_{{\text {RE}}}\) shortens. This is because of the reason that a shorter \(d_{{\text {RE}}}\) results into a better wiretap channel quality. For instance, for variable gain AF (fixed gain AF) strategy with \(\lambda = 18\) dB, when \((x_{E},y_{E})=(0.5,0.5)\) so that \(d_{RE}=0.50\), the ESC is 3.70076 bps/Hz (3.4815 bps/Hz), while for \((x_{E},y_{E})=(0.6,0.8)\) so that \(d_{RE}=0.806\), the ESC is 0.3.96311 bps/Hz (3.6620 bps/Hz). Further, we can observe that the variable gain relaying provides a slightly better ESC performance in the medium-to-high MER than the fixed gain AF relaying.
Figure 5 illustrates the impact of relay-to-eavesdropper distance, \(d_{{\text {RE}}}\) upon ESC performance under both the relaying schemes for different values of MERs (\(\lambda\)), when \(M=20\), \(x_{{\text {R}}}=x_{{\text {E}}}=0.5\), and \(\rho = 10\) dB. Also, we have \(d_{{\text {RE}}}=\sqrt{(x_{{\text {E}}}-0.5)^{2}+y_{{\text {E}}}^{2}}\) and \(y_{{\text {E}}}\) moves from 0.1 to 3 (corresponding to \(d_{{\text {RE}}}\) from 0.1 to 3). As can be seen from the Fig. 5 that the ESC performance under both fixed and variable gain relaying improves with the increase in \(d_{{\text {RE}}}\), irrespective of \(\lambda\). This is owing to the reason that as \(d_{{\text {RE}}}\) increases, \({\text {R}}\rightarrow {\text {E}}\) link quality becomes poorer. Further, we can see that the ESC performance improves under both the relaying strategies as MER increases. This improvement in the ESC performance is because of the reason that the legitimated channel quality improves with the increase in MER. Also, we can see that the variable gain relaying provides a slightly better ESC performance than the fixed gain AF relaying for medium-to-high values of \(d_{{\text {RE}}}\). For low values of \(d_{{\text {RE}}}\), fixed gain AF relaying can achieve a marginally better ESC performance to that of variable gain AF relay. Therefore, we can see from Figs. 4 and 5 that fixed gain relaying can provide comparable ESC performance to that of variable gain AF relay strategy.
Figures 6 and 7 illustrate the impact of relay location on the ESC performance under both the relaying strategies, for various values of \(x_{{\text {E}}}\) and \(y_{{\text {E}}}\), when \(M=20\), \(\rho = 10\) dB, and \(\lambda = 10\) dB. From the plots for the fixed gain relaying in Fig. 6, it can be seen that the relay location for maximum ESC is affected by the \({\text {R}}\rightarrow {\text {E}}\) link only. In particular, from the plots of Fig. 6, it can be observed that when \(x_{E}>0.5\) and \(y_{E}\lessgtr 0.5\), the ESC achieves a maximum value for relay location \(x_{R}\)Footnote 1 i.e., \(x_{R}^{*}\le 0.5\), whereas for \(x_{E}<0.5\) and \(y_{E}\lessgtr 0.5\), the maximum ESC occurs at \(x_{R}^{*}\ge 0.5\). For instance, when \(x_{E}=0.2, y_{E}= 0.2\), the maximum ESC occurs at \(x_{R}^{*}= 0.65\), whereas for \(x_{E}= 0.8\) and \(y_{E}= 0.2\), it occurs at \(x_{R}^{*}= 0.40\). Similarly, under variable gain relaying in Fig. 7, we can observe that when \(x_{E}>0.5\) and \(y_{E}\lessgtr 0.5\), maximum ESC value occurs for \(x_{R}^{*}\le 0.5\), whereas for \(x_{E}<0.5\) and \(y_{E}\lessgtr 0.5\), the maximum ESC occurs at \(x_{R}^{*}\ge 0.5\).
5 Conclusion
We evaluated the secrecy performance of a CVRN where a source vehicle communicates with a destination vehicle by the assistance of an AF relay vehicle in the presence of a passive eavesdropper vehicle. By considering both fixed and variable gain AF relaying protocols, we deduced the new expressions for the intercept probability and ESC of the considered system under double-Rayleigh fading channels. The analytical findings were corroborated with the help of numerical and simulation results. We have also examined the impacts of channel conditions and relay and eavesdropper locations on the secrecy performance. From a practical standpoint, our results also revealed that the fixed gain relaying can bring a comparable intercept probability and ESC performances to variable gain relaying, without requiring full CSI. Therefore, the fixed gain relaying can be an attractive option in CVRNs due to its ease in implementation and reduced complexity.
Notes
Note that \(x_{R}^{*}\) can be evaluated by numerically solving the optimization problem using the software packages such as Matlab and Mathematica.
References
Yan, G., & Rawat, D. B. (2017). Vehicle-to-vehicle connectivity analysis for vehicular ad-hoc networks. Ad Hoc Networks, 58, 25–35.
Hartenstein, H., & Laberteaux, K. P. (2008). A tutorial survey on vehicular ad hoc networks. IEEE Communication Magazine, 46(6), 164–171.
Martinez, F., Toh, C.-K., Cano, J.-C., Calafate, C., & Manzoni, P. (2010). Emergency services in future intelligent transportation systems based on vehicular communication networks. IEEE Intelligent Transportation System Magazine, 2(2), 6–20.
Akin, A. I., Ilhan, H., & Ozdemir, O. (2015). Relay selection for DF-based cooperative vehicular systems. EURASIP Journal on Wireless Communications and Networking, 30, 1–9.
Ahmed, E., & Gharavi, H. (2018). Cooperative vehicular networking: A survey. IEEE Transactions on Intelligent Transportation Systems, 19(3), 996–1014.
He, R., Molisch, A. F., Tufvesson, F., Wang, R., Zhang, T., Li, Z., et al. (2016). Measurement-based analysis of relaying performance for vehicle-to-vehicle communications with large vehicle obstructions. In Vehicular technology conference (VTC-Fall), 2016 IEEE 84th (pp. 1–6).
Sakiz, F., & Sen, S. (2017). A survey of attacks and detection mechanisms on intelligent transportation systems: VANETs and IoV. Ad Hoc Networks, 61, 33–50.
Parkinson, S., Ward, P., Wilson, K., & Miller, J. (2017). Cyber threats facing autonomous and connected vehicles: Future challenges. IEEE Transactions on Intelligent Transportation Systems, 18(11), 2898–2915.
Qu, F., Wu, Z., Wang, F. Y., & Cho, W. (2015). A security and privacy review of VANETs. IEEE Transactions on Intelligent Transportation Systems, 16(6), 2985–2996.
Hao, Y., Tang, J., & Cheng, Y. (2013). Secure cooperative data downloading in vehicular ad hoc networks. IEEE Journal of Selected Areas in Communications, 31(9), 523–537.
Raya, M., Papadimitratos, P., Aad, I., Jungels, D., & Hubaux, J.-P. (2007). Eviction of misbehaving and faulty nodes in vehicular networks. IEEE Journal of Selected Areas in Communications., 25(8), 1557–1568.
Asuquo, P., Cruickshank, H., Morley, J., Ogah, C. P. A., & Lei, A. (2018). Security and privacy in location-based services for vehicular and mobile communications: An overview, challenges, and countermeasures. IEEE Internet Things Journal, 5(6), 4778–4802.
Liu, Y., & Chen, H. H. (2017). Physical layer security for next generation wireless networks: Theories, technologies, and challenge. IEEE Communication Surveys and Tutorials, 19(1), 347–376.
Hamamreh, J. M., Furqan, H. M., & Arslan, H. (2018). Classifications and applications of physical layer security techniques for confidentiality: A comprehensive survey. IEEE Communication Surveys and Tutorials,. https://doi.org/10.1109/COMST.2018.2878035.
Yener, A., & Ulukus, S. (2015). Wireless physical-layer security: Lessons learned from information theory. Proceedings of the IEEE, 103(10), 1814–1825.
Zou, Y., Zhu, J., Wang, X., & Hanzo, L. (2016). A survey on wireless security: Technical challenges, recent advances, and future trends. Proceedings of the IEEE, 104(9), 1727–1765.
Shiu, Y., Chang, S. Y., Wu, H., Huang, S. C., & Chen, H. (2011). Physical layer security in wireless networks: A tutorial. IEEE Wireless Communications, 18(2), 66–74.
Zou, Y., Wang, X., & Shen, W. (2013). Optimal relay selection for physical-layer security in cooperative wireless networks. IEEE Journal of Selected Areas in Communications, 31(10), 2099–2111.
Nguyen, B. V., & Kim, K. (2015). Secrecy outage probability of optimal relay selection for secure AnF cooperative networks. IEEE Communication Letters, 19(12), 2086–2089.
Yang, L., Chen, J., Jiang, H., Vorobyov, S. A., & Zhang, H. (2017). Optimal relay selection for secure cooperative communications with an adaptive eavesdropper. IEEE Transactions on Wireless Communications, 16(1), 26–42.
Fan, L., Lei, X., Duong, T. Q., Elkashlan, M., & Karagiannidis, G. K. (2014). Secure multiuser communications in multiple amplify-and-forward relay networks. IEEE Transactions on Communications, 62(9), 3299–3310.
Fan, L., Yang, N., Duong, T. Q., Elkashlan, M., & Karagiannidis, G. K. (2016). Exploiting direct links for physical layer security in multiuser multirelay networks. IEEE Transactions on Wireless Communications, 15(6), 3856–3867.
Wang, W., Teh, K. C., & Li, K. H. (2016). Relay selection for secure successive AF relaying networks with untrusted nodes. IEEE Transactions on Information Forensics and Security, 11(11), 2466–2476.
Kuhestani, A., Mohammadi, A., & Mohammadi, M. (2018). Joint relay selection and power allocation in large-scale MIMO systems with untrusted relays and passive eavesdroppers. IEEE Transactions on Information Forensics and Security, 13(2), 341–355.
Yang, M., Guo, D., Huang, Y., Duong, T. Q., & Zhang, B. (2016). Secure multiuser scheduling in downlink dual-hop regenerative relay networks over Nakagami-m fading channels. IEEE Transactions on Wireless Communications, 15(12), 8009–8024.
Zhao, R., Lin, H., He, Y. C., Chen, D. H., Huang, Y., & Yang, Y. (2018). Secrecy performance of transmit antenna selection for MIMO relay systems with outdated CSI. IEEE Transactions on Communications, 66(2), 546–559.
Sun, L., Ren, P., & Du, Q. (2014). Distributed source-relay selection scheme for vehicular relaying networks under eavesdropping attacks. EURASIP Journal on Wireless Communications and Networking, 109, 1–11.
Wang, D., Ren, P., Du, Q., Sun, L., & Wang, Y. (2017). Security provisioning for MISO vehicular relay networks via cooperative jamming and signal superposition. IEEE Transactions on Vehicular Technology, 66(12), 10732–10747.
Andersen, J. B. (2002, August). Statistical distributions in mobile communications using multiple scattering. In Proceedings of the 27th URSI general assembly (pp. 0090–6778).
Salo, J., El-Sallabi, H. M., & Vainikainen, P. (2006). Statistical analysis of the multiple scattering radio channel. IEEE Transactions on Antennas and Propagation, 54(11), 3114–3124.
Alghorani, Y., Kaddoum, G., Muhaidat, S., Pierre, S., & Al-Dhahir, N. (2016). On the performance of multihop-intervehicular communications systems over n* Rayleigh fading channels. IEEE Wireless Communications Letters, 5(2), 116–119.
Seyfi, M., Muhaidat, S., Liang, J., & Uysal, M. (2011). Relay selection in dual-hop vehicular networks. IEEE Signal Processing Letters, 18(2), 134–137.
Nguyen, S. Q., & Kong, H. Y. (2016). Outage probability analysis in dual-hop vehicular networks with the assistance of multiple access points and vehicle nodes. Wireless Personal Communications, 87(4), 1175–1190.
Ilhan, H., Uysal, M., & Altunbas, I. (2009). Cooperative diversity for intervehicular communication: Performance analysis and optimization. IEEE Transactions on Vehicular Technology, 58(7), 3301–3310.
Xu, L., Huang, L., Cao, C., Wang, H., Li, Y., & Gulliver, T. A. (2018). Outage performance of mobile V2V cooperative networks. Physical Communications,. https://doi.org/10.1016/j.phycom.2018.04.019.
Ata, S. O., & Altunbas, I. (2016). Fixed-gain AF PLNC over cascaded Nakagami-m fading channels for vehicular communications. AEU-International Journal of Electronics and Communication, 70(4), 510–516.
Ai, Y., Cheffena, M., Mathur, A., & Lei, H. (2018). On physical layer security of double Rayleigh fading channels for vehicular communications. IEEE Wireless Communication Letters, 7(6), 1038–1041.
Zhang, J., & Pan, G. (2017). Secrecy outage analysis with Kth best relay selection in dual-hop inter-vehicle communication systems. AEU-International Journal of Electronics and Communication, 71, 139–144.
Pandey, A., & Yadav, S. (2018). Performance evaluation of amplify-and-forward relaying cooperative vehicular networks under physical layer security. Transactions on Emerging Telecommunication Technologies, 29(12), e3534.
Pandey, A., & Yadav, S. (2018). Physical layer security in cooperative AF relaying networks with direct links over mixed Rayleigh and double-Rayleigh fading channels. IEEE Transactions on Vehicular Technology, 67(11), 10615–10630.
Gradshteyn, I. S., & Ryzhik, I. M. (2000). Table of integrals, series, and products (6th ed.). Berlin: Academic Press.
The Wolfram Functions Site (Online). http://functions.wolfram.com/.
Brychkov, Y. A. (2008). Handbook of special functions: Derivatives, integrals, series and other formulas. London: CRC Press.
Mathai, A., & Saxena, M. R. K. (1973). Generalized hypergeometric functions with applications in statistics and physical sciences. New York: Springer.
Prudnikov, A. P., Brychkov, Y. A., & Marichev, O. I. (1990). Integrals and series volume 3: More special functions. London: Gordon and Breach Science Publishers.
Zhang, C., Ge, J., Li, J., Rui, Y., & Guizani, M. (2015). A unified approach for calculating the outage performance of two-way AF relaying over fading channels. IEEE Transactions on Vehicular Technology, 64(3), 1218–1229.
Acknowledgements
This research work was supported by the Science and Engineering Research Board (a statutory body of the DST, Govt. of India), under Project ECR/2017/000104.
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 Theorem 1
Using (14), (15), and (16), and after some simplifications, we can express \({\mathcal {P}}_{{\text {int}}}^{{\mathrm{v}}}\) under double-Rayleigh fading channels as
By applying the facts that \((b\sqrt{x})^{\alpha }{\mathcal {K}}_{\beta }(b\sqrt{x})=2^{\alpha-1}{\mathcal {G}}_{0,2}^{2,0}\big (\frac{(b\sqrt{x})^{2}}{4}\big |_{\frac{\alpha +\beta }{2}, \frac{\alpha -\beta }{2}}\big )\) [44, p. 54], \({\mathcal {K}}_{\alpha }(a\sqrt{x}){\mathcal {K}}_{\beta }(a\sqrt{x})\) \(=\frac{\sqrt{\pi }}{2}G_{2,4}^{4,0}\bigg (a^{2}x\Big |_{\frac{\alpha +\beta }{2}, \frac{\alpha -\beta }{2}, \frac{-\alpha +\beta }{2}, \frac{-\alpha -\beta }{2}}^{0,0.5}\bigg )\) [45, Eq. (8.4.23.31)], and \({\mathcal {K}}_{\alpha }(\sqrt{x})=\frac{1}{2}{\mathcal {G}}_{0, 2}^{2, 0}\big (\frac{x}{4}\big |_{\frac{\alpha }{2}, \frac{-\alpha }{2}}\big )\) [42, Eq. (03.04.26.0009.01)] within the integral \({\mathcal {I}}_{1}\) in (28), and then simplifying the integral by using [42, Eq. (07.34.21.0081.01)], we can get \({\mathcal {I}}_{1}\) as
Moreover, using \(({\mathcal {K}}_{\alpha }(\sqrt{x}))^{2}=\frac{\sqrt{\pi }}{2}{\mathcal {G}}_{1, 3}^{3, 0}\big (x\big |_{0, \alpha , -\alpha }^{0.5}\big )\) [45, Eq. (8.4.23.27)], and [42, Eq. (03.04.26.0009.01)] within the integral \({\mathcal {I}}_{2}\) in (28), and then with the aid of [42, Eq. (07.34.21.0081.01)], we can obtain \({\mathcal {I}}_{2}\) as
Substituting (29) and (30) into (28), we can obtain the intercept probability for variable gain relaying, \({\mathcal {P}}_{{\text {int}}}^{{\mathrm{v}}}\), as presented in (14).
Appendix 2: Proof of Theorem 2
We can restructure \(\overline{{\mathcal {C}}}_{{\text {D}}}^{{\mathrm{f}}}\) in (19) as
We first evaluate \({\mathcal {I}}_{1}\) as
Making the change of variable \(\alpha _{{\text {RD}}}^{2}x=t\), and using [42, Eq. (01.04.26.0003.01)] and [41, Eq. (7.821.3)], the integral inside the square brackets can be expressed as
Invoking the PDF of \(\lambda _{{\text {SR}}}\) into (33), and solving the integral with the help of \({\mathcal {K}}_{\alpha }(\sqrt{x})=\frac{1}{2}G_{0,2}^{2,0}\bigg (\frac{x}{4}\Big |_{\frac{\alpha }{2}, \frac{-\alpha }{2}}\bigg )\) [42, Eq. (03.04.26.0009.01)] and [42, Eq. (07.34.21.0082.01)], we obtain
Now, we can write \({\mathcal {I}}_{2}\) as
which can be simplified using the fact that \(\ln (1+x)=G_{2,2}^{1,2}\big (x|_{1,0}^{1,1}\big )\) [42, Eq. (01.04.26.0003.01)], and making the change of variable \(\alpha _{{\text {RD}}}^{2}x=t\) and [41, Eq. (7.821.3)] as
Finally, invoking (34) and (36) into (31), we can obtain \(\overline{{\mathcal {C}}}_{{\text {D}}}^{{\mathrm{f}}}\) as
Following the same steps as to obtain (37), we can get \(\overline{{\mathcal {C}}}_{{\text {E}}}^{{\mathrm{f}}}\) as
Invoking (37) and (38) into (20), and after some algebraic simplifications, we can obtain the ESC under fixed gain relaying in (20).
Appendix 3: Proof of Theorem 3
Under variable gain relaying scenario, the ESC of the considered system can be expressed using (6) and (18) as
The terms \({\mathcal {T}}_{1}\) and \({\mathcal {T}}_{2}\) can be evaluated by using the fact that \(\ln (1+x)=G_{2,2}^{1,2}\big (x|_{1,0}^{1,1}\big )\) [42, Eq. (01.04.26.0003.01)] and [41, Eq. (7.821.3)], as presented in (22) and (23), respectively.
Further, the term \({\mathcal {T}}_{3}\) can be expressed as
By inserting the PDFs of \(\lambda _{{\text {SR}}}\) and \(\lambda _{{\text {RD}}}\) into (40), it is observed that the exact evaluation of (40) is intractable due to the involvement of two Bessel functions of different orders and arguments (e.g., \({\mathcal {K}}_{m}(\sqrt{x}){\mathcal {K}}_{n}(\sqrt{x-y}))\). Therefore, for a tractable analysis, we can split the triangular integral region of \(\lambda _{{\text {SR}}}+\lambda _{{\text {RD}}}\) into M rectangular subregions [40, 46], and slightly modify them to express \({\mathcal {T}}_{3}\) as
It is worth noting that the expression in (41) is a good approximation to (40), which yields tight results over broad range of SNRs with negligible approximate error as M increases. Substituting the CDFs of \(\lambda _{{\text {SR}}}\) and \(\lambda _{{\text {RD}}}\) into (41) and using [45, Eq. (1.14.1.4)], we can express \({\mathcal {T}}_{3}\) as
where the first integral in (42) can be simplified with the help of [42, Eq. (01.04.26.0003.01)] and [41, Eq. (7.821.3)], whereas the second integral in (42) can be evaluated with the help of [42, Eq. (03.04.26.0009.01)], [42, Eq. (01.04.26.0003.01)], and [42, Eq. (07.34.21.0081.01)]. Consequently, after some algebraic manipulations, we can get \({\mathcal {T}}_{3}\) as given in (24).
Following the same approach as used to evaluate \({\mathcal {T}}_{3}\) in (24), we can get \({\mathcal {T}}_{4}\) as presented in (25).
Rights and permissions
About this article
Cite this article
Pandey, A., Yadav, S. Secrecy Analysis of Cooperative Vehicular Relaying Networks over Double-Rayleigh Fading Channels. Wireless Pers Commun 114, 2733–2753 (2020). https://doi.org/10.1007/s11277-020-07500-1
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11277-020-07500-1