On-demand Multicast Routing Protocol Research Articles

Selecting Optimal Path in Multiple-Path Routing for MANETs Using Fuzzy Cost

Background/ Objectives: Mobile Ad Hoc Networks (MANETs) consists of a set of nodes, where the nodes tend to change their positions time to time because of their infrastructure less characteristic. In MANETs, the protocol that is considered to be the appropriate for constructing an efficient route is AODV. Broadcast storm is another approach that can be used for establishing a path between the sender and receiver. Due to the concerns related to contention and collision, broadcast is not considered as an efficient mechanism for path selection. Though the aim of broadcasting is to minimize the flooding other issues like bandwidth consumption, collision and contention cannot be controlled. Since MANETs are associated with inadequate bandwidth, the approach of broadcasting is not efficient. Multipath routing approach permits in constructing multiple paths between the communicating nodes (sender and receiver). This approach is complicated due to the problem of node mobility in MANETs. The other paths available are not reliable because of the ad hoc nature of MANETs. The intention is to design a fuzzy controller that assists in reducing the reconstruction of paths using fuzzy cost assigned to each node in the network. Methods: The concept of this paper is to establish an optimal path from sender node to the receiver node from the available multiple paths in MANETs. The path established in this approach uses fuzzy cost. Fuzzy measure is the criteria used for establishing a path. The concept ImRMR used in this paper has been included with few improvements. The basic functionality of ImRMR is that paths are classified based on rank fitness. The proposal is to classify the paths based on its fuzzy cost. This fuzzy cost classifies the paths fitness. Findings: The proposed fuzzy cost approach discussed in this study is compared with On-Demand Multicast Routing Protocol (ODMRP). The result exhibits that the proposed method works better under differing conditions like traffic load, transmission range between nodes and also considers node mobility. The proposed mechanism with inclusion of fuzzy cost shows 5% energy efficiency, reduces the collisions by about 35% and throughput is enhanced by 30%. There has been a considerable decrease in the number of queries by 23%. The simulation results indicate that ODMRP with fuzzy cost is more useful and significant. Hence, consideration of fuzzy cost as a means for selecting an effective route is assumed to be the best. Novelty: This method contributes in reducing the drawbacks of routing approaches whether it is unipath and multi-path approach. The proposed approach changes the value of the attributes for a given route with fuzzy cost. A threshold value will be considered initially and the route having a cost more than the initialized threshold would be advised as the best route. This route would be considered as the efficient route for transmission between the sender and the receiver. Keywords: Uni­path, multiple paths, Fuzzy cost, Fuzzy fitness, Rank fitness

A Scalable Multicast Routing Protocol for Mobile Ad-Hoc Networks

The multicasting technique supports a variety of applications that require data to be instantaneously transmitted to a set of destination nodes. In environments with continuously moving nodes, such as mobile ad-hoc networks, the search for efficient routes from sources to the projected destinations is a common issue. Proposed Windmill protocol provides a scalable multicast solution for mobile ad-hoc networks. Windmill aims to improve routing protocol’s performance by introducing a hierarchal distributed routing algorithm and dividing the area into zones. Additionally, it attempts to demonstrate better scalability, performance and robustness when faced with frequent topology changes, by utilizing restricted directional flooding. A detailed and extensive simulated performance evaluation has been conducted to assess Windmill and compare it with multicast ad-hoc on-demand distance vector (MAODV) and on-demand multicast routing protocols (ODMRP). Simulation results show that the three protocols achieved high packet delivery rates in most scenarios. Results also show that Windmill is capable of achieving scalability by maintaining the minimum packet routing load, even upon increasing the nodes’ speed, the number of sources, the number of group members and the size of the simulated network. The results also indicate that it offers superior performance and is well suited for ad-hoc wireless networks with mobile hosts. The trade-off of using Windmill consists in slightly longer paths – a characteristic that makes it a good choice for applications that require simultaneous data transmission to a large set of nodes.

SGMRP: Scalable Geographic Multicast Routing Protocol for Mobile Ad Hoc Networks

Recently, group communications over Mobile Ad hoc Networks (MANETs) have received considerable attention. Group communication needs support of multicast routing protocols for simultaneous delivery information of group of receivers. Thus, designing effective and efficient multicast routing protocol is necessary to support this kind of applications. Several efforts have been adopted to improve multicast routing. However, most of them did not consider the scalability issue. In this paper, we propose a novel Scalable Geographic Multicast Routing Protocol (SGMRP) to improve the scalability of multicast routing with reduced overhead. SGMRP uses virtual clustering strategy to implement scalable routing and efficient group management. This scheme based on partitioning the network into sectorial zones. The proposed solution performs efficient packet forwarding with reduced communication overhead. This scheme reduces the number of participating nodes and eliminates the duplicate packets. Compared with on Demand Multicast Routing Protocol (ODMRP) and Efficient Geographic Multicast Protocol (EGMP), simulation results show that SGMRP delivers more packets with significantly reduced overhead regardless of the network size, mobility speed and number of multicast members.

WINDMILL: A Scalable Multicast Routing Protocol for Mobile Ad-Hoc Networks

Multicasting supports various applications that need a high collaboration and require data transmission to numerous destinations concurrently. In environments where nodes are continuously moving, as in mobile Ad-hoc networks, seeking efficient routes from a specific source leading to anticipated destinations became an important issue. In this paper a novel scalable multicast routing procedure for mobile Ad-hoc networks is proposed. Our new protocol, WINDMILL, tries to improve performance by introducing a hierarchal routing algorithm and dealing with the area as zones. Furthermore, WINDMILL tries to demonstrate better scalability, performance and robustness through applying the restricted directional flooding. WINDMILL utilizes the network partitioning to forward the route request and reply packets in an efficient way and avoid forwarding duplicate packets. A qualitative comparison between WINDMILL, multicast Ad-hoc on-demand distance vector (MAODV), on-demand multicast routing protocol (ODMRP) and location aware multicasting protocol (LAMP) protocols is presented in this paper. This comparison has considered the used routing category, main contribution, routing structure and network structure maintenance, request and reply packets sending mechanisms, route activation time, selected routes length, and data packet copies number. Our investigation reveals that WINDMILL will be able to achieve scalability by attaining reduced control overhead and low number of data packets copies even within large networks. Hence, WINDMILL can be a good choice for multicasting in Ad-hoc networks established for example among students on a campus or soldiers in a battlefield, where scalability is a key issue.

Performance analysis of modified on-demand multicast routing protocol for MANET using non forwarding nodes

ODMRP (On-Demand Multicast Routing Protocol) is an admired multicast protocol in wireless ad-hoc networks. ODMRP flood a route applies for over the total network to go for a set of forwarding nodes for packet delivery. On the other hand, a on its own forwarding path is exposed to node failures, which are common due to the vibrant nature of mobile ad hoc networks. Still, a set of mischievous or malicious nodes can generate network partitions and mount Denial-of- Service (DoS) attacks. We recommend a new ODMRP-based wireless multicast protocol that offer more forwarding paths in face of link failures. A subset of the nodes that are not on forwarding path rescreen received packets to nodes in their neighbourhoods to beat perceived node failure. This rebroadcasting creates superfluous forwarding paths to skirt unsuccessful areas in the network. Each node makes this forwarding conclusion probabilistically. Our simulation results indicate the unbiased packet delivery ratio with smallest control in the clouds.

A Novel Light-Weight Subjective Trust Inference Framework in MANETs

There is an inherent reliance on collaboration among the participants of mobile ad hoc networks in order to achieve the fixed functionalities. However, they are susceptible to the destruction of the malicious attacks or denial of cooperation. Therefore, it becomes obvious that the security issue is urgently needed to be addressed. Over the last few years, many trust-considered countermeasures have been proposed. The design of trust quantification methods is the key of these countermeasures. In this study, we abstract a novel light-weight subjective trust inference framework, which is divided into trust assessment and trust prediction. The process of node trust assessment is based on node's historical behaviours. Then utilizing the obtained trust data sequence, we introduce the SCGM(1,1)-weighted Markov stochastic chain measure to predict node's trust for future decision making. Experimental results have been conducted to evaluate the effectiveness of the proposed trust model. As an important security application, based on the standard On-Demand Multicast Routing Protocol (ODMRP), we make four major improvements which take the issue of trust into consideration, and propose a novel trust-based routing protocol called the On-Demand Trust-Based Multicast Routing protocol (ODTMRP). And finally, convincing experimental results are presented using three routing evaluation metrics.

Performance of MAODV and ODMRP Routing Protocol for Group Communication in Mobile Ad Hoc Network

A MANET is a self-conFigureuring system of mobile hosts connected by wireless links. The routers are free to move randomly and organize themselves arbitrarily; thus, the network's wireless topology may change rapidly and unpredictably. Routing is the process of exchanging information from one station to the other stations of the network. Multicasting is a popular mechanism for supporting group communication. In a multicast session, the sender transmits only one copy of each message that is replicated within the network and delivered to multiple recipients. This multicast routing is highly deal with self-organized network in recent days due to its broadcast characteristics. However, devising multicast protocols to provide group communications in mobile ad-hoc networks is significantly more complicated, because of the wireless medium, changing topology, battery power and available bandwidth as well. This paper, evaluates two prominent on-demand multicast routing protocols for group communication, namely, Multicast Ad hoc On-Demand Distance Vector (MAODV) and On-Demand Multicast Routing Protocol(ODMRP) as increasing number of multicast sources and receivers in both single-active multicast group and multi-active multicast group in the network.

A Novel Multicast Routing Protocol for Mobile Ad-Hoc Networks

We present a novel approach multicast routing protocol using Ant Colony Optimization and Cross Layer Technique. This protocol is an enhancement of the existing on-demand multicast routing protocol (ODMRP). Establishing communication through portable devices without any central infrastructure is possible in Ad-hoc networks. This feature of the absence of a central infrastructure and the random mobility of the devices give rise to multiple problems involving in security and routing. The challenges encountered by these multicast routing protocols are to provide a secured and efficient routing in these networks. In this paper we intend to present a novel approach of on-demand multicast routing protocol using Ant Colony Optimization and Cross Layer Technique. With this enhanced feature of cross layer technique and by applying ant colony optimization the proposed protocol performs more efficient with minimal overhead. The performance levels of the proposed algorithm at higher traffic load in comparison to the existing algorithms are evident from the simulations performed using NS-2.

Comparative Performance Evaluation of On-Demand Multicast Routing Protocols for MANET

A Mobile Ad hoc NETwork (MANET) is a collection of wireless nodes communicating with each other in the absence of any infrastructure. Each device in a MANET is free to move independently in any direction, and will therefore change its links to other devices frequently. Each must forward traffic unrelated to its own use, and therefore be a router. The primary challenge in building a MANET is equipping each device to continuously maintain the information required to properly route traffic. Such networks may operate by themselves or may be connected to the larger Internet. In this paper, we compare the performance of On-Demand Multicast Routing Protocol (ODMRP), Adaptive demand driven Multicast Routing Protocol (ADMR) With Efficient Geographic Multicast Routing Protocol (EGMP) under different mobility models such as Random Way Point Model, Manhattan Model and Random Drunken Model. Using these models, performance metrics such as Packet Delivery Ratio, End-to-End Delay and Control Overhead are evaluated. ODMRP dynamically builds the route and manages the group membership. In ADMR, Multicast routing state is dynamically established and maintained only for active groups and only in nodes located between multicast senders and receivers. ADMR detects the high mobility without the use of GPS or other positioning system. EGMP supports a zone-based scheme to efficiently handle the two-tier membership management, and takes advantage of the membership management structure to efficiently track the locations of all the group members. The simulation result shows that the throughput of ADMR is higher than that of ODMRP and EGMP at high mobility and EGMP is high at low mobility. End to end delay and control overhead of EGMP is higher than that of ODMRP and ADMR.

Simulation and Performance Evaluation of On Demand Multicast Routing Protocol (ODMRP) on ns-2

An ad hoc network is a collection of wireless mobile nodes dynamically forming a tempory network with out the presence of a wired support infrastructure. In this environment, routing/multicasting protocols are faced with the challenge of producing multi-hop routes under host mobility and bandwidth constraints. In recent years, a number of new multicast protocols of different styles have been proposed for ad hoc networks. ODMRP (On Demand multicast routing protocol) is a mesh based, rather than a conventional tree based , multicast scheme it well suited for adhoc wireless networks. ODMRP has been simulated on PARSEC and its performance evaluated wehave implemented ODMRPon ns-2 and have done a simulation based performance analysis. Based onour experience during implementation, we have also suggested some enhancements to the protocol which we believe improve its performance.

IE2M: Design of intellectual energy efficient multicast routing protocol for ad-hoc network

In this paper, an intellectual energy efficient multicast routing protocol is proposed. It achieves enhanced performance over On-Demand Multicast Routing Protocol (ODMRP). The proposed protocol finds energy efficient multicast routes from source node to a group of receivers. Multicast mesh creation involves two phases: a Join Query (J-Q) phase and a Join Reply (J-R) phase. The J-Q phase initiates a route discovery process to find routes of the multicast group. In J-R phase, different routes of the multicast groups are set up. In the proposed protocol, we modify ODMRP and introduce fuzzy inference system to deal with imprecise and partial information during the route discovery phase. The decision maker uses two fuzzy variables such as energy and distance for evaluating reward as an output parameter of each multicast route. This output parameter helps to distinguish different multicast route and it also helps to reduce the effect of mutual interference between routes. The proposed protocol is simulated using the NS-2 simulator. The performance of the proposed protocol is compared with existing multicast routing protocols, and results outperform existing protocols in terms of several network metrics.

Moralism: mobility prediction with link stability based multicast routing protocol in MANETs

In recent research, link stability is getting tremendous attention in mobile adhoc networks (MANETs), because of several impediments that occur in a reliable and robust network. Link stability metric is used to improve network performance in terms of end-to-end delay, data success delivery ratio (DSDR) and available route time (ART). Energy consumption, bandwidth and communication delay of major concern in ad hoc networks. A high mobility of MANET nodes reduces the reliability of network communication. In a dynamic networks, high mobility of the nodes makes it very difficult to predict the dynamic routing topology and hence cause route/link failures. Multicast in MANETs is an emerging trend that effectively improves the performance while lowering the energy consumption and bandwidth usage. Multicast routing protocol transmits a packet to multicast a group at a given time instant to achieve a better utilization of resources. In this paper, node mobility is considered to map better their movement in the network. So, the links with long active duration time can be identified as a stable link for route construction. Variation in signal strength is used to identify whether the direction of the node is towards or away from estimating node. We consider signal strength as QoS metric to calculate link stability for route construction. Efforts are made to identify the link with highly probable longer lifetime as the best suitable link between two consecutive nodes. We predict the movement time of nodes that define the route path to the node destination. Exata/cyber simulator is used for network simulation. The simulation results of the proposed routing protocol are compared with on-demand multicast routing protocol and E-ODMRP, which works on minimum hop count path. Analysis of our simulation results has shown improvement of various routing performance metrics such as DSDR, ART, routing overhead and packet drop ratio.

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.

Learning automata based multipath multicasting in cognitive radio networks

Cognitive radio networks (CRNs) have emerged as a promising solution to the problem of spectrum under utilization and artificial radio spectrum scarcity. The paradigm of dynamic spectrum access allows a secondary network comprising of secondary users (SUs) to coexist with a primary network comprising of licensed primary users (PUs) subject to the condition that SUs do not cause any interference to the primary network. Since it is necessary for SUs to avoid any interference to the primary network, PU activity precludes attempts of SUs to access the licensed spectrum and forces frequent channel switching for SUs. This dynamic nature of CRNs, coupled with the possibility that an SU may not share a common channel with all its neighbors, makes the task of multicast routing especially challenging. In this work, we have proposed a novel multipath on-demand multicast routing protocol for CRNs. The approach of multipath routing, although commonly used in unicast routing, has not been explored for multicasting earlier. Motivated by the fact that CRNs have highly dynamic conditions, whose parameters are often unknown, the multicast routing problem is modeled in the reinforcement learning based framework of learning automata. Simulation results demonstrate that the approach of multipath multicasting is feasible, with our proposed protocol showing a superior performance to a baseline state-of-the-art CRN multicasting protocol.

Quick Recovery from Link Failures using Enhanced On-demand Multicast Routing Protocol

The aim of this study is to reduce the number of link failures and provide a quick recovery mechanism in MANETs. Multicasting is one of the greatest issues among MANETs due to the seamless variations in topology and link dynamics. Due to the wireless nature of the network, the nodes are under the compulsion to perform communication at adverse situations for any emergency or defense operations. The On Demand Multicast Routing Protocol (ODMRP) is one of the solutions proposed to avoid the multicasting problem in Wireless Mobile Ad hoc Network. In order to avoid excessive flooding of control messages in the network, Enhanced ODMRP was proposed that introduced short time frames to wait until the refresh messages are flooded. In this study, we propose a quick recovery mechanism that along with the EODMRP helps in the quick recovery from route failures and increases performance in the network. An analysis of the EODMRP protocol for multicasting in MANETs is presented along with the proposed quick recovery mechanism using simulations in the network simulator.

Novel Protocols for Improving the Performance of ODMRP and EODMRP over Mobile Ad Hoc Networks

Due to its simplicity, efficiency, and robustness to mobility, the On-Demand Multicast Routing Protocol (ODMRP) becomes a standout amongst the most broadly utilized multicast routing protocols in mobile ad hoc networks (MANETs). However, the robustness of ODMRP comes at the expense of incurring a high control overhead to the network. The Enhanced ODMRP (EODMRP) proposed a dynamic refresh interval for the multicast mesh based on the network feedback on real disconnections experienced by the multicast network members. Veritably, EODMRP decreased the network control overhead at the cost of obtaining a low packet delivery ratio especially in high mobility conditions of the network. In this paper, two protocols, as improvements to both ODMRP and EODMRP, are proposed where the refresh interval is basically adapted based on the source moving speed and the number of disconnections reported by multicast members. Furthermore, we proposed an impressive local recovery to be employed in both protocols, which includes new setup and failure mechanisms that contribute effectively to boosting the performance of our proposed protocols. Since the majority of nodes in MANET rely on batteries, the main contribution of this research is to limit the amount of control information that is passed between nodes (i.e., reducing the control overhead over that in ODMRP) while maintaining a better packet delivery ratio than EODMRP.

On-demand QoS and Stability Based Multicast Routing in Mobile Ad Hoc Networks

Finding a connection path that remains stable for suciently longer period is critical in mobile ad hoc networks due to frequent link breaks. In this paper, an on-demand Quality of Service (QoS) and stability based multicast routing (OQSMR) scheme is proposed, which is an extension of ad hoc on-demand multicast routing protocol (ODMRP) to provide QoS support for real time applications. The scheme works as follows. Each node in the network periodically estimates the parameters, i.e., node and link stability factor, bandwidth availability, and delays. Next step is creation of neighbor stability and QoS database at every node by using estimated parameters. The last sequence is multicast path construction by using, route request and route reply packets, and QoS and stability information, i.e., link/node stability factor, bandwidth and delays in route information cache of nodes, and performing route maintenance in case of node mobility and route failures. The simulation results indicate that proposed OQSMR demonstrates reduction in packet overhead, improvement in Packet Delivery Ratio (PDR), and reduction in end-to-end delays as compared to ODMRP, and Enhanced ODMRP (E-ODMRP).

Enhancing On-Demand Multicast Routing Protocols using Mobility Prediction in Mobile Ad-hoc Network

A Mobile Ad hoc Network (MANET) is a self-organizing wireless communication network in which mobile devices are based on no infrastructure like base stations or access points. Minimal configuration and quick deployment make ad hoc networks suitable for emergency situations like disaster recovery or military conflict. Since node mobility may cause links to be broken frequently, a very important issue for routing in MANETs is how to set reliable paths which can last as long as possible. To solve this problem, non-random behaviors for the mobility patterns that mobile users exhibit are exploited. This paper introduces a scheme to improve On-Demand Multicast Routing Protocol (ODMRP) performances by using mobility prediction.

FB-ODMRP: A Feedback-based Scheme for Improving ODMRP Performance in Ad Hoc Networks

This research aims at proposing an improvement to On Demand Multicast Routing Protocol (ODMRP) called as Feedback ODMRP (FB-ODMRP). ODMRP is a popular multicast routing protocol designed for ad hoc networks with mobile hosts. Its efficiency, simplicity and robustness to mobility render it one of the most widely used routing protocols in MANETs. In ODMRP, the robustness is achieved using periodic route refreshing wherein group membership and multicast mesh are established and updated by the source on fixed refresh intervals and thus such route refresh interval is of the utmost importance to ODMRP's performance. However, robustness comes at the expense of high control overhead incurred to the network. If small route refresh interval values are used, fresh routes and membership information can be achieved at the expense of incurring more control packets and increasing probability of packet collisions and congestion whereas the large refresh values are used, the protocol cannot keep up with network varying dynamics resulting route breakages and packet failure. In this research, the proposed variation of ODMRP makes the route refresh interval variable adapted to feedback information achieved from receivers of the multicast group. Through extensive simulations, it is observed that FB-ODMRP performs well over the range of scenarios and incurs less control overhead compared to original ODMRP while maintaining packet delivery ratio comparable that of the original ODMRP.

Fuzzy Logic Based Rate Control Scheme for ODMRP in Mobile Ad hoc Networks

On Demand Multicast Routing Protocol (ODMRP) is a popular solution designed for ad hoc networks with mobile hosts. Its efficiency, simplicity, and robustness to mobility render it one of the most widely used multicast routing protocols in Mobile Ad hoc NETworks (MANET). In ODMRP, there is no input rate control for upper layer traffic. So, it's possible that high dense traffic flow causes congestion in networks. In this work, an enhancement to ODMRP is proposed referred to as fuzzy logic based Rate Control ODMRP (FRC-ODMRP). FRC-ODMRP attempts to adapt the arrival rate from upper layers to the state in the network by using feedback information from receivers of the multicast group. Accordingly, source comes up with a decision whether to increase or decrease its transmission rate based on information collected from the receivers. In this research, delay and packet delivery ratio reconsidered as indicators of congestion in addition to number of received packets. Simulation results demonstrate that FRC-ODMRP achieves significant performance improvements in comparison to conventional ODMRP and QoS-ODMRP. Indeed, it efficiently handles simultaneous traffic flows such that no one could dominate available bandwidth of networks.