Next Article in Journal
Joint Constraints Based Dynamic Calibration of IMU Position on Lower Limbs in IMU-MoCap
Next Article in Special Issue
Performance Evaluation of GPS Auto-Surveying Techniques
Previous Article in Journal
Measurement of Water Level in Urban Streams under Bad Weather Conditions
Previous Article in Special Issue
Dynamic Divide Grouping Non-Orthogonal Multiple Access in Terrestrial-Satellite Integrated Network
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Secure Cognitive Radio-Enabled Vehicular Communications under Spectrum-Sharing Constraints

1
Department of Electronics and Communication Engineering, Indian Institute of Information Technology Allahabad, Prayagraj 211015, India
2
Secure Systems Research Center, Technology Innovation Institute, Abu Dhabi 9639, United Arab Emirates
3
Department of Computer Science and Information Engineering, College of Information and Electrical Engineering, Asia University, 500 Lioufeng Rd., Wufeng, Taichung 41354, Taiwan
4
Department of of Intelligent Mechatronics Engineering, and Convergence Engineering for Intelligent Drone, Sejong University, Seoul 05006, Korea
5
Instituto de Telecomunicações (IT) and Departamento de Eletrónica, Telecomunicações e Informática (DETI), University of Aveiro, 3810-193 Aveiro, Portugal
*
Author to whom correspondence should be addressed.
Sensors 2021, 21(21), 7160; https://doi.org/10.3390/s21217160
Submission received: 10 August 2021 / Revised: 25 October 2021 / Accepted: 25 October 2021 / Published: 28 October 2021
(This article belongs to the Special Issue Transmission Techniques for Future Global Mobile Systems)

Abstract

:
Vehicular communication has been envisioned to support a myriad of essential fifth-generation and beyond use-cases. However, the increasing proliferation of smart and intelligent vehicles has generated a lot of design and infrastructure challenges. Of particular interest are the problems of spectrum scarcity and communication security. Consequently, we considered a cognitive radio-enabled vehicular network framework for accessing additional radio spectrum and exploit physical layer security for secure communications. In particular, we investigated the secrecy performance of a cognitive radio vehicular network, where all the nodes in the network are moving vehicles and the channels between them are modeled as double-Rayleigh fading. Furthermore, adopting an underlay approach, the communication between secondary nodes can be performed by employing two interference constraint strategies at the primary receiver; (1) Strategy I: the secondary transmitter power is constrained by the interference threshold of the primary receiver, and (2) Strategy II: the secondary transmitter power is constrained by both the interference threshold of the primary receiver and the maximum transmit power of the secondary network. Under the considered strategies, we derive the exact secrecy outage probability (SOP) and ergodic secrecy capacity (ESC) expressions over double-Rayleigh fading. Moreover, by analyzing the asymptotic SOP behavior, we show that a full secrecy diversity of 1 can be achieved, when the average channel gain of the main link goes to infinity with a fixed average wiretap channel gain. From the ESC analysis, it is revealed that the ESC follows a scaling law of Θ ln Ω m 2 Ω e 2 for large Ω m and Ω e , where Ω m and Ω e are the average channel gains of the main link and wiretap link. The numerical and simulation results verify our analytical findings.

1. Introduction

With the advancement in wireless communication capabilities and increasing number of sensors, an ecosystem of automated connected vehicles has evolved into a network paradigm called the Internet of Vehicles (IoV) [1,2]. Such vehicular communication networks form an integral part of 5G and beyond wireless communication technologies. Moreover, vehicular communications can help us to realize an abundance of on the move intelligent transportation system (ITS) applications, such as safer and better travel experience to the users, infotainment services, efficient traffic management, vehicle platooning etc. [3]. In addition, vehicular communications aim at realizing ubiquitous connectivity among the vehicles in a wireless manner [4]. Therefore, to support such massive connectivity with real-time network access, a substantial amount of energy and radio resources are needed. To this end, cognitive radio technology can be exploited in the vehicular communication networks to support the shared spectrum access [5,6]. The cognitive radio-enabled vehicular communications, named cognitive radio vehicular networks (CRVNs), can exploit the additional spectrum opportunities outside the IEEE 802.11p specified standard 5.9-GHz band [7]. However, such networks are susceptible to various serious security attacks as the bulk of communication occur over the open and vulnerable wireless medium [8]. The issues of mobility, cooperative infrastructure, dynamic nature of cognitive radios, and heterogeneity can further aggravate the security concerns, as these characteristics limit the implementation of the existing key-based cryptography security infrastructure [8,9]. As of late, physical-layer security (PHY-security) has arisen as an appealing way to guarantee secure wireless transmissions and to complement the existing security infrastructure further. In contrast to the key-based upper layer security mechanisms, PHY-security techniques provide secure transmissions at the physical layer by exploiting the inherent random nature of the wireless channels such as fading, interference, etc., through various coding, signal design, and signal processing approaches [10]. Therefore, this paper aims to provide a comprehensive performance analysis of PHY-security in CRVNs under spectrum-sharing constraints.

1.1. Related Works

PHY-security aspects have been thoroughly investigated in the literature for various network scenarios under different fading channels without considering the cognitive framework [11,12,13,14,15,16,17,18,19,20]. Furthermore, the authors in [21] have proposed a machine-learning-based method to locate the vehicles generating jamming signals by monitoring the physical channel parameters of the vehicles in the vehicular networks. Moreover, PHY-security performance in the cognitive radio networks has been explored broadly in the literature [22,23,24,25,26,27,28,29,30,31] with or without relaying scenarios. In addition, to guarantee the quality of service (QoS) at the primary receiver, these works have employed either the single-power constraint of the maximum interference tolerable limit for the primary network or the combined power constraint of the maximum interference tolerable limit for the primary network and the maximum allowable transmission power at the secondary network. For the relay-assisted cognitive radio networks, the secrecy performance of cooperative cognitive relay networks has been analyzed in [22,23,24,25,26,27] and the references therein. Specifically, the authors in [22] investigated the secrecy performance of the cooperative cognitive relay networks in the presence of direct links. The authors in [23,24] have proposed some relay selection strategies to enhance the secrecy performance of the secondary network in the cognitive relaying systems. Moreover, the authors in [25] employed external jamming techniques for improving the security of an underlay cognitive relaying systems. The authors in [26] studied the problem of residual energy maximization for the multiple eavesdropper scenario in cognitive relaying networks. Furthermore, the authors in [27] analyzed the PHY-security performance of multiple-input–multiple-output cognitive relaying networks under the impact of outdated channel estimates.
Of particular interest are the secure underlay cognitive radio networks, where the secondary transmitter communicates with the secondary receiver under the interference constraint imposed on primary receiver in the presence of active/passive eavesdropper. Specifically, the authors in [28,29,30,31,32] evaluated the secrecy performance for cognitive radio networks. For instance, the authors in [28] investigated the secrecy performance of an underlay cognitive wiretap secondary system with multiple secondary receivers and eavesdroppers by considering the joint power constraint under Rayleigh fading channels. In [29], the authors investigated the secrecy performance of multiinput, single-output, and single-eavesdropper cognitive radio networks over correlated fading channels. The authors in [30] analyzed the secrecy performance of a cognitive wiretap system with multiantenna secondary terminals under Rayleigh fading channels. Further, the authors in [31] evaluated the secrecy performance of an underlay cognitive radio system in the presence of an active eavesdropper. Furthermore, for a single-input–multiple-output system, the authors in [32] investigated the impact of outdated channel estimates on PHY-security performance for cognitive radio networks.
However, all the aforesaid studies in [28,29,30,31,32] were limited to the scenarios where the nodes in the network are stationary (i.e., fixed infrastructures); therefore, the channel between the nodes is modeled as Rayleigh fading or Nakagami-m fading. In fact, the nodes in the wireless communication networks can be moving while exchanging the information, e.g., mobile of people driving on road, yielding the channel between the moving nodes as cascaded Rayleigh (double-Rayleigh) fading [33,34,35]. ( It is to be emphasized that the vehicle-to-vehicle (V2V) links undergo multiple scattering phenomena and are moving in a relatively dense scattering environment; thus, from the theoretical and empirical studies, cascaded Rayleigh channel modeling is shown to be more appropriate in resembling the dynamic V2V communication links [33,34,35]). Therefore, such V2V communications-enabled cognitive radio networks are one of the most fascinating use-cases in the upcoming 5G networks, and it is very interesting to comprehensively investigate the PHY-security in CRVNs under double-Rayleigh fading channels. In this context, the secrecy performance over cascaded fading channels has been widely studied in [35,36,37,38,39,40]. Recently, the authors in [41] studied the secrecy capacity performance for vehicular communication networks. However, these works [35,36,37,38,39,40,41] were limited to the noncognitive networking setup. Moreover, the authors in [42,43] evaluated the performance of multihop cognitive radio networks over double-Rayleigh fading channels but without taking PHY-security aspects into account. Further, the authors in [44] investigated secrecy performance of CRVNs over N * Nakagami-m fading channels.

1.2. Motivation

From the aforementioned discussion, we can infer that the bulk of the works reported towards the investigation of PHY-security aspects in cognitive communication networks were limited to the scenario where the nodes are stationary. With the emerging varied form of ITS applications and user needs on the move, CRVNs have attracted great research interest. The authors in [35,36,37,38,39,40] evaluated PHY-security performance of cooperative vehicular relaying networks but without taking the spectrum-sharing cognitive framework into consideration. Moreover, the authors in [42,43] considered double-Rayleigh fading channels and evaluated the performance of cognitive radio-enabled V2V networks, but they did not emphasize the PHY-security aspects of the considered system. Therefore, exploitation of PHY-security benefits in underlay CRVNs over cascaded fading channels is still an open issue. To this end, a little effort has been directed to analyze the secrecy performance of CRVNs over N * Nakagami-m fading channels in [44]. Very recently, the authors in [45] analyzed the secrecy performance of cognitive radio networks over cascaded Rayleigh fading. However, there are several differences between this work and [44,45].
  • In [44], the authors considered the following assumptions while analyzing the secrecy performance of CRVNs; (i) single-power constraint of the interference on the primary receiver, and (ii) N * Nakagami-m fading. In addition, the system’s performance was evaluated in terms of secrecy outage probability (SOP).
  • In [45], the authors considered the following assumptions while investigating the PHY-security performance of CRVNs; (i) single-power constraint of the interference on the primary receiver, (ii) cascaded Rayleigh fading for the main channel (between secondary source and secondary receiver), and Rayleigh fading for both the wiretap channel (between secondary source and secondary eavesdropper) and interference channel (between secondary source and primary receiver). However, for evaluating the system’s performance, the cascaded Rayleigh fading was transformed into a Nakagami-m fading approximation, and assumed statistical independence among the channel gains. In addition, the performance was evaluated in terms of SOP, intercept probability, and probability of non-zero secrecy capacity.
  • Different from [44,45], in this paper, we adopt the following: (i) two power control strategies at the secondary transmitter, i.e., Strategy I: single-power constraint of the interference on the primary receiver, and Strategy II: combined power constraint of the interference on the primary receiver and the maximum transmission power at the secondary transmitter, (ii) double-Rayleigh fading for all the links, and (iii) statistical dependency among the channel gains. In addition, we evaluate the secrecy performance in terms of exact SOP, asymptotic SOP, and ergodic secrecy capacity (ESC), under Strategies I and II.
In addition, the proposed work and the works presented in [46,47] explored the cognitive radio networks under vehicular communications. However, there are several key differences between this work and [46,47], whose brief detail is as follows.
  • This paper and the work presented in [46] consider all the nodes are equipped with single antenna, whereas the authors in [47] considered the secondary transmitter and primary receiver are equipped with single antenna and secondary receiver and eavesdropper are enabled with multiple antennas.
  • In this work, we consider the channel between the moving vehicles to be quasistationary for a short duration (i.e., one fading block time), where the distance between the nodes is much greater than the scattering radii. Consequently, assuming the radio propagation between two moving vehicles undergoes independent double scattering events, the channel can be modeled as double-Rayleigh fading. By contrast, the works presented in [46,47] considered the scenario where the symbol period of the detected signal is larger than the coherence time of the channel, and hence, the system fading links can be characterized as time-selective. Particularly, the works [46,47] considered Rayleigh fading channels and Nakagami-m fading channels, respectively.
  • In [46], the authors considered a single-power constraint of the interference on the primary receiver, whereas in [47], the authors adopted a combined power constraint of the interference on the primary receiver and the maximum transmission power at the secondary transmitter. Different from [46,47], this paper adopts both single-power- and combined-power-based control strategies for managing interference at the primary receiver.
  • In [46], the authors evaluated the SOP and intercept probability expressions over Rayleigh fading channels, while in [47], the authors derived the expressions for the SOP and ESC over Nakagami-m fading channels. In this paper, we derived the SOP and ESC expressions over double-Rayleigh fading channels.
Therefore, the above differences make the contributions and results of this work fundamentally very different from [44,45,46,47]. Hence, this motivates us to develop a thorough and comprehensive investigation on the secrecy performance of CRVNs under both single and combined interference power constraints in the presence of double-Rayleigh fading channels.

1.3. Contributions

From the aforesaid discussion, it is obvious that there is a lack of PHY-security performance evaluation in CRVNs over double-Rayleigh fading channels by employing two power control strategies at the secondary transmitter vehicle, i.e., (1) Strategy I: where the transmit power of the secondary transmitter vehicle is only constrained by the interference threshold of the primary receiver vehicle, and (2) Strategy II: where the transmit power of the secondary transmitter vehicle is constrained by both the maximum transmit power and the interference threshold of the primary receiver vehicle. The analytical outcomes reported in this paper thus (1) face several mathematical challenges and complications under the considered strategies and double-Rayleigh fading, (2) are unique as efforts to investigate PHY-security in CRVNs under the consideration of two spectrum sharing constraints and double-Rayleigh fading channels is made first time in the literature, and (3) lay the foundation for examining PHY-security in CRVNs over more generalized cascaded fading models, such as N*Rayleigh and N*Nakagami-m. Specifically, in this work, under the two considered power control strategies and by taking double-Rayleigh fading channels into account, we investigate SOP, asymptotic SOP behavior, and ESC, for the considered underlay CRVNs. The key contributions of the paper are summarized as follows.
  • We deduce the exact SOP expressions over double-Rayleigh fading channels in order to investigate the secrecy performance under two considered power control strategies. These SOP expressions enable us to effectively determine the impact of key system/channel parameters on the system’s secrecy performance.
  • We further present the asymptotic SOP expressions for Strategy I and Strategy II over double-Rayleigh fading channels. These asymptotic expressions provide us some important insights related to the system’s achievable secrecy diversity order. Based on these asymptotic results, it is observed that the system can achieve a secrecy diversity order of 1, when the average channel gain of the main link goes to infinity and the average channel gain of the wiretap link is fixed. However, the convergence of achieving the asymptotical secrecy diversity order of 1 is very slow, due the involvement of double-Rayleigh fading channels. In addition, the secrecy diversity order reduces to zero when the average channel gains of the main and wiretap links go to infinity.
  • Using the derived exact SOP expression under Strategy II, we demonstrate the impact of maximum tolerable interference level and maximum secondary transmitter power on the secrecy performance. Specifically, we analyze two cases, viz., (1) when maximum tolerable interference level is proportional to maximum secondary transmitter power, and (2) when maximum tolerable interference level is not related to maximum secondary transmitter power. It is revealed from these two cases that the SOP performance saturates when maximum secondary transmitter power is large enough, which results into a zero system’ secrecy diversity gain.
  • Further, we deduce novel ESC expressions for Strategy I and Strategy II under double-Rayleigh fading, in order to analyze the impact of interference threshold, maximum transmit power, and average channel gains on the secrecy performance. We also present two key observations irrespective of two power control strategies, when the average channel gains of main and wiretap links are very large, i.e., (1) there exists a ceiling of ESC, and (2) the ESC follows a scaling law of Θ ln Ω m 2 Ω e 2 , where Ω m and Ω e are the average channel gains of main and wiretap links, respectively.
  • We finally verify our analytical and theoretical findings via simulation studies. Our results show the impact of involved network parameters on the system’s SOP and ESC performances under Strategy I and Strategy II.

1.4. Organization

The paper is structured as follows: Section 2 describes the considered system model for CRVNs. In Section 3, we analyze and present the exact and asymptotic SOP expressions under Strategy I and Strategy II for CRVNs. Section 4 presents the ESC expressions under Strategies I and II. Numerical results are provided in Section 5 to offer valuable insights onto the secrecy performance. Finally, Section 6 concludes the work.
Notations: K v ( · ) is the v-th order modified Bessel function of second kind (eq. (8.432)) of [48], 2 F ˜ 1 ( m , n , p ; z ) is the Hypergeometric regularized function (eq. (9.10)) of [48], Ψ ( · , · , · ) being the Kummer hypergeometric function (eq. (9.238)) of [48], G p , q m , n y | b 1 , , b q a 1 , , a p is the Meijer-G function (eq. (9.301)) of [48], and G p 1 , q 1 : p 2 , q 2 : p 3 , q 3 m 1 , n 1 : n 2 , m 2 : n 3 , m 3 y , z | b 1 , , b q 1 a 1 , , a p 1 | d 1 , , d q 2 c 1 , , c p 2 | f 1 , , f q 3 e 1 , , e p 3 is the extended generalized bivariate Meijer-G function (eq. (07.34.21.0081.01)) of [49].

2. System and Channel Models

In the following subsections, we detail the adopted cascaded fading channel model for the V2V channels and the system model for our considered cognitive vehicular networks. Further, we consider two power control strategies to minimize the interference at the primary receiver and present the end-to-end instantaneous signal-to-noise ratios for both the strategies.

2.1. Statistical Background: The Double-Rayleigh Distribution

As proposed in [33], for mobile-to-mobile links, the multiple Rayleigh propagation considers two or more independent Rayleigh fading processes generated by independent groups of scatterers around the two moving vehicles. The resulting transfer function, H ( t ) , can be expressed as a linear combination of components with Rayleigh, double-Rayleigh, triple-Rayleigh, etc., distributed amplitudes. For the case of only double-Rayleigh process, the narrow-band, base-band channel transfer function can be written as [37]
H ¯ ( t ) = 2 N T N R n = 1 N T m = 1 N R e j 2 π ( f T cos ( ϕ n ) t + f R cos ( ϕ m ) t + θ n m ) ,
where N T and N R are the respective numbers of scatterers generated around moving transmitter and receiver, f T and f R denote the respective maximum Doppler shift due to the motion (speed of mobility) of transmitter and receiver, ϕ n and ϕ m are the random angle of departure and the angle of arrival with respect to the velocity vectors, respectively, and θ n m is the joint phase shift. It is important to note that the motions (speed of mobility) of transmitter and receiver are involved in the form of Doppler shifts to determine how fast the fading channel will be. For mathematical tractability, the channel between moving vehicles is assumed to be quasi-stationary for a short duration (i.e., one fading block time), and the distance between the nodes is much greater than the scattering radii, the channel between those moving vehicles can be distributed as double-Rayleigh fading (It is a more realistic channel model in a V2V scenario, especially when (i) the vehicles are moving in high scattering environment, e.g., high traffic scenarios and (ii) all the vehicles are equipped with low elevation antennas. Such a fading assumption which can find its applicability for vehicular communication scenarios in rush-hour traffic is widely investigated for vehicular networks in the literature [35,36,37,38,39,40,42,43]) [33,34,35,36,37,38,39,40,42,43,44,45,50,51,52].
Under double-Rayleigh fading, the resulting envelope R can be expressed as the product of R 1 and R 2 , i.e., R = R 1 R 2 , where R 1 and R 2 are independent Rayleigh fading processes with mean powers Ω 1 and Ω 2 , respectively. Thus, the probability density function (PDF) and the cumulative distribution function (CDF) of R can be expressed as [37]
f R ( r ) = r Ω 1 Ω 2 K 0 r Ω 1 Ω 2 ,
F R ( r ) = 1 r Ω 1 Ω 2 K 1 r Ω 1 Ω 2 ,
respectively. Moreover, the PDF and CDF of the square to the envelope, i.e., | R | 2 , can be represented, respectively, as
f | R | 2 ( r ) = 2 Ω 1 Ω 2 K 0 2 r Ω 1 Ω 2 ,
F | R | 2 ( r ) = 1 2 r Ω 1 Ω 2 K 1 2 r Ω 1 Ω 2 .

2.2. Cognitive Radio Vehicular System

We consider a secure CRVN, where primary user vehicle and secondary user vehicles share the same licensed spectrum band in a given propagation environment. In the secondary network, the secondary transmitter sends its message to secondary receiver in the presence of a primary receiver present in the primary network. Meanwhile, in the secondary network, a passive eavesdropper vehicle is able to intercept the information transmitted by the secondary transmitter. Under the passive eavesdropping scenario, the instantaneous CSI between secondary transmitter and eavesdropper is not available at the secondary transmitter. During the whole process, the secondary transmitter imposes an interference to the primary receiver. Note that we highlight a practical consideration of the passive eavesdropping scenario since, in practice, the passive eavesdropper is noncooperative and does not feedback its instantaneous CSI to the trusted nodes. The assumption of known statistical CSI of eavesdropper’s channel can be applied to the scenario where the eavesdropper is part of a system which in alternate time slots becomes an active trusted user in the system. As such, the instantaneous CSI of the eavesdropper can be available at the transmitter via a feedback channel for the time slot where it is being served. Therefore, from this information and assuming eavesdropper CSI does not change under the assumption of quasi-stationary channel for a short duration, statistical CSI of the passive eavesdropper can be available at the trusted node, for the time slots where it is not being served [17,18,19,20,21,22,23,24,25,26,27,28,29,30]. The detail of the interference constraints is discussed later in this section.
Figure 1 depicts the system model of the considered secure CRVN, which consists of a secondary transmitter vehicle ST , a secondary receiver vehicle SR , a primary receiver vehicle PR , and a passive eavesdropper vehicle E. All the terminals are equipped with a single antenna and operate in the half-duplex manner (note that the consideration of single-antenna at the terminals can reduce the system complexity and requirement of power-intensive signal processing modules and hence make them for practical use in various battery operated devices, such as wireless sensor applications. In addition, the assumption of half-duplex terminals can be practically applicable, as the half-duplex operation is much easier and does not require additional signal-processing operations compared to the full-duplex operation, because in the full-duplex operation, a significant amount of self-interference is observed at the receiving antenna as a result of the signal from the transmitting antenna of the same node). Since, all the nodes are moving vehicles; therefore, the channels for ST SR (i.e., main link), ST PR (i.e., interference link), and ST E (i.e., wiretap link) links can be modeled as double-Rayleigh fading. We represent h m , h p , and h e as the channel coefficients of ST SR , ST PR , and ST E links, respectively. In addition, we consider the perfect CSI knowledge of the channels. In this paper, we consider the perfect channel estimation process. However, imperfect channel estimates may be available for transmission in such systems, which are generally inaccurate and outdated with respect to actual channel. Consequently, the imperfect/outdated CSI for the actual channel can be expressed as h ı i m p e r f e c t = ϱ ı h ı + 1 ϱ ı 2 w ı , for ı { m , e , p } , where ρ ı denotes the normalized correlation coefficient between h ı i m p e r f e c t and h ı , and w ı is a Gaussian random variable having the same variance as that of h ı . Therefore, the performance evaluation of considered CRVNs under such imperfect/outdated CSI requires a fresh approach, which is studied thoroughly and comprehensively in the future work. Under double-Rayleigh fading, the channel coefficients h ı , for ı { m , e , p } , can be expressed as the product of h ı , 1 and h ı , 2 , where h ı , 1 and h ı , 2 are independent complex Gaussian random variables having zero mean and variance (without loss of generality, we assume Ω ı , 1 = Ω ı , 2 = Ω ı , for ı { m , e , p } ; however, the analysis can readily be extended for Ω ı , 1 Ω ı , 2 ). Ω ı , 1 and Ω ı , 2 , respectively. P s denotes the transmit power at ST . We also assume the additive white Gaussian noise (AWGN) with zero mean and N 0 variance for each link.

2.3. Instantaneous End-to-End Signal-to-Noise Ratio

Suppose that ST sends its confidential information to the legitimate SR over the main channel, and at the same time an E tries to decode this information through the wiretap channel; then, the signal received at SR and E can be given by y SR = P s h m x s + n m and y E = P s h e x s + n e , respectively, where n m and n e are AWGNs at SR and E, respectively. The instantaneous end-to-end signal-to-noise ratios (SNRs) Λ m and Λ e at SR and E can be expressed as
Λ m = P s | h m | 2 N 0   and   Λ e = P s | h e | 2 N 0 .
Furthermore, we assume that PR feedbacks its instantaneous CSI to secondary transmitter ST, and ST accordingly adjusts its transmit power to satisfy the interference constraint [52]. Practically, a spectrum band manager can help to realize this task by mediating between the primary and the secondary users. Therefore, in order to protect the QoS of PR, we employ two power control strategies at ST , i.e., (1) Strategy I: single-power constraint of the interference on the PR, I P [22,28,53] and (2) Strategy II: combined power constraint of the interference on the PR and the maximum transmit power at ST , Q [29,30,53].
Strategy I: Under Strategy I, the transmit power P s at ST is constrained so that the interference impinged on PR remains below the maximum tolerable interference level I P . Therefore, P s at ST can be mathematically expressed as P s = I P | h p | 2 . Therefore, with Strategy I, the instantaneous end-to-end SNRs at SR and E can be given as
Λ m I = ρ | h m | 2 | h p | 2   and   Λ e I = ρ | h e | 2 | h p | 2 ,
respectively, where ρ I P N 0 .
Strategy II: In Strategy II, if ST is power limited terminal, then ST may transmit up to the maximum transmit power constraint of Q, and therefore P s at ST can be expressed as P s = min I P | h p | 2 , Q . Taking such strategy into account, the instantaneous end-to-end SNRs at SR and E can be given by
Λ m I I = min ρ | h p | 2 , ρ 1 | h m | 2 ,
Λ e I I = min ρ | h p | 2 , ρ 1 | h e | 2 ,
respectively, where ρ 1 Q N 0 .
Under the two adopted strategies, the capacities corresponding to main link (i.e., ST SR ) and wiretap link (i.e., ST E ) can be given by C m ȷ = log 2 ( 1 + Λ m ȷ ) and C e ȷ = log 2 ( 1 + Λ e ȷ ) , where ȷ = I for Strategy I and ȷ = I I for Strategy II. Moreover, the secrecy capacity of the wireless transmission can be given as C s e c ȷ = max { C m ȷ C e ȷ , 0 } , for ȷ { I , I I } .
In addition, Figure 2 shows the overall representation of the proposed CRVN framework. Here, the secondary vehicular network operates in the underlay spectrum sharing context along with the presence of a primary vehicular network. The transmission in the secondary network can only be established as long as the resulting interference on the PR is maintained underneath a given threshold. Firstly, if the PR generates an instantaneous QoS requirements, then the transmit power at ST should be constrained so that the interference imposed on PR remains below the maximum tolerable interference level, and consequently the transmit power, P s , at ST can be given as P s = I P | h p | 2 . Thereafter, the secondary users are allowed to use the licensed band and perform their operations accordingly. On the other hand, if the PR generates a stringent requirement of protecting QoS of PR and maintaining secondary user throughput simultaneously, then the transmit power, P s , at ST can be expressed as P s = min I P | h p | 2 , Q . Accordingly, the secondary users are allowed to start their transmissions. Finally, the performance of secure secondary network under the above two constraints can be evaluated in terms of SOP, asymptotic SOP, and ESC, as presented in subsequent Section 3 and Section 4.

2.4. Practical Applicability

The proposed analysis of the considered system by taking two power control strategies and double-Rayleigh fading channels into account can be applicable for various practical scenarios, as stated below.
  • The proposed analysis under Strategy I can be more appropriate under the practical scenario when the service provided by the primary user has an instantaneous QoS requirement.
  • The proposed analysis under Strategy II is suitable under the practical scenario when there is a stringent requirement of protecting QoS of primary user and maximizing secondary user throughput simultaneously.
  • The proposed analysis under double-Rayleigh fading assumption is practically applicable for vehicular communication scenarios in rush-hour urban traffic.
  • The proposed analysis is also applicable for the scenario when one mobile terminal is located indoors in low-ascent building, and the another mobile terminal is placed outdoors, as the cascaded fading envelope distribution is found suitable under such scenario.
  • The proposed analysis can be applied to the scenario when the mobile nodes are located in a relatively dense scattering (e.g., vegetation) environment, as the channel between them will be a good fit for cascaded fading distribution.
It is to be noted that compared to the existing similar works presented in [44,45,47], the complexity of this work can be discussed as follows; (i) the paper [44] adopted N * Nakagami-m fading channels and [45] adopted cascaded fading channels, which implies that the cascading degree of order N imposes more computational resources in examining the performance of the considered system. Whereas this paper considers the double-Rayleigh fading channels, which allows one to operate with less computational resources (because of having cascading degree of order (2) while evaluating the system performance, without the loss of information, and (ii) the work presented in [47] considered the multiple-antennas at the legitimate destination and eavesdropper, which require several parallel radio frequency chains in the front-end architecture of the receiver. This increases the power consumption, complexity, cost, and size of the system, due to which the direct implementation of such systems is hindered in battery-operated sources, such as in wireless sensor applications. That said, this paper considers the single-antenna terminals which drastically reduce the system’s complexity and can be efficiently applicable for the resource constraint devices.
Furthermore, we evaluate the SOP and ESC for Strategy I and Strategy II under double-Rayleigh fading channels, in what follows. Note that SOP is an appropriate metric for the block fading channels (such as, double-Rayleigh fading channels under multiple scattering phenomenon for vehicular scenario), where the maximum rate of reliable communication is supported only by the one channel realization. On the other hand, ESC is the maximum mutual information averaged over many independent fades of the channel. With the block fading, the time average should converge to the same limit for almost all channel realizations of the fading process (known as ergodicity); thus, ESC is only the long-term time average rate achieved, and not on how fast that rate fluctuates over the time. Therefore, we can evaluate the SOP and ESC in the one system assumption.

3. Exact and Asymptotic SOP Analyses under Strategies I and II

In the consequent subsections, we derive an analytical expression for a key secrecy metric and SOP to quantify the considered network secrecy performance under both Strategies I and II. Further, to provide meaningful insights, we also provide asymptotic SOP analysis under both the scenarios for the considered system.

3.1. Strategy I: Single-Power Constraint of the Interference on the PR

3.1.1. Exact Analysis for SOP

The SOP can be defined as the probability that the achievable secrecy capacity is less than a predefined secrecy transmission rate R s (in bps/Hz). We can mathematically express the SOP under Strategy I as
P o u t s e c , I = Pr [ max { C m I C e I , 0 } < R s ] .
Note that when C m I C e I , the secrecy is compromised, i.e., P o u t s e c , I = 1 . Therefore, we analyze the SOP when C m I > C e I as
P o u t s e c , I = Pr [ C m I C e I < R s ] = Pr 1 + ρ | h m | 2 | h p | 2 1 + ρ | h e | 2 | h p | 2 < η = 1 P r | h e | 2 < | h m | 2 η ( η 1 ) | h p | 2 η ρ .
Since | h m | 2 and | h e | 2 consist of a common channel gain | h p | 2 ; therefore, the SOP under this strategy can be expressed as
P o u t s e c , I = 1 0 ( η 1 ) w ρ F | h e | 2 y η ( η 1 ) w η ρ f | h m | 2 ( y ) d y I 1 f | h p | 2 ( w ) d w ,
where η = 2 R s is the secrecy target threshold. To evaluate the SOP under Strategy I in (12), we first need to simplify the inner integral I 1 , which is given as per the following theorem.
Theorem 1.
The inner integral I 1 of (12) can be expressed as
I 1 = I 1 a I 1 b ,
where
I 1 a = 2 ( η 1 ) w ρ λ m K 1 2 ( η 1 ) w ρ λ m ,
I 1 b = λ m η λ e k = 0 ( 1 ) k k ! η 1 ρ λ m k w k G 3 , 3 2 , 3 λ m η λ e | 1 2 , 1 2 , k 1 2 1 2 , k 1 2 , k 1 2 ,
where λ m = Ω m 2 and λ e = Ω e 2 .
Proof. 
The proof is given in Appendix A. □
Furthermore, invoking (14) and (15) along with the PDF of | h p | 2 into (12), we can represent the SOP as
P o u t s e c , I ( η ) = 1 4 λ p ( η 1 ) ρ λ m 0 w 1 2 K 0 2 w λ p K 1 2 ( η 1 ) w ρ λ m d w + 2 λ m λ p η λ e k = 0 ( 1 ) k k ! η 1 ρ λ m k G 3 , 3 2 , 3 λ m η λ e | 1 2 , 1 2 , k 1 2 1 2 , k 1 2 , k 1 2 0 w k K 0 2 w λ p d w ,
where λ p = Ω p 2 . Then, the first integral in (16) can be simplified using (eq. (03.04.26.0009.01)) of [49] and (eq. (07.34.21.0011.01)) of [49], and the second integral in (16) can be evaluated by first using the transformation of variables w λ p = t 2 4 and then applying (eq. (6.561.16)) of [48]. Consequently, the SOP under Strategy I, P o u t s e c , I ( η ) , can be expressed as
P o u t s e c , I ( η ) = 1 ( η 1 ) λ p ρ λ m G 2 , 2 2 , 2 ( η 1 ) λ p ρ λ m | 1 2 , 1 2 1 2 , 1 2 + λ m η λ e k = 0 ( 1 ) k k ! η 1 ρ λ m k λ p k ( Γ ( k + 1 ) ) 2 G 3 , 3 2 , 3 λ m η λ e | 1 2 , 1 2 , k 1 2 1 2 , k 1 2 , k 1 2 .
Remark 1.
The SOP in (17) mainly consists of powers, complete Gamma function, and Meijer-G functions, containing maximum interference threshold limit ( I p ) , secrecy target threshold ( η ) , and average channel gains ( Ω m , Ω e , and Ω p ), which can effectively be evaluated using Mathematica software. The SOP behavior for various values of channel/system parameters is shown numerically in Section 5.
Remark 2.
We infer that the SOP expression in (17) depends on the average channel gain of the interference link (ST → PR), i.e., λ p = Ω p 2 , which implies that the SOP performance degrades as λ p increases and vice versa. This is due to the fact that the power at ST reduces with the increased λ p , as also validated numerically in Section 5.

3.1.2. Asymptotic Analysis for SOP

To gain more insights into the achievable secrecy diversity order of the considered system, we focus on the asymptotic analysis in the high average channel fading gains regime. Here, we specifically investigated two separate scenarios: (1) when λ m and λ e is fixed. In this scenario, the quality of the legitimated channel is better than the quality of wiretap channel (i.e., E is located far away from ST ), and (2) when λ m and λ e , where both the legitimated and wiretap channels experience similar fading conditions. Note that there may be another scenario where λ m is fixed and λ e . However, this case significantly strengthens the quality of wiretap link and increases the probability of successful eavesdropping, as E, which implies that the secrecy diversity order becomes zero.
When λ m and fixed λ e
Under this scenario, we simplify (17) by ignoring the higher order infinitesimal terms to obtain the asymptotic SOP as
P o u t , a s y s e c , I ( η ) λ m 1 ( η 1 ) λ p ρ λ m G 2 , 2 2 , 2 ( η 1 ) λ p ρ λ m | 1 2 , 1 2 1 2 , 1 2 + λ m η λ e G 3 , 3 2 , 3 λ m η λ e | 1 2 , 1 2 , 1 2 1 2 , 1 2 , 1 2 .
Remark 3.
Secrecy diversity order analysis: When λ m and λ e are fixed, the secrecy diversity order can be defined as the ratio of asymptotic SOP to average channel gain of the main link λ m , yielding
G D = lim λ m log P o u t , a s y s e c , I ( η ) log λ m .
From (18), we can observe that the term G 3 , 3 2 , 3 λ m η λ e | 1 2 , 1 2 , 1 2 1 2 , 1 2 , 1 2 converges to zero very quickly as λ m for fixed η and λ e , and hence, it can be ignored from (18) while evaluating the secrecy diversity order. Consequently, we can re-express the resultant asymptotic SOP via (eq. (07.34.03.0871.01)) of [49], and after some simplifications, as
P o u t , a s y s e c , I ( η ) 1 A ( η ) λ m 2 F ˜ 1 2 , 2 , 3 ; 1 A ( η ) λ m ,
where A ( η ) = ( η 1 ) λ p ρ . Now, invoking (20) into (19), and by simplifying 2 F ˜ 1 ( a , b , c ; z ) using (eq. (07.24.26.0003.01)) of [49] and (eq. (07.23.03.3573.01)) of [49], and after some involved simplifications, we can express the secrecy diversity order as
G D = lim λ m log 1 λ m A ( η ) + λ m + A ( η ) log A ( η ) λ m ( A ( η ) λ m ) 2 log λ m ,
which can be further simplified with the assistance of L’Hospital’s rule to obtain the secrecy diversity order as
G D = 1 .
Therefore, we can infer that the system can achieve a secrecy diversity order of 1 and does not depend on the parameters related to the wiretap link (i.e., ST → E) and interference link (i.e., ST → PR).
Remark 4.
The convergence behavior of secrecy diversity order is shown in Figure 3, from which it can be observed that the secrecy diversity order converges to its asymptotical value of 1 over double-Rayleigh fading channels, irrespective of the wiretap link strength λ e , ρ, and λ p . However, the convergence gets slower because of the involved double-Rayleigh fading channels. We can also infer that the convergence further slows down as λ e and/or λ p increases and vice versa.
When λ m and λ e
The asymptotic SOP for this case can be evaluated as per the following theorem.
Theorem 2.
The asymptotic SOP for the case when λ m and λ e (as the average channel gains of both the legitimated link and wiretap link are improved simultaneously) under double-Rayleigh fading channels can be expressed as
P o u t , a s y s e c , I ( η ) λ m , λ e 1 η λ e λ m G 2 , 2 2 , 2 η λ e λ m | 1 2 , 1 2 1 2 , 1 2 .
Proof. 
Under λ m and λ e , we can approximate the SOP as P o u t s e c , I ( η ) = P r 1 + ρ | h m | 2 | h p | 2 1 + ρ | h e | 2 | h p | 2 < η P r | h m | 2 | h e | 2 < η , which can be further expressed in the integral form as P o u t , a s y s e c , I ( η ) 0 F | h m | 2 ( η y ) f | h e | 2 ( y ) d y . Now, invoking the CDF of | h m | 2 and the PDF of | h e | 2 and simplifying with the aid of (eq. (07.34.21.0011.01)) of [49], we can obtain the asymptotic SOP expression, as given in (23). □
Remark 5.
From (23), we can infer that the secrecy outage floor occurs for fixed ratio λ e λ m (as λ m and λ e ), and hence, the secrecy diversity order cannot be attained. In addition, it is also worthwhile to note that the system’s secrecy diversity order can also be realized by analyzing the asymptotic SOP behavior for the case when ρ = I p N 0 . Under this case, we can have the same asymptotic SOP expression as evaluated in (23), since ρ at both D and E are increased simultaneously. We can further reveal that the SOP expression under this case achieves an error floor and results in a zero secrecy diversity order.

3.2. Strategy II: Combined Power Constraint of the Interference at the PR and Maximum Transmit Power at the ST

3.2.1. Exact Analysis for SOP

Considering C m I I > C e I I and using (8) and (9), the SOP can be expressed as
P o u t s e c , I I ( η ) = Pr 1 + min ρ | h p | 2 , ρ 1 | h m | 2 1 + min ρ | h p | 2 , ρ 1 | h e | 2 < η = Pr 1 + ρ 1 | h m | 2 1 + ρ 1 | h e | 2 < η Pr ρ ρ 1 | h p | 2 Θ 1 ( η ) + P r 1 + ρ | h m | 2 | h p | 2 1 + ρ | h e | 2 | h p | 2 < η , ρ ρ 1 < | h p | 2 Θ 2 ( η ) .
Further, the SOP in (24) can be simplified as per Theorem 3.
Theorem 3.
The exact expression for the SOP under Strategy II using (24) can be expressed as
P o u t s e c , I I ( η ) = Θ 1 ( η ) + Θ 2 ( η ) ,
where
Θ 1 ( η ) = [ 1 2 η 1 ρ 1 λ m K 1 2 η 1 ρ 1 λ m + λ m η λ e k = 0 ( 1 ) k k ! η 1 ρ 1 λ m k × G 3 , 3 2 , 3 λ m η λ e | 1 2 , 1 2 , k 1 2 1 2 , k 1 2 , k 1 2 ] 1 2 ρ ρ 1 λ p K 1 2 ρ ρ 1 λ p ,
Θ 2 ( η ) = 2 ρ ρ 1 λ p K 1 2 ρ ρ 1 λ p 4 λ p η 1 ρ λ m [ λ p 3 2 4 G 2 , 2 2 , 2 ( η 1 ) λ p ρ λ m | 1 2 , 1 2 1 2 , 1 2 ρ 3 2 2 ρ 1 3 2 i = 1 N g i t i 2 G 0 , 2 2 , 0 ( η 1 ) t i 2 ρ 1 λ m | 1 2 , 1 2 G 0 , 2 2 , 0 ρ t i 2 ρ 1 λ p | 0 , 0 ] + λ m η λ e λ p k = 0 ( 1 ) k k ! × ρ ρ 1 k + 1 η 1 ρ λ m k G 1 , 3 3 , 0 ρ ρ 1 λ p | k 1 , 0 , 0 k G 3 , 3 2 , 3 λ m η λ e | 1 2 , 1 2 , k 1 2 1 2 , k 1 2 , k 1 2 ,
where g i = j = 0 N 1 [ q j ( t i ) ] 2 1 and t i , ( i = 1 , , N ) are the weights and zeros of N order Gauss–Lobatto’s polynomial (eq. (25.4.33)) of [54], respectively, and q N ( t ) = 2 N + 3 P N ( 2 , 0 ) ( 1 2 t ) with P N ( 2 , 0 ) as the Jacobi polynomial.
Proof. 
The detailed analysis is given in Appendix B. □
Remark 6.
We highlight that (25) mainly involves powers, Meijer-G functions, and modified Bessel function of the second kind, consisting of network parameters I p , Q, η, Ω m , Ω e , and Ω p , which can readily be evaluated by the help of Mathematica software, as shown via numerical results in Section 5.
Remark 7.
The SOP expression in (25) consists of Gauss–Lobatto’s series expansion of order N, which converges to an arbitrarily accurate approximation by selecting the appropriate value of N. For instance, consider the term of (27), i.e., Z = G 0 , 2 2 , 0 ( η 1 ) t i 2 ρ 1 λ m | 1 2 , 1 2 G 0 , 2 2 , 0 ρ t i 2 ρ 1 λ p | 0 , 0 . Note that the Meijer-G function can be expressed in terms of v-th order modified Bessel function of second kind using the transformation K v ( x ) = 1 2 G 0 , 2 2 , 0 ( x 2 4 | v 2 , v 2 ) (eq. (03.04.26.0009.01)) of [49], and K v ( x ) can further be expressed as π e x ( 2 x ) v Ψ ( v + 0.5 , 1 + 2 v ; 2 x ) (eq. (9.328)) of [48]. Realizing such representations in Z , we can get Z = 16 π ( η 1 ) t i 2 ρ 1 λ m e 2 ( η 1 ) t i 2 ρ 1 λ m e 2 ρ t i 2 ρ 1 λ p Ψ 1 2 , 1 ; 4 ρ t i 2 ρ 1 λ p × Ψ 3 2 , 3 ; 4 ( η 1 ) t i 2 ρ 1 λ m . From which, it can be clearly seen that the exponential terms in Z implies that (27) decreases rapidly as N increases, and only a few values of N are sufficient to obtain satisfactory accuracy, as also shown numerically in Section 5.

3.2.2. Asymptotic Analysis for SOP

We analyze the asymptotic SOP performance of the considered system under Strategy II for two separate scenarios, i.e., (1) when λ m and λ e is fixed and (2) when λ m and λ e , in what follows.
When λ m and fixed λ e
For λ m and fixed λ e , by neglecting the higher order infinitesimal terms in (26) and (27), and then invoking the resultant expressions on (25), the asymptotic SOP expression can be given as
P o u t , a s y s e c , I I ( η ) 1 2 η 1 ρ 1 λ m K 1 2 η 1 ρ 1 λ m + λ m η λ e G 3 , 3 2 , 3 λ m η λ e | 1 2 , 1 2 , 1 2 1 2 , 1 2 , 1 2 × 1 2 ρ ρ 1 λ p K 1 2 ρ ρ 1 λ p + 2 ρ ρ 1 λ p K 1 2 ρ ρ 1 λ p ( η 1 ) λ p ρ λ m × G 2 , 2 2 , 2 ( η 1 ) λ p ρ λ m | 1 2 , 1 2 1 2 , 1 2 2 ρ ρ 1 3 2 λ p ( η 1 ) λ m i = 1 N g i t i 2 G 0 , 2 2 , 0 ( η 1 ) t i 2 ρ 1 λ m | 1 2 , 1 2 × G 0 , 2 2 , 0 ρ t i 2 ρ 1 λ p | 0 , 0 + λ m η λ e λ p G 1 , 3 3 , 0 ρ ρ 1 λ p | k 1 , 0 , 0 k G 3 , 3 2 , 3 λ m η λ e | 1 2 , 1 2 , 1 2 1 2 , 1 2 , 1 2 .
Remark 8.
By following a similar approach used to evaluate (22), we can infer from (28) that the secrecy diversity order of 1 can also be achieved under Strategy II. Furthermore, Figure 4 shows that the secrecy diversity order convergence slows down because of the involvement of double-Rayleigh fading channels, for various values of λ e and ρ 1 .
When λ m and λ e
Using (24), the asymptotic SOP can be expressed as
P o u t , a s y s e c , I I ( η ) λ m , λ e Pr | h m | 2 | h e | 2 < η P r | h p | 2 ρ ρ 1 + P r | h p | 2 > ρ ρ 1 = 0 F | h m | 2 ( η y ) f | h e | 2 ( y ) d y .
Now, invoking the CDF of | h m | 2 and the PDF of | h e | 2 into (29), and simplifying it via (eq. (07.34.21.0011.01)) of [49], we can obtain the asymptotic SOP expression under the scenario when λ m and λ e as
P o u t , a s y s e c , I I ( η ) λ m , λ e 1 η λ e λ m G 2 , 2 2 , 2 η λ e λ m | 1 2 , 1 2 1 2 , 1 2 .
Remark 9.
According to (30), the asymptotic SOP in this scenario depends on the wiretap channel gain to the legitimated channel gain ratio, i.e., λ e λ m . Therefore, we can infer that the secrecy outage floor occurs, which yields into a zero secrecy diversity order.

3.2.3. Impact of Maximum Tolerable Interference Level I P and Maximum Secondary Transmitter Power Q

It can be observed in (25) that the SOP expression under Strategy II also depends on the maximum tolerable interference level I P and maximum secondary transmitter power Q. Therefore, in order to study the impact of I P and Q on the system’s secrecy diversity gain, two cases, i.e., Case 1: when ρ = μ ρ 1 and Case 2: when ρ μ ρ 1 , where ρ I P N 0 and ρ 1 Q N 0 are investigated in the following.
Case 1 ( ρ = μ ρ 1 )
When ρ is proportional to ρ 1 , i.e., ρ = μ ρ 1 , where μ is a positive constant. In the high SNR regime, i.e., ρ 1 , the SOP in (25) can be approximated by applying the fact K 1 ( x ) x 0 1 x (eq. (9.6.9)) of [54] and ignoring the higher order infinitesimal terms at high SNR, as
P o u t s e c , I I ( η ) ρ = μ ρ 1 , ρ 1 λ m η λ e G 3 , 3 2 , 3 λ m η λ e | 1 2 , 1 2 , 1 2 1 2 , 1 2 , 1 2 1 2 ρ λ p ρ 1 K 1 2 ρ λ p ρ 1 + 2 ρ λ p ρ 1 × K 1 2 ρ λ p ρ 1 f r a c λ m ρ η λ e λ p ρ 1 G 1 , 3 3 , 0 ρ ρ 1 λ p | 1 , 0 , 0 0 G 3 , 3 2 , 3 λ m η λ e | 1 2 , 1 2 , 1 2 1 2 , 1 2 , 1 2 .
Remark 10.
We can see from (31) that the SOP is independent of SNR ρ 1 with fixed ratio ρ ρ 1 , which implies that the secrecy diversity gain cannot be achieved in this case.
Case 2 ( ρ μ ρ 1 )
When ρ μ ρ 1 and ρ is a constant. At high SNR range, i.e., ρ 1 , we can approximate the SOP expression in (25) by using the fact K 1 ( x ) x 0 1 x (eq. (9.6.9)) of [54] and eliminating the higher order terms under high SNR ( ρ 1 ) regime, as
P o u t s e c , I I ( η ) ρ μ ρ 1 , ρ 1 1 ( η 1 ) λ p ρ λ m G 2 , 2 2 , 2 ( η 1 ) λ p ρ λ m | 1 2 , 1 2 1 2 , 1 2 .
Remark 11.
From (32), it is noted that the SOP only depends on a constant ρ, although ρ 1 . This implies that the secrecy diversity gain reduces to zero in this case as well.

4. ESC Analysis under Strategies I and II

4.1. Strategy I: Single-Power Constraint of the Interference on the PR

The instantaneous secrecy capacity for the considered secure CRVN under Strategy I can be given as
C s e c I = C m I C e I = log 2 ( 1 + Λ m I ) log 2 ( 1 + Λ e I ) .
By averaging the instantaneous secrecy capacity expression over the distributions of the end-to-end SNRs Λ m I and Λ e I under Strategy I, the ESC can be expressed as
C ¯ s e c I = E [ log 2 ( 1 + Λ m I ) log 2 ( 1 + Λ e I ) ] , = 1 ln ( 2 ) E log 1 + ρ | h m | 2 | h p | 2 log 1 + ρ | h e | 2 | h p | 2 ,
which can be evaluated as per the following theorem.
Theorem 4.
The exact ESC expression for the considered system under Strategy I over double-Rayleigh fading channels can be represented as
C ¯ s e c I = 1 ln ( 2 ) i = 1 U w i e t i [ t i ρ λ m G 2 , 4 4 , 1 t i ρ λ m | 0 , 0 , 1 , 1 1 , 0 t i 3 2 λ m + λ e ρ 3 2 λ m λ e S t i ρ ] 1 λ p G 0 , 2 2 , 0 t i λ p | 0 , 0 ,
where S ( a ) = G 2 , 2 : 0 , 2 : 0 , 2 2 , 1 : 2 , 0 : 2 , 0 3 2 , 3 2 3 2 , 1 2 | 0 , 0 | 1 2 , 1 2 | a λ m , a λ e . w i = t i ( ( U + 1 ) L U + 1 ( t i ) ) 2 and t i , ( i = 1 , , U ) are the weights and zeros of U order Gauss–Laguerre polynomial (i.e., L U ( t ) ) (eq. (25.5.45)) of [54].
Proof. 
See Appendix C for the proof. □
Remark 12.
It can be seen from (35) that the ESC expression consists of exponential, powers, and Meijer-G function, involving system parameters I p , η, Ω m , Ω e , and Ω p , and as such, it can be readily evaluated. In addition, the ESC expression in (35) consists of extended generalized bivariate Meijer-G function, which is not easily available in the Mathematica software computational package, but the work in [55] has proposed an efficient and accurate implementation in Mathematica. Moreover, from (35), we can see that the ESC expression consists of Gauss–Laguerre series expansion, which is convergent. We can achieve the accurate results by appropriately selecting the value of U (can be analytically proved as in Gauss–Lobatto’s polynomial in Remark 7), as also shown numerically in Section 5.
Remark 13.
Using (34) for | h m | 2 | h e | 2 , the ESC under strategy I can be expressed as
C ¯ s e c I = 1 ln ( 2 ) 0 f | h e | 2 ( | h e | 2 ) | h e | 2 ln 1 + ρ | h m | 2 | h p | 2 1 + ρ | h e | 2 | h p | 2 × f | h m | 2 ( | h m | 2 ) d | h m | 2 d | h e | 2 .
Substituting | h m | 2 = λ m x and | h e | 2 = λ e y into (36), and applying the scenario when the average power gains of both the main and wiretap channels go to infinity (i.e., λ m and λ e ), and after some involved mathematical simplifications, we can express (36) as
C ¯ s e c I 4 ln ( 2 ) 0 λ e λ m y ln λ m x λ e y K 0 ( 2 x ) K 0 ( 2 y ) d x d y .
Now, by using (eq. (6.561.8)) of [48] and the transformations z a π ( z + 1 ) ln ( z ) = G 3 , 3 2 , 2 z | a , a , a + 0.5 a , a , a + 0.5 (eq. (07.34.03.0919.01)) of [49] and K ν ( z ) = 1 2 G 0 , 2 2 , 0 ( z 4 | ν 2 , ν 2 ) , (eq. (03.04.26.0009.01)) of [49], into (37), and then simplifying it via (eq. (07.34.21.0011.01)) of [49] and (eq. (07.34.21.0081.01)) of [49], and after some algebraic simplifications, the ESC expression can be obtained, as shown in in (37), when λ m and λ e . We skipped the detailed analysis here for brevity. Moreover, it can be seen from (37) that the ESC improves with λ m and λ e ; however, an error floor can be seen in the ESC performance in the high λ m and λ e regime. This is because of the reason that the channel strengths of both main link and wiretap link are improved simultaneously. This behavior is also shown numerically in Section 5.
Remark 14.
We can further express (37) as
C ¯ s e c I 4 ln ( 2 ) [ 0 λ e λ m y ln x y K 0 ( 2 x ) K 0 ( 2 y ) d x d y + ln λ m λ e 0 λ e λ m y K 0 ( 2 x ) K 0 ( 2 y ) d x d y ] .
It can be seen from (38) that both the integrals are consistent and can easily be evaluated. Therefore, we can conclude that the asymptotic ESC follows the scaling law of Θ ln λ m λ e as λ m λ e increases and thus depends on the relative channel strengths of S T S R and S T E links, which is also demonstrated via numerical results in Section 5.

4.2. Strategy II: Combined Power Constraint of the Interference at the PR and Maximum Transmit Power at the ST

The ESC under Strategy II can be formulated as
C ¯ s e c I I = E log 2 1 + min ρ | h p | 2 , ρ 1 | h m | 2 log 2 1 + min ρ | h p | 2 , ρ 1 | h e | 2 = E log 2 1 + ρ | h m | 2 | h p | 2 log 2 1 + ρ | h e | 2 | h p | 2 | | h p | 2 > ρ ρ 1 C ¯ s e c , 1 I I + E log 2 1 + ρ 1 | h m | 2 log 2 1 + ρ 1 | h e | 2 | | h p | 2 ρ ρ 1 C ¯ s e c , 2 I I ,
which can be simplified as per the following theorem.
Theorem 5.
The exact expression of ESC under Strategy II over double-Rayleigh fading channels using (39) is given by
C ¯ s e c I I = C ¯ s e c , 1 I I + C ¯ s e c , 2 I I ,
where
C ¯ s e c , 1 I I = 1 ln ( 2 ) i = 1 U w i e t i λ p t i ρ λ m G 2 , 4 4 , 1 t i ρ λ m | 0 , 0 , 1 , 1 1 , 0 t i 3 2 λ m + λ e ρ 3 2 λ m λ e S t i ρ × G 0 , 2 2 , 0 t i λ p | 0 , 0 2 ln ( 2 ) [ k = 1 N g k ρ ρ 1 2 λ m λ p G 0 , 2 2 , 0 ρ r k 2 ρ 1 λ p | 0 , 0 G 2 , 4 4 , 1 r k 2 ρ 1 λ m | 0 , 0 , 1 , 1 1 , 0
λ m + λ e λ m λ e ρ ρ 1 5 2 k 1 = 1 M g k 1 λ p G 0 , 2 2 , 0 ρ r k 1 2 ρ 1 λ p | 0 , 0 S r k 1 2 ρ 1 ] , C ¯ s e c , 2 I I = 1 ln ( 2 ) 1 ρ 1 λ m G 2 , 4 4 , 1 1 ρ 1 λ m | 0 , 0 , 1 , 1 1 , 0 λ m + λ e ρ 1 3 2 λ m λ e S 1 ρ
× 1 2 ρ ρ 1 λ p K 1 2 ρ ρ 1 λ p ,
where w i = t i ( ( U + 1 ) L U + 1 ( t i ) ) 2 and t i , ( i = 1 , , U ) are the weights and zeros of U order Gauss–Laguerre polynomial (i.e., L U ( t ) ) [54], g k = j = 0 N 1 [ q j ( r k ) ] 2 1 and r k , ( k = 1 , , N ) are the weights and zeros of N order Gauss–Lobatto’s polynomial [54], respectively, q N ( r ) = 2 N + 4 P N ( 3 , 0 ) ( 1 2 r ) with P N ( 3 , 0 ) as Jacobi polynomial, and g k 1 = j 1 = 0 M 1 [ q j 1 ( r k 1 ) ] 2 1 and r k 1 , ( k 1 = 1 , , M ) are the weights and zeros of M order Gauss–Lobatto’s polynomial, respectively, q M ( r ) = 2 M + 5 P M ( 4 , 0 ) ( 1 2 r ) with P M ( 4 , 0 ) as Jacobi polynomial.
Proof. 
See Appendix D for the detailed proof. □
Remark 15.
It should be noted that (40) involves powers, exponential, Meijer-G functions, modified Bessel function of second kind, and extended generalized bivariate Meijer-G functions, consisting of network parameters I p , Q, η, Ω m , Ω e , and Ω p , which can be efficiently calculated via Mathematica software. We can achieve an arbitrary accurate approximation by appropriately selecting the values of U, N, and M.
Remark 16.
Using (39) for | h m | 2 | h e | 2 , the ESC under strategy II can be expressed as
C ¯ s e c I I = 1 ln ( 2 ) ρ ρ 1 [ 0 f | h e | 2 ( | h e | 2 ) | h e | 2 ln 1 + ρ | h m | 2 | h p | 2 1 + ρ | h e | 2 | h p | 2 × f | h m | 2 ( | h m | 2 ) d | h m | 2 d | h e | 2 ] f | h p | 2 ( | h p | 2 ) d | h p | 2 + 1 ln ( 2 ) ρ ρ 1 [ 0 f | h e | 2 ( | h e | 2 ) | h e | 2 ln 1 + ρ 1 | h m | 2 1 + ρ 1 | h e | 2 × f | h m | 2 ( | h m | 2 ) d | h m | 2 d | h e | 2 ] f | h p | 2 ( | h p | 2 ) d | h p | 2 .
Substituting | h m | 2 = λ m x and | h e | 2 = λ e y into (43), and under the scenario when λ m and λ e , and after some mathematical simplifications, we can express (43) as
C ¯ s e c I I 4 ln ( 2 ) 0 λ e λ m y ln λ m x λ e y K 0 ( 2 x ) K 0 ( 2 y ) d x d y × ρ ρ 1 f | h p | 2 ( | h p | 2 ) d | h p | 2 + 0 ρ ρ 1 f | h p | 2 ( | h p | 2 ) d | h p | 2 4 ln ( 2 ) 0 λ e λ m y ln λ m x λ e y K 0 ( 2 x ) K 0 ( 2 y ) d x d y .
Further, we can simplify (44) by using (eq. (6.561.8)) of [48], (eq. (07.34.03.0919.01)) of (eq. (03.04.26.0009.01)) of [49], (eq. (07.34.21.0011.01)) of [49], and (eq. (07.34.21.0081.01)) of [49], whose detailed analysis is skipped here for brevity. From (44), one can observe that the ESC performance increases with the increased in λ m and λ e but saturates in the high λ m and λ e regime because of the simultaneous improvement in the channel strengths of both the main link and the wiretap link, as shown numerically in Section 5.
Remark 17.
We can further express (44) as
C ¯ s e c I I 4 ln ( 2 ) [ 0 λ e λ m y ln x y K 0 ( 2 x ) K 0 ( 2 y ) d x d y + ln λ m λ e 0 λ e λ m y K 0 ( 2 x ) K 0 ( 2 y ) d x d y ] .
The integrals in (45) are consistent and can readily be simplified. Moreover, we can see from (45) that the asymptotic ESC follows the scaling law of Θ ln λ m λ e as λ m λ e increases, as shown numerically in Section 5.

5. Numerical Results and Discussion

In this section, we provide the numerical and simulation results to validate the effectiveness of our derived analytical findings under the consideration of Strategy I and Strategy II. To demonstrate, we plot various curves by varying the channel strengths ( Ω m , Ω e , and Ω p ) of ST SR , ST E , and ST PR links. Note that a path-loss channel modeling can also be adopted, where the average channel power gains of all channels can be denoted as Ω ı = d ı ν , for ı = { m , e , p } , where ν denotes the path-loss exponent, and d ı is the euclidean distance between the two nodes having the coordinates ( x ı , y ı ) and ( x ȷ , y ȷ ) , for ı = { m , e , p } , ȷ = { m , e , p } , and ı ȷ . Such modeling indicates that, Ω ı correspond to d ı 0 , which implies that the nodes are located close to each other, whereas Ω ı 0 correspond to d ı , which indicates that two nodes are located far away from each other. Furthermore, we consider the Gauss–Laguerre polynomial order U = 30 and Gauss–Lobatto’s polynomial order N = M = 50 , to obtain precise results.

5.1. SOP Performance under Strategies I and II

In Figure 5, we plot the SOP performance versus λ m and λ e for Strategy I. In Figure 5a, we show the SOP performance versus λ m for different values of λ e and R s , when ρ = 10 dB and λ p = 0 dB. We can observed from Figure 5a that the derived analytical results are in good agreement with the simulation results over the entire range of λ m . Further, we can see that the SOP performance improves as λ m increases, and an effective secrecy diversity order of 1 can be verified irrespective of λ e and R s , as also analytically demonstrated in Section 3-A. As expected, the SOP performance deteriorates with the improvement in wiretap channel strength λ e , regardless of λ m and R s . In Figure 5b, we demonstrate the SOP performance with average channel gains of both the main and wiretap links simultaneously varying (i.e., λ m = λ e dB) for various values of R s , when ρ = 10 dB and λ p = 0 dB. From which, it is observed that the SOP decreases as average channel gains ( λ m = λ e dB) increase, but saturates in the medium-to-high average channel gains regime, regardless of R s . This observation is also aligned with the derived asymptotic SOP results presented in (23), which depends on the fixed ratio λ e λ m . In addition, we can see that the SOP performance decreases with the improvement in R s , since more power is needed to achieve the higher value of R s .
Figure 6 illustrates the impact of PR on the SOP performance for various values of ρ , λ m , and λ e , when R s = 0.1 bps/Hz. We can see from this figure that the SOP performance deteriorates as λ p increases, irrespective of ρ , λ m , and λ e . This is because of the reason that the transmit power at ST decreases as λ p increases. Moreover, for fixed value of ρ , the SOP performance improves when the legitimate channel quality is better than the wiretap channel quality, i.e., λ m > λ e , and vice versa. In addition, the SOP performance improves as ρ increases, i.e., the performance is better for ρ = 20 compared to ρ = 10 dB. This is due to the fact that an increase in ρ allows ST to transmit at a higher power level without interfering with the PR.
In Figure 7, we demonstrate the impact of λ m , λ e , and λ p on the SOP performance under Strategy II. It can be observed from Figure 7 that the analytical results match perfectly with the simulation results, which corroborate the correctness of our derived theoretical findings. Figure 7a illustrates the SOP performance versus λ m for various values of λ e and R s , when ρ = ρ 1 = 15 dB and λ p = 0 dB. We can observe that the SOP performance enhances as λ m increases; however, it decreases with the improvement in λ e . Moreover, the effective secrecy diversity order of 1 can also be achieved for different set of involved parameters. As expected, the higher R s results into the SOP performance degradation. In Figure 7b, we show the impact of PR on the SOP performance under Strategy II for various values of λ m and λ e , when R s = 0.1 bps/Hz and ρ = ρ 1 = 20 dB. It can be seen that the SOP performance degrades as λ p increases, since power at ST reduces as λ p improves. In addition, the SOP performance significantly improves if λ m > λ e , for all values of λ p .
In Figure 8, we illustrate the impact of maximum tolerable interference level I P and maximum transmit power constraint Q on the SOP performance behavior under Strategy II. It can be observed from Figure 8a,b that the SOP performance deteriorates when λ e > λ m in the low ρ and ρ 1 regimes; however, it saturates as ρ and ρ 1 increase (i.e., in the medium-to-high ρ and ρ 1 regimes). The secrecy floor in Figure 8a occurs because the SOP is independent of maximum secondary transmitter power, ρ 1 Q N 0 , in the high ρ 1 , and only depends on fixed ρ , as also theoretically verified in (32). Furthermore, the secrecy floor is observed in Figure 8b due to the limited impact of ρ on the SOP in the high ρ regime, since the SOP depends on the fixed ratio ρ ρ 1 , as also analytically validated in (31). In other words, the secrecy floor occurs in the high ρ region since the SNR both the legitimated link and wiretap link is improved simultaneously. In addition, Figure 8a,b implies that the secrecy diversity order reduces to zero, which is perfectly aligned with the theoretical findings obtained in Section 3-B.

5.2. ESC Performance under Strategies I and II

Figure 9 illustrates the ESC curves for various values of λ m and λ e under Strategy I and Strategy II. We can observe that the analytical ESC results under Strategies I and II are in good agreement with the simulation results over the entire regime of λ m and λ e . We can observe from Figure 9a that the ESC performance increases as λ m increases under both the considered strategies. In addition, the ESC performance decreases significantly as the quality of wiretap link improves. Further, in Figure 9b, the ESC performance increases as λ m = λ e dB increases; however, the performance saturates in the high λ m = λ e dB regime, which is aligned with the theoretical findings obtained in Section 4. The reason behind this behavior is that the quality of wiretap channel increases in the same proportion as of legitimate channel, hence restricting further improvement in the ESC performance.
In Figure 10, we demonstrate the impact of primary user ( λ p ) , maximum tolerable interference level I P , and maximum transmit power constraint Q on the ESC performance of the considered system. Figure 10a shows the ESC performance versus ρ under Strategy I for various values of λ p , when λ m = 10 dB and λ p = 5 dB. The ESC performance increases as ρ increases; however, a secrecy floor is observed in the medium-to-high regime of ρ . This is because of the fact that an increase in ρ benefits both the legitimate destination and the eavesdropper. Moreover, the performance significantly deteriorates as λ p increases for all values of ρ . This degradation in ESC performance is because of the fact that the power at ST reduces as λ p increases. Moreover, in Figure 10b, we plot the curves for ESC versus ρ 1 under Strategy II for various values of ρ and λ p . We can observe from this figure that the ESC performance improves with ρ 1 when ρ ρ 1 and saturates when ρ < ρ 1 . In other words, the ESC is affected by the interaction of ρ and ρ 1 . When ρ is smaller than ρ 1 , the SOP is mainly affected by ρ , whereas when ρ 1 is smaller than ρ , then ρ 1 becomes the dominant factor. In addition, the secrecy floor behavior is also due to the fact that both the eavesdropper and the legitimate destination simultaneously extract the same benefits of increased transmit powers. Further, Figure 10b under Strategy II reveals that the ESC performance is better for lower values of λ p than that of the one with higher values of λ p .
Figure 11 illustrates the ESC versus λ m λ e for various ρ under Strategy I and for various ρ and ρ 1 under Strategy II, when λ p = 0 dB. It can be observed from Figure 11 that the ESC improves with increasing λ m λ e . This is owing to a higher λ m than λ e implying a superior channel quality of the legitimate channel when compared to the channel quality of the eavesdropper. This behavior is also depicted theoretically in (38) for Strategy I and in (45) for Strategy II. I addition, it is seen that there is a linear relationship between the ESC growth rate and λ m λ e at high λ m λ e .

6. Conclusions

This paper analyzed PHY-security in underlay CRVNs under spectrum-sharing constraints. Since all the nodes are in motion, the channels between the nodes are assumed to be modeled as double-Rayleigh fading. We assumed two different strategies to determine the transmit power of the secondary network. In Strategy I, the transmit power of the secondary transmitter is governed by the single-power constraint of the interference on the primary network, whereas in Strategy II, the transmit power of the secondary transmitter is governed by the combined power constraint of the interference on the primary network and the maximum transmission power at the secondary network. Under these two considered strategies, we deduced the exact SOP and ESC expressions for the considered system over double-Rayleigh fading channels. We also presented the asymptotic SOP analysis for the two considered strategies to reveal key insights into the system’s secrecy diversity order. It was demonstrated that the system can achieve a full secrecy diversity order of 1, when the average channel gain of main link goes to infinity with fixed average wiretap channel gain. Furthermore, from the ESC analysis, it is reveled that the ESC follows a scaling law of Θ ln Ω m 2 Ω e 2 , when Ω m and Ω e go to infinity. We also verified our analytical findings via simulation studies.

Author Contributions

Conceptualization, S.Y. and A.P.; methodology, S.Y., A.P., D.-T.D. and A.S.; software, S.Y. and A.P.; validation, S.Y. and A.P., D.-T.D., B.M.L. and A.S.; formal analysis, S.Y. and A.P.; investigation, S.Y., A.P. and A.S.; resources, A.S.; writing—original draft preparation, S.Y., A.P., D.-T.D., B.M.L. and A.S.; visualization, S.Y., A.P., D.-T.D., B.M.L. and A.S.; funding acquisition, A.S. All authors have read and agreed to the published version of the manuscript.

Funding

This work is funded by FCT/MCTES through national funds and when applicable co-funded EU funds under the project UIDB/50008/2020-UIDP/50008/2020.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

This study did not report any data.

Conflicts of Interest

The authors declare no conflict of interest.

Appendix A

Proof of Theorem 1

By invoking the CDF of | h e | 2 and the PDF of | h m | 2 into (12), we can express the integral I 1 as
I 1 = I 1 a I 1 b ,
where I 1 a = ( η 1 ) w ρ 2 λ m K 0 2 y λ m d y ,
I 1 b = 4 λ m λ e ( η 1 ) w ρ y η ( η 1 ) w η ρ K 0 2 y λ m K 1 2 λ e y η ( η 1 ) w η ρ d y .
We can simplify I 1 a in (A2) by first applying the relation α g ( x ) d x = 0 g ( x ) d x 0 α g ( x ) d x and then making use of the facts (eq. (6.561.16)) of [48] and (eq. (6.561.8)) of [48], as presented in (14). Moreover, I 1 b in (A3) can be evaluated by first applying the change of variables y η ( η 1 ) w η ρ = t and η t λ m = r and the transformation K ν ( z ) = 1 2 G 0 , 2 2 , 0 ( z 4 | ν 2 , ν 2 ) (eq. (03.04.26.0009.01)) of [49] and then simplifying via (eq. (07.34.21.0082.01)) of [49], as shown in (15). Consequently, invoking (A2) and (A3) into (A1), we can obtain the inner integral I 1 as presented in (13).

Appendix B

Proof of Theorem 3

We can simplify Θ 1 ( η ) in (24) as
Θ 1 = 1 η 1 ρ 1 F | h e | 2 y η η 1 η ρ 1 f | h m | 2 ( y ) d y F | h p | 2 ρ ρ 1 = [ 1 η 1 ρ 1 2 λ m K 0 2 y λ m d y + 4 λ m λ e η 1 ρ 1 y η η 1 η ρ 1 K 1 2 λ e y η η 1 η ρ 1 × K 0 2 y λ m d y ] 1 2 ρ ρ 1 λ p K 1 2 ρ ρ 1 λ p .
The first integral in (A4) can easily be simplified with the facts that α g ( x ) d x = 0 g ( x ) d x 0 α g ( x ) d x (eq. (6.561.16)) of [48] and (eq. (6.561.8)) of [48], whereas we can simplify the second integral in (A4) by first applying the transformations of variables y η η 1 η ρ 1 = t and η t λ m = r and then using (eq. (03.04.26.0009.01)) of [49] and (eq. (07.34.21.0082.01)) of [49]. Consequently, Θ 1 ( η ) can be given in (26).
Moreover, we can express Θ 2 ( η ) in (24) as
Θ 2 ( η ) = ρ ρ 1 f | h p | 2 ( y ) d y ρ ρ 1 { y ( η 1 ) ρ F | h e | 2 x η y ( η 1 ) η ρ × f | h m | 2 ( x ) d x } f | h p | 2 ( y ) d y ,
which can be further expressed after some simplifications as
Θ 2 ( η ) = 2 ρ ρ 1 λ p K 1 2 ρ ρ 1 λ p ρ ρ 1 { y ( η 1 ) ρ f | h m | 2 ( x ) × F | h e | 2 x η y ( η 1 ) η ρ d x } f | h p | 2 ( y ) d y .
The inner integral in (A6) can be evaluated by invoking the CDF of | h e | 2 and the PDF of | h m | 2 and following the same steps as used to simplify the integrals in (A4). Then, invoking the result along with the PDF of | h p | 2 into (A6), and after some simplifications, Θ 2 ( η ) can be expressed as
Θ 2 ( η ) = 2 ρ ρ 1 λ p K 1 2 ρ ρ 1 λ p 4 λ p η 1 ρ λ m ρ ρ 1 y K 0 2 y λ p K 1 2 ( η 1 ) y ρ λ m d y + 2 λ m λ p η λ e k = 0 ( 1 ) k k ! η 1 ρ λ m k G 3 , 3 2 , 3 λ m η λ e | 1 2 , 1 2 , k 1 2 1 2 , k 1 2 , k 1 2 ρ ρ 1 y k K 0 2 y λ p d y .
The first integral (say χ 1 ) in (A7) can be expressed by using the facts that α g ( x ) d x = 0 g ( x ) d x 0 α g ( x ) d x and (eq. (03.04.26.0009.01)) of [49] as
χ 1 = 1 4 0 y G 0 , 2 2 , 0 ( η 1 ) y ρ λ m | 1 2 , 1 2 G 0 , 2 2 , 0 y λ p | 0 , 0 d y 1 4 0 ρ ρ 1 y G 0 , 2 2 , 0 ( η 1 ) y ρ λ m | 1 2 , 1 2 G 0 , 2 2 , 0 y λ p | 0 , 0 d y ,
where the first integral in (A8) can readily be simplified using (eq. (07.34.21.0011.01)) of [49], and the second integral in (A8) can be evaluated by first applying the transformation of variables ρ 1 y ρ = t 2 and then applying Guass–Lobatto’s quadrature integration [54]. Consequently, χ 1 can be given by
χ 1 = λ p 3 2 4 G 2 , 2 2 , 2 ( η 1 ) λ p ρ λ m | 1 2 , 1 2 1 2 , 1 2 ρ 3 2 2 ρ 1 3 2 i = 1 N g i t i 2 × G 0 , 2 2 , 0 ( η 1 ) t i 2 ρ 1 λ m | 1 2 , 1 2 G 0 , 2 2 , 0 ρ t i 2 ρ 1 λ p | 0 , 0 .
Furthermore, we can simplify the second integral (say χ 2 ) of (A7) with the help of (eq. (03.04.26.0009.01)) of [49] and (eq. (07.34.21.0085.01)) of [49] as
χ 2 = ρ ρ 1 k + 1 G 1 , 3 3 , 0 ρ ρ 1 λ p | k 1 , 0 , 0 k .
Now, invoking (A9) and (A10) into (A7), and after some simplifications, we can express Θ 2 ( η ) as presented in (27).

Appendix C

Proof of Theorem 4

With the aid of [56], we can express the ESC in (34) as
C ¯ s e c I = 1 ln ( 2 ) 0 [ 0 y ρ ln ( 1 + x ) f | h m | 2 x y ρ F | h e | 2 x y ρ d x T 1 + 0 y ρ ln ( 1 + x ) f | h e | 2 x y ρ F | h m | 2 x y ρ d x T 2 0 y ρ ln ( 1 + x ) f | h e | 2 x y ρ d x T 3 ] f | h p | 2 ( y ) d y .
By invoking the PDF of | h m | 2 and the CDF of | h e | 2 into T 1 of (A11), and applying the transformations ln ( 1 + z ) = G 2 , 2 1 , 2 z | 1 , 0 1 , 1 (eq. (01.04.26.0003.01)) of [49] and K ν ( z ) = 1 2 G 0 , 2 2 , 0 ( z 4 | ν 2 , ν 2 ) (eq. (03.04.26.0009.01)) of [49], and then using (eq. (07.34.21.0011.01)) of [49] and (eq. (07.34.21.0081.01)) of [49], we can obtain T 1 as
T 1 = y ρ λ m G 2 , 4 4 , 1 y ρ λ m | 0 , 0 , 1 , 1 1 , 0 y 3 2 ρ 3 2 λ m λ e G 2 , 2 : 0 , 2 : 0 , 2 2 , 1 : 2 , 0 : 2 , 0 3 2 , 3 2 3 2 , 1 2 | 0 , 0 | 1 2 , 1 2 | y ρ λ m , y ρ λ e .
On the same line, we can evaluate the integrals T 2 and T 3 in (A11), respectively, as
T 2 = y ρ λ e G 2 , 4 4 , 1 y ρ λ e | 0 , 0 , 1 , 1 1 , 0 y 3 2 ρ 3 2 λ e λ m G 2 , 2 : 0 , 2 : 0 , 2 2 , 1 : 2 , 0 : 2 , 0 3 2 , 3 2 3 2 , 1 2 | 0 , 0 | 1 2 , 1 2 | y ρ λ m , y ρ λ e ,
T 3 = y ρ λ e G 2 , 4 4 , 1 y ρ λ e | 0 , 0 , 1 , 1 1 , 0 .
Now, invoking (A12), (A13), and (A14) alongwith the PDF of | h p | 2 into (A11), and applying the transformation K ν ( z ) = 1 2 G 0 , 2 2 , 0 ( z 4 | ν 2 , ν 2 ) (eq. (03.04.26.0009.01)) of [49], it is observed that the solution of the resultant integral is tedious and intractable. To make the analysis tractable, we first multiply and divide the resultant integral by e y , then simplifying it via Gauss–Laguerre numerical method [54]. Consequently, the ESC expression can be obtained, as shown in (35).

Appendix D

Proof of Theorem 5

The C ¯ s e c , 1 I I of (39) can be expressed in the integral form as
C ¯ s e c , 1 I I = 1 ln ( 2 ) ρ ρ 1 [ 0 y ρ ln ( 1 + x ) f | h m | 2 x y ρ F | h e | 2 x y ρ d x M 1 + 0 y ρ ln ( 1 + x ) f | h e | 2 x y ρ F | h m | 2 x y ρ d x M 2 0 y ρ ln ( 1 + x ) f | h e | 2 x y ρ d x M 3 ] f | h p | 2 ( y ) d y .
The integrals M 1 , M 2 , and M 3 of (A15) can be evaluated by following the similar process as used to simplify T 1 in (A12), T 2 in (A13), and T 3 in (A14), respectively. Then, invoking the results along with the PDF of | h p | 2 into (A15), and further using the facts that α g ( x ) d x = 0 g ( x ) d x 0 α g ( x ) d x and (eq. (03.04.26.0009.01)) of [49], and after some mathematical simplifications, we can express C ¯ s e c , 1 I I as
C ¯ s e c , 1 I I = 1 ln ( 2 ) 0 y ρ λ m G 2 , 4 4 , 1 y ρ λ m | 0 , 0 , 1 , 1 1 , 0 y 3 2 λ m + λ e ρ 3 2 λ m λ e S y ρ × 1 λ p G 0 , 2 2 , 0 y λ p | 0 , 0 d y 1 ln ( 2 ) 0 ρ ρ 1 1 λ p G 0 , 2 2 , 0 y λ p | 0 , 0 [ y ρ λ m G 2 , 4 4 , 1 y ρ λ m | 0 , 0 , 1 , 1 1 , 0 y 3 2 λ m + λ e ρ 3 2 λ m λ e S y ρ ] d y .
The first integral in (A16) can be simplified by first multiplying and dividing it by e y , and then applying the Guass–Laguarre quadrature method [54], whereas the second integral in (A16) can be evaluated by first using the transformation of variables ρ 1 y ρ = r 2 and then applying Guass–Lobatto’s integration method [54]. Consequently, the resultant expression of C ¯ s e c , 1 I I can be obtained, as presented in (41).
Furthermore, we can express C ¯ s e c , 2 I I of (39) as
C ¯ s e c , 2 I I = 1 ln ( 2 ) [ 0 1 ρ 1 ln ( 1 + x ) f | h m | 2 x ρ 1 F | h e | 2 x ρ 1 d x + 0 1 ρ 1 ln ( 1 + x ) f | h e | 2 x ρ 1 F | h m | 2 x ρ 1 d x 0 1 ρ 1 ln ( 1 + x ) f | h e | 2 x ρ 1 d x ] F | h p | 2 ρ ρ 1 .
By invoking the PDFs and CDFs of | h m | 2 and | h e | 2 and applying the transformations ln ( 1 + z ) = G 2 , 2 1 , 2 z | 1 , 0 1 , 1 (eq. (01.04.26.0003.01)) of [49] and K ν ( z ) = 1 2 G 0 , 2 2 , 0 ( z 4 | ν 2 , ν 2 ) (eq. (03.04.26.0009.01)) of [49], and then simplifying the integrals with the help of (eq. (07.34.21.0011.01)) of [49] and (eq. (07.34.21.0081.01)) of [49], we can obtain C ¯ s e c , 2 I I , as given in (42).

References

  1. Zhou, H.; Xu, W.; Chen, J.; Weng, W. Evolutionary V2X technologies toward the Internet of vehicles: Challenges and opportunities. Proc. IEEE. 2020, 108, 308–320. [Google Scholar] [CrossRef]
  2. Fallgren, M. 5GCAR: Executive Summary. 2019. Available online: https://5gcar.eu/wp-content/uploads/2019/12/5GCAR-Executive-Summary-White-Paper.pdf (accessed on 18 October 2021).
  3. Wong, V.W.; Schober, R.; Ng, D.W.K.; Wang, L.C. Key Technologies for 5G Wireless Systems; Cambridge University Press: Cambridge, UK, 2017. [Google Scholar]
  4. Kaiwartya, O.; Kumar, S. Enhanced caching for geocast routing in vehicular Ad Hoc network. In Intelligent Computing, Networking, and Informatics; Advances in Intelligent Systems and Computing; Springer: New Delhi, India, 2014; Volume 243, pp. 213–220. [Google Scholar]
  5. Mumtaz, S.; Huq, K.M.S.; Ashraf, M.I.; Rodriguez, J.; Monteiro, V.; Politis, C. Cognitive vehicular communication for 5G. IEEE Commun. Mag. 2015, 53, 109–117. [Google Scholar] [CrossRef]
  6. Eze, J.; Zhang, S.; Liu, E.; Eze, E. Cognitive radio-enabled Internet of Vehicles: A cooperative spectrum sensing and allocation for vehicular communication. IET Netw. 2018, 7, 190–199. [Google Scholar] [CrossRef] [Green Version]
  7. Di Felice, M.; Doost-Mohammady, R.; Chowdhury, K.R.; Bononi, L. Smart Radios for Smart Vehicles: Cognitive Vehicular Networks. IEEE Veh. Technol. Mag. 2012, 7, 26–33. [Google Scholar] [CrossRef]
  8. Zou, Y.; Zhu, J.; Yang, L.; Liang, Y.C.; Yao, Y.D. Securing physical-layer communications for cognitive radio networks. IEEE Commun. Mag. 2015, 53, 48–54. [Google Scholar] [CrossRef] [Green Version]
  9. Shu, Z.; Qian, Y.; Ci, S. On physical layer security for cognitive radio networks. IEEE Netw. 2013, 27, 28–33. [Google Scholar]
  10. Zou, Y.; Zhu, J.; Wang, X.; Hanzo, L. A survey on wireless security: Technical challenges, recent advances, and future trends. Proc. IEEE. 2016, 104, 1727–1765. [Google Scholar] [CrossRef] [Green Version]
  11. Li, S.; Yang, L.; Hasna, M.O.; Alouini, M.S.; Zhang, J. Amount of secrecy loss: A novel metric for physical layer security analysis. IEEE Commun. Lett. 2020, 24, 1626–1630. [Google Scholar] [CrossRef]
  12. Chen, X.; Ng, D.W.K.; Gerstacker, W.H.; Chen, H.H. A survey on multiple-antenna techniques for physical layer security. IEEE Commun. Surv. Tut. 2017, 19, 1027–1053. [Google Scholar] [CrossRef]
  13. Moualeu, J.M.; da Costa, D.B.; Lopez-Martinez, F.J.; Hamouda, W.; Nkouatchah, T.M.; Dias, U.S. Transmit antenna selection in secure MIMO systems over α-μ fading channels. IEEE Trans. Commun. 2019, 67, 6483–6498. [Google Scholar] [CrossRef]
  14. Park, J.; Yun, S.; Kim, I.; Ha, J. Secure communications with a full-duplex relay network under residual self-interference. IEEE Commun. Lett. 2020, 24, 496–500. [Google Scholar] [CrossRef]
  15. Le, K.N.; Bao, V.N.Q. Secrecy under Rayleigh-dual correlated Rician fading employing opportunistic relays and an adaptive encoder. IEEE Trans. Veh. Technol. 2020, 69, 5179–5192. [Google Scholar] [CrossRef]
  16. Yang, L.; Chen, J.; Jiang, H.; Vorobyov, S.A.; Zhang, H. Optimal relay selection for secure cooperative communications with an adaptive eavesdropper. IEEE Trans. Wirel. Commun. 2017, 16, 6–42. [Google Scholar] [CrossRef]
  17. Fan, L.; Lei, X.; Yang, N.; Duong, T.Q.; Karagiannidis, G.K. Secrecy cooperative networks with outdated relay selection over correlated fading channels. IEEE Trans. Veh. Technol. 2017, 66, 7599–7603. [Google Scholar] [CrossRef] [Green Version]
  18. Zhao, H.; Liu, Z.; Yang, L.; Alouini, M.S. Secrecy analysis in DF relay over Generalized-K fading channels. IEEE Trans. Commun. 2019, 67, 7168–7182. [Google Scholar] [CrossRef] [Green Version]
  19. Madeira, J.; Guerreiro, J.; Dinis, R.; Carvalho, P.; Campos, L. On the physical layer security characteristics for MIMO-SVD techniques for SC-FDE schemes. Sensors 2019, 19, 4757. [Google Scholar] [CrossRef] [Green Version]
  20. Madeira, J.; Guerreiro, J.; Serra, H.; Dinis, R.; Carvalho, P.; Campos, L. A physical layer security technique for NOMA systems with MIMO SC-FDE schemes. Electronics 2020, 9, 240. [Google Scholar] [CrossRef] [Green Version]
  21. Kumar, S.; Singh, K.; Kumar, S.; Kaiwartya, O.; Cao, Y.; Zhou, H. Delimitated anti jammer scheme for Internet of Vehicle: Machine learning based security approach. IEEE Access 2019, 7, 113311–113323. [Google Scholar] [CrossRef]
  22. Chakraborty, P.; Prakriya, S. Secrecy outage performance of a cooperative cognitive relay network. IEEE Commun. Lett. 2017, 21, 326–329. [Google Scholar] [CrossRef]
  23. Nguyen, M.N.; Nguyen, N.P.; Da Costa, D.B.; Nguyen, H.K.; De Sousa, R.T. Secure cooperative half-duplex cognitive radio networks with K-th best relay selection. IEEE Access. 2017, 5, 6678–6687. [Google Scholar] [CrossRef]
  24. Chopra, K.; Bose, R.; Joshi, A. Secrecy performance of threshold-based cognitive relay network with diversity combining. J. Commun. Netw. 2018, 20, 383–395. [Google Scholar] [CrossRef]
  25. Bouabdellah, M.; Bouanani, F.E.; Alouini, M.S. A PHY layer security analysis of uplink cooperative jamming-based underlay CRNs with multi-eavesdroppers. IEEE Trans. Cog. Commun. Netw. 2020, 6, 704–717. [Google Scholar] [CrossRef] [Green Version]
  26. Banerjee, A.; Maity, S.P. On residual energy maximization in cognitive relay networks with eavesdropping. IEEE Syst. J. 2019, 13, 3836–3846. [Google Scholar] [CrossRef]
  27. Zhang, T.; Cai, Y.; Huang, Y.; Duong, T.Q.; Yang, W. Secure transmission in cognitive MIMO relaying networks with outdated channel state information. IEEE Access 2016, 4, 8212–8224. [Google Scholar] [CrossRef] [Green Version]
  28. Zou, Y.; Li, X.; Liang, Y. Secrecy outage and diversity analysis of cognitive radio systems. IEEE J. Sel. Areas Commun. 2014, 32, 2222–2236. [Google Scholar] [CrossRef] [Green Version]
  29. Li, M.; Yin, H.; Huang, Y.; Fu, T.; Wang, Y.; Yu, R. Secrecy performance analysis in MISOSE cognitive radio networks over correlated fading. In Proceedings of the 2nd IEEE Advanced Information Management, Communicates, Electronic and Automation Control Conference (IMCEC 2018), Xi’an, China, 25–27 May 2018; pp. 875–879. [Google Scholar]
  30. Singh, A.; Bhatnagar, M.R.; Mallik, R.K. Physical layer security of a multiantenna-based CR network with single and multiple primary users. IEEE Trans. Veh. Technol. 2017, 66, 11011–11022. [Google Scholar] [CrossRef]
  31. Timilsina, S.; Baduge, G.A.A.; Schaefer, R.F. Secure communication in spectrum-sharing massive MIMO systems with active eavesdropping. IEEE Trans. Cog. Commun. Netw. 2018, 4, 390–405. [Google Scholar] [CrossRef]
  32. Lei, H.; Zhang, J.; Park, K.H.; Ansari, I.S.; Pan, G.; Alouini, M.S. Secrecy performance analysis of SIMO underlay cognitive radio systems with outdated CSI. IET Commun. 2017, 11, 1961–1969. [Google Scholar] [CrossRef]
  33. Andersen, J.B. Statistical distributions in mobile communications using multiple scattering. In Proceedings of the 27th URSI General Assembly, Maastricht, The Netherlands, 17–24 August 2002. [Google Scholar]
  34. Salo, J.; El-Sallabi, H.M.; Vainikainen, P. Statistical analysis of the multiple scattering radio channel. IEEE Trans. Antennas Propag. 2006, 54, 3114–3124. [Google Scholar] [CrossRef]
  35. Pandey, A.; Yadav, S. Physical layer security in cooperative AF relaying networks with direct links over mixed Rayleigh and double-Rayleigh fading channels. IEEE Trans. Veh. Technol. 2018, 67, 10615–10630. [Google Scholar] [CrossRef]
  36. Kovács, I.Z.; Eggers, P.C.; Olesen, K.; Petersen, L.G. Radio channel description and quality of service for TETRA direct mode operation in forest environments. In Proceedings of the IEEE 54th Vehicular Technology Conference, VTC Fall, Atlantic City, NJ, USA, 7–11 October 2001; pp. 1970–1974. [Google Scholar]
  37. Kovács, I.Z.; Eggers, P.C.; Olesen, K.; Petersen, L.G. Investigations of outdoor-to-indoor mobile-to-mobile radio communication channels. In Proceedings of the IEEE 56th Vehicular Technology Conference, Vancouver, BC, Canada, 24–28 September 2002; pp. 430–434. [Google Scholar]
  38. Zhang, J.; Pan, G. Secrecy outage analysis with Kth best relay selection in dual-hop inter-vehicle communication systems. AEU—Int. J. Electron. Commun. 2017, 71, 139–144. [Google Scholar] [CrossRef]
  39. Pandey, A.; Yadav, S. Secrecy analysis of cooperative vehicular relaying networks over double-Rayleigh fading Channels. Wirel. Pers. Commun. 2020, 114, 2733–2753. [Google Scholar] [CrossRef]
  40. Pandey, A.; Yadav, S. Physical layer security in cooperative amplify-and-forward relay networks over mixed Nakagami-M Double Nakagami-m Fading Channels: Perform. Eval. Optimisation. IET Commun. 2020, 14, 95–104. [Google Scholar] [CrossRef]
  41. Ahn, N.; Lee, D.; Oh, S. Vehicle Communication Using Secrecy Capacity. In Proceeding FTC; Arai, K., Bhatia, R., Kapoor, S., Eds.; Springer International Publishing: Cham, Switzerland, 2019; pp. 158–172. [Google Scholar]
  42. Duy, T.T.; Alexandropoulos, G.C.; Tung, V.T.; Son, V.N.; Duong, T.Q. Outage performance of cognitive cooperative networks with relay selection over double-Rayleigh fading channels. IET Commun. 2016, 10, 57–64. [Google Scholar] [CrossRef]
  43. Lee, J.; Lee, J.H.; Bahk, S. Performance analysis for multi-hop cognitive radio networks over cascaded Rayleigh fading channels with imperfect channel state information. IEEE Trans. Veh. Technol. 2019, 68, 10335–10339. [Google Scholar] [CrossRef]
  44. Ata, S.O.; Erdogan, E. Secrecy outage probability of inter-vehicular cognitive radio networks. Int. J. Commun. Sys. 2019, 33, e4244. [Google Scholar] [CrossRef]
  45. Tashman, D.H.; Hamouda, W. Physical-layer security for cognitive radio networks over cascaded Rayleigh fading channels. In Proceedings of the IEEE Global Communications Conference (GLOBECOM 2020), Taipei, Taiwan, 7–11 December 2020; pp. 1–6. [Google Scholar]
  46. Yadav, S.; Pandey, A. Secrecy performance of cognitive vehicular radio networks: Joint impact of nodes mobility and imperfect channel estimates. In Proceedings of the IEEE International Black Sea Conference on Communications and Networking (BlackSeaCom), Odessa, Ukraine, 26–29 May 2020; pp. 1–7. [Google Scholar]
  47. Pandey, A.; Yadav, S. Joint impact of nodes mobility and imperfect channel estimates on the secrecy performance of cognitive radio vehicular networks over Nakagami-M Fading Channels. IEEE Open J. Veh. Technol. 2021, 2, 289–309. [Google Scholar] [CrossRef]
  48. Gradshteyn, I.S.; Ryzhik, I.M. Tables of Integrals, Series, and Products, 6th ed.; Academic Press: New York, NY, USA, 2000. [Google Scholar]
  49. The Wolfram Functions Site [Online]. Available online: Http://functions.wolfram.com (accessed on 18 October 2021).
  50. Patel, C.S.; Stuber, G.L.; Pratt, T.G. Simulation of Rayleigh-faded mobile-to-mobile communication channels. IEEE Trans. Commun. 2005, 53, 1876–1884. [Google Scholar] [CrossRef]
  51. Patzold, M.; Hogstad, B.O.; Youssef, N. Modeling, analysis, and simulation of MIMO mobile-to-mobile fading channels. IEEE Trans. Wirel. Commun. 2008, 7, 510–520. [Google Scholar] [CrossRef]
  52. Ghasemi, A.; Sousa, E.S. Fundamental limits of spectrum-sharing in fading environments. IEEE Trans. Wirel. Commun. 2007, 6, 649–658. [Google Scholar] [CrossRef]
  53. Duong, T.Q.; da Costa, D.B.; Elkashlan, M.; Bao, V.N.Q. Cognitive amplify-and-forward relay networks over Nakagami-m fading. IEEE Trans. Veh. Technol. 2012, 61, 2368–2374. [Google Scholar] [CrossRef]
  54. Abramowitz, M.; Stegun, I.A. Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables; National Bureau of Standards: Washington, DC, USA, 1972. [Google Scholar]
  55. Ansari, I.S.; Al-Ahmadi, S.; Yilmaz, F.; Alouini, M.S.; Yanikomeroglu, H. A new formula for the BER of binary modulations with dual-branch selection over generalized-K composite fading channels. IEEE Trans. Commun. 2011, 59, 2654–2658. [Google Scholar] [CrossRef] [Green Version]
  56. Lei, H.; Zhang, H.; Ansari, I.S.; Gao, C.; Guo, Y.; Pan, G.; Qaraqe, K.A. Performance analysis of physical layer security over generalized-K fading channels using a mixture Gamma distribution. IEEE Commun. Lett. 2016, 20, 408–411. [Google Scholar]
Figure 1. System model for the considered secure underlay CRVNs.
Figure 1. System model for the considered secure underlay CRVNs.
Sensors 21 07160 g001
Figure 2. Overall representation of the considered CRVN framework.
Figure 2. Overall representation of the considered CRVN framework.
Sensors 21 07160 g002
Figure 3. Secrecy diversity order behavior of the considered system under Strategy I for λ m and fixed λ e .
Figure 3. Secrecy diversity order behavior of the considered system under Strategy I for λ m and fixed λ e .
Sensors 21 07160 g003
Figure 4. System’s secrecy diversity order behavior under Strategy II for λ m and fixed λ e .
Figure 4. System’s secrecy diversity order behavior under Strategy II for λ m and fixed λ e .
Sensors 21 07160 g004
Figure 5. SOP performance for the considered system under Strategy I.
Figure 5. SOP performance for the considered system under Strategy I.
Sensors 21 07160 g005
Figure 6. Impact of PR on the SOP performance under Strategy I.
Figure 6. Impact of PR on the SOP performance under Strategy I.
Sensors 21 07160 g006
Figure 7. SOP performance for the considered system under Strategy II, (a) SOP versus λ m , and (b) SOP versus λ p .
Figure 7. SOP performance for the considered system under Strategy II, (a) SOP versus λ m , and (b) SOP versus λ p .
Sensors 21 07160 g007
Figure 8. Impact of maximum tolerable interference level ( ρ = I P / N 0 ) and maximum transmit power constraint ( ρ 1 = Q / N 0 ) on the SOP performance under Strategy II.
Figure 8. Impact of maximum tolerable interference level ( ρ = I P / N 0 ) and maximum transmit power constraint ( ρ 1 = Q / N 0 ) on the SOP performance under Strategy II.
Sensors 21 07160 g008
Figure 9. ESC performance for the considered system under Strategy I and Strategy II.
Figure 9. ESC performance for the considered system under Strategy I and Strategy II.
Sensors 21 07160 g009
Figure 10. Impact of maximum tolerable interference level ( ρ = I P / N 0 ) and maximum transmit power constraint ( ρ 1 = Q / N 0 ) on the ESC performance.
Figure 10. Impact of maximum tolerable interference level ( ρ = I P / N 0 ) and maximum transmit power constraint ( ρ 1 = Q / N 0 ) on the ESC performance.
Sensors 21 07160 g010
Figure 11. ESC performance versus λ m λ e under Strategy I and Strategy II.
Figure 11. ESC performance versus λ m λ e under Strategy I and Strategy II.
Sensors 21 07160 g011
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Yadav, S.; Pandey, A.; Do, D.-T.; Lee, B.M.; Silva, A. Secure Cognitive Radio-Enabled Vehicular Communications under Spectrum-Sharing Constraints. Sensors 2021, 21, 7160. https://doi.org/10.3390/s21217160

AMA Style

Yadav S, Pandey A, Do D-T, Lee BM, Silva A. Secure Cognitive Radio-Enabled Vehicular Communications under Spectrum-Sharing Constraints. Sensors. 2021; 21(21):7160. https://doi.org/10.3390/s21217160

Chicago/Turabian Style

Yadav, Suneel, Anshul Pandey, Dinh-Thuan Do, Byung Moo Lee, and Adão Silva. 2021. "Secure Cognitive Radio-Enabled Vehicular Communications under Spectrum-Sharing Constraints" Sensors 21, no. 21: 7160. https://doi.org/10.3390/s21217160

APA Style

Yadav, S., Pandey, A., Do, D. -T., Lee, B. M., & Silva, A. (2021). Secure Cognitive Radio-Enabled Vehicular Communications under Spectrum-Sharing Constraints. Sensors, 21(21), 7160. https://doi.org/10.3390/s21217160

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop