Secure Cognitive Radio-Enabled Vehicular Communications under Spectrum-Sharing Constraints
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...
Guardado en:
| Autores principales: | , , , , |
|---|---|
| Formato: | article |
| Lenguaje: | EN |
| Publicado: |
MDPI AG
2021
|
| Materias: | |
| Acceso en línea: | https://doaj.org/article/0b6000ba4d5647279b7a1d39f1747114 |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| Sumario: | 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 <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mo>Θ</mo><mfenced separators="" open="(" close=")"><mo form="prefix">ln</mo><mfenced open="(" close=")"><mfrac><msubsup><mo>Ω</mo><mrow><mi>m</mi></mrow><mn>2</mn></msubsup><msubsup><mo>Ω</mo><mrow><mi>e</mi></mrow><mn>2</mn></msubsup></mfrac></mfenced></mfenced></mrow></semantics></math></inline-formula> for large <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><msub><mo>Ω</mo><mi>m</mi></msub></semantics></math></inline-formula> and <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><msub><mo>Ω</mo><mi>e</mi></msub></semantics></math></inline-formula>, where <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><msub><mo>Ω</mo><mi>m</mi></msub></semantics></math></inline-formula> and <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><msub><mo>Ω</mo><mi>e</mi></msub></semantics></math></inline-formula> are the average channel gains of the main link and wiretap link. The numerical and simulation results verify our analytical findings. |
|---|