Adaptive Multicast Routing Research Articles

Adaptive On-Demand Multicast Routing Protocol for Mobile Ad Hoc Networks

The On-Demand Multicast Routing Protocol (ODMRP) is a multicast routing protocol for mobile ad hoc networks (MANETs). Its efficiency, simplicity, and robustness against mobility render it one of the most widely used MANET multicast protocols. In this paper, we present an Adaptive On-Demand Multicast Routing Protocol (A-ODMRP), an improved version of ODMRP. ODMRP lacks a control mechanism for the physical layer. Nodes in ODMRP transmit multicast data at a fixed transmission rate and power level for the physical layer. Also, as the number of nodes belonging to the forwarding group increases, there is significant packet drop or retransmission due to interference between the nodes that send multicast data. However, A-ODMRP implements an adaptive control mechanism with a cross-layer algorithm for the physical layer. When a node transmits multicast data, A-ODMRP can adjust the transmission rate and power level of the physical layer to minimize packet drop or retransmission due to interference between nodes belonging to the forwarding group. Simulation results confirmed that A-ODMRP provides an improved goodput of up to 42% compared to ODMRP.

Energy-Efficient Adaptive Geosource Multicast Routing for Wireless Sensor Networks

We propose an energy-efficient adaptive geosource multicast routing (EAGER) for WSNs. It addresses the energy and scalability issues of previous location based stateless multicast protocols in WSNs. EAGER is a novel stateless multicast protocol that optimizes location-based and source-based multicast approaches in various ways. First, it uses the receiver's geographic location information to save the cost of building a multicast tree. The information can be obtained during the receiver's membership establishment stage without flooding. Second, it reduces packet overhead, and in turn, energy usage by encoding with a small sized node ID instead of potentially large bytes of location information and by dynamically using branch geographic information for common source routing path segments. Third, it decreases computation overhead at each forwarding node by determining the multicast routing paths at a multicast node (or rendezvous point (RP)). Our extensive simulation results validate that EAGER outperforms existing stateless multicast protocols in computation time, packet overhead, and energy consumption while maintaining the advantages of stateless protocols.

Adaptive QoS Multicast Routing with Mobility Prediction in MANETs

Adaptive QoS Multicast Routing with Mobility Prediction in MANETs

Context-aware multicast routing scheme for Disruption Tolerant Networks

Disruption Tolerant Networks (DTNs) are designed to enable communications in networks that experience frequent network partitions and large end-to-end delays. In this paper, we propose a Context-aware Adaptive Multicast Routing (CAMR) scheme for DTNs. Simulation results show that our CAMR scheme can achieve higher message delivery ratio with similar delay performance than two existing DTN multicast schemes, namely DTBR and OS-Multicast. We evaluate the delivery performance of CAMR in different scenarios e.g., different number of groups, different maximum node speeds. Our results indicate that CAMR scales well and provides excellent delivery performance in many different scenarios.

Adaptive core multicast routing protocol

The Adaptive Core Multicast Routing Protocol (ACMRP) is proposed for multicast routing in ad hoc networks. ACMRP is on demand core-based multicast routing protocol that is based on a multicast mesh. In ACMRP, a core is not well-known and it adapts to the current network topology and group membership. The enhanced adaptivity minimizes the core dependency and, accordingly, improves performance and robustness of ACMRP. A multicast mesh is created and maintained by the periodic flooding of the adaptive core. Since the flooding traffic is evenly maintained and a mesh provides rich connectivity among group members, ACMRP can achieve efficiency, scalability, and effectiveness. We evaluate scalability and performance of ACMRP via simulation.

Multicast Routing in Mobile Ad Hoc Networks

We focus on one critical issue in mobile ad hoc networks that is multicast routing. Advantages and limitations of existing routing protocols are illustrated. Optimal routes, stable links, power conservation, loop freedom, and reduced channel overhead are the main features to be addressed in a more efficient mechanism. In this paper, we propose a new on-demand multicast routing protocol, named Source Routing-based Multicast Protocol (SRMP). Our proposition addresses two important issues in solving routing problems: (i) path availability concept, and (ii) higher battery life paths. SRMP applies a source routing mechanism, and constructs a mesh to connect group members. It provides stable paths based on links' availability according to future prediction of links' states, and higher battery life paths. This protocol succeeded to minimize network load via designing optimal routes that guarantee reliable transmission and active adaptability. A performance comparison study with On-demand Multicast Routing Protocol (ODMRP) and Adaptive Demand-driven Multicast Routing (ADMR) protocol is undertaken. Analysis results show the strength of the SRMP nodes' selection criteria and its efficient energy consumption compared to the other two protocols.

AMRST: adaptive multicast routing protocol for satellite–terrestrial networks

Multicasting facilitates the distributing of multimedia information to an entire set of destinations simultaneously. However, the subsequent mass of Internet traffic usually increases the network congestion and degrades network utilization. The unexpected congestion together with limited network capacity might challenge the provision of multimedia services especially since multicast subscribers are widely scattered. The desired QoS of the ongoing services cannot be guaranteed. To address this challenge, in addition to installing new terrestrial broadband networks, another feasible solution would be to integrate now available broadcasting-oriented broadband satellite networks into the Internet backbone. This paper presents a novel adaptive multicast routing (AMRST) protocol to deliver reliable and adaptive multicast services to global subscribers, based on an integrated infrastructure, called a satellite–terrestrial network (ST network), which provides dynamic bandwidth allocation, flexible resource management and ubiquitous transmission. In the AMRST, a proposed virtual hierarchical routing tree was applied in constructing an efficient multicast tree. A routing decision model was proposed to determine routing path for the member requests. A “hierarchical membership maintenance” approach was designed to maintain the multicast membership. The scalability of the AMRST was further addressed. The AMRST not only kept the benefits of the traditional terrestrial multicast but also promoted the multicasting performance by employing the satellite broadcasting capability. The simulation results demonstrate that the AMRST performed excellently for the ST network.

Adaptive multicast routing in multirate loss networks

In this paper, we study two versions of the multicast routing problem in multirate loss networks: complete and partial. In the complete version of the multicast routing problem, the identities of all destination nodes are available to the multicast routing algorithm at once. Conversely, in the partial version of the multicast problem, the identities of the destination nodes are revealed to the routing algorithm one by one. Although the complete version of the multicast routing problem, also known as the Steiner tree problem, has been well studied in the literature, less attention has been paid for the definition of link costs and evaluating the performance of multicast routing algorithm from the network revenue point of view. Therefore, in this paper, we first propose two approaches, namely, the Markov Decision Process?based (MDP?based) and Least Loaded Routing?based (LLR?based) approaches, for defining link costs. Several heuristic multicast routing algorithms are then proposed for both fully connected networks and sparsely connected networks. We have also proposed a new performance metric, referred to as fractional reward loss, for evaluating the performance of multicast routing algorithms. Our simulation results indicate that algorithms based on partial destination information yield worse performance than those based on complete information. We also found that, for fully connected networks, algorithms that use LLR?based link costs yield very competitive performance as compared to those that use MDP approach. However, for sparsely connected networks, LLR?based algorithms yield significantly worse performance as compared to the MDP?based algorithms.

Adaptive Multicast Wormhole Routing in 2D Mesh Multicomputers

The issues of adaptive multicast wormhole routing in 2D mesh multicomputers are studied. Three adaptive multicast wormhole routing strategies are proposed and evaluated. The methods include minimal partially adaptive, minimal fully adaptive, and nonminimal adaptive routing. All the algorithms are shown to be deadlock-free. A study has been conducted that compares the performance of these multicast algorithms. The results show that the minimal fully adaptive routing method creates the least traffic; however, double vertical channels are required in order to avoid deadlock. The nonminimal routing algorithm exhibits the best adaptivity, although it creates more network traffic than the other methods.

A theory of deadlock-free adaptive multicast routing in wormhole networks

A theory for the design of deadlock-free adaptive routing algorithms for wormhole networks, proposed by the author (1991, 1993), supplies sufficient conditions for an adaptive routing algorithm to be deadlock-free, even when there are cyclic dependencies between channels. Also, two design methodologies were proposed. Multicast communication refers to the delivery of the same message from one source node to an arbitrary number of destination nodes. A tree-like routing scheme is not suitable for hardware-supported multicast in wormhole networks because it produces many headers for each message, drastically increasing the probability of a message being blocked. A path-based multicast routing model was proposed by Lin and Ni (1991) for multicomputers with 2D-mesh and hypercube topologies. In this model, messages are not replicated at intermediate nodes. This paper develops the theoretical background for the design of deadlock-free adaptive multicast routing algorithms. This theory is valid for wormhole networks using the path-based routing model. It is also valid when messages with a single destination and multiple destinations are mixed together. The new channel dependencies produced by messages with several destinations are studied. Also, two theorems are proposed, developing conditions to verify that an adaptive multicast routing algorithm is deadlock-free, even when there are cyclic dependencies between channels. As an example, the multicast routing algorithms of Lin and Ni are extended, so that they can take advantage of the alternative paths offered by the network. >