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.

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 distributed on-demand bandwidth-constrained multicast routing protocol for wireless ad hoc networks

To meet the bandwidth requirement for the multicasting data flow in ad hoc networks, a distributed on- demand bandwidth-constrained multicast routing （BCMR） protocol for wireless ad hoc networks is proposed. With this protocol, the resource reservation table of each node will record the bandwidth requirements of data flows, which access itself, its neighbor nodes and hidden nodes, and every node calculates the remaining available bandwidth by deducting the bandwidth reserved in the resource reservation table from the total available bandwidth of the node. Moreover, the BCMR searches in a distributed manner for the paths with the shortest delay conditioned by the bandwidth constraint. Simulation results demonstrate the good performance of BCMR in terms of packet delivery reliability and the delay. BCMR can meet the requirements of real time communication and can be used in the multicast applications with low mobility in wireless ad hoc networks.

Max-Min Fair RIS-Aided Rate-Splitting Multiple Access for Multigroup Multicast Communications

Rate-splitting multiple access(RSMA)can cope with a wide range of propagation conditions in multigroup multicast communications through rate splitting optimization.To breakthrough the grouprate limited bottleneck,reconfigurable intelligent surface(RIS)technique can be introduced to assist wireless communications through enhancing the channel quality.In RIS-aided RSMA multigroup multicasting,how to provide fair and high-quality multiuser service under power and spectrum constraints is essential.In this paper,we propose a max-min fair RIS-aided rate-splitting multiple access(MMF-RISRSMA)scheme for multigroup multicast communications,where the rate fairness is obtained by maximizing the minimum group-rate.In doing so,we jointly optimize the beamformers,the rate splitting vector at the transmitter,as well as the phase shifts at RIS.To solve it,we divide the original optimization problem into two subproblems and alternately optimize the variables.The beamforming and rate splitting optimization subproblem is solved by using the successive convex approximation technique.The phase shift optimization subproblem is solved through the penalty function method to achieve a rank-one locally optimal solution.Simulations demonstrate that the proposed MMF-RIS-RSMA scheme can obtain significant performance gain in terms of the minimum group-rate.

Coded Multicasting for Content Delivery over Predictable Time-Varying Satellite Communication Networks

With the development of astronautic technology, communication satellites now have a tremendous gain in both quantity and quality, and have already shown their capability on multi-functional converged communication other than telecommunication. Under this circumstance, increasing the transmission efficiency of satellite communication network becomes a top priority. In this paper, we focus on content delivery service on satellite networks, where each ground station may have prefetched some file fragments. We cast this problem into a coded caching framework so as to exploit the coded multicast gain for minimizing the satellite communication load. We first propose an optimization-based coded multicast scheme by considering the special property that the satellite network topology is predictable and timevariant. Then, a greedy based fast algorithm is proposed, which can tremendously reduce the computation complexity with a small loss in optimality. Simulation experiments conducted on two Walker constellation satellite networks show that our proposed coded multicast method can efficiently reduce the communication load of satellite networks.

Application Layer Multicast Model with Low Delay and High Stability

As an alternative of Internet protocol(IP)multicast,application layer multicast(ALM)is widely used with the advantage of simplicity and flexibility.However,the existing problems of large transmission delay and poor stability limit the application and development.In this article,to solve these problems,an ALM model based on node potential(NP)and topological index(TI)is proposed.The proposed model considers the factors of node capability and node distance in constructing and maintaining multicast tree to reduce transmission delay and increase stability,and thus it improves the application level in real-time multimedia multicast.The computer simulations prove that the proposed model reduces the ALM transmission delay,increases multicast tree stability effectively,and improves the ALM performance,and therefore it is suitable to apply in large-scale real-time multimedia environment.

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.

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.

Generation of Low-Delay and High-Stability Multicast Tree

Delay and stability are two key factors that affect the performance of multicast data transmission in a network.However,current algorithms of tree generation hardly meet the requirements of low delay and high sta-bility simultaneously.Given a general network,the generation algorithm of a multicast tree with minimum delay and maximum stability is an NP-hard problem,without a precise and efficient algorithm.To address these challenges,this paper studies the generation of low-delay and high-stability multicast trees under the model of spanning tree based on stability probability,degree-constrained,edge-weighted for multicast(T-SDE).A class of algorithms was proposed which creates the multicast tree greedy on the ratio of fan-out to delay(RFD)and probability of stability of terminal to obtain a high performance in multicast.The proposed algorithms greedily select terminals with a large RFD and a high probability of stability as forwarding nodes in the generation of the multicast tree,where the larger RFD and higher stability of upstream nodes are beneficial to achieve a low transmission delay and high stability in multicast.The proposed RFD can be compatible with the original model,which can take advantage of network connectivity during the generation of a multicast tree.This paper carries out simulation experiments on Matlab R2016b to measure the performance of the proposed algorithm.Experimental results show that the proposed algorithm can provide a smaller height,higher stability,and a lower transmission delay of the resulting multicast tree than other solutions.The spanning tree of the proposed algorithms can support low transmission delay and high stability in multicast transmission.

Analysis and Taxonomy of Congestion Control Mechanisms for Internet Reliable Multicast

The research of congestion control for Internet reliable multicast is one of the most active fields in reliable multicast protocol research. Many reliable multicast congestion control mechanisms have been put forward. In this paper we present principal problems of congestion control for Internet reliable multicast, analyze solutions and difficulties of solving these problems, and then give a classification of some reliable multicast congestion control mechanisms. Lastly the future work is proposed.

Distributed QoS-aware source-specific multicast routing protocol

A distributed QoS (quality of service) -aware source-specific multicast routing protocol—DQSSMR is proposed to increase the successful join ratio and lower the overhead of the control message in QoS required multicast routing. By an improved searching strategy, the cost of message control is reduced and the successful join ratio is increased. The network load is balanced due to the distributed routing operation and the scalability is enhanced further because of the usage of SSM (source- specific multicast) service model in DQSSMR. The analysis results indicate that DQSSMR performs as expected.

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.

Programming Technology of IP Multicast and Broadcast Based on Socket

Beginning with the simple introduction of socket which is the most commonly used application program interfaces in UNIX/LINUX communication domain, the concrete programming procedures to realize multicast and broadcast based on socket is provided, according to TCP/IP protocol in LINUX system. The acquiring and converting of broadcast destination address and multicast address, the setting of multicast options, the joining in and withdrawing from the multicast group, and the receiving and sending of datagram are all demonstrated in it, the related system calls and simple explication of C programming are also included.

D2D Multicast Retransmission Algorithm in Mobile Cloud Based on SINR Constraint

In cellular network, users with same demand and in proximity to each other form the mobile cloud, in which the short-range D2 D technology is employed by users to improve the data dissemination efficiency. In view of the fact that the D2 D links with the poor channel conditions are likely to be the bottleneck of resource utilization improvement, aiming at the differentiation of link quality, this paper proposes a intra-cloud D2 D multicast retransmission algorithm based on SINR constraint to meet the minimum requirement of D2 D retransmission for Qo S. In the proposed algorithm, the model of system link cost is built, the number of multicast retransmission times is restricted and each link quality matrix is traversed to reasonably select the multicast transmitter as well as its routing, which further reduces the link cost consumption, and in turn improves the bandwidth efficiency. Simulation results show that the proposed algorithm is more efficient to improve the bandwidth utilization when the ratio between normal user and non-normal user is small in mobile cloud.

IP MultiCast技术在远程教学系统中的应用

介绍了一种先进的远程教学系统及系统所实现的各部分功能 ,着重介绍了IPMultiCast技术以及这种技术在音频 。

Clustering and Resource Allocation Strategy for D2D Multicast Networks with Machine Learning Approaches

In this paper,the clustering and resource allocation problem in device-to-device(D2D)multicast transmission underlay cellular networks are investigated.For the sake of classifying D2D users into different D2D multicast clusters,a hybrid intelligent clustering strategy(HICS)based on unsupervised machine learning is proposed first.By maximizing the total energy efficiency of D2D multicast clusters,a joint resource allocation scheme is then presented.More specifically,the energy efficiency optimization problem is constructed under the quality of service(QoS)constraints.Since the joint optimization problem is non-convex,we transform the original problem into a mixed-integer programming problem according to the Dinkelbach algorithm.Furthermore,to avoid the high computational complexity inherent in the traditional resource allocation problem,a Q-Learning based joint resource allocation and power control algorithm is proposed.Numerical results reveal that the proposed algorithm achieves better energy efficiency in terms of throughput per energy consumption.

Secure Multigroup Multicast Communication Systems via Intelligent Reflecting Surface

This paper considers a secure multigroup multicast multiple-input single-output(MISO)communication system aided by an intelligent reflecting surface(IRS).Specifically,we aim to minimize the transmit power at Alice via jointly optimizing the transmit beamformer,artificial noise(AN)vector and phase shifts at the IRS subject to the secrecy rate constraints as well as the unit modulus constraints of IRS phase shifts.To tackle the optimization problem,we first transform it into a semidefinite relaxation(SDR)problem,and then alternately update the transmit beamformer and AN matrix as well as the phase shifts at the IRS.In order to reduce the high computational complexity,we further propose a low-complexity algorithm based on second-order cone programming(SOCP).We decouple the optimization problem into two sub-problems and optimize the transmit beamformer,AN vector and the phase shifts alternately by solving two corresponding SOCP subproblem.Simulation results show that the proposed SDR and SOCP schemes require half or less transmit power than the scheme without IRS,which demonstrates the advantages of introducing IRS and the effectiveness of the proposed methods.

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.

ZTE's IP Multicast Technology

The multicast technology is an integration of a series of multicast protocols and a set of corresponding control management models, authentications and billing methods. It has its unique advantages in one-to-many and many-to-many multimedia service applications. The network-wide multicast technology is based on a series of multicast-related protocols. This article introduces multicast protocols and technologies used in ZTE' s data products in terms of application environments. Moreover, it discusses ZTE's solution to multicast's controllability, manageability, security, operability and the added values the solution brought.

Quantum multicast schemes of different quantum states via non-maximally entangled channels with multiparty involvement

Due to the unavoidable interaction between the quantum channel and its ambient environment,it is difficult to generate and maintain the maximally entanglement.Thus,the research on multiparty information transmission via non-maximally entangled channels is of academic value and general application.Here,we utilize the non-maximally entangled channels to implement two multiparty remote state preparation schemes for transmitting different quantum information from one sender to two receivers synchronously.The first scheme is adopted to transmit two different four-qubit cluster-type entangled states to two receivers with a certain probability.In order to improve success probabilities of such multicast remote state preparation using non-maximally entangled channels,we put forward the second scheme,which deals with the situation that is a synchronous transfer of an arbitrary single-qubit state and an arbitrary two-qubit state from one sender to two receivers.In particular,its success probability can reach 100%in principle,and independent of the entanglement degree of the shared non-maximally entangled channel.Notably,in the second scheme,the auxiliary particle is not required.