<?xml version="1.0" encoding="UTF-8"?><!DOCTYPE article  PUBLIC "-//NLM//DTD Journal Publishing DTD v3.0 20080202//EN" "http://dtd.nlm.nih.gov/publishing/3.0/journalpublishing3.dtd"><article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" dtd-version="3.0" xml:lang="en" article-type="research article"><front><journal-meta><journal-id journal-id-type="publisher-id">JCC</journal-id><journal-title-group><journal-title>Journal of Computer and Communications</journal-title></journal-title-group><issn pub-type="epub">2327-5219</issn><publisher><publisher-name>Scientific Research Publishing</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.4236/jcc.2022.1011009</article-id><article-id pub-id-type="publisher-id">JCC-121592</article-id><article-categories><subj-group subj-group-type="heading"><subject>Articles</subject></subj-group><subj-group subj-group-type="Discipline-v2"><subject>Computer Science&amp;Communications</subject></subj-group></article-categories><title-group><article-title>
 
 
  Enhancement of Multicast Security with Opportunistic Relaying Technique over &lt;i&gt;κ&lt;/i&gt;-&lt;i&gt;μ&lt;/i&gt; Shadowed Fading Channels
 
</article-title></title-group><contrib-group><contrib contrib-type="author" xlink:type="simple"><name name-style="western"><surname>Ashik</surname><given-names>Alam</given-names></name><xref ref-type="aff" rid="aff1"><sup>1</sup></xref><xref ref-type="corresp" rid="cor1"><sup>*</sup></xref></contrib><contrib contrib-type="author" xlink:type="simple"><name name-style="western"><surname>Md.</surname><given-names>Zahurul Islam Sarkar</given-names></name><xref ref-type="aff" rid="aff1"><sup>1</sup></xref></contrib></contrib-group><aff id="aff1"><addr-line>Department of Electrical and Electronic Engineering, Rajshahi University of Engineering and Technology, Rajshahi, Bangladesh</addr-line></aff><pub-date pub-type="epub"><day>31</day><month>10</month><year>2022</year></pub-date><volume>10</volume><issue>11</issue><fpage>121</fpage><lpage>137</lpage><history><date date-type="received"><day>15,</day>	<month>October</month>	<year>2022</year></date><date date-type="rev-recd"><day>27,</day>	<month>November</month>	<year>2022</year>	</date><date date-type="accepted"><day>30,</day>	<month>November</month>	<year>2022</year></date></history><permissions><copyright-statement>&#169; Copyright  2014 by authors and Scientific Research Publishing Inc. </copyright-statement><copyright-year>2014</copyright-year><license><license-p>This work is licensed under the Creative Commons Attribution-NonCommercial International License (CC BY-NC).http://creativecommons.org/licenses/by-nc/4.0/</license-p></license></permissions><abstract><p>
 
 
  The effects of scatterers, fluctuation parameter and propagation clusters significantly affect the performance of 
  κ-
  μ shadowed fading channel. On the other hand, opportunistic relaying is an efficient technique to improve the performance of fading channels reducing the effects of aforementioned parameters. Motivated by these issues, in this paper, a secure wireless multicasting scenario through 
  κ-
  μ shadowed fading channel is considered in the presence of multiple eavesdroppers with opportunistic relaying. The main purpose of this paper is to ensure the security level in wireless multicasting compensating the loss of security due to the effects of power ratio between dominant and scattered waves, fluctuation parameter, and the number of propagation clusters, multicast users and eavesdroppers, by opportunistic relaying technique. The closed-form analytical expressions are derived for the probability of non-zero secrecy multicast capacity (PNSMC) and the secure outage probability for multicasting (SOPM) to understand the insight of the effects of above parameters. The results show that the loss of security in multicasting through 
  κ-
  μ shadowed fading channel can be significantly enhanced using opportunistic relaying technique by compensating the effects of scatterers, fluctuation parameter, and the number of propagation clusters, multicast users and eavesdroppers.
 
</p></abstract><kwd-group><kwd>Opportunistic Relaying</kwd><kwd> Probability of Non-Zero Secrecy Multicast Capacity (PNSMC)</kwd><kwd> Secure Wireless Multicasting</kwd><kwd> Secure Outage Probability for Multicasting (SOPM)</kwd><kwd> &lt;i&gt;κ&lt;/i&gt;-&lt;i&gt;μ&lt;/i&gt; Shadowed Fading Channel</kwd></kwd-group></article-meta></front><body><sec id="s1"><title>1. Introduction</title><p>The statistical characterization of fading is an important issue in wireless communication system. The most promising method, for improving wireless links by reducing the impacts of fading, scatterers, fluctuations, etc., is cooperative diversity with the best relay selection [<xref ref-type="bibr" rid="scirp.121592-ref1">1</xref>] [<xref ref-type="bibr" rid="scirp.121592-ref2">2</xref>] [<xref ref-type="bibr" rid="scirp.121592-ref3">3</xref>] [<xref ref-type="bibr" rid="scirp.121592-ref4">4</xref>]. On the other hand, multicasting is an effective means of group-oriented wireless data transmission such as video-conference, distance education [<xref ref-type="bibr" rid="scirp.121592-ref5">5</xref>], etc. The open nature of wireless network makes them vulnerable to fraud and eavesdropping. The conventional cryptographic schemes are not able to provide a secure framework for multicasting. Therefore, a key strategy for achieving information-theoretic security in multicasting is the physical layer security.</p><sec id="s1_1"><title>1.1. Related Works</title><p>Recently, zero-forcing (ZF) multiplexing system was used in [<xref ref-type="bibr" rid="scirp.121592-ref6">6</xref>] [<xref ref-type="bibr" rid="scirp.121592-ref7">7</xref>] to increase the spectral efficiency with the help of linear equalization. The secrecy performance of wireless physical layer security was analyzed in [<xref ref-type="bibr" rid="scirp.121592-ref8">8</xref>] over α-κ-μ and α-η-μ fading channels. The physical layer security was studied in [<xref ref-type="bibr" rid="scirp.121592-ref9">9</xref>] over κ-μ/Gamma composite fading channels. In [<xref ref-type="bibr" rid="scirp.121592-ref10">10</xref>], author focused on the performance comparison of multicasting over Rician-K and Rayleigh fading channels. In [<xref ref-type="bibr" rid="scirp.121592-ref11">11</xref>] [<xref ref-type="bibr" rid="scirp.121592-ref12">12</xref>], authors investigated the secrecy performance over the cascaded α-μ fading channels. In the above papers, they did not consider the effects of shadowing.</p><p>Wyner’s wiretap model was used in [<xref ref-type="bibr" rid="scirp.121592-ref13">13</xref>] [<xref ref-type="bibr" rid="scirp.121592-ref14">14</xref>] to investigate the secrecy performance over κ-μ shadowed fading channels. In [<xref ref-type="bibr" rid="scirp.121592-ref15">15</xref>], author studied the performance of receiver by different types of diversity combining techniques. Authors analyzed the secrecy capacity in [<xref ref-type="bibr" rid="scirp.121592-ref16">16</xref>] considering the effects of interferences. The security in κ-μ shadowed fading channels was analyzed in [<xref ref-type="bibr" rid="scirp.121592-ref17">17</xref>] with the ergodic secrecy capacity. In [<xref ref-type="bibr" rid="scirp.121592-ref18">18</xref>], author showed the effects of scattering over multiple-input multiple-output (MIMO) system. In [<xref ref-type="bibr" rid="scirp.121592-ref19">19</xref>], author investigated the effects of shadowing on the performance of multicasting over κ-μ shadowed fading channels. In [<xref ref-type="bibr" rid="scirp.121592-ref20">20</xref>], authors investigated the effects of correlation and shadowing on the performance of multicasting. But the authors of the above papers did not consider the opportunistic relaying technique enhancing security for multicasting.</p></sec><sec id="s1_2"><title>1.2. Contributions</title><p>Based on the aforementioned scenario available in the literature and motivated by the importance of security in multicasting, the authors in this work investigated a secure wireless multicasting scenario using κ-μ shadowed fading channels when multiple eavesdroppers are present. Authors developed a mathematical model to ensure that security in κ-μ shadowed fading channels with opportunistic relaying system. We can summarize the major contributions of this paper below.</p><p>● At first, based on the probability density function (PDF) of κ-μ shadowed fading channels [<xref ref-type="bibr" rid="scirp.121592-ref15">15</xref>], authors derived closed-form analytical expressions for the PNSMC and the SOPM.</p><p>● Then, the effects of power ratio between dominant and scattered waves, fluctuation parameter, and the number of propagation clusters, multicast users, eavesdroppers and relays on the PNSMC and the SOPM are investigated.</p><p>● Finally, the derived analytical expressions are justified via Monte-Carlo simulation.</p><p>The remaining part of this paper has been arranged as follows. Section II explains the system model and section III narrates the problem formulation. The equations for the PNSMC and the SOPM have been derived respectively in Section IV and V. Section VI describes the numerical results. In the end, the conclusions of this paper are represented in Section VII.</p></sec></sec><sec id="s2"><title>2. System Model</title><p>A secure wireless multicasting communication scenario shown in <xref ref-type="fig" rid="fig1">Figure 1</xref> is considered through κ-μ Shadowed fading channels in the presence of multiple eavesdroppers. This figure consists of one transmitter, a group of R relays, M number of destination receivers and N number of eavesdroppers. The transmitter sends a common stream of confidential information to the M destination receivers via R relays. The eavesdroppers are trying to decode that confidential information. The objective of this research is to establish a secure communication between transmitter and destination receivers by preventing this eavesdropping. The channel between transmitter and destination receiver is known as multicast channel and the channel between transmitter and eavesdropper is known as eavesdropper’s channel. We consider all the multicast channels and eavesdropper’s</p><p>channels experience independent κ-μ shadowed fading. κ and μ denote two physical fading parameters of this system. κreflects a real positive number representing the power ratio between dominant and scattered-wave components and μ reflects a positive real number representing the effective number of propagation clusters.</p></sec><sec id="s3"><title>3. Problem Formulation</title><p>This section deals with the derivation of the closed-form analytical expressions for the PDFs of multicast channels and eavesdropper’s channels.</p><sec id="s3_1"><title>3.1. The PDF of κ-μ Shadowed Fading Channels</title><p>Let γ denotes the SNR of each sub-channel of multicast channel. Then, the PDF of γ denoted by f γ ( γ ) for the κ-μ shadowed fading channels is given by [<xref ref-type="bibr" rid="scirp.121592-ref15">15</xref>] [<xref ref-type="bibr" rid="scirp.121592-ref17">17</xref>],</p><p>f γ ( γ ) = μ μ m m ( 1 + k ) μ Γ ( μ ) ( m + μ k ) m γ &#175; ( γ γ &#175; ) μ − 1 e − μ ( 1 + k ) γ γ &#175; F 1 1 ( m , μ ; μ 2 k ( 1 + k ) μ k + m γ γ &#175; ) , (1)</p><p>where F 1 1 ( .,. ; . ) is the confluent hypergeometric function which is defined as</p><p>F 1 1 ( p , q ; r ) = Γ ( q + 1 ) Γ ( p + 1 ) ∑ n = 0 ∞ Γ ( p + n ) Γ ( q + n ) r n n ! . Substituting this formula in Equation (1), f γ ( γ ) can be found as</p><p>f γ ( γ ) = ∑ n = 0 ∞     A 1 A 4 γ n + μ − 1 e − A 2 γ , (2)</p><p>where A 1 = μ μ m m ( 1 + k ) μ Γ ( μ ) ( m + μ k ) m γ &#175; μ , A 2 = μ ( 1 + k ) γ &#175; , A 3 = μ 2 k ( 1 + k ) ( μ k + m ) γ &#175; and A 4 = Γ ( μ + 1 ) Γ ( m + 1 ) ∑ n = 0 ∞ Γ ( m + n ) Γ ( μ + n ) A 3 n n ! .</p></sec><sec id="s3_2"><title>3.2. The PDF of SNR of Source-to-kth Relay</title><p>Let γ s , k denotes the SNR of source-to-kth relay. Then, the PDF of γ s , k denoted by f γ s , k ( γ s , k ) for the κ-μ shadowed fading channels is given by,</p><p>f γ s , k ( γ s , k ) = ∑ n = 0 ∞     s 1 s 4 γ s , k n + μ − 1 e − s 2 γ s , k , (3)</p><p>where s 1 = μ μ m m ( 1 + k ) μ Γ ( μ ) ( m + μ k ) m γ &#175; s μ , s 2 = μ ( 1 + k ) γ &#175; s , s 3 = μ 2 k ( 1 + k ) ( μ k + m ) γ &#175; s and s 4 = Γ ( μ + 1 ) Γ ( m + 1 ) ∑ n = 0 ∞ Γ ( m + n ) Γ ( μ + n ) s 3 n n ! .</p></sec><sec id="s3_3"><title>3.3. The PDF of the SNR of kth Relay-to-ith Destination Receiver</title><p>Let γ k , i denotes the SNR of kth relay-to-ith destination receiver. Then, the PDF of the SNR of γ k , i denoted by f γ k , i ( γ k , i ) for the κ-μ shadowed fading channel is given by,</p><p>f γ k , i ( γ k , i ) = ∑ n = 0 ∞     a 1 a 4 γ k , i n + μ − 1 e − a 2 γ k , i , (4)</p><p>where a 1 = μ μ m m ( 1 + k ) μ Γ ( μ ) ( m + μ k ) m γ &#175; a μ , a 2 = μ ( 1 + k ) γ &#175; a , a 3 = μ 2 k ( 1 + k ) ( μ k + m ) γ &#175; a and a 4 = Γ ( μ + 1 ) Γ ( m + 1 ) ∑ n = 0 ∞ Γ ( m + n ) Γ ( μ + n ) a 3 n n ! .</p></sec><sec id="s3_4"><title>3.4. The PDF of SNR of kth Relay-to-jth Eavesdropper</title><p>Let γ k , j denotes the SNR of kth relay-to-jth eavesdropper. Then, the PDF of the SNR of γ k , j denoted by f γ k , j ( γ k , j ) for κ-μ shadowed fading channels is given by,</p><p>f γ k , j ( γ k , j ) = ∑ n = 0 ∞     b 1 b 4 γ k , j n + μ − 1 e − b 2 γ k , j , (5)</p><p>where b 1 = μ μ m m ( 1 + k ) μ Γ ( μ ) ( m + μ k ) m γ &#175; b μ , b 2 = μ ( 1 + k ) γ &#175; b , b 3 = μ 2 k ( 1 + k ) ( μ k + m ) γ &#175; b and b 4 = Γ ( μ + 1 ) Γ ( m + 1 ) ∑ n = 0 ∞ Γ ( m + n ) Γ ( μ + n ) b 3 n n ! .</p></sec><sec id="s3_5"><title>3.5. The CDF of SNR of Best Relay for Source-to-ith Destination Link</title><p>Let γ i denotes the SNR of best relay for source-to-destination link. Then, the</p><p>CDF of γ i denoted by F γ ∑ d i ( γ i ) for the κ-μ shadowed fading channels is given by,</p><p>F γ ∑ d i ( γ i ) = { F γ e q k ( γ i ) } R = { 1 − P r ( γ s , k &gt; γ i ) P r ( γ k , i &gt; γ i ) } R , (6)</p><p>where P r ( γ s , k &gt; γ i ) ≜ ∫ γ i ∞     f γ s , k ( γ s , k ) d γ s , k and P r ( γ k , i &gt; γ i ) ≜ ∫ γ i ∞     f γ k , i ( γ k , i ) d γ k , i . Substituting the values of f γ s , k ( γ s , k ) and f γ k , i ( γ k , i ) , and using the following identity of [<xref ref-type="bibr" rid="scirp.121592-ref21">21</xref>],</p><p>∫ u ∞     x n e − μ x d x = e − μ u ∑ k = 0 n ( n ! u k k ! μ n − k + 1 ) (7)</p><p>the value of P r ( γ s , k &gt; γ i ) and P r ( γ k , i &gt; γ i ) can be calculated in closed-form. Then, substituting the values of P r ( γ s , k &gt; γ i ) and P r ( γ k , i &gt; γ i ) in Equation (6) and using the following identities of [<xref ref-type="bibr" rid="scirp.121592-ref21">21</xref>],</p><p>{ ∑ k = 0 ∞ ( a k x k ) } n = ∑ k = 0 ∞ ( c k x k ) (8)</p><p>( a + x ) n = ∑ i = 0 n ( n i ) x i a n − i , (9)</p><p>where c m = 1 m a 0 ∑ k = 1 m ( k n − m + k ) a k c m − k for m ≥ 1 and c 0 = a 0 n for m = 0 and n is an integer number, the closed-form expression for the F γ ∑ d i ( γ i ) can be derived as</p><p>F γ ∑ d i ( γ i ) = ∑ k 1 = 0 ∞     ∑ k 2 = 0 R     ω 4 γ i 2 k 1 e − ω 5 k 2 γ i , (10)</p><p>where ω 4 = ∑ k 2 = 0 R R ! ( − 1 ) k 2 R ! ( R − k 2 ) ! [ ∑ n = 0 ∞ ω 1 ( n + μ − 1 ) ! q n + μ ] 2 k 2 , ω 5 = q γ &#175; s + q γ &#175; m and q = μ ( 1 + k ) .</p></sec><sec id="s3_6"><title>3.6. The CDF of SNR of Best Relay for Source-to-jth Eavesdropper Link</title><p>Let γ j denotes the SNR of best relay for source-to-eavesdropper link. Then, the</p><p>CDF of γ j denoted by F γ ∑ e j ( γ j ) , for κ-μ shadowed fading channels is given by,</p><p>F γ ∑ e j ( γ j ) = { F γ q k ( γ j ) } R = { 1 − P r ( γ s , k &gt; γ i ) P r ( γ k , j &gt; γ j ) } R , (11)</p><p>where P r ( γ s , k &gt; γ j ) ≜ ∫ γ j ∞     f γ s , k ( γ s , k ) d γ s , k and P r ( γ k , j &gt; γ j ) ≜ ∫ γ j ∞     f γ k , j ( γ k , j ) d γ k , j . Substituting the values of f γ s , k ( γ s , k ) and f γ k , j ( γ k , j ) , and using the identities of Equations (7)-(9), the closed-form expression for the F γ ∑ e j ( γ j ) can be defined as</p><p>F γ ∑ e j ( γ j ) = ∑ k 1 = 0 ∞     ∑ k 2 = 0 R     β 3 γ j 2 k 1 e − β 2 k 2 γ j , (12)</p><p>where β 2 = q γ &#175; s + q γ &#175; e , q = μ ( 1 + k ) and</p><p>β 3 = ∑ k 2 = 0 R R ! k 2 ! ( R − k 2 ) ! ( − 1 ) k 2 [ ∑ n = 0 ∞ ω 1 ( n + μ − 1 ) ! q n + μ ] 2 k 2 .</p></sec><sec id="s3_7"><title>3.7. The PDF of SNR of Best Relay for Source-to-ith Destination Link</title><p>The PDF of γ i denoted by f γ ∑ d i ( γ i ) for κ-μ shadowed fading channel can be obtained as</p><p>f γ ∑ d i ( γ i ) = R f γ e q k ( γ i ) [ F γ e q k ( γ i ) ] R − 1 , (13)</p><p>where the value of f γ e q k ( γ i ) can be calculated from the following expression</p><p>f γ e q k ( γ i ) = d d γ i { F γ e q k ( γ i ) } . (14)</p><p>Substituting the value of F γ e q k ( γ i ) in Equation (14) and after differentiation, the closed-form expression of f γ e q k ( γ i ) is given by,</p><p>f γ e q k ( γ i ) = ( − 2 k 1 γ i 2 k 1 − 1 + ω 5 γ i 2 k 1 ) ω 3 e − ω 5 γ i , (15)</p><p>where ω 3 = ∑ k 1 = 0 ∞ ω 2 2 ( γ &#175; s γ &#175; m ) k 1 and ω 5 = q γ &#175; s + q γ &#175; m . Finally, substituting the values of f γ e q k ( γ i ) and F γ e q k ( γ i ) in Equation (13) we have</p><p>f γ ∑ d i ( γ i ) = ( ω 7 γ i v 1 + ω 8 γ i v 2 ) e − ω 9 γ i , (16)</p><p>where ω 7 = ∑ k 1 = 0 ∞ − 2 ω 3 ω 6 k 1 R , ω 8 = ω 3 ω 5 ω 6 R , ω 9 = ∑ k 3 = 0 R − 1     ω 5 ( 1 + k 3 ) , v 1 = v 2 − 1 and v 2 = 4 ∑ k 1 = 0 ∞     k 1 .</p></sec><sec id="s3_8"><title>3.8. The PDF of SNR of Best Relay for Source-to-jth Eavesdropper Link</title><p>The PDF of γ j denoted by f γ ∑ e j ( γ j ) for κ-μ shadowed fading channel can be defined as</p><p>f γ ∑ e j ( γ j ) = R f γ q k ( γ j ) [ F γ q k ( γ j ) ] R − 1 . (17)</p><p>The value of f γ q k ( γ j ) is calculated as follows,</p><p>f γ q k ( γ j ) = d d γ j { F γ q k ( γ j ) } = ( − 2 k 1 γ j 2 k 1 − 1 + β 2 γ j 2 k 1 ) β 1 e − β 2 γ j , (18)</p><p>where β 1 = ∑ k 1 = 0 ∞ ω 2 2 ( γ &#175; s γ &#175; e ) k 1 and β 2 = q γ &#175; s + q γ &#175; e . Substituting the values of f γ q k ( γ j ) and F γ q k ( γ j ) in Equation (17), the closed-form expression for the f γ ∑ e j ( γ j ) can be derived as,</p><p>f γ ∑ e j ( γ j ) = ( β 5 γ j v 1 + β 6 γ j v 2 ) e − β 7 γ j , (19)</p><p>where β 5 = ∑ k 1 = 0 ∞ − 2 k 1 β 1 β 4 , β 6 = β 1 β 2 β 4 , β 7 = ∑ k 3 = 0 R − 1     β 2 ( 1 + k 3 ) , v 1 = v 2 − 1 and v 2 = 4 ∑ k 1 = 0 ∞     k 1 .</p></sec><sec id="s3_9"><title>3.9. The PDF of d<sub>min</sub></title><p>Let d min = min 1 ≤ i ≤ M γ i denotes the SNR of multicast channel. Then, the PDF of d min denoted by f d m i n ( γ i ) , for the κ-μ shadowed fading channel is given by,</p><p>f d min ( γ i ) = M f γ ∑ d i ( γ i ) { 1 − F γ ∑ d i ( γ i ) } M − 1 . (20)</p><p>Substituting the value of f γ ∑ d i ( γ i ) and F γ ∑ d i ( γ i ) in Equation (20), the closedform analytical expression for the f d min ( γ i ) can be derived as</p><p>f d min ( γ i ) = ( η 3 γ i k 6 + η 4 γ i k 7 ) e − η 5 γ i , (21)</p><p>where</p><p>η 3 = ∑ k 4 = 0 M − 1     M ( M − 1 ) ! k 4 ! ( ( M − 1 ) − k 4 ) ! ( ω 4 ) k 4 ω 7 ,</p><p>η 4 = ∑ k 4 = 0 M − 1     M ( M − 1 ) ! k 4 ! ( ( M − 1 ) − k 4 ) ! ( ω 4 ) k 4 ω 8 ,</p><p>η 5 = ∑ k 2 = 0 R     ∑ k 4 = 0 M − 1 ( ω 9 + ω 5 k 2 k 4 ) ,</p><p>k 6 = ∑ k 1 = 0 ∞     ∑ k 4 = 0 M − 1 ( v 1 + 2 k 1 k 4 ) and</p><p>k 7 = ∑ k 1 = 0 ∞     ∑ k 4 = 0 M − 1 ( v 2 + 2 k 1 k 4 ) .</p></sec><sec id="s3_10"><title>3.10. The PDF of d<sub>max</sub></title><p>Let d max = max 1 ≤ j ≤ N γ j denotes the maximum SNR of eavesdropper’s channel. Then, the PDF of d max denoted by f d max ( γ j ) , for the κ-μ shadowed fading channel is given by,</p><p>f d max ( γ j ) = N f γ ∑ e j ( γ j ) { F γ ∑ e j ( γ j ) } N − 1 . (22)</p><p>Substituting the values of f γ ∑ e j ( γ j ) and F γ ∑ e j ( γ j ) in Equation (22), the closed-form analytical expression for the f d max ( γ j ) can be derived as</p><p>f d max ( γ j ) = η 1 γ j v 1 + k 5 + η 2 γ j v 2 + k 5 e β 8 γ j , (23)</p><p>where β 8 = ∑ k 2 = 0 R { β 7 + β 2 k 2 ( N − 1 ) } , η 1 = N β 3 N − 1 β 5 and η 2 = N β 3 N − 1 β 6 .</p></sec></sec><sec id="s4"><title>4. Probability of Non-Zero Secrecy Multicast Capacity</title><p>The PNSMC is defined as</p><p>P r ( C s m c a s t &gt; 0 ) = ∫ 0 ∞     f d min ( γ i ) ∫ 0 γ i     f d max ( γ j ) d γ j d γ i . (24)</p><p>Substituting the values of f d min ( γ i ) and f d max ( γ j ) in Equation (24) and using the following identities of [<xref ref-type="bibr" rid="scirp.121592-ref21">21</xref>],</p><p>∫ 0 u     x n e − μ x d x = n ! μ n + 1 − e − μ u ∑ k = 0 n ( n ! u k k ! μ n − k + 1 ) (25)</p><p>∫ 0 ∞     x n e − μ x d x = n ! μ − n − 1 (26)</p><p>the derived analytical expression in the closed-form for the P r ( C s m c a s t &gt; 0 ) is shown in Equation (27) at the top of the next page, where</p><p>δ 1 = η 1 ( v 1 + k 5 ) ! β 8 v 1 + k 5 + 1 + η 2 ( v 2 + k 5 ) ! β 8 v 2 + k 5 + 1 , δ 2 = ( − 1 ) ∑ k 9 = 0 v 1 + k 5 ( v 1 + k 5 ) ! k 9 ! η 1 β 8 v 1 − k 9 + 1 and δ 3 = ( − 1 ) ∑ k 8 = 0 v 2 + k 5 ( v 2 + k 5 ) ! k 8 ! η 2 β 8 v 2 − k 8 + 1 .</p><p>P r ( C s m c a s t &gt; 0 ) = δ 1 k 6 ! η 5 k 7 { η 3 + η 4 k 7 η 5 } + ∑ k 9 = 0 v 1 + k 5 δ 2 ( k 6 + k 9 ) ! ( β 8 + η 5 ) k 7 + k 9 { η 3 + η 4 ( k 7 + k 9 ) β 8 + η 5 }       + ∑ k 8 = 0 v 2 + k 5 δ 3 ( k 6 + k 8 ) ! ( β 8 + η 5 ) k 7 + k 8 { η 3 + η 4 ( k 7 + k 8 ) β 8 + η 5 } (27)</p></sec><sec id="s5"><title>5. Secure Outage Probability for Multicasting</title><p>The SOPM is defined as</p><p>P o u t ( R s m c a s t ) = 1 − ∫ 0 ∞     f d max ( γ j ) ∫ x ∞     f d min ( γ i ) d γ i d γ j , (28)</p><p>where x = e 2 R s m c a s t ( 1 + γ j ) − 1 , x = H + e 2 R s m c a s t γ j , H = e 2 R s m c a s t − 1 and R s m c a s t denotes the target secrecy multicast rate which is indicated as R<sub>S</sub> in the figure.</p><p>Substituting the values of f d min ( γ i ) and f d max ( γ j ) in Equation (28) and using the identities of Equations (25) and (26), the derived analytical expression in the closed-form for the P o u t ( R s m c a s t ) is shown below in Equation (29) as</p><p>P o u t ( R s m c a s t ) = 1 − [ ∑ k 11 = 0 k 6     ∑ k 13 = 0 k 11 { η 1 η 6 ( v 1 + k 5 + k 13 ) ! ( β 8 + η 8 ) v 1 + k 5 + k 13 + 1 } + ∑ k 11 = 0 k 6     ∑ k 13 = 0 k 11 { η 2 η 6 ( v 2 + k 5 + k 13 ) ! ( β 8 + η 8 ) v 2 + k 5 + k 13 + 1 }         + ∑ k 12 = 0 k 7     ∑ k 14 = 0 k 12 { η 1 η 7 ( v 1 + k 5 + k 14 ) ! ( β 8 + η 8 ) v 1 + k 5 + k 14 + 1 } + ∑ k 12 = 0 k 7     ∑ k 14 = 0 k 12 { η 2 η 7 ( v 2 + k 5 + k 14 ) ! ( β 8 + η 8 ) v 2 + k 5 + k 14 + 1 } ] , (29)</p><p>where, η 6 = ∑ k 11 = 0 k 6     ∑ k 13 = 0 k 11 η 3 ( H ) k 11 − k 13 ( e η 5 H ) ( e − 2 R s ) k 13 k 6 ! k 11 ! k 11 ! k 13 ! ( k 11 − k 13 ) ! η 5 k 6 − k 11 + 1 , η 7 = ∑ k 12 = 0 k 7     ∑ k 14 = 0 k 12 η 4 ( H ) k 12 − k 14 ( e η 5 H ) ( e − 2 R s ) k 14 k 7 ! k 12 ! k 12 ! k 14 ! ( k 12 − k 14 ) ! η 5 k 7 − k 12 + 1 and η 8 = η 5 e 2 R s .</p></sec><sec id="s6"><title>6. Numerical Results</title><p>The PNSMC represented by P r ( C s m c a s t &gt; 0 ) is depicted in <xref ref-type="fig" rid="fig2">Figure 2</xref> as a function of the multicast channel’s average SNR ( γ s ), for various values of κ and μ. This figure shows the impacts of κ and μ on the P r ( C s m c a s t &gt; 0 ) for the given values of system parameters. We see that the P r ( C s m c a s t &gt; 0 ) increases, if κ decrease from 2 (represented by the dot line) to 1 (represented by the solid line) when μ = 1 . Again the P r ( C s m c a s t &gt; 0 ) decreases, if μ increase from 1 (represented by the short dash line) to 1.4 (represented by the dash dot line) when κ = 2 .</p><p>The P r ( C s m c a s t &gt; 0 ) is depicted in <xref ref-type="fig" rid="fig3">Figure 3</xref> as a function of the multicast channel’s average SNR ( γ s ), for various values of M and N. This figure shows the impacts of M and N on the P r ( C s m c a s t &gt; 0 ) for the selected values of system parameters. It is found that the P r ( C s m c a s t &gt; 0 ) increases, if N decrease from 2</p><p>(dot line) to 1 (solid line) and M decrease from 2 (dash dot line) to 1 (short dash line) when M = 1 and N = 1 , respectively. This is due to the fact that when the number of multicast users increases, each user’s bandwidth decreases, which in turn lowers the multicast user’s capacity.</p><p>The P r ( C s m c a s t &gt; 0 ) is depicted in <xref ref-type="fig" rid="fig4">Figure 4</xref> as a function of the multicast channel’s average SNR ( γ s ), for various values of the number of relay, R, and fluctuation parameter, m. This figure shows the impacts of R and m on the P r ( C s m c a s t &gt; 0 ) for selected values of system parameters. We see that the P r ( C s m c a s t &gt; 0 ) increases, if R increase from 1 (dot line) to 2 (solid line) when m = 2.5 . The P r ( C s m c a s t &gt; 0 ) also increases when the values of m decrease from 2.5 (dash dot line) to 1.5 (short dash line) when R = 1 . This is because, increasing in the number of relay increases the diversity gain provided by the relays, and decreasing in the LOS fluctuation parameter decreases the severity of fading in the multicast channels which causes an improvement in the capacity of multicast user.</p><p>In <xref ref-type="fig" rid="fig5">Figure 5</xref>, the SOPM represented by P o u t ( R s m c a s t ) is illustrated as a function of the multicast channel’s average SNR γ s for various values of κ and R. For the selected values of system parameters, this figure illustrates how κ and R affect the SOPM, P o u t ( R s m c a s t ) . We see that the P o u t ( R s m c a s t ) increases, if the values of κ increase from 1 to 1.6 and decreases if the values of R increase from 1 to 2 when R = 1 and κ = 1.6 , respectively.</p><p>The impact of μ illustrates with R that is described in <xref ref-type="fig" rid="fig6">Figure 6</xref> by plotting the P o u t ( R s m c a s t ) against γ s of the multicast channel. For the selected values of system parameters, this figure illustrates how μ and R affect the P o u t ( R s m c a s t ) . We see that the P o u t ( R s m c a s t ) increases, if the values of μ increase from 1.2 to 1.5</p><p>and decreases if the value of R increase from 1 to 2 when R = 1 and μ = 1.5 , respectively.</p><p>In <xref ref-type="fig" rid="fig7">Figure 7</xref>, the P o u t ( R s m c a s t ) is illustrated as a function of the multicast channel’s average SNR γ s for various values of M and R. For the given values of system parameters, this figure illustrates how M and R affect the P o u t ( R s m c a s t ) . We see that the P o u t ( R s m c a s t ) increases, if M increase from 1 to 2 when R = 1 . The P o u t ( R s m c a s t ) decreases if the value of R increase from 1 (represented by at the very top) to 2 (represented by lowest) when M = 2 in the high SNR region, as one expects.</p><p>In <xref ref-type="fig" rid="fig8">Figure 8</xref>, the P o u t ( R s m c a s t ) is illustrated as a function of the multicast channel’s average SNR γ s for various values of N and R. For the given values of system parameters, this figure narrates how N and R affect the SOPM, P o u t ( R s m c a s t ) . It is observed that the P o u t ( R s m c a s t ) increases, if N increase from 1 (dot line) to 2 (solid line) when R = 1 . The P o u t ( R s m c a s t ) decreases with R.</p><p>The P o u t ( R s m c a s t ) is plotted against γ s which shows in <xref ref-type="fig" rid="fig9">Figure 9</xref> of the multicast channel for various values of m and R. This figure shows the impacts of m and R on the P o u t ( R s m c a s t ) for the given system parameters. We see that the P o u t ( R s m c a s t ) increases, if m increase from 1 to 2 when R = 1 . This effect of m increases when the value of R increases.</p><p>The P o u t ( R s m c a s t ) is depicted in <xref ref-type="fig" rid="fig1">Figure 1</xref>0 as a function of the multicast channel’s average SNR ( γ s ), for the values of R = 1 and R = 2 . This figure shows the impacts of R on the P o u t ( R s m c a s t ) for the given system parameters. We see that the P o u t ( R s m c a s t ) increases if the values of R decrease from 2 to 1 when M = N = 1 . The cooperative diversity provided by the best relay increases with the number of relays which is a reason of an improvement in the multicast capacity.</p><p>Therefore, based on the closed-form analytical expressions for the</p><p>P r ( C s m c a s t &gt; 0 ) and the P o u t ( R s m c a s t ) and from the observations of numerical</p><p>results, the main findings of this paper can be summarized as follows: The P r ( C s m c a s t &gt; 0 ) decreases with κ, μ, m, M and N. Therefore, increase in κ, μ, m, M and N degrades the security of the system. On the other hand, if R increases P r ( C s m c a s t &gt; 0 ) increases and P o u t ( R s m c a s t ) decreases. Therefore, increasing in R enhances the security of the system.</p></sec><sec id="s7"><title>7. Conclusion</title><p>The creation of an analytical mathematical model to guarantee security in wireless multicasting using κ-μ shadowing fading channels with opportunistic relaying is the main topic of this article. The parameters such as κ, μ, m, the number of multicast users, eavesdroppers, and relays that assist in determining the values of N and R are used to derive the analytical formulas in the closed-form for the PNSMC and the SOPM. Our results conclude that the security in wireless multicasting through κ-μ fading channel degrades with the κ, μ, m, M and N. But increasing the number of relays helps to mitigate this loss of security which takes part in competition of opportunistic relaying technique to be the best relay. The effects of interferences on the security in multicasting through κ-μ shadowing fading channel are not considered in this paper. The zero-forcing precoding can be used to eliminate the effects of interferences and the selection and phase alignment precoding techniques can be used to enhance the security by using interference power. Finally, the validity of analytical expressions is verified via Monte-Carlo simulation.</p></sec><sec id="s8"><title>Conflicts of Interest</title><p>The authors declare no conflicts of interest regarding the publication of this paper.</p></sec><sec id="s9"><title>Cite this paper</title><p>Alam, A. and Sarkar, M.Z.I. (2022) Enhancement of Multicast Security with Opportunistic Relaying Technique over κ-μ Shadowed Fading Channels. Journal of Computer and Communications, 10, 121-137. https://doi.org/10.4236/jcc.2022.1011009</p></sec></body><back><ref-list><title>References</title><ref id="scirp.121592-ref1"><label>1</label><mixed-citation publication-type="other" xlink:type="simple">Swaminathan, R., Selvaraj, M.D. and Roy, R. (2015) On the Error and Outage Performance of Decode-and-Forward Cooperative Selection Diversity System with Correlated Links. IEEE Transactions on Vehicular Technology, 64, 3578-3593. https://doi.org/10.1109/TVT.2014.2356479</mixed-citation></ref><ref id="scirp.121592-ref2"><label>2</label><mixed-citation publication-type="other" xlink:type="simple">Li, X., Li, J., Li, L., Du, L., Jin, J. and Zhang, D. (2018) Performance Analysis of Cooperative Small Cell Systems under Correlated Rician/Gamma Fading Channels. IET Signal Processing, 12, 64-73. https://doi.org/10.1049/iet-spr.2017.0078</mixed-citation></ref><ref id="scirp.121592-ref3"><label>3</label><mixed-citation publication-type="other" xlink:type="simple">Sanguanpuak, T., Rajatheva, N. and Taparugssanagorn, A. (2013) Performance Analysis of OSTBC for Partial Relay Selection with Correlated Antennas over Nakagami-m Fading. IEEE Wireless Communications Letters, 2, 355-358. https://doi.org/10.1109/WCL.2013.042313.130003</mixed-citation></ref><ref id="scirp.121592-ref4"><label>4</label><mixed-citation publication-type="other" xlink:type="simple">Deng, D., Yu, M., Xia, J., Na, Z., Zhao, J. and Yang, Q. (2018) Wireless Powered Cooperative Communications with Direct Links over Correlated Channels. Physical Communication, 28, 147-153. https://doi.org/10.1016/j.phycom.2018.03.013</mixed-citation></ref><ref id="scirp.121592-ref5"><label>5</label><mixed-citation publication-type="other" xlink:type="simple">Yang, M., Guo, D., Huang, Y., Duong, T.Q. and Zhang, B. (2016) Secure Multiuser Scheduling in Downlink Dual-Hop Regenerative Relay Networks over Nakagami-m Fading Channels. IEEE Transactions on Wireless Communications, 15, 8009-8024. https://doi.org/10.1109/TWC.2016.2610965</mixed-citation></ref><ref id="scirp.121592-ref6"><label>6</label><mixed-citation publication-type="other" xlink:type="simple">Sarker, D.K., Sarkar, M.Z.I. and Anower, M.S. (2017) Secure Wireless Multicasting with Linear Equalization. Physical Communication, 25, 201-213. https://doi.org/10.1016/j.phycom.2017.07.007</mixed-citation></ref><ref id="scirp.121592-ref7"><label>7</label><mixed-citation publication-type="other" xlink:type="simple">Sarker, D.K., Sarkar, M.Z.I. and Anower, M.S. (2015) Secure Outage Performance Analysis for Multicasting with Linear Equalization. 2015 18th International Conference on Computer and Information Technology, Dhaka, 21-23 December 2015, 99-104. https://doi.org/10.1109/ICCITechn.2015.7488050</mixed-citation></ref><ref id="scirp.121592-ref8"><label>8</label><mixed-citation publication-type="other" xlink:type="simple">Moualeu, J.M., da Costa, D.B., Hamouda, W., Dias, U.S. and de Souza, R.A.A. (2019) Physical Layer Security Over α-κ-μ and α-η-μ Fading Channels. IEEE Transactions on Vehicular Technology, 68, 1025-1029. https://doi.org/10.1109/TVT.2018.2884832</mixed-citation></ref><ref id="scirp.121592-ref9"><label>9</label><mixed-citation publication-type="other" xlink:type="simple">Singh, R. and Rawat, M. (2019) Secrecy Capacity of Physical Layer over κ-μ/Gamma Composite Fading Channel. TENCON 2019—2019 IEEE Region 10 Conference, Kochi, 17-20 October 2019, 1472-1477. https://doi.org/10.1109/TENCON.2019.8929467</mixed-citation></ref><ref id="scirp.121592-ref10"><label>10</label><mixed-citation publication-type="other" xlink:type="simple">Badrudduza, A.S.M., Sarkar, M.Z.I., Kundu, M.K. and Sarker, D.K. (2019) Performance Analysis of Multicasting over Rician-K Fading Channels: A Secrecy Tradeoff. 2019 International Conference on Computer, Communication, Chemical, Materials and Electronic Engineering, Rajshahi, 11-12 July 2019, 1-4. https://doi.org/10.1109/IC4ME247184.2019.9036684</mixed-citation></ref><ref id="scirp.121592-ref11"><label>11</label><mixed-citation publication-type="other" xlink:type="simple">Bhargav, N., Cotton, S.L. and Simmons, D.E. (2016) Secrecy Capacity Analysis over κ-μ Fading Channels: Theory and Applications. IEEE Transactions on Communications, 64, 3011-3024. https://doi.org/10.1109/TCOMM.2016.2565580</mixed-citation></ref><ref id="scirp.121592-ref12"><label>12</label><mixed-citation publication-type="other" xlink:type="simple">Tashman, D.H., Hamouda, W. and Dayoub, I. (2020) Secrecy Analysis over Cascaded κ-μ Fading Channels with Multiple Eavesdroppers. IEEE Transactions on Vehicular Technology, 69, 8433-8442. https://doi.org/10.1109/TVT.2020.2995115</mixed-citation></ref><ref id="scirp.121592-ref13"><label>13</label><mixed-citation publication-type="other" xlink:type="simple">Sun, J., Li, X., Huang, M., Ding, Y., Jin, J. and Pan, G. (2018) Performance Analysis of Physical Layer Security over κ-μ Shadowed Fading Channels. IET Communications, 12, 970-975. https://doi.org/10.1049/iet-com.2017.1268</mixed-citation></ref><ref id="scirp.121592-ref14"><label>14</label><mixed-citation publication-type="other" xlink:type="simple">Al-Hmood, H. and Al-Raweshidy, H. (2019) Exact Closed-Form Capacity and Outage Probability of Physical Layer Security in κ-μ Shadowed Fading Channels. IET Communications, 13, 3235-3243. https://doi.org/10.1049/iet-com.2019.0325</mixed-citation></ref><ref id="scirp.121592-ref15"><label>15</label><mixed-citation publication-type="other" xlink:type="simple">Bilim, M. (2019) A Performance Study on Diversity Receivers over κ-μ Shadowedfading Channels. AEU-International Journal of Electronics and Communications, 112, Article ID: 152934. https://doi.org/10.1016/j.aeue.2019.152934</mixed-citation></ref><ref id="scirp.121592-ref16"><label>16</label><mixed-citation publication-type="other" xlink:type="simple">Srinivasan, M. and Kalyani, S. (2018) Secrecy Capacity of κ-μ Shadowed Fading Channels. IEEE Communications Letters, 22, 1728-1731. https://doi.org/10.1109/LCOMM.2018.2837859</mixed-citation></ref><ref id="scirp.121592-ref17"><label>17</label><mixed-citation publication-type="other" xlink:type="simple">Sun, J., Bie, H., Li, X., Rabie, K.M. and Kharel, R. (2020) Average Secrecy Capacity of SIMO κ-μ Shadowed Fading Channels with Multiple Eavesdroppers. 2020 IEEE Wireless Communications and Networking Conference, Seoul, 25-28 May 2020, 1-6. https://doi.org/10.1109/WCNC45663.2020.9120598</mixed-citation></ref><ref id="scirp.121592-ref18"><label>18</label><mixed-citation publication-type="other" xlink:type="simple">Snchez, J.D.V., Osorio, D.P.M., Lpez-Martnez, F.J., Paredes, M.C.P. and Urquiza-Aguiar, L.F. (2021) Information-Theoretic Security of MIMO Networks under κ-μ Shadowed Fading Channels. IEEE Transactions on Vehicular Technology, 70, 6302-6318. https://doi.org/10.1109/TVT.2021.3086026</mixed-citation></ref><ref id="scirp.121592-ref19"><label>19</label><mixed-citation publication-type="other" xlink:type="simple">Badrudduza, A.S.M., Shahriyer, S.M.S., Kundu, M.K. and Shabab, S. (2019) Enhancement of Secrecy Multicast Capacity over κ-μ Shadowed Fading Channel. 2019 IEEE International Conference on Telecommunications and Photonics, Dhaka, 28-30 December 2019, 1-4. https://doi.org/10.1109/ICTP48844.2019.9041722</mixed-citation></ref><ref id="scirp.121592-ref20"><label>20</label><mixed-citation publication-type="other" xlink:type="simple">Ibrahim, M., Sarkar, M.Z.I., Badrudduza, A.S.M., Kundu, M.K. and Dev, S. (2020) Impact of Correlation on the Security in Multicasting through κ-μ Shadowed Fading Channels. 2020 IEEE Region 10 Symposium, Dhaka, 5-7 June 2020, 1396-1399.https://doi.org/10.1109/TENSYMP50017.2020.9231044</mixed-citation></ref><ref id="scirp.121592-ref21"><label>21</label><mixed-citation publication-type="other" xlink:type="simple">Gradshteyn, I.S. and Ryzhik, I.M. (2014) Table of Integrals, Series, and Products. Academic Press, Cambridge.</mixed-citation></ref></ref-list></back></article>