Multicast Receivers Research Articles

QoS-Based Parallel GRASP Algorithm for RP Selection in PIM-SM Multicast Routing and Mobile IPv6

On account the progress of network multimedia technology, more and more real-time multimedia applications arrive with the need to transmit information using multicast IP communication. These applications are more important with arrival of mobile IPv6 protocol with mobile members and require a multicast routing protocol which has packets arriving to members within a specified QoS guaranteed and a quick recovery mechanism. Multicast IP is a bandwidth-conserving technology that reduces traffic by simultaneously delivering a single stream of information to a group members. Internet research community has proposed many multicast routing protocols to support efficient multimedia application, expect that they were developed for multicast parties whose members are topologically stationary. The mobility of multicast receivers or senders may lead to serious problems, when a receiver or sender moves, the quality of full multicast tree may degrade hens multicast datagrams cannot be forwarded efficiently.D2V-RPM (delay and delay variation RP Manager) problem consist of choosing an optimal multicast router in the network as the root of the Shared RP Tree within a specified delay and delay variation bound, and recovering this RP if it’s off optimal. This NP hard problem needs to be solved through a heuristic algorithm. In this paper we propose a new RP Management algorithm based on PGRAS Procedure. 2DV-PGRASP-RPM selects and recovers the RP by considering cost, delay and delay variation functions and can be easily integrated to bootstrap RP protocol used by PIM-SM protocol. Simulation results show that good performance is achieved in multicast cost.

A novel multicast routing method with minimum transmission for WSN of cloud computing service

As we know, multicast communication of industrial application is an effective way to save energy, bandwidth, cost and other resources in wireless sensor networks (WSN); a novel multicast routing method with minimum transmission for WSN of Industrial application is presented in this paper. We analyze the causes of uncertain information in WSN of Industrial application due to random load, information fusion or other impact factors. In terms of these random cases, we establish a transmission model of industrial application and present a new heuristic distributed minimum transmission multicast routing algorithm for WSN. Using the offset back-off scheme and taking advantage of the broadcast characteristic of wireless communication, our algorithm chooses the forwarding routes which can connect more multicast receivers. We conduct extensive evaluations to study the performance of the proposed algorithm and compare it with the existing methods. Simulation results demonstrate that our method effectively improves the efficiency of multicast routing; the advantage and novelty of the approach suggested is in saving energy by minimizing bandwidth, delay and the number of transmissions.

A media access and feedback protocol for reliable multicast over wireless channel

A link level reliable multicast requires a channel access protocol to resolve the collision of feedback messages sent by multicast data receivers. Several deterministic media access control protocols have been proposed to attain high reliability, but with large delay. Besides, there are also protocols which can only give probabilistic guarantee about reliability, but have the least delay. In this paper, we propose a virtual token-based channel access and feedback protocol (VTCAF) for link level reliable multicasting. The VTCAF protocol introduces a virtual (implicit) token passing mechanism based on carrier sensing to avoid the collision between feedback messages. The delay performance is improved in VTCAF protocol by reducing the number of feedback messages. Besides, the VTCAF protocol is parametric in nature and can easily trade off reliability with the delay as per the requirement of the underlying application. Such a cross layer design approach would be useful for a variety of multicast applications which require reliable communication with different levels of reliability and delay performance. We have analyzed our protocol to evaluate various performance parameters at different packet loss rate and compared its performance with those of others. Our protocol has also been simulated using Castalia network simulator to evaluate the same performance parameters. Simulation and analytical results together show that the VTCAF protocol is able to considerably reduce average access delay while ensuring very high reliability at the same time.

Exploiting Multichannel Diversity for Cooperative Multicast in Cognitive Radio Mesh Networks

Cognitive radio networks (CRNs) have emerged as a promising, yet challenging, solution to enhance spectrum utilization, thanks to the technology of cognitive radios. A well-known property of CRNs is the potential heterogeneity in channel availability among secondary users. Therefore, multicast throughput in CRNs may suffer from significant degradation because of this property since a link-level broadcast of a frame may only reach a small subset of destinations that are able to receive on the same channel. This may necessitate multiple sequential transmissions of the same frame by the source on different channels to guarantee delivery to all receivers in the destination set. In case of high data generation rate, delivery delay will be high due to the repeated transmissions by the source. In this paper, we propose an assistance strategy to reduce the effect of the channel heterogeneity property on the multicast throughput in cognitive radio wireless mesh networks (CR-WMNs). This assistance strategy is composed of two main activities: first, allowing multicast receivers to assist the source in delivering the data, and second, allowing the transmission of coded packets so that multicast receivers belonging to different multicast groups can decode and extract their data concurrently. Results show that the proposed assistance paradigm reduces multicast time and increases throughput significantly.

A Multicast Algorithm for Wireless Sensor Networks Based on Network Coding

We propose a set of distributed algorithms for improving the multicast throughput in wireless sensor networks. To this end, network coding is applied when exploiting path diversity with two disjoint paths to each multicast group receiver. We depart from the traditional wisdom that the multicast topology from source to receivers needs to be a tree and propose a novel and distributed algorithm to construct a 2-redundant multicast graph (a directed acyclic graph) as the multicast topology, on which network coding is applied. We conduct both analytical and simulation-based studies to evaluate the effectiveness and performance of our algorithm.

Effective Interference Cancellation Schemes for Device-to-Device Multicast Uplink Period Underlaying Cellular Networks

Device-to-Device (D2D) multicast will become an important technology with the increasing requirements of local communication services in future networks. To increase the overall capacity and improve resource utilization, a novel interference coordination scheme is proposed. The proposed scheme includes three steps. First, in order to mitigate the interference from D2D multicast transmission to cellular networks (CNs), a dynamic power control scheme is proposed that can determine the upper bound of D2D transmitter power based on the location of Base Station and areas of adjacent cells from the coverage area of D2D multicast group. Next, an interference limited area control scheme that reduces the interference from CNs to each D2D multicast receiver is proposed. The proposed scheme does not allow the coexistence of cellular equipments (CUEs) located in the interference limited area to reuse the same resources as the D2D multicast group. Then two resource block (RB) allocation rules are proposed to select the appropriate RBs from a candidate RB set for D2D multicast group. From the simulation results, it is confirmed that the proposed schemes improve the performance of the hybrid system compared to the conventional ways.

Interference coordination schemes for cellular network assisted device-to-device multicast

In this paper, a multicast concept for device-to-device (D2D) communication underlaying a cellular infrastructure is investigated. To increase the overall capacity and improve resource utilization, a novel interference coordination scheme is proposed. The proposed scheme includes two steps. First, in order to mitigate the interference from D2D multicast transmission to cellular networks (CNs), a dynamic power control scheme is proposed that can determine the upper bound of D2D transmitter power based on the location of base station (BS) and areas of adjacent cells from the coverage area of D2D multicast group. Next, an interference limited area control scheme that reduces the interference from CNs to each D2D multicast receiver is proposed. The proposed scheme does not allow the coexistence of cellular user equipments (CUEs) located in the interference limited area to reuse the same resources as the D2D multicast group. From the simulation results, it is confirmed that the proposed schemes improve the performance of the hybrid system compared to the conventional ways.

Novel Branching-Router-Based Multicast Routing Protocol with Mobility Support

To cope with challenging problems faced by traditional multicast routing protocols, many branching-router (BR)-based multicast routing schemes with desirable features have been proposed. However, the current BR-based methods still lack efficient multicast management and suffer from a long join latency, leading to a disappointing mobility performance. In this paper, we propose a novel BR-based multicast architecture with a corresponding multicast routing protocol supporting multicast receiver mobility. In the proposed multicast architecture, a new management entity called multicast controller (MC) is used to handle most of the multicast management-related tasks, while other routers in the network construct a multicast tree according to the proposed Branching-Router-based Multicast routing protocol with Mobility support (BRMM). Besides, the fast handover of multicast service can be supported by BRMM through the pre-establishment of temporary multicast paths. Through extensive simulation and analysis, we show that BRMM outperforms existing protocols and has many other attractive features.

A Novel Prefix-Aggregation Based Distributed Management Scheme for PMIPv6

As a promising network-based mobility management protocol, Proxy Mobile IPv6 (PMIPv6) can provide the mobility support for the Mobile Node (MN) without any involvement of MN in mobility signaling. However, PMIPv6 supports the mobility management via centralized anchors, which leads to many obvious shortcomings, such as sub-optimal routing, scalability and single point of failure issue. Besides, it remains an open issue how to deal with the inter-domain handover for PMIPv6 while keeping optimal routing and low signaling costs as well as supporting multicast efficiently. In this paper, we propose a novel Prefix-Aggregation based Distributed Management Scheme for PMIPv6 (PA-DMSP), in which all the Local Mobility Anchors (LMAs) distributed in the extended home network are connected to each other via the global tunnel and announce their aggregated prefix to the Internet. By using the IP anycast routing, the signaling messages and data packets destined to any IP address that belongs to the aggregated prefix can be transmitted to the topologically closest LMA, which indicates that the optimized routing can always be achieved. Besides, the distributed LMA management scheme enables the inter-domain handover and eliminates the scalability and single point of failure issue. Moreover, PA-DMSP also proposes the multicast source mobility and receiver mobility support schemes. Our analysis verifies the better performance of PA-DMSP in terms of the signaling costs when compared with other baseline schemes. In addition, PA-DMSP can significantly improve the scalability in terms of reducing the number of LMA's routing entries.

Agent Driven Delay and Power Constrained Multicast Routing in Mobile Ad Hoc Networks by Using ANFIS

Group communication applications in Mobile Ad hoc NETworks (MANETs) require stringent bounds on Quality of Service (QoS) parameters. In this paper, we propose an agent driven QoS mesh based multicast routing scheme in MANET that satisfies the user requirements with good reasoning by using adaptive neuro-fuzzy inference system (ANFIS). Four types of agents are used in the scheme: Multicast administer, ANFIS, Route inventing and Guard agents. The proposed scheme operates in following steps. (1) ANFIS agent at the source node optimizes membership functions of QoS parameters according to the user QoS requirement. It also computes QoS factor for different combinations of parameter values from optimized membership functions. (2) Route inventing mobile agent carries the QoS requirement, set of parameter values and their corresponding QoS factors to reach multicast receivers through intermediate nodes by using selective flooding and agent cloning. Multicast administer agent (MAA) at the intermediate node decides its QoS satisfiability. (3) Route inventing mobile agents trace back the traversed path by marking QoS nodes. They facilitate MAA at the source node to construct QoS mesh between source and destinations. (4) MAA at the source node selects a shortest path to reach each of the multicast receivers from the constructed QoS mesh, and (5) Guard mobile agent is employed for the link/node failures and management of the group. Our proposed scheme performs better than fuzzy based, and autonomic QoS multicast routing schemes.

Effective Video Multicast Using SVC with Heterogeneous User Demands over TDMA-Based Wireless Mesh Networks

We provide an effective video multicast framework over time division multiple access (TDMA)-based wireless mesh networks (WMNs). Heterogeneous user demand is considered where each multicast receiver has its own video quality demand. In video multicasting, different relay nodes in the same multicast tree may have different transmission rates by utilizing scalable video coding (SVC). Considering this distinguishing characteristic of video multicasting, the proposed multicast framework provides effective multicast routing, scheduling, and rate allocation algorithms. The purpose of the multicast routing and scheduling is to obtain a minimum length schedule which satisfies given quality demands of receivers. If the schedule is not feasible even with its minimum length due to the limited number of time slots in the network, rate allocation algorithm adjusts the transmission rates of relay nodes to generate a feasible schedule. The algorithm is designed to maximize the minimum utility of multicast receivers. Simulation results show that the proposed multicast routing and scheduling algorithms outperform existing schemes in terms of schedule length. The minimum utility is improved up to 30 percent by the proposed rate allocation algorithm compared to the existing method.

Video multicast over WLANs: Power saving and reliability perspectives

Video streaming service via multicast is one promising technology for multimedia services over wireless local area networks. Given that many portable devices are battery-powered while video quality relies on the reliable delivery of video traffic, video multicast frames need to be reliably delivered to power-saving stations. In this article, we study video multicast from the power saving and reliability perspectives. The IEEE 802.11 standard allows multicast receivers to enable power management while receiving multicast frames. However, from measurements with several commercial WLAN devices, we observe that many devices are not standards- compliant, thus severely degrading video multicast performance when multicast receivers are in the power saving mode. We identify various standards-non-compliant malfunctions of both access points and stations, and then categorize these malfunctions. Meanwhile, the legacy 802.11 standard is known to support only unreliable multicast service due to the lack of retransmissions. We present various reliable multicast schemes including application layer forward error correction and reliable multicast protocols defined in the emerging IEEE 802.11v and 802.11aa, and comparatively evaluate them via simulations.

Reliable Buffering Management Algorithm Support for Multicast Protocol in Mobile Ad-hoc Networks

Multicasting is one of the relevant issues of communication in infrastructure or centralized administration networks. The reliable delivery of multicast data packets needs feedback from all multicast receivers to indicate whether a retransmission is necessary. A reliable multicast delivery in the wireless Ad-hoc network requires a multicast packet to be received by all multicast receiver nodes. Thus, one or all members need to buffer data packet for possible error recovery. Furthermore, different buffer strategies are essentially used in existing reliable multicast protocols towards support error recovery and reducing buffer overflow. This study proposed two algorithms to improve the performance of the source tree reliable multicast (STRM) protocol. The first algorithm was developed to avoid buffer overflow in the sender node as the forward server (FS) nodes of STRM. This reduction is achieved by managing the buffer of the FS nodes, i.e., selecting the FS nodes depending on its empty buffer size and reducing the feedback sent from the receiver nodes to their FS node. The second algorithm was developed to decrease duplicated packets in the multicast members of the local group, which may be achieved by sending the repair packets to the requesting member. The FS in the local group should create a dynamic and temporary subgroup whose members are only those that requested the repair packet retransmission. The algorithms were tested using detailed discrete event simulation models encompassing messaging systems including error, delay, and mobility models to characterize the performance benefits of the proposed algorithms compared with the existing wireless Ad-hoc network protocols. Several experiments were conducted, revealing numerous results that verify the superior performance of the proposed algorithms over the existing algorithms.

Pacifier: High-Throughput, Reliable Multicast Without “Crying Babies” in Wireless Mesh Networks

In contrast to unicast routing, high-throughput reliable multicast routing in wireless mesh networks (WMNs) has received little attention. There are two primary challenges to supporting high-throughput, reliable multicast in WMNs. The first is no different from unicast: Wireless links are inherently lossy due to varying channel conditions and interference. The second, known as the “crying baby” problem, is unique to multicast: The multicast source may have varying throughput to different multicast receivers, and hence trying to satisfy the reliability requirement for poorly connected receivers can potentially result in performance degradation for the rest of the receivers. In this paper, we propose Pacifier, a new high-throughput, reliable multicast protocol for WMNs. Pacifier seamlessly integrates four building blocks-namely, tree-based opportunistic routing, intraflow network coding, source rate limiting, and round-robin batching-to support high-throughput, reliable multicast routing in WMNs, while at the same time it effectively addresses the “crying baby” problem. Our experiments on a 22-node IEEE 802.11 WMN testbed show that Pacifier increases the average throughput over a state-of-the-art reliable network coding-based protocol MORE by up to 144%, while at the same time it solves the “crying baby” problem by improving the throughput of well-connected receivers by up to a factor of 14.

Using Orthogonal Channels for Supporting Multicast Service in Multi-channel Wireless Mesh Networks

Unlike wired networks, the capacity of a wireless network is interference limited due to the broadcast nature of wireless medium. Some multicast wireless network protocols do not consider channel assignment issue, that they cause interference at transmission nodes, hence do not use full capacity of the network. Interference can be reduced and throughput improved with the use of multichannel features. Therefore, this paper used orthogonal channels for sending and receiving nodes in the network. We propose EWM (Efficient Wireless Multicast) method that is distributed scheme for constructing multicast tree in multi-channel multi-interface wireless mesh networks (MIMC-WMN) which selects relay nodes and in distributed form assign orthogonal radio channels to them. To more decrease of interference in adding a branch to the tree, the route with minimum end-to-end delay from the source to the multicast receiver will be chosen. Thus, the tree is suitable for multimedia applicants. We also employ the broadcast nature of the wireless media to reduce the number of relay nodes. The proposed algorithm is compared with MCM algorithm in NS2.

Efficient OFDM-based WLAN-multicast with feedback aggregation, power control and rate adaptation

Feedback aggregation is an approach for repeat request protocols in which positive and negative feedback from multiple wireless stations is aggregated within a single time slot, during which negative acknowledgments (NACKs) from non-leader receivers may cancel positive acknowledgments (ACK) sent by the leader. This solves the problem of increased overhead with increasing number of receivers, and enables high rate audiovisual mediacast for large wireless multicast receiver groups. In this paper, we investigate feedback cancelation (jamming) failure rates, which in turn determine the performance of error correction protocols using feedback aggregation. We do so by simulation and measurement using a variable number of NACKs in i.i.d. fading scenarios. Our results apply to OFDM based wireless multicast and we show that multicast error performance and throughput can be tuned with ACK power control using consumer IEEE 802.11 hardware.

On Achieving Group-Strategyproof Multicast

In computer networks, multicast models a class of data dissemination applications, where a common data item is routed to multiple receivers simultaneously. The routing of multicast flows across the network may incur a cost, and such a cost is to be recovered from payments by receivers who enjoy the multicast service. In reality, a group of potential multicast receivers exist at different network locations. Each receiver has a valuation for receiving the multicast service, but such valuation is private information known to itself. A multicast scheme asks each potential receiver to report her valuation, then decides which subset of potential receivers to serve, how to route the multicast flow to them, and how much to charge each of them. A multicast scheme is stragegyproof if no receiver has incentive to lie about her true valuation. It is further group strategyproof if no group of colluding receivers has incentive to lie. We study multicast schemes that target group strategyproofness, in both directed and undirected networks. Our main results reveal that under group strategyproofness, a compromise is necessary in either routing optimality or budget balance. We also design multicast schemes that pursue maximum budget balance while guaranteeing group stragetyproofness and routing optimality.

Routing protocols to determine stable paths and trees using the inverse of predicted link expiration times for mobile ad hoc networks

The high-level contribution of this paper is the design and development of routing protocols to discover stable paths and trees for unicast and multicast communication based on the predicted link expiration times LETs of links in mobile ad hoc networks MANETs. Both of the stability-based unicast SILET and multicast MILET routing protocols discover routes through an on-demand request-reply cycle with a link weight being 1 plus the inverse of the LET of the link. The destination nodes and the multicast receiver nodes connect to the source node through paths that have the lowest sum of the link weights. The inclusion of a '1' in the link weight helps to minimise the hop count of the paths from the source node to each of the targeted end nodes of the communication session; the inclusion of the inverse of the LET in the path/tree optimisation function helps to maximise the path/tree lifetime. The proposed protocols effectively neutralise the stability-hop count tradeoff and are able to simultaneously maximise the path/tree lifetime and minimise the hop count per source-destination/source-receiver path. The performance of SILET and MILET has been extensively studied in the ns-2 simulator along with contemporary unicast and multicast routing protocols.

Fuzzy-controlled Power-aware Multicast Routing (FPMR) for Mobile Ad Hoc Networks

Ad hoc networks are highly dynamic networks where the nodes are battery-powered. Routing in such networks is an issue of upcoming concern due to the possibility of frequent link breakage as a result of node mobility and/or high rate of energy depletion of nodes. Also to fulfill certain quality parameters, presence of multiple node disjoint paths become essential. Such paths aid in the optimal traffic distribution and reliability in case of path breakages. In this paper we propose a fuzzy controlled power aware multicast routing (FPMR) protocol that takes into account estimated network evolution in terms of residual energy of nodes w.r.t. approximated energy required to complete the multicast operation, link stability, geographical positions of multicast receivers etc. Extensive simulation experiments have been conducted to compare the performance of FPMR with other state-of-the –art multicast protocols. The results w.r.t. a wide range of parameters show that FPMR attains significantly high packet delivery ratio at much lesser cost than its competitors, thereby improving the lifetime of nodes.

An adaptive and predictive approach for autonomic multirate multicast networks

Autonomic communications aim at easing the burden of managing complex and dynamic networks, and designing adaptive, self-turning and self-stabilizing networks to provide much needed flexibility and functional scalability. With the ever-increasing number of multicast applications made recently, considerable efforts have been focused on the design of adaptive flow control schemes for autonomic multicast services. The main difficulties in designing an adaptive flow controller for autonomic multicast service are caused by heterogeneous multicast receivers, especially those with large propagation delays, since the feedback arriving at the source is somewhat outdated and can be harmful to the control operations. To tackle the preceding problem, this article describes a novel, adaptive, and autonomic multicast scheme, the so-called Proportional, Integrative, Derivative plus Neural Network (PIDNN) predictive technique, which consists of two components: the Proportional Integrative plus Derivative (PID) controller and the Back Propagation BP Neural Network (BPNN). In this integrated scheme, the PID controllers are located at the next upstream main branch nodes of the multicast receivers, and have explicit rate algorithms to regulate the receiving rates of the receivers; while the BPNN is located at the multicast source, and predicts the available bandwidth of those longer delay receivers to compute the expected rates of the longer delay receivers. The ultimate sending rate of the multicast source is the maximum of the aforesaid receiving rates that can be accommodated by its participating branches. This network-assisted property is different from the existing control schemes, in that the PIDNN controller can release the irresponsiveness of a multicast flow caused by those long propagation delays from the receivers. By using BPNN, this active scheme makes the control more responsive to the receivers with longer propagation delay. Thus the rate adaptation can be performed in a timely manner, for the sender to respond to network congestion quickly. We analyze the theoretical aspects of the proposed algorithm, show how the control mechanism can be used to design a controller to support multirate multicast transmission based on feedback of explicit rates, and verify this matching using simulations. Simulation results demonstrate that the proposed PIDNN controller avoids overflow of multicast traffic, and performs better than the existing scheme PNN [Tan et al. 2005] and the multicast schemes based on control theory. Moreover, it also performs well in the sense that it achieves high link utilization, quick response, good scalability, high unitary throughput, intra-session fairness and inter-session fairness.