Multicast Protocol Research Articles

Secluding Efficient Geographic Multicast Protocol against Multicast Attacks

A Mobile Ad-hoc Network (MANETs) is composed of Mobile Nodes without any infrastructure. The network nodes in MANETs, not only act as ordinary network nodes but also as the routers for other peer devices. The dynamic topology, lack of a fixed infrastructure and the wireless nature make MANETs susceptible to the security attacks. To add to that, due to the inherent, severe constraints in power, storage and computational resources in the MANET nodes, incorporating sound defense mechanisms against such attacks is also non-trivial. Therefore, interest in research of Mobile Ad-hoc NETworks has been growing since last few years. Security is a big issue in MANETs as they are infrastructure-less and autonomous. The main objective of this paper is to address some basic security concerns in EGMP protocol which is a multicast protocol found to be more vulnerable towards attacks like blackhole, wormhole and flooding attacks. The proposed technique uses the concepts of certificate to prevent these attacks and to find the malicious node. These attacks are simulated using NS2.28 version and the proposed proactive technique is implemented. The following metrics like packet delivery ratio, control overhead, total overhead and End to End delay are used to prove that the proposed solution is secure and robust.

Scalability Dynamic Multicast Labels Management Mechanism for Ubiquitous Data-Centric Sensor Networks

The significant difference between traditional electric power system and smart grid is the cooperative control of power flows and information flows. With a large number of secondary equipments accessed into smart grid, the electric power communication network becomes one type of ubiquitous data-centric sensor networks. Real-time and reliable multicast services are required for power system's stable operation. Multiple Protocols Label Switching (MPLS) with its traffic engineering capabilities has emerged as a powerful tool to provide QoS support in backbone transmission networks. But previous MPLS unicast and multicast protocols have common disadvantages, not scalable enough, especially for various intelligent electronic devices following distributed generators frequently accessed into smart grid. To overcome the problems of overfull labels consuming bandwidth and prolonging delay, this paper proposed a novel labels dispatching mechanism based on Resource ReSerVation Protocol (RSVP) and message injecting and headward impelling technologies. Based on a set of accurate mathematical analyses and simulation experiments in a typical distributed power system scenario, the new mechanism could effectively reduce the total number of labels and overheads, save bandwidth, and shorten the multicast tree establishing time. The good scalability can adapt much better to ubiquitous and thick electrical advanced metering application.

A Kind of New Multicast Routing Algorithm for Application of Internet of Things

Wireless Sensor Networks (WSN) is widely used as an effective medium to integrate physical world and information world of Internet of Things (IOT). While keeping energy consumption at a minimal level, WSN requires reliable communication. Multicasting is a general operation performed by the Base Station, where data is to be transmitted to a set of destination nodes. Generally, the packets are routed in a multi-hop approach, where some intermediate nodes are also used for packet forwarding. This problem can be reduced to the well-known Steiner tree problem, which has proven to be NP-complete for deterministic link descriptors and cost functions. In this paper, we propose a novel multicast protocol, named heuristic algorithms for the solution of the Quality of Service (QoS) constrained multicast routing problem, with incomplete information in Wireless Sensor Networks (WSN). As information aggregation or randomly fluctuating traffic loads, link measures are considered to be random variables. Simulation results show that the Hop Neural Networks (HNN) based heuristics with a properly chosen additive measures can yield to a good solution for this traditionally NP complex problem, when compared to the best multicast algorithms known.

GEographic Multicast (GEM) for Dense Wireless Networks: Protocol Design and Performance Analysis

Multicast is necessary in several wireless multihop communication scenarios. Accordingly, it has received a lot of attention in the past, and several multicast protocols have been proposed. Nevertheless, traditional solutions typically incur poor efficiency when there is a large number of nodes, topology changes occur frequently, and/or the traffic load is low. Geographic multicast has been recently exploited to solve the problems mentioned above. However, these solutions require exchange of topology information that, again, can lead to excessive overhead. In this paper, we propose a new geographic multicast protocol denoted as GEM, which is inspired by the Euclidean Steiner Tree (EST) theory and does not require any information exchange for routing purposes. Therefore, it is very efficient and scalable in wireless networking scenarios where other schemes achieve low performance, especially in terms of energy consumption. In this paper, we also derive some key properties of GEM that allow us to characterize the protocol performance. As a major contribution, we show that these properties are quite general and apply to a wide range of algorithms inspired by the EST. Simulation results assess the derived properties and confirm the effectiveness of the proposed GEM scheme.

M-CONFIDANT: A Multicast based Cooperation of Node Fairness in Dynamic Ad hoc Network

Mobile Ad-hoc Network (MANET) consists of many wireless mobile nodes that temporally constitute a dynamic infrastructure less network. To enable communication between nodes that do not have direct contact, each node must function as a wireless access point and potentially forward data traffic on behalf of the other nodes present in the network. Due to limitation of resources with these Mobile nodes the property of selfishness is exhibited. A technique system level based Cooperation of Node Fairness in Dynamic Ad hoc Network that promise to detect and nullify the effect of selfish nodes on the basis of monitoring, assigning reputation measure to every node and isolation of the detected misbehaving nodes. Previously, this scheme was implemented in GloMoSim simulator using unicast protocol and the idea is to integrate the CONFIDANT protocol with multicast protocol, so that the network performance can be boosted. In this paper, we suggest a M-CONFIDANT: A Multicast based Cooperation of Node Fairness in Dynamic Ad hoc Network. This scheme integrates a multicast based MAODV protocol with the CONFDIANT protocol previously integrated with DSR protocol.

A Study on the Use of Multicast Protocol Traffic Overload for Active Network

Multicast requires reliability in one-to-one or multi-counterpart communication services and such demand for reliability becomes more and more an important factor to manage the whole network. In addition, it requires link of broadband network, real-time transmission, and much effective multicast protocol in order to support application of multimedia that has become a dominant figure recently. Communication method for multicast is a way of communication for a transmitter that provides multicast data to every registered member in the transmitters group, and it can be classified into the traditional and the reliable communication methods in general. The traditional communication method is very fast in connection but quality of service is poor. In contrast, the reliable communication method provides good quality in service but its speed is somewhat poor. Thus to enhance such demerits, this thesis proposes communication method of multicast by using active network method. In this thesis, a fair and practical bandwidth is used for data packet transmission along with the use of active network. The bandwidth and data processing capability filters out the transmitted data from an active router through transmission packet and upgrades multimedia data packet more effectively. Therefore, recipients in various levels receive the effective data packet and based on these facts, the study actualizes and evaluates efficiency of a router, which is able to transmit the fair bandwidth from active router in a simulation.

MR2_ODMRP: Improvement of End-to-End Transmission Delay in Wireless Multicast Routing

With recent advances in wireless technology, the importance of the capability to use multiple transmission rates and multiple radios has been widely recognized. In this paper, multi-rate and multi-radio (MR2) characteristics are exploited to improve end-to-end transmission delay for reliable multicasts. To achieve this goal, maximum potential rate based on multiple rates and radio based transmission delay with a different number of available radios are investigated in the construction of multicast routes. Multi-rate multi-radio on-demand multicast routing protocol (MR2_ODMRP), a protocol that makes ODMRP suitable for a MR2 environment, is proposed. An integer linear programming model is proposed to obtain the optimal tree as well as the rate and radios at each node of the tree for each multicast service. The solution is employed to evaluate the performance of the MR2_ODMRP. From the simulation, it is shown that the MR2_ODMRP produces nearly optimal solutions even in environments with a large number of nodes. It outperforms the ODMRP in wireless mesh networks. The end-to-end transmission delay is improved by a factor of four compared to the ODMRP.

A multicast reprogramming protocol for wireless sensor networks based on small world concepts

Automatic reprogramming is an important and challenging issue in wireless sensor networks (WSNs). A usual approach is the over-the-air programming (OAP), which is a fundamental service based on reliable broadcast for efficient code dissemination. However, existing OAP protocols do not enable the reprogramming of a subset of the sensor nodes in a WSN. Hence, in this work we propose a multicast-based over-the-air programming protocol that considers a small world infrastructure (MOAP-SW). The small world model is used to create shortcuts toward the sink in the communication infrastructure of sensor networks. The endpoints of these shortcuts are more powerful nodes, resulting in a heterogeneous wireless sensor network. Simulation results show the feasibility of the protocol regarding the number of messages transmitted, the energy consumption and the time to reconfigure the network.

Space Optimized Multicast in Delay Tolerant Networks

Many multicast protocols for Delay Tolerant Networks fall in the class of tree based algorithms. Most of these tree computations aim to reduce the time taken by the message to reach its recipients. However, many scenarios have a greater demand to save on the space usage than on the time requirement. The present work proposes a tree computation technique that aims to reduce the duplication of messages in the network as a result of store-and-forward mechanism in tree based multicast. The proposed algorithm has been simulated on SLAW mobility model and shows a reduction in the number of copies of message in the network by as much as 75% (reducing to ¼ th of the number), compared to the Dynamic Tree Based Routing protocol.

Secure Multicast Routing in MANETs for PBM Protocol

A Mobile Ad-hoc NETwork (MANET) consists of Mobile Nodes (MNs) without any centralized authority. Mobile nodes form a network over radio links due to its infrastructure less environment. Multicast routing plays a significant role in MANETs. Due to its features, such as dynamic network topology, limited bandwidth, and limited battery power, routing in MANETs becomes a tedious task. In the presence of malicious nodes, the MANET is vulnerable to various kinds of attacks. The MANET protocol is found to be more vulnerable due to the lack of centralized authority and also due to its dynamic nature. Position Based Multicast (PBM) protocol does not require any distribution structure and it avoids flooding of control packets. It uses the geographical locations of the intermediate nodes and the destination node to make the message forwarding decisions. Position-based routing is commonly regarded as highly scalable and very robust against frequent topological changes. However, there are several potential security issues for the development of position-based routing protocols. In this paper, we examine the various multicast routing attacks and a suitable countermeasure is provided against attacks using game theory in the existing Position Based Multicast (PBM) protocol in MANETs. The proposed countermeasure is evaluated using the performance metrics namely packet delivery ratio, End to End Delay and Control Overhead.

Secluding RSGM Protocol against Multicast Attacks

the presence of malicious nodes, one of the main challenges in MANETs is to design a novel, scalable and robust Geographic Multicast Protocol (RSGM) that can protect MANETs from various routing attacks. The vulnerabilities in the RSGM protocol were explored and various attacks like blackhole, wormhole and flooding attack are simulated. Several virtual architectures are used in the protocol without need of maintaining state information for more robust and scalable membership management and packet forwarding in the presence of high network dynamics due to unstable wireless channels and node movements. Specifically, scalable and efficient group membership management is performed through a virtual-zone-based structure, and the location service for group members is integrated with the membership management. Both the control messages and data packets are forwarded along efficient tree- like paths, but there is no need to explicitly create and actively maintain a tree structure. The stateless virtual tree-based structures significantly reduce the tree management overhead, support more efficient transmissions, and make the transmissions much more robust to dynamics. Geographic forwarding is used to achieve scalability and robustness. Differences mechanisms have been proposed using various techniques to countermeasure the routing attack against MANETs. However, these mechanisms are not suitable for MANETs resource constraints. In a mobile scenario, mesh based protocols outperformed tree-based protocols. The availability of alternate routes provided robustness and scalability. The different routing attacks, such as flooding, blackhole and wormhole are simulated using NS2.28 version and efficient proactive counter measure is provided using HMAC function which would lead to a drastic change is performance metric like packet delivery ratio, control overhead and end to end delay which is used to prove that the proposed solution was efficient and robust. Keywordsattack, Wormhole attack, Flooding attack, RSGM.

Adaptive Coding and Modulation for Multicast Transmission in Packet Radio Networks

A low-complexity protocol is described and evaluated for adaptation of the modulation and coding for multicast transmission in half-duplex packet radio networks. The adaptive multicast transmission protocol is designed to compensate for changes in propagation conditions that occur from packet to packet during a session with one sender and multiple receivers. The protocol relies on simple receiver statistics to obtain the control information for adapting the modulation and coding, and it also provides scheduling to avoid collisions among acknowledgments from the receivers. The throughput provided by the protocol is compared with performance results for hypothetical ideal adaptive multicast transmission protocols that are given perfect channel state information. We illustrate the importance of adaptive modulation and channel coding in systems that employ fountain coding for packet erasure correction.

Multiflow: Multicast clean-slate with anticipated route calculation on OpenFlow programmable networks

Increasingly popular, Internet applications for multimedia broadcasting require multipoint communication, in order to reduce network traffic rates. However, the widespread adoption of traditional multicast protocols is still held back by the current Internet structure, where the responsibility for management of multicast groups is distributed among network devices. By using distributed algorithms, such protocols generate delays in processing control groups events. In this paper we propose a clean-slate approach for multimedia multicasting, where the end to end calculation of the best route is performed to decrease delays in group configuration. The prototype developed implements this approach using OpenFlow technology. Results obtained through experimentation show a performance gain in relation to traditional IP multicasting. Key words: Multicast, SDN, OpenFlow.

Improved heuristics for multicast routing in wireless mesh networks

Multicast is a communication technique that allows a source to transmit data to a set of recipients in an efficient manner. Therefore, the primary objective of a multicast routing protocol would be...

SPARM: Spatially Pipelined ACK Aggregation for Reliable Multicast in Directional MAC

In this paper, we propose an ACK-based reliable multicast protocol for directional antennas referred to as spatially pipelined ACK aggregation for reliable multicast (SPARM). To resolve the problems of ACK implosion and ACK collection latency, the SPARM exploits (1) spatial reuse and (2) pipelining of ACK aggregation. In the SPARM, receivers sequentially aggregate their ACKs while the sender multicasts a data frame to the next beam, both removing the ACK implosion problem and reducing ACK collection latency. Also, we prove that the aggregation process does not interfere with the sender multicasting to the next beam. Performance evaluation shows that the proposed SPARM has full reliability and outperforms the existing schemes with respect to the throughput by about 200%.

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.

A social similarity-aware multicast routing protocol in delay tolerant networks

In delay tolerant networks (DTNs), multicast is widely adopted for emergency notifications in crisis environment and data scattering under military rescue situations, as it has better robustness and resource utilisation. Although the topology of DTNs usually changes quickly, they also demonstrate relatively stable social characteristics, e.g., the social similarity. In this paper, a social similarity-aware multicast routing protocol (SSM) is proposed, in which the social similarity is quantified as the probability of the encounter of two nodes in the future based on the number of common neighbours in the history. We propose and evaluate four measuring metrics (i.e., max, min, average and median) on such probability in multicast scenarios, and nodes with higher such similarity metrics are selected in priority to construct the forwarding group during the data replication process. Simulation results show that SSM can effectively improve the data delivery ratio and reduce the overhead at the same time.

On channel assignment and multicast routing in multi-channel multi-radio wireless mesh networks

Multicast is a key networking service, enabling one-shot delivery of information from a source to multiple destinations and is considered underlying for collaborating multimedia applications such as video conferencing, distance learning and other forms of content distributing over Multi-Channel Multi-Radio Wireless Mesh Networks MCMR WMNs. Multicast protocol as designed in these networks, however, is tightly coupled with the specifics of the nodes' channel-radio associations to realise minimum interference communication. The mainstream of research in WMN multicasting is oriented towards heuristic or meta-heuristic strategies which basically take on a sequential approach to solve the channel assignment and the multicast routing as two disjoint sub-problems. The resulting network configurations would be sub-optimal in this case. It is given that the cross-interaction between the two sub-problems is an effect of the problem's specifications. In this paper, first, we propose a cross-layer mathematical formulation of joint channel assignment and multicast tree construction in MCMR WMNs, which, opposed to the existing schemes guarantees optimal solution. The simulation results demonstrate that our cross-layer design outperforms the Level Channel Assignment LCA, Multi-Channel Multicast MCM, the Genetic Algorithm GA, Simulated Annealing SA and the Tabu Search TS-based methods proposed by Zeng et al. 2010 and Cheng et al. 2011 respectively, in terms of inter-channel interference. Second, since joint optimisation modelling has been relatively demanding in terms of complexity, we relax the optimality requirement and alternatively explore the option of a layered formulation in which to ensure an optimal solution for each sub-problem. Our alternative design is proved superior to the prior art in terms of interference minimisation too. We conduct an extensive series of simulations to analyse the optimality and complexity of our two design strategies. The overall result of the interference, is our optimality measurement. Also, complexity is evaluated in terms of the memory consumption as well as the required time to solve the multicast problem.

Opportunistic Unicast and Multicast Routing Protocol for VANET

Vehicular Ad Hoc Network (VANET) is a new paradigm of wireless network. Reliable and efficient unicast and multicast routing protocols are critical for VANETs. As a possible solution, opportunistic routing (OR) has received much attention recently. This paper focuses on the aspect of soft security by building trust opportunistic forwarding model in VANET. It incorporates the trust mechanism into OR to enhance the security of routing in resisting malicious attacks. In this paper, we proposed a trusted minimum cost opportunistic unicast routing protocol (TMCOR) and a multicast routing protocol (TMCOM). The simulation results show TMCOR and TMCOM have good throughput, average delay and security gains compared with existing protocols.