Evaluation Comparison of Mesh-Based routing Protocols in MANET

A multicast routing protocol manages group membership and controls the path that multicast data takes over the network in mobile ad hoc network. This process is done through either tree-based or mesh-based protocols. The mesh-based protocols are more reliable and robust against the tree based protocols. One of the most used on-demand multicast routing protocol is ODMRP (On-Demand Routing Protocol). However, it has the significant overhead due to redundant data delivery group and path maintenance. This overhead has been eliminated through the forwarding node reduction and link break time prediction algorithm (FNRLP). This work aims to exhibit the performance characteristics of mesh-based on-demand multicast routing protocols ODMRP and ODMRP-FNRLP

MALMR: Medium Access Level Multicast Routing For Congestion Avoidance in Multicast Mobile Ad Hoc Routing Protocol

This paper is focused on a new solution for congestion avoidance in ad hoc multicast routing by bearing the congestion situations. As the routing strategy belongs to Medium Access Level, the routing strategy is named Medium Access Level Multicast Routing short MALMR. MALMR is aimed at Congestion Avoidance in Multicast Mobile Ad hoc routing protocol. The present MAC level routing strategy is independent which can work with any multicast routing protocol irrespective of tree or mesh structure. During the study of MALMR performance, the MALMR tested along with On-Demand Multicast Routing Protocol where simulation results proved that MALMR raises the performance of ODMRP in order of magnitude

Static and Dynamic Study of the Performance of Multicast in Ad Hoc Networks Using ODMRP Protocol

An ad hoc network is a collection of wireless mobile nodes dynamically forming a temporary network without the use of any preexisting network infrastructure or centralized administration. On Demand Multicast Routing protocol (ODMRP) is a multicast routing protocol for mobile ad hoc networks. Its efficiency, simplicity, and robustness to mobility renders it one of the most widely used MANET multicast protocols. In this paper, our proposed scheme presents two different scenarios (static and dynamic) used to study the performance of ODMRP as a multicast routing protocol based on mesh topology and fmally concluded that protocol operates well in dynamic environment than in static one because the mobile node has a better packet delivery ratio than in static scenario. Keywords: Multicast, Ad hoc, Simulation, ODMRP, MANET, MCB

A NEW APPROACH OF MULTICAST ROUTING PROTOCOLS IN MANETS BASED ON CBR (CASE-BASED REASONING) METHOD

Multicast routing protocols significantly increase the performance of the network using a new approach of group-orientedservices which become recently apparent for MANETs. Due to this reason several MANET-specific multicasting routingprotocols have been proposed. Although numerous challenges in designing multicast routing protocols in MANETs becomeostensible due to node mobility, contention for channel access, multi hop communications and dynamic topology,researchers tend to address such problems by designing simple, scalable and robust routing protocols. In this paper tried toexplore the existing On-Demand Multicast Routing Protocol (OMRP) with its limitation and propose a new approach ofCBR based multicast routing protocols without changing the basic structure of the protocol. Nodes with CBR based OMRPbecome autonomous by keeping track of previous route discovery experience to reuse back as a solution. This will reducechannel overhead and improves the scalability of the ad hoc network.Keywords: Mobile ad hoc networks (MANETs), Multicast Routing Protocols, and Case-Based Reasoning (CBR)

RODMRP - resilient on demand multicast routing protocol

ODMRP (On-Demand Multicast Routing Protocol) [6] [8] [2] is a popular multicast protocol for wireless ad hoc networks. The strengths of ODMRP are simplicity, high packet delivery ratio, and non-dependency on a specific unicast protocol. ODMRP floods a route request over the entire network to select a set of forwarding nodes for packet delivery. However, a single forwarding path is vulnerable to node failures, which are common due to the dynamic nature of mobile ad hoc networks. Furthermore, a set of misbehaving or malicious nodes can create network partitions and mount Denial-of-Service (DoS) attacks. This thesis proposes a ODMRP-based wireless multicast protocol named RODMRP that offers more reliable forwarding paths in face of node and network failures. A subset of the nodes that are not on forwarding paths rebroadcast received packets to nodes in their neighborhoods to overcome perceived node failures. This rebroadcasting creates redundant forwarding paths to circumvent failed areas in the network. Each node makes this forwarding decision probabilistically. Our simulation results indicate that RODMRP improves packet delivery ratio with minimal overheads, while retaining the original strengths of ODMRP

A Modified Shared-tree Multicast Routing Protocol in Ad Hoc Network

Mobile ad hoc network is a wireless mobile network that does not have any base station or other central control infrastructure. Design of efficient multicast routing protocols in such network is challenging, especially when the mobile hosts move faster. Shared tree routing protocol is a widely used multicast routing protocol in ad hoc network. However, there are problems in end-to-end delay and network throughput for this protocol. In this paper, we propose a protocol to improve the inherent problem of large end-to-end delay in shared tree method as a modification to the existing multicast Ad hoc On-demand Distance Vector (MAODV) routing for low mobility network. The protocol uses n-hop local ring search to establish new forwarding path and limit flooding region. We then propose an extension to our proposed protocol, which uses periodic route discovery message to improve the network throughput for high mobility network. Simulation results demonstrate the improvement with average end-to-end delay in low mobility case as well as high packet delivery ratio in high mobility cas