Enhancement of Secrecy Multicast Capacity over k - µ Shadowed Fading Channel

Abstract

This paper illustrates a secure multicast scenario over k- µ shadowed fading channel in the appearance of multiple eavesdroppers. In order to achieve perfect secrecy, it must be ensured that no eavesdropper can decipher any transmitted information from the multicast channels. The secrecy analysis incorporates deriving mathematical expressions for two secrecy matrices such as the ergodic secrecy multicast capacity and the secure outage probability for multicasting. It is observed that proposed k - µ shadowed model unifies secrecy analysis of some well-known classical fading models and the derived expressions can help to quantify the significant impact of shadowing as-well-as other system parameters on secrecy performance. Finally, a close match between the analytical and Monte-Carlo simulation results is shown which validates the correctness of the derived expressions.