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.

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.

An Efficient and Reliable Multicasting for Smart Cities

The Internet of thing(IoT)is a growing concept for smart cities,and it is compulsory to communicate data between different networks and devices.In the IoT,communication should be rapid with less delay and overhead.For this purpose,flooding is used for reliable data communication in a smart cities concept but at the cost of higher overhead,energy consumption and packet drop etc.This paper aims to increase the efficiency in term of overhead and reliability in term of delay by using multicasting and unicasting instead of flooding during packet forwarding in a smart city using the IoT concept.In this paper,multicasting and unicasting is used for IoT in smart cities within a receiver-initiated mesh-based topology to disseminate the data to the cluster head.Smart cities networks are divided into cluster head,and each cluster head or core node will be responsible for transferring data to the desired receiver.This protocol is a novel approach according to the best of our knowledge,and it proves to be very useful due to its efficiency and reliability in smart cities concept because IoT is a collection of devices and having a similar interest for transmission of data.The results are implemented in Network simulator 2(NS-2).The result shows that the proposed protocol shows performance in overhead,throughput,packet drop,delay and energy consumption as compared to benchmark schemes.

MINIMUM-PHASE FIR PRECODER DESIGN FOR MULTICASTING OVER MIMO FREQUENCY-SELECTIVE CHANNELS

To maximize the throughput of frequency-selective multicast channel, the minimum-phase Finite Impulse Response (FIR) precoder design is investigated in this paper. This problem can be solved in two steps. Firstly, we focus on designing a nonminimum-phase FIR precoder under the criterion of maximizing the throughput, and develop two efficient algorithms for the FIR precoder design from perspectives of frequency domain and time domain. In the second step, based on the theory of spectral factorization, the nonminimum-phase FIR precoder is transformed into the corresponding minimum-phase FIR precoder by a classic iterative algorithm without affecting the throughput. Numerical results indicate that the achievable rate of the proposed design has remarkable improvement over that of existing schemes, moreover, the group delay introduced by the FIR precoder is minimized.

Reliable Battery-Aware Cooperative Multicasting for MBS WiMAX Traffic

Recently, relay agents selection schemes were introduced to support downlink multicasting in WiMAX single frequency networks. Such schemes were devised to work cooperatively in order to facilitate reliable Multicast Broadcast Multimedia Services (MBMS) traffic delivery over wireless channels without any consideration to mobile relay agents’ battery energy levels. In this paper, we introduce a battery-aware balancing algorithm to operate in conjunction with these relay agents selection schemes proposed in the open literature. A simulation model, used to present the effect of “before” and “after” the battery–awareness selection criterion, highlighted the benefit of using such algorithms in prolonging network lifetime with emphasis on reliable delivery.

Elastic Resource Allocation for Multi-Granularity Multicasting Traffic in OFDM-Based Optical Networks

With the increasing requirements of the multicast services in the whole data traffic service, the optical multicast technology becomes a key technology supporting wide bandwidth and high speed multicasting communication. The transmission efficiency, capacity and robustness of optical multicast network can be further improved by introducing network coding technology into optical multicast networks. Meanwhile, facing to demand of emerging rate-variable multi-granularity multicast service, a multi-path transmission scheme based on network coding for routing and spectrum allocation (RSA) is proposed. It can not only allocate spectrum resources effectively and flexibly for various-rate multicast traffic, but also balance the network load, improve network throughput and reduce transmission blocking rate. In this paper, RSA problem is decomposed into two subproblems, namely routing allocation based on network coding and spectrum allocation based on maximum spectrum first (MSF) strategy, which are solved sequentially. Simulation experiments are carried out to analyze transmission performance with proposed RSA scheme. The simulation results show that the proposed RSA mechanism can allocate spectrum resources efficiently and flexibly for multi-granularity multicast traffic. Compared with RSA schemes based on shortest path tree (SPT) and minimal spanning tree (MST), the proposed RSA scheme is more efficient for spectrum resource utilization and load balancing, and spectrum resource is saved more than 20%.

An adaptive joint source and channel coding scheme for H.264 video multicasting over wireless LAN

This paper proposes an adaptive joint source and channel coding scheme for H.264 video multicast over wireless LAN which takes into account the user topology changes and varying channel conditions of multiple users, and dynamically allocates available bandwidth between source coding and channel coding, with the goal to optimize the overall system performance. In particular, source resilience and error correction are considered jointly in the scheme to achieve the optimal performance. And a channel estimation algorithm based on the average packet loss rate and the variance of packet loss rate is proposed also. Two overall performance criteria for video multicast are investigated and experimental results are presented to show the improvement obtained by the scheme.

Effective multicasting algorithm for dynamic membership with delay constraint

This paper proposes an effective heuristic algorithm The tree constructed by DDMR has the following characteristics： for dynamic multicast routing with delay-constrained DDMR. （1） multicast tree changes with the dynamic memberships; （2） the cost of the tree is as small as possible at each node addition/removal event; （3） all of the path delay meet a fixed delay constraint; （4） minimal perturbation to an existing tree. The proposed algorithm is based on “damage” and “usefulness” concepts proposed in previous work, and has a new parameter bf（Balancing Factor） for judging whether or not to rearrange a tree region when membership changes. Mutation operation in Genetic Algorithm （GA） is also employed to find an attached node for a new adding node. Simulation showed that our algorithm performs well and is better than static heuristic algorithms, in term of cost especially.

Optimal power allocation for a video layered multicasting relay strategy in cellular system

Within a cell of cellular system,cooperative relay technique can improve the performance of multicast efficiently,but it can cause the stream frequent interruptions because of the mobility of relay terminals.A video layered cooperative relay strategy is proposed to guarantee the continuity of multicast stream and retain high-bandwidth of the cooperative relay channel.Based on the capacity analysis for layered relay channel in the strategy,the optimal power allocation is studied to maximize capacity.After analyzing and optimizing the capacity in abstract models,the study is extended to a non-fading and a Gaussian wireless channel model to satisfy the scenario of cellular system.Giving the relay nodes position or distribution of noise power,the obtained results can determine the optimal power allocation among the transmitter and relay nodes.At last,the simulation results show that the strategy and its optimal power allocation have a significant improvement on the performance.

A Multi-objective QoS Optimization with Fuzzy Based Parameter Setting for Real-Time Multicasting

We propose a multi-objective Pareto-optimal technique using Genetic Algorithm (GA) for group communication, which determines a min-cost multicast tree satisfying end-to-end delay, jitter, packet loss rate and blocking probability constraints. The model incorporates a fuzzy-based selection technique for initialization of QoS parameter values at each instance of multicasting. The simulation results show that the proposed algorithm satisfies on-demand QoS requirements (like high availability, good load balancing and fault-tolerance) made by the hosts in varying topology and bursty data traffic in multimedia communication networks.

Algorithm for Delay-Constrained Minimal Cost Group Multicasting

Group multicast routing algorithms satisfying quality of service requirements of real-time applications are essential for high-speed networks. A heuristic algorithm was presented for group multicast routing with bandwidth and delay constrained. A new metric was designed as a function of available bandwidth and delay of link. And source-specific routing trees for each member were generated in the algorithm by using the metric, which satisfy member′s bandwidth and end-to-end delay requirements. Simulations over random network were carried out to compare the performance of the proposed algorithm with that from literature.Experimental results show that the algorithm performs better in terms of network cost and ability in constructing feasible multicast trees for group members. Moreover,the algorithm can avoid link blocking and enhance the network behavior efficiently.

Multichannel wavelength multicasting for two QPSK signals based on FWM in SOA

We experimentally demonstrate multichannel wavelength multicasting for two nonreturn-to-zero quadrature phase-shift keying （NRZ-QPSK） channels based on four-wave mixing （FWM） in semiconductor optical amplifier （SOA）. Through the interaction with the two pumps in SOA, the input two 25 Gb/s NRZ-QPSK channels are successfully simultaneously multicast to five and two new wavelengths, respectively. All the multicast channels are with a power penalty less than 2.5 dB at a bit error rate （BER） of 10^- 3. A characterization of the system performance using conversion efficiency and BER as figures-of-merit in terms of pump and signal powers is also presented. The results indicate that the pump and signal powers can be optimized to eliminate the introduced deleterious nonlinear components. The wavelengths of the two NRZ-QPSK channels and the two pumps need to be specified to avoid the crosstalk induced by high-order FWM.

QPSK wavelength multicasting based on four-wave mixing in semiconductor optical amplifier

We experimentally demonstrate one-to-five quadrature phase-shift keying（QPSK） wavelength multicasting based on four-wave mixing in bulk semiconductor optical amplifier. The input 25 Gb/s nonreturn-to-zero QPSK signal is successfully multicast to five new wavelengths with all information preserved. All the multicast channels are with a power penalty less than 1.1 d B at a bit error rate（BER） of 10-3. A characterization of the conversion efficiency in terms of pump and signal powers using the BER as figure of merit is also presented, the results indicate that the pump and signal powers should be optimized to eliminate the introduced deleterious nonlinear components.

Multimedia Conferencing System and Multicasting

The multimedia conferencing system is an important tool for Computer supported Cooperative Work (CSCW), and also one of the basic techniques supporting team work in the Concurrent Engineering. In this paper the architecture and function modules of the reported multimedia conferencing system are described. Then in order to reduce the network bandwidth required by the conferencing system, two methods for sending the conferencing data by using multicasting are discussed.

Service-Oriented Wireless Multimedia Multicasting with Partial Frequency Reuse

Service-Oriented Architecture（SOA） is employed in a wide range of applications because it promises to expose computation-intensive tasks as services and combine them with new applications to accelerate their applications development process. For service-oriented multimedia applications, the performance of multicasting transmission services under multimedia traffic must be evaluated. Multiview Video（MVV） is a promising and emerging type of multimedia traffic that consists of multiple video streams, allows stream switching, and requires strict Quality-of-Service（Qo S）. In this study, we investigated multicast transmission of MVV in wireless cellular networks with Partial Frequency Reuse（PFR） and focused on two challenging problems：（1） multicast group formation and（2） subchannel and power allocation. Initially, we propose a novel Content-based Partial frequency reuse Diversity Grouping（CPDG） scheme to allocate users to multicast groups on the basis of Partial frequency reuse Diversity（PD） in wireless networks with PFR. After group formation, an optimization problem for subchannel and power allocation is formulated to minimize network power consumption under Qo S constraint. Thereafter,the optimization problem is divided into two subproblems and solved using simplex method and Karush-KuhnTucker（KKT） condition. Finally, to solve the optimization problem, a suboptimal scheme referred to as Partial frequency reuse Diversity Based Energy-efficient Multicasting（PDEM） is proposed by dynamically allocating wireless resources under Qo S constraint. The simulation results show that the proposed PDEM scheme can achieve close-to-optimal performance. Moreover, mathematical analysis of the effect of PD on network performance can provide guidelines for optimization of multimedia traffic in multicasting-enabled wireless cellular networks with PFR.

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.

An Approach to Support IP Multicasting in Networkswith Mobile Hosts

it is an efficient way for a mobile host to obtain multicast servicevia a local multicast router on the visited network. However, there is a possibilityfor a temporary disruption of multicast service due to the join latency and otherissues in handoff procedure. This paper proposes a scheme to solve such a problem.A smooth handoff mechanism is introduced to avoid unnecessary data loss. Besides,any mobility agent capable of multicast can be appointed to provide service to mobile hosts, which makes it possible to deploy the protocol widely. Discrete-eventsimulations were conducted to survey the performance of the proposed scheme. Thesimulation results show that the scheme has better performance than the comparedapproaches.

Fault-Tolerant Tree-Based Multicasting in Mesh Multicomputers

We propose a fault-tolerant tree-based multicast algorithm for 2-dimensional (2-D) meshes based on the concept of the extended safety level which is a vector associated with each node to capture fault information in the neighborhood. In this approach each destination is reached through a minimum number of hops. In order to minimize the total number of traffic steps, three heuristic strategies are proposed. This approach can be easily implemented by pipelined circuit switching (PCS). A simulation study is conducted to measure the total number of traffic steps under different strategies. Our approach is the first attempt to address the fault- tolerant tree-based multicast problem in 2-D meshes based on limited global information with a simple model and succinct information.

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.