The performance of Rayleigh fading channels is substantially impacted by the impacts of relays, antennas, and the number of branches. Opportunistic relaying is a potent technique for enhancing the effects of the aforementioned factors while enhancing the performance of fading channels. Due to these issues, a secure wireless multicasting scenario using opportunistic relaying over Rayleigh fading channel in the presence of multiple wiretappers is taken into consideration in this study. So the investigation of a secure wireless multicasting scenario using opportunistic relaying over Rayleigh fading channel in the presence of multiple wiretappers is the focus of this paper. The primary goals of this study are to maximize security in wireless multicasting while minimizing security loss caused by the effects of relays, branches at destinations and wiretappers, as well as multicast users and wiretappers through opportunistic relaying. To comprehend the insight effects of prior parameters, the closed form analytical expressions are constructed for the probability of non-zero secrecy multicast capacity (PNSMC), ergodic secrecy multicast capacity (ESMC), and secure outage probability for multicasting (SOPM). The findings demonstrate that opportunistic relaying is a successful method for reducing the loss of security in multicasting.
Because of the diversification of application fields and users’ mobility when using network components, wireless communication systems security is crucial. Furthermore, wireless communication is susceptible to fraud and wiretapping [
Recently, in [
In this research, authors examined a secure wireless multicasting scenario over Rayleigh fading channels in the presence of multiple wiretappers. This study was inspired by the necessity of safety in multicasting and was based on the previously indicated condition that is documented in the literature. The authors created a mathematical model to forecast the safety in opportunistic relaying over Rayleigh fading channels. The following is a summary of this paper’s main contributions.
● At first, authors deduced the analytical expression for cumulative distribution functions (CDFs) of signal-to-noise ratio (SNR) of best relay for source-to-destination link and source-to-wiretapper’s link based on the probability density function (PDF) of Rayleigh fading channels.
● Secondly, authors generated the expression for PDFs of SNR of the best relay for source-to-destination link and source-to-wiretapper’s link from these CDFs.
● Thirdly, using these PDFs of SNR of the best relay for source-to-destination link and source-to-wiretapper’s link, authors deduced the expressions for the PDFs of minimum SNR of multicast channels and maximum SNR of wiretapper’s channels.
● Fourthly, the authors developed the expressions for PNSMC, ESMC, and SOPM using the PDFs of minimum SNR of multicast channels and maximum SNR of wiretapper’s channels. The PNSMC, ESMC, and SOPM will then be investigated based on the effect of relays, branches at destinations and wiretappers channels, multicast users and wiretappers, average SNR of the wiretappers channel.
● Finally, the provided analytical expressions are validated using Monte-Carlo simulation.
Following is how this document is structured for the remaining portions. System structure and Problem analysis are both treated in Sections II and III, respectively. The expressions for PNSMC, ESMC, and SOPM, respectively, are found in Sections IV, V, and VI. In Section VII, the numerical results are presented. Finally, the conclusions of this task are presented in Section VIII.
In the presence of multiple wiretappers, Rayleigh fading channels are taken into consideration for the secure wireless multicasting communication circumstances depicted in
The elements of this image are single source S, a collection of K relays, P destinations, Q wiretappers and the number of Nm and Ne branches at destinations and wiretappers respectively. Relays are used by the source to transmit a shared stream of privileged data to the P destinations. The wiretappers are attempting to decrypt the private data. By preventing this wiretapping, the goal of this thesis is to ensure secure communication between source and destinations. Multicast channels are those between the source and the destinations, whereas wiretappers channels are those between the source and the wiretappers.
The development of closed-form analytical equations for PDFs of multicast channels and wiretappers channels is the purpose of this section.
The symbol γ represents signal-to-noise ratio (SNR) of each sub-channel in a multicast channel. Then, for Rayleigh fading channels, PDF of γ represented by f γ ( γ ) is given by ( [
f γ ( γ ) = N γ ¯ ( 1 − e − γ γ ¯ ) N − 1 e − γ γ ¯ (1)
Putting the formula
( 1 − x ) n = ∑ r = 0 n ( n r ) ( − 1 ) r x r
in Equation (1), we get
f γ ( γ ) = N γ ¯ ∑ n = 0 N − 1 ( N − 1 n ) ( − 1 ) n e − ( 1 + n γ ¯ ) γ , (2)
where N is the number of branch and γ ¯ is the average SNR for all branches.
Let γ s , k represents SNR of source-to-kth relay. Then, PDF of γ s , k represented by f γ s , k ( γ s , k ) for Rayleigh fading channels is shown by,
f γ s , k ( γ s , k ) = N s γ ¯ s ∑ n = 0 N s − 1 ( N s − 1 n ) ( − 1 ) n e − ( 1 + n γ ¯ s ) γ s , k = s 1 e − s 2 γ s , k , (3)
where s 1 = N s γ ¯ s ∑ n = 0 N s − 1 ( N s − 1 n ) ( − 1 ) n , s 2 = 1 + n γ ¯ s .
Let γ k , i represents SNR of kth relay-to-ith destination. Then, PDF of SNR of γ k , i represented by f γ k , i ( γ k , i ) for Rayleigh fading channel is shown by,
f γ k , i ( γ k , i ) = N m γ ¯ m ∑ n = 0 N m − 1 ( N m − 1 n ) ( − 1 ) n e − ( 1 + n γ ¯ m ) γ k , i = d 1 e − d 2 γ k , i , (4)
where d 1 = N m γ ¯ m ∑ n = 0 N m − 1 ( N m − 1 n ) ( − 1 ) n , d 2 = 1 + n γ ¯ m .
Let γ k , j represents SNR of kth relay-to-jth wiretapper. Then, PDF of SNR of γ k , j represented by f γ k , j ( γ k , j ) for Rayleigh fading channels is given by,
f γ k , j ( γ k , j ) = N e γ ¯ e ∑ n = 0 N e − 1 ( N e − 1 n ) ( − 1 ) n e − ( 1 + n γ ¯ e ) γ k , j = e 1 e − e 2 γ k , j , (5)
where e 1 = N e γ ¯ e ∑ n = 0 N e − 1 ( N e − 1 n ) ( − 1 ) n , e 2 = 1 + n γ ¯ e .
Let γ i represents SNR of best relay for source-to-ith Destination. Then, CDF of γ i represented by F γ ∑ d i ( γ i ) for Rayleigh fading channels is shown by,
F γ ∑ d i ( γ i ) = { F γ e q k ( γ i ) } K = { 1 − P r ( γ s , k > γ i ) P r ( γ k , i > γ i ) } K , (6)
where P r ( γ s , k > γ i ) ≜ ∫ γ i ∞ f γ s , k ( γ s , k ) d γ s , k and P r ( γ k , i > γ i ) ≜ ∫ γ i ∞ f γ k , i ( γ k , i ) d γ k , i . Putting the value of f γ s , k ( γ s , k ) and f γ k , i ( γ k , i ) , and using the following identity of
∫ x ∞ e − b x d x = e − b x b , (7)
the value of P r ( γ s , k > γ i ) and P r ( γ k , i > γ i ) can be computed. Then, putting the value of P r ( γ s , k > γ i ) and P r ( γ k , i > γ i ) in Equation (6) and using the identity of
( 1 − x ) n = ∑ r = 0 n ( n r ) ( − 1 ) r x r (8)
the expression for F γ ∑ d i ( γ i ) can be derived as
F γ ∑ d i ( γ i ) = B d e − b d γ i , (9)
where B d = ∑ k = 0 K ( K k ) ( − 1 ) k ( A d ) k , b d = a d k .
Let γ j represents SNR of best relay for source-to-jth Eavesdropper. Then, CDF of γ j represented by F γ ∑ e j ( γ j ) , for Rayleigh fading channels is shown by,
F γ ∑ e j ( γ j ) = { F γ q k ( γ j ) } K = { 1 − P r ( γ s , k > γ j ) P r ( γ k , j > γ j ) } K , (10)
where P r ( γ s , k > γ j ) ≜ ∫ γ j ∞ f γ s , k ( γ s , k ) d γ s , k and P r ( γ k , j > γ j ) ≜ ∫ γ j ∞ f γ k , j ( γ k , j ) d γ k , j . Putting the value of f γ s , k ( γ s , k ) and f γ k , j ( γ k , j ) , and using the identities of Equations (7) and (8) the equation for the F γ ∑ e j ( γ j ) can be deduced as
F γ ∑ e j ( γ j ) = B e e − b e γ j , (11)
where B e = ∑ k = 0 K ( K k ) ( − 1 ) k ( A e ) k , b e = a e k .
The PDF of γ i denoted by f γ ∑ d i ( γ i ) for Rayleigh fading channel is defined as
f γ ∑ d i ( γ i ) = K f γ e q k ( γ i ) [ F γ e q k ( γ i ) ] K − 1 , (12)
where the value of f γ e q k ( γ i ) can be derived from the expression which is stated as below
f γ e q k ( γ i ) = d d γ i { F γ e q k ( γ i ) } . (13)
Putting the value of F γ e q k ( γ i ) in Equation (13) and after differentiation, the expression of f γ e q k ( γ i ) is given by,
f γ e q k ( γ i ) = A d a d e − a d γ i , (14)
where A d = s 1 d 1 s 2 d 2 and a d = s 2 + d 2 . Finally, Putting the value of f γ e q k ( γ i ) and F γ e q k ( γ i ) in Equation (12) we get
f γ ∑ d i ( γ i ) = C d e − c d γ i , (15)
where C d = K A d a d ∑ k = 0 K ( K k ) ( − 1 ) k ( A d ) k , c d = a d ( 1 + k ) .
The PDF of γ j denoted by f γ ∑ e j ( γ j ) for Rayleigh fading channel is defined as
f γ ∑ e j ( γ j ) = K f γ q k ( γ j ) [ F γ q k ( γ j ) ] K − 1 . (16)
The value of f γ q k ( γ j ) is determined as follows,
f γ q k ( γ j ) = d d γ j { F γ q k ( γ j ) } = A e a e e − a e γ j (17)
where A e = s 1 e 1 s 2 e 2 and a e = s 2 + e 2 . Putting the value of f γ q k ( γ j ) and F γ q k ( γ j ) in Equation (16), the expression for f γ ∑ e j ( γ j ) can be deduced as,
f γ ∑ e j ( γ j ) = C e e − c e γ j , (18)
where C e = K A e a e ∑ k = 0 K ( K k ) ( − 1 ) k ( A e ) k , c e = a e ( 1 + k ) .
Let d min = min 1 ≤ i ≤ M γ i represents SNR of multicast channel. Then, PDF of d min represented by f d min ( γ i ) , for Rayleigh fading channel is shown by [
f d min ( γ i ) = P f γ ∑ d i ( γ i ) { 1 − F γ ∑ d i ( γ i ) } P − 1 (19)
Putting the value of f γ ∑ d i ( γ i ) and F γ ∑ d i ( γ i ) in Equation (19), the expression for the f d min ( γ i ) can be deduced as
f d min ( γ i ) = D d e − d d γ i , (20)
where
D d = P C d ∑ r = 0 P − 1 ( P − 1 r ) ( − 1 ) r ( B d ) r , d d = c d + b d r
Let d max = min 1 ≤ j ≤ N γ j represents maximum SNR of wiretapper’s channel. Then, PDF of d max represented by f d max ( γ j ) , for Rayleigh fading channel is shown by [
f d max ( γ j ) = Q f γ ∑ e j ( γ j ) { F γ ∑ e j ( γ j ) } Q − 1 (21)
Putting the value of f γ ∑ e j ( γ j ) and F γ ∑ e j ( γ j ) in Equation (21), the expression for f d max ( γ j ) can be deduced as
f d max ( γ j ) = D e e − d e γ j , (22)
where D e = Q C e ( B e ) Q − 1 , d e = c e + b e ( Q − 1 )
The PNSMC has the following mathematical definition: [
P r ( C s m > 0 ) = ∫ 0 ∞ f d min ( γ i ) ∫ 0 γ i f d max ( γ j ) d γ j d γ i (23)
Putting the value of f d min ( γ i ) and f d max ( γ j ) in Equation (23) and using the identities of
∫ 0 x e − b x d x = 1 − e − b x b , (24)
and
∫ 0 ∞ e − B x d x = 1 B , (25)
the expression that was derived for the P r ( C s m > 0 ) is given by
P r ( C s m > 0 ) = P C d ∑ r = 0 P − 1 ( P − 1 r ) ( − 1 ) r a d ( 1 + k ) + a d k r ( ∑ k = 0 K ( K k ) ( − 1 ) k ( s 1 d 1 s 2 d 2 ) k ) r a d ( 1 + k ) + a d k r + a e ( 1 + k ) + a e k ( Q − 1 ) × Q C e ( ∑ k = 0 K ( K k ) ( − 1 ) k ( s 1 e 1 s 2 e 2 ) k ) Q − 1 a e ( 1 + k ) + a e k ( Q − 1 ) . (26)
The ESMC can be expressed as [
〈 C s m 〉 = ∫ 0 ∞ ln ( 1 + γ i ) f d min ( γ i ) d γ i − ∫ 0 ∞ ln ( 1 + γ j ) f d max ( γ j ) d γ j . (27)
Putting the value of f d min ( γ i ) and f d max ( γ j ) in Equation (27) and after integration by using the identity of ( [
∫ 0 ∞ ln ( 1 + a x ) x t e − x d x = ∑ s = 0 t t ! ( t − s ) ! × { ( − 1 ) t − s − 1 a t − s e − 1 / a E i ( − 1 / a ) + ∑ r = 1 t − s ( r − 1 ) ! ( − a ) t − r − s } , (28)
the expression for ESMC is shown by
〈 C s m 〉 = Q C e ( ∑ k = 0 K ( K k ) ( − 1 ) k ( A e ) k ) Q − 1 e c e + b e ( Q − 1 ) c e + b e ( Q − 1 ) E i [ − ( c e + b e ( Q − 1 ) ) ] × − P C d ∑ r = 0 P − 1 ( P − 1 r ) ( − 1 ) r ( ∑ k = 0 K ( K k ) ( − 1 ) k ( s 1 d 1 s 2 d 2 ) k ) r e c d + b d r c d + b d r E i [ − ( c d + b d r ) ] (29)
For multicasting, the SOP is defined as [
P out ( R s ) = 1 − ∫ 0 ∞ f d max ( γ j ) ∫ x 1 ∞ f d min ( γ i ) d γ i d γ j , (30)
where x = e 2 R s ( 1 + γ j ) − 1 , x = H + e 2 R s γ j , H = e 2 R s − 1 and R s represents target secrecy rate.
Putting the value of f d min ( γ i ) and in Equation (30) and using the identities of Equations (7) and (25), the deduced expression for the P out ( R s ) is shown by
P out ( R s ) = 1 − P C d ∑ r = 0 P − 1 ( P − 1 r ) ( − 1 ) r ( ∑ k = 0 K ( K k ) ( − 1 ) k ( s 1 d 1 s 2 d 2 ) k ) r × Q C e ( ∑ k = 0 K ( K k ) ( − 1 ) k ( s 1 e 1 s 2 e 2 ) k ) Q − 1 e − d d ( 2 R s − 1 ) a d ( 1 + k ) + a d k r [ a d ( 1 + k ) + a d k r + a e ( 1 + k ) + a e k ( Q − 1 ) ] . (31)
According to different values of relays and branches at destinations, the PNSMC is shown in
According to different values of users and wiretappers, the PNSMC is shown in
rises as relays increases and falls as wiretapper branches increases.
with the increase in users (P) as well as wiretappers (Q). This is because increasing in multicast users decreases the bandwidth of each user which in turn decrease the capacity of multicast user.
of multicast channel for different values of users and wiretappers. As the rise of users (P) and wiretappers (Q), we can observe that SOPM also rises dramatically. This is due to the fact that an increasing in multicast users as well as wiretappers decreases the bandwidth. As a result, increase the outage probability for multicasting.
In relation to average SNR of multicast channel for different values of relays,
Therefore, based on the observations of numerical data and analytical formulations for PNSMC, ESMC, and SOPM, the primary conclusions of this study can be summed up as follows: As Ne, P, and Q increase, the PNSMC and ESMC decline. As a result, a rise in Ne, P, and Q reduces system security. As opposed to this, if K and Nm rise, PNSMC and ESMC rise, and SOPM falls. Therefore, raising K and Nm improves system security.
This study focuses on creating a mathematical model for analytically to ensure the security in wireless multicasting using opportunistic relaying over Rayleigh fading channels. The closed-form analytical expressions for PNSMC, ESMC and SOPM are deduced in terms of parameters such as Nm, Ne, multicast users (P) and wiretappers (Q), and relays (K), which aid in gaining a clear understanding of the effects of anterior parameters. According to our findings, the security of wireless multicasting over Rayleigh fading channels declines as Ne, P, and Q grow. However, this loss of security can be reduced by simultaneously increasing relays (K) and branches (Nm) at destinations that compete using the opportunistic relaying technique to choose the best relay from a collection of relays. The effects of distributed switch and stay combining on the security in multicasting through Rayleigh fading channel are not considered in this paper. So the distributed switch and stay combining techniques can be used to enhance the security over Rayleigh fading channel. The accuracy of the analytical expression is finally verified using Monte Carlo simulation.
The authors declare no conflicts of interest regarding the publication of this paper.
Hossain Md. S. and Sarkar Md. Z.I. (2023) Opportunistic Relaying Technique over Rayleigh Fading Channel to Improve Multicast Security. Journal of Computer and Communications, 11, 134-148. https://doi.org/10.4236/jcc.2023.118010