Multicast Ad Hoc On-demand Distance Vector Research Articles

Centralized multicasting AODV routing protocol optimized for intermittent cognitive radio ad hoc networks

The advancement of wireless technology is affected by Spectrum scarcity and the overcrowding of free spectrum. Cognitive Radio Ad Hoc Networks (CRAHNs) have emerged as a possible solution to both the scarcity and overcrowding challenges of the spectrum. The CRAHNs ensure that the Secondary Users (SUs) do co-exist with Primary Users (PUs) in a non-interfering manner. The SUs access the licensed spectrum opportunistically when they are idle. CRAHNs have many use cases which include intermittent networks here referred to as intermittent CRAHNs (ICRAHNs). For example, the Military (MCRAHNs). MCRAHN is complex and characterized by a dynamic topology which is subject to frequent partitioning and route breakages due to attacks and destruction in combat. This study optimizes the routing protocols for intermittent networks such as the MCRAHNs. ICRAHN routing is a challenge due to the network’s intermittent attribute, which is subject to destruction in the case of MCRAHN which is characterized by frequent link breakages. To better understand the routing in this network scenario, this paper presents two analytic models for the AODV and MAODV protocols based on queuing theory. The analytic models simulate unicast and multicast AODV in terms of factors such as queuing delay, throughput, and network scalability. Numerical analysis shows that MAODV outperforms AODV. Furthermore, the suggested routing protocols' performance was tested using network simulations utilizing the following metrics: throughput, Routing Path delay, Node Relay delay, and Spectrum Mobility delay. The simulation findings suggest that the MAODV protocol outperforms the AODV protocol.

Design and implementation of event-based multicast AODV routing protocol for ubiquitous network

We designed and implemented the ECA (Event Condition Action) based Multicast Ad hoc On-demand Distance Vector (ECA-MAODV) routing protocol for the ubiquitous network. The ECA-MADOV protocol plays a predominant role in selecting an efficient route for the creation of an efficient multicast tree and selecting a unique group leader in the multicast group to share and exchange information among group members in an efficient way using a Computational Intelligence (CI) approach. The vague set is a CI that is an enhanced fragment of a fuzzy set. Each element in the Fuzzy set is mapped to [0,1], reflecting its membership grade. We estimated ECA-MAODV’s time and spatial complexity. Besides, we assessed ECA-MAODV performance and compared it with conventional routing protocols such as MAODV and AODV. Finally, simulation results indicate that the ECA scheme proposed is both effective and powerful.

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.

Enhancement of Link Stability and Connectivity in Vehicular Ad hoc Networks

Vehicular Ad hoc Networks is a promising sub-group of MANET. VANET is deployed on the highways, where the vehicles are mobile nodes. Safety and intelligent transportation are important VANET applications that require appropriate communication among vehicles, in particular routing technology. VANETs generally inherit their common features from MANETs where vehicles operate in a collaborative and dispersed way for promoting contact among vehicles and with network infrastructure like the Road Side Units (RSU) for enhanced traffic experience. In view of the fast growth of Intelligent Transportation Systems (ITS), VANETs has attracted considerable interest in this decade. VANET suffer from a major problem of link failure due to dynamic mobility of vehicles. In this paper we proposed a position based routing algorithm to identify stable path, this will improve the routing by decreasing overhead and interrupting the number of links. Link Expiration Time (LET) is used to provide the stable link, the link with the longest LET is considered as the most stable link. The multicast Ad-hoc On-demand Distance Vector (MAODV) is proposed to avoid the link breakages by using a link with longest LET. Data loss is reduced by avoiding link breakages and enhance throughput by reducing the communication delay.

Evaluation of Multicast and Unicast Routing Protocols Performance for Group Communication with QoS Constraints in 802.11 Mobile Ad-hoc Networks

In Mobile Ad-hoc Network (MANET), portable devices like smartphones, or laptop PC can join together to make provisional networks without any infrastructure The objective of multicast or unicast protocols is to ensure an efficient route formation and flow control mechanism which is a very challenging issue for many group computing services in MANETs. MANETs can support several real-time applications like emergency rescue, and disaster relief operations which require minimum Quality of Service (QoS) to handle high traffic. Providing QoS for multimedia and group-oriented computing in MANETs becomes a real challenge due to the wireless medium and the mobility of operating nodes. Therefore, an investigation of routing protocols for one-to-many or many-to-many computing is important that supports acceptable QoS in MANETs. Numerous QoS metrics have been considered for the assessment like packet delivery ratio, latency, packet loss rate, control overhead, and throughput. By considering different network topologies and scenarios with different performance parameters, the primary goal of this study is to explore the challenges and factors for QoS services in MANET’s multicast communication. The outcomes of investigation can be used to design the future MANET protocol for multimedia applications. The performance results indicate that the increasing number of sending/receiving nodes may increase the overhead or latency of the network but capable of providing higher network throughput, carried out in NS-2. The results also indicate although MANETs can induce errors and packets are lost as part of the normal operating context, multicast AODV practice superior to the unicast protocol to various QoS in a wide range of scenarios with less overhead.

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.

Multimedia Transmission through Mobile Ad hoc Networks using Multicasting

Mobile ad hoc networks, abbreviated to MANETs are covering various application fields with the significant advancements in wireless networks. In the recent past, the multimedia transmission over such networks has drawn the attention from researchers and scientists. In wireless medium, it is always advantageous to go for multicast routing than unicast routing. This paper focuses on the performance analysis of a multicast routing protocol, multicast ad hoc on-demand distance vector (MAODV), and its modified version QoS-MAODV, to support multimedia transmission over ad hoc environments.

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.

Cuckoo Search and M-Tree based Multicast Ad hoc On-demand Distance Vector Protocol for MANET

The proposed work, Cuckoo Search (CS) and M-Tree based Multicast Ad hoc On-demand Distance Vector (MAODV), is a two-step process, which involves M-Tree construction and optimal multicast route selection. Divisional based Cluster (DIVC), a technique of clustering inspired from Divisive clustering, builts the M-Tree using three constraints, destination flag, path-inclusion factor, and multi-factor. This paper aims to provide optimal multicasting with multiple objectives, such as energy, link lifetime, distance and delay

Tree-based reliable and energy-aware multicast routing protocol for mobile ad hoc networks

Mobile ad hoc networks (MANETs) can be used for applications which need to be quickly launched and set up. One of the most notable challenges in these networks is reliable and energy-efficient routing protocol. Since mobile nodes in MANET have limited resources, an efficient and reliable multicast routing protocol is needed to reduce the wastage of resources. In this paper, a reliable and energy-aware multicast ad hoc on demand distance vector (REA-MAODV) routing protocol is proposed which is based on MAODV (multicast ad hoc on demand distance vector) protocol. The proposed scheme achieves enhanced performance over ODMRP and finds energy-efficient multicast routes from source node to a group of destination nodes. The proposed REA-MAODV multicast routing protocol not only can update high-consumption and shorter tree branches but also can produce a multicast tree with supporting branches. For improving MAODV protocol, we used three phases: (1) selecting high-energy consumption path, (2) selecting process and adding supporting branches, and (3) maintaining mechanism of multicast tree. The simulation results in NS-2 indicated that REA-MAODV, on average, consumed 45% less energy than MAODV and it has more balance in energy consumption. Moreover, the proposed REA-MAODV protocol was able to enhance packet delivery rate (19%), and it also managed to reduce end-to-end delay in network (21%).

QoS Enabled Cross-Layer Multicast Routing over Mobile Ad Hoc Networks

Quality of group communication using mobile ad-hoc networks depends on various factors like channel fading, signal quality, path loss, transmission and reception power of mobile nodes, mobility, link life and battery backup. Different layers are involved in communication, but the behavior of these layers is isolated with each other and overall network performance may effect from their operations. A cross-layer approach can extract the critical information from multiple layers which can be further utilized to enhance the overall network performance and Quality of Service (QoS). In this paper, Cross-layer Multicast Routing (CLMR) is introduced to enhance the QoS using a tree-based multicast routing protocol. In order to achieve QoS, optimization of the tree operations and tree management cost has been done. CLMR exploits the functionality of PHY layer, Application layer and Routing Layer for QoS oriented communication. Performance of CLMR is analyzed using Multicast Ad-Hoc On-Demand Distance Vector (MAODV) routing protocol under various parameters, i.e. Throughput, Delay, Packet Delivery Ratio, Link Cost and Energy Consumption.

Cost-effective multicast routings in wireless mesh networks with multiple gateways

In order that multicast routing characteristics is reflected in wireless mesh networks, multicast routing metric is required for quantifying the multicast tree cost under wireless environments. This paper proposes a new multicast routing metric considering receiver's different characteristics of link quality on a wireless multicast channel as well as wireless multicast advantage. The proposed multicast-tree transmission ratio quantifying the multicast tree cost represents the product of the multicast transmission ratios of all nodes in the constructed multicast tree. In this paper, we also propose a wireless multicast routing which constructs the multicast tree by maximizing the multicast-tree transmission ratio in wireless mesh networks with multiple gateways and design the multicast routing protocol based on AODV protocol. Since the multicast tree by our wireless proposed routing algorithm contains the nodes having maximum multicast-node transmission ratio, our proposed multicast routing shows a higher delivery ratio and a lower average delay than original multicast AODV and the multicast routing with minimizing the forwarding nodes in its multicast tree. In comparison with other multicast routings, simulation results show that the proposed multicast heuristics maximizing the multicast-tree transmission ratio construct a cost-effective multicast tree in terms of its delivery ratio, average delay, and required network resources.

Scalable Channel Access Optimized Cross Layer Protocol for Mobile Ad Hoc Networks

In Mobile Ad hoc Network (MANET) multicast protocols are tightly coupled with association of nodeschannel ratio which leads to non-interference or low-interference communication. It is purely based on the linear and sequential approach to solve the channel assignment unicast routing or multicast routing as two disjoint subproblems. To overcome this, heuristic routing planner for exposure calculation and non-interference greedy optimized routing is designed by using genetic operator. The main focus of this study is genetic based cross layer optimization of relay selection for both unicast and multicast communication. Performance evaluation shows that the proposed scheme exhibits high performance in terms of packet delivery ratio, bandwidth utilization, throughput and delay when compared to Ad hoc On Demand Distance Vector (AODV) and Multicast Ad hoc On Demand Distance Vector (MAODV).

Self-Organized Hash Based Secure Multicast Routing Over Ad Hoc Networks

Multicast group communication over mobile ad hoc networks has various challenges related to secure data transmission. In order to achieve this goal, there is a need to authenticate the group member as well as it is essential to protect the application data, routing information, and other network resources etc. Multicast-AODV (MAODV) is the extension of an AODV protocol, and there are several issues related to each multicast network operation. In the case of dynamic group behavior, it becomes more challenging to protect the resources of a particular group. Researchers have developed different solutions to secure multicast group communication, and their proposed solutions can be used for resource protection at different layers i.e. application layer, physical layer, network layer, etc. Each security solution can guard against a particular security threat. This research paper introduced a self-organized hash based secure routing scheme for multicast ad hoc networks. It uses group Diffie-Hellman method for key distribution. Route authentication and integrity, both are ensured by generating local flag codes and global hash values. In the case of any violation, route log is monitored to identify the malicious activities.

Genetic based optimization for multicast routing algorithm for MANET

Mobile Ad hoc Network (MANET) is established for a limited period, for special extemporaneous services related to mobile applications. This ad hoc network is set up for a limited period, in environments that change with the application. While in Internet the TCP/IP protocol suite supports a wide range of application, in MANETs protocols are tuned to specific customer/application. Multicasting is emerging as a popular communication format where the same packet is sent to multiple nodes in a network. Routing in multicasting involves maintaining routes and finding new node locations in a group and is NP-complete due to the dynamic nature of the network. In this paper, a Hybrid Genetic Based Optimization for Multicast Routing algorithm is proposed. The proposed algorithm uses the best features of Genetic Algorithm (GA) and particle swarm optimization (PSO) to improve the solution. Simulations were conducted by varying number of mobile nodes and results compared with Multicast AODV (MAODV) protocol, PSO based and GA based solution. The proposed optimization improves jitter, end to end delay and Packet Delivery Ratio (PDR) with faster convergence.

Improved Multicast AODV in Vehicular Ad-Hoc Networks

Improved Multicast AODV in Vehicular Ad-Hoc Networks

DLBMRP: Design of Load Balanced Multicast Routing Protocol for Wireless Mobile Ad-hoc Network

A mobile ad-hoc network (MANETs) is a wireless network of mobile nodes without any fixed base-station or any centralized administration. When a node sends a data packet to more than one node at a time, it is called multicasting, multicast often used to utilize the network resources like channel bandwidth and node energy to improve the network efficiency. Multicast in MANETs have several challenges due to frequent changes in the network such as node mobility, reliability, limited resources, etc. The MANETs is widely used in several fields like emergency searches, rescues operation, and military battlefields where sharing of information is mandatory. These operations often require a rapid deployable and quick reconfigurable routing protocols. Since mobile nodes in wireless ad-hoc network have limited resources so an efficient multicast routing protocol is needed to reduce the wastage of resources. This paper proposes a traffic load balanced multicast routing protocol (LBMRP) in order to reduce the network overhead and increases the network life. In this scheme all mobile nodes are randomly classified into multi group (three groups) and create a tree for each group in order to achieve efficient data transmission. Simulation results shows that the proposed LBMRP scheme outperforms with some existing multicast routing protocols as multicast ad-hoc on-demand distance vector routing protocol, reliability of the multicast ad-hoc on demand distance vector and Parallel multiple nearly-disjoint trees multicast routing schemes.

DCEEMR: A Delay-Constrained Energy Efficient Multicast Routing Algorithm in Cognitive Radio Ad Hoc Networks

We discuss the delay-constrained energy efficient multicast routing problem in cognitive radio ad hoc networks. A cognitive radio ad hoc network is a wireless multihop network established by secondary users on varying available spectrum bands. The research on routing is a hot topic in the field of cognitive radio ad hoc networks. However, multicast routing algorithm study of cognitive radio ad hoc networks is still at its start stage. In this paper, we proposed a novel delay-constrained energy efficient multicast routing algorithm (DCEEMR) in cognitive radio ad hoc networks. The DCEEMR guarantees that the multicast tree can be found if it exists, and the multicast tree satisfies the delay bound and has low energy consumption. The algorithm uses delay-energy function to construct the multicast tree based on the spectrum selection. Through an example with random network topology, we demonstrate that our algorithm is better in terms of energy cost of multicast tree as compared to the existing algorithm QoS dependent multicast routing (QDMR). Moreover, the algorithm does not suffer from high complexity common to the algorithm QDMR. Experiment results by NS-2 show that the delay and cost of tree are lower than well-known multicast ad hoc on-demand distance vector (MAODV) protocol.

Security Algorithms for Mitigating Selfish and Shared Root Node Attacks in MANETs

Mobile ad hoc network is a type of self configurable, dynamic wireless network in which all the mobile devices are connected to one another without any centralised infrastructure. Since, the network topology of MANETs changes rapidly. It is vulnerable to routing attacks than any other infrastructure based wireless and wired networks. Hence, provid ing security to this infrastructure-less network is a majo r issue. This paper investigates on the security mechanis ms that are proposed for Selfish node attack, Shared root node attack and the Control packet attack in MANETs with the aid of a well known mu lticast routing protocol namely Mult icast Ad hoc On Demand Distance Vector (MAODV). The security solutions proposed for each of the above mentioned attacks are evaluated with the help of three evaluation parameters namely packet delivery ratio, control overhead and total overhead. The algorith mic solutions thus obtained are analysed in the simu lation environ ment by using ns-2 simulator.

Enhancing Performance of MAODV Routing Protocol for Wireless Mesh Network using Integrated Multiple Metrics Technique (IMMT)

Customarily, the design of an efficient routing protocol for Wireless Mesh Networks (WMNs) demands suffi- cient consideration of the pertinent features. This is due to the fact that WMNs can be permanent or semi-permanent networks. Moreover, a reliable path from the source to the destination can be maintained using an improved and better performance metrics. Currently, the most widely used performance metric is the minimum hop-count which is based on the assumption that communication links are either working well or not working at all. This assumption is true for wired networks however this is impractical for wireless networks where numerous links suffer from intermediate loss ratios, low throughput, inter- ference and other inherent limitations. Consequently, researchers have proposed a number of performance metrics for WMNs. It has also been shown that integrating multiple performance metrics into a routing protocol is effective for attaining optimal performance since it is highly probable that a single performance metric will not be able to satisfy the comprehensive re- quirements of WMNs. This paper presents a technique of integrating multiple routing metrics in order to optimize the per- formance of a routing protocol. The proposed technique is implemented on Multicast Ad-hoc On-Demand Distance Vector (MAODV) routing protocol. Simulation results show a statistically significant performance improvement over standard MAODV for WMNs.