Abstract

In this paper, we consider the transmission of confidential information over a $\kappa $ – $\mu $ fading channel in the presence of an eavesdropper who also experiences $\kappa $ – $\mu $ fading. In particular, we obtain novel analytical solutions for the probability of strictly positive secrecy capacity (SPSC) and a lower bound of secure outage probability (SOP $^{L}$ ) for independent and non-identically distributed channel coefficients without parameter constraints. We also provide a closed-form expression for the probability of SPSC when the $\mu $ parameter is assumed to take positive integer values. Monte-Carlo simulations are performed to verify the derived results. The versatility of the $\kappa $ – $\mu $ fading model means that the results presented in this paper can be used to determine the probability of SPSC and SOP $^{L}$ for a large number of other fading scenarios, such as Rayleigh, Rice (Nakagami- $n$ ), Nakagami- $m$ , One-Sided Gaussian, and mixtures of these common fading models. In addition, due to the duality of the analysis of secrecy capacity and co-channel interference (CCI), the results presented here will have immediate applicability in the analysis of outage probability in wireless systems affected by CCI and background noise (BN). To demonstrate the efficacy of the novel formulations proposed here, we use the derived equations to provide a useful insight into the probability of SPSC and SOP $^{L}$ for a range of emerging wireless applications, such as cellular device-to-device, peer-to-peer, vehicle-to-vehicle, and body centric communications using data obtained from real channel measurements.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.