https://www.eecs.ucf.edu/~turgut/Research/Publications/Download/Boukerche-2011-ComputerNetworks.pdf

Survey Paper: Routing protocols in ad hoc networks: A survey

A Mobile Ad-hoc NETwork (MANET) is composed of Mobile Nodes (MNs) without any infrastructure. MNs selforganize to form a network over radio links. In this environment, multicast routing protocols are faced with the challenge of producing multi-hop routing under host mobility and bandwidth constraint. Multicast routing plays a significant role in MANETs. In recent years, various multicast routing protocols with distinguishing feature have been newly proposed. In order to provide a comprehensive understanding of these multicast routing protocols designed for MANETs and pave the way for the further research, a survey of the multicast routing protocols is discussed in detail in this paper. Qualitatively, based on their primary multicast routing selection principle, we show that all these protocols could be placed under one of two broad routing selection categories: multicast routing based on application independence and multicast routing based on application dependence.

A survey of multicast routing protocols for mobile Ad-Hoc networks

Review: Review of multicast routing mechanisms in mobile ad hoc networks

Research on multicast routing protocols for mobile ad-hoc networks

The stationary nature of nodes in a mesh network has shifted the main design goal of routing protocols from maintaining connectivity between source and destination nodes to finding high-throughput paths between them. In recent years, numerous link-quality-based routing metrics have been proposed for choosing high-throughput paths for unicast protocols. In this paper we study routing metrics for high-throughput tree or mesh construction in multicast protocols. We show that there is a fundamental difference between unicast and multicast routing in how data packets are transmitted at the link layer, and accordingly there is a difference in how the routing metrics for each of these primitives are designed. We adapt certain routing metrics for unicast for high-throughput multicast routing and propose news ones not previously used for high-throughput. We then study the performance improvement achieved by using different link-quality-based routing metrics via extensive simulation and experiments on a mesh network testbed, using ODMRP as a representative multicast protocol. Our testbed experiment results show that ODMRP enhanced with linkquality routing metrics can achieve up to 17.5% throughput improvement as compared to the original ODMRP.

/pdf/high-throughput-multicast-routing-metrics-in-wireless-mesh-7t7s60lrtt.pdf

High-Throughput Multicast Routing Metrics in Wireless Mesh Networks

We present the protocol for unified multicasting through announcements (PUMA) in ad-hoc networks, which establishes and maintains a shared mesh for each multicast group, without requiring a unicast routing protocol or the preassignment of cores to groups. PUMA achieves a high data delivery ratio with very limited control overhead, which is almost constant for a wide range of network conditions. Using simulations in Qualnet 3.5, we compare PUMA with ODMRP and MAODV, which are representatives of mesh-based and tree-based multicast routing in ad hoc networks. The results from a wide range of scenarios of varying mobility, group members, number of senders, traffic load, and number of multicast groups show that PUMA attains higher packet delivery ratios than ODMRP and MAODV, while incurring far less control overhead.

/pdf/efficient-and-robust-multicast-routing-in-mobile-ad-hoc-13tyb3tjne.pdf

Efficient and robust multicast routing in mobile ad hoc networks

We examine on-demand multicasting in ad hoc networks. We study a wide range of simulation scenarios and identify key limitations of MAODV. Based on our findings, we propose a number of changes in MAODV, and call the resulting protocol robust multicasting in ad hoc networks using trees (ROMANT). We compare ROMANT to MAODV and ODMRP, for a wide range of simulation scenarios. Our results indicate that ROMANT effectively eliminates the limitations of MAODV. Moreover, it provides comparable or better packet delivery ratio than ODMRP at only a fraction of the overhead incurred by ODMRP.

Robust tree-based multicasting in ad hoc networks

https://escholarship.org/content/qt5p50k8br/qt5p50k8br.pdf?t=nud57x

An adaptive redundancy protocol for mesh based multicasting

In this paper we present DPUMA, a mesh-based multicast routing protocol specifically designed to reduce the overhead needed to deliver multicast packets, saving bandwidth and energy, two of the scarcest resources in MANETS. The two main features of DPUMA are: (1) for each multicast group, it periodically floods a single control packet to build the mesh, elect the core of the mesh and get two-hop neighborhood information; and (2), it computes the mesh's k-dominating set to further reduce overhead induced by flooding the mesh when forwarding data packets, These two characteristics contrast with other protocols that blindly flood the net in different stages to construct their routing structure (mesh or tree), to elect the leader of the structure, and that exchange hello messages to get neighborhood information. Using detailed simulations, we show over different scenarios that our protocol achieves similar or better reliability while inducing less packet transmission overhead than ODMRP, MAODV and PUMA which is DPUMA's predecessor.

DPUMA : A highly efficient multicast routing protocol for mobile ad hoc etworks

In this paper we present DPUMA, a mesh-based multicast routing protocol specifically designed to reduce the overhead needed to deliver multicast packets, saving bandwidth and energy, two of the scarcest resources in MANETS. The two main features of DPUMA are: (1) for each multicast group, it periodically floods a single control packet to build the mesh, elect the core of the mesh and get two-hop neighborhood information; and (2), it computes the mesh’s k-dominating set to further reduce overhead induced by flooding the mesh when forwarding data packets. These two characteristics contrast with other protocols that blindly flood the net in different stages to construct their routing structure (mesh or tree), to elect the leader of the structure, and that exchange hello messages to get neighborhood information. Using detailed simulations, we show over different scenarios that our protocol achieves similar or better reliability while inducing less packet transmission overhead than ODMRP, MAODV and PUMA which is DPUMA’s predecessor.

/pdf/dpuma-a-highly-efficient-multicast-routing-protocol-for-tiqjbye16v.pdf

R. Vaishampayan

Papers

Efficient and robust multicast routing in mobile ad hoc networks

Robust tree-based multicasting in ad hoc networks

An adaptive redundancy protocol for mesh based multicasting

DPUMA : A highly efficient multicast routing protocol for mobile ad hoc etworks

DPUMA: a highly efficient multicast routing protocol for mobile ad hoc networks