Secure Wireless Multicasting through Nakagami-m Fading Channels with Multi-Hop Relaying

The additional diversity gain provided by the relays improves the secrecy capacity of communications system significantly. The multiple hops in the relaying system is an important technique to improve this diversity gain. The development of an analytical mathematical model of ensuring security in multicasting through fading channels incorporating this benefit of multi-hop relaying is still an open problem. Motivated by this issue, this paper considers a secure wireless multicasting scenario employing multi-hop relaying technique over frequency selective Nakagami-m fading channel and develops an analytical mathematical model to ensure the security against multiple eavesdroppers. This mathematical model has been developed based on the closed-form analytical expressions of the probability of non-zero secrecy multicast capacity (PNSMC) and the secure outage probability for multicasting (SOPM) to ensure the security in the presence of multiple eavesdroppers. Moreover, the effects of the fading parameter of multicast channel, the number of hops and eavesdropper are investigated. The results show that the security in multicasting through Nakagami-m fading channel with multi-hop relaying system is more sensitive to the number of hops and eavesdroppers. The fading of multicast channel helps to improve the secrecy multicast capacity and is not the enemy of security in multicasting.

A QoS Mobicast-based dynamic clustering secure multicast scheme for large-scale tracking sensornets

Most of the existing security Mobicast routing protocols are not suitable for the monitoring applications with higher quality of service （QoS） requirement. A QoS dynamic clustering secure multicast scheme （QoS-DCSMS） based on Mobicast and multi-level IxTESLA protocol for large-scale tracking sensornets is presented in this paper. The multicast clusters are dynamically formed according to the real-time status of nodes, and the cluster-head node is responsible for status review and certificating management of cluster nodes to ensure the most optimized QoS and security of multicast in this scheme. Another contribution of this paper is the optimal QoS security authentication algorithm, which analyzes the relationship between the QoS and the level Mofmulti-level oTESLA. Based on the analysis and simulation results, it shows that the influence to the network survival cycle （＇NSC） and real-time communication caused by energy consumption and latency in authentication is acceptable when the optimal QoS security authentication algorithm is satisfied.

SECURE GROUP COMMUNICATIONS FOR LARGE DYNAMIC MULTICAST GROUP

As the major problem in multicast security, the group key management has been the focus of research But few results are satisfactory. In this paper, the problems of group key management and access control for large dynamic multicast group have been researched and a solution based on SubGroup Secure Controllers (SGSCs) is presented, which solves many problems in IOLUS system and WGL scheme.

A MULTICAST KEY MANAGEMENT SCHEME BASED ON CHARACTERISTIC VALUES OF MEMBERS

A new collusion attack on Pour-like schemes is proposed in this paper. Then, we present a collusion-free centralized multicast key management scheme based on characteristic values of members. The re-keying method that other group members calculate new keys when a member is joining or leaving is also designed. It achieves forward secrecy and backward secrecy. Compared with typical existing centralized schemes, the storage of Group Key Controller (GKC) in our scheme halves the storage overhead of others, and communication overhead of GKC is 2 in case of joining re-keying. Especially, the leaving re-keying overhead is and the overall performance is excellent.

A Research on Improvement of Hadoop Security Mechanism

. Hadoop, as an open-source cloud computing framework, is increasingly applied in many fields, while the weakness of security mechanism now becomes one of the main problems hindering its development. This paper first analyzes the current security mechanisms of Hadoop, then through study of Hadoop＇s security mechanism and analysis of security risk in its current ~,ersion, proposes a corresponding solution based on secure multicast to resovle the security risks. All these could provide certain technical supports for the enterprises in their Hadoop applications with new security needs.

Opportunistic Relaying Technique over Rayleigh Fading Channel to Improve Multicast Security

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.

Enhancement of Multicast Security with Opportunistic Relaying Technique over κ-μ Shadowed Fading Channels

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.

Enhancing Security in Multicellular Multicast Channels Reducing Interference Power with the Best Relay Selection

The capacity of wireless networks is fundamentally limited by interference. A few research has focused on the study of the simultaneous effect of interference and correlation, and less attention has been paid to the topic of canceling simultaneous effect of interference and correlation until recently. This paper considers a secure wireless multicasting scenario through multicellular networks over spatially correlated Nakagami-m fading channel in the presence of multiple eavesdroppers. Authors are interested to protect the desired signals from eavesdropping considering the impact of perfect channel estimation (PCE) with interference and correlation. The protection of eavesdropping is also made strong reducing the simultaneous impact of interference and correlation on the secrecy multicast capacity employing opportunistic relaying technique. In terms of the signal-to-interference plus noise ratio (SINR), fading parameter, correlation coefficient, the number of multicast users and eavesdroppers and the number of antennas at the multicast users and eavesdroppers, the closed-form analytical expressions are derived for the probability of non-zero secrecy multicast capacity and the secure outage probability for multicasting to understand the insight of the effects of aforementioned parameters. The results show that the simultaneous effects of correlation and interference at the multicast users degrade security in multicasting. Moreover, the security in multicasting degrades with the intensity of fading and the number of multicast users, eavesdroppers and antennas at the eavesdroppers. The effects of these parameters on the security in multicasting can be significantly reduced by using opportunistic relaying technique with PCE. Finally, the analytical results are verified via Monte-Carlo simulation to justify the validity of derived closed-form analytical expressions.

Security in Multicast Over α-μ Fading Channels with Orthogonal Frequency Division Multiplexing

The orthogonal space-frequency block coding (OSFBC) with orthogonal frequency division multiplexing (OFDM) system reduces complexity in the receiver which improves the system performance significantly. Motivated by these advantages of OSFBC-OFDM system, this paper considers a secure wireless multicasting scenario through multiple-input multiple-output (MIMO) OFDM system employing OSFBC over frequency selective α-μ fading channels. The authors are interested to protect the desired signals from eavesdropping considering the impact of the number of multicast users and eavesdroppers, and the fading parameters α and μ. A mathematical model has been developed based on the closed-form analytical expressions of the probability of non-zero secrecy multicast capacity (PNSMC) and the secure outage probability for multi-casting (SOPM) to ensure the security in the presence of multiple eaves-droppers. The results show that the security in MIMO OSFBC OFDM system over α-μ fading is more sensitive to the magnitude of α and μ and this effect increases in the high signal-to-noise ratio (SNR) region of the main channel.

Enhancing Security in Correlated Nakagami-m Fading Cellular Network Using SC and SSC Diversity Combining

The effect of correlated fading reduces the performance gain in multi-antenna communications. Diversity combining is a well-known technique to reduce the effect of correlation. But still, it is an open problem to quantify as the diversity scheme is more efficient in enhancing the security of cellular multicast network mitigating the effects of correlation. Motivated by this issue, this paper considers a secure wireless multicasting scenario through correlated cellular networks in the presence of multiple eavesdroppers. The selection combining (SC) and switch and stay combining (SSC) techniques are considered in dual arbitrarily correlated Nakagami-m fading channels. The closed-form analytical expressions for the probability of non-zero secrecy multicast capacity and the secure outage probability for multicasting are derived to understand the insight into the effects of correlation on the SC and SSC diversity schemes and to quantify which diversity scheme is more efficient in enhancing the security of correlated multicast networks. The results show that, although the diversity gain reduces the effect of correlation, the diversity gain provided by the SC diversity scheme is more significant in mitigating the effect of correlation compared to the SSC diversity scheme. Due to the selection mechanism of SC diversity, it is more sensitive to the change of SNR of the eavesdropper’s channel compared to the case of the SSC diversity scheme.

Minimum Exact Cover Problem of Group Key Distribution

Secure group communications are restrained by the number of the group size, number of changes and their distribution, all existing works do not meet the commands of applications with large group size and high dynamic members. In this paper, minimum exact cover problem for group key distribution （GMECP） is presented, and a heuristic solution is testified. Then an algorithm of batch rekeying with renewing cost tending to zero is illustrated, which can process any large number of change requests with best security guaranteed. Efficiency analysis and simulation test show that the achievement can improve the efficiency of any tree-based group key management.