Timer forecasting zone based on Demand Multicast Routing Protocol in Mobile Ad hoc Network

n/a

Ad hoc wireless networks are self-organizing dynamic topology networks formed by a collection of mobile nodes through radio links. Minimal configuration absence of infrastructure and quick deployment make them convenient for emergency situations other than military applications. Multicasting plays a very crucial role in the application of Ad hoc networks. As the number of participants increases scalability of the multicast protocol becomes an important issue. Among the existing multicast protocols On Demand Multicast Routing Protocol (ODMRP) perfo exhibits a high packet delivery ratio even at high mobility. But ODMRP suffers from higher control overhead as the network size and the number of sources increase.In this paper we propose an efficient multicast routing protocol for Ad hoc wireless networks. This protocol reduces the control overhead by dynamically classifying the sources into Active and Passive categories. The control overhead is significantly reduced by about 30% compared to ODMRP which contributes to the scalability of the protocol. We study the effectiveness of the proposed multicast routing protocol by simulation studies and the results show that the multicast efficiency is increased by 10--15% and packet delivery ratio is also improved at high network load.

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.

Multicast routing protocols proposed for mobile ad hoc networks have certain limitations. Most of these protocols try to discover the route on-demand by flooding route request messages, which results in increased end-to-end latency and also consumes considerable amount of network bandwidth. These limitations make protocols not suitable for real-time multimedia communication. In this paper, we have presented an efficient mobile agents aided multicast routing (MAMR) protocol which overcomes these limitations. The protocol is a hybrid protocol where intelligent mobile agents can been integrated with existing on-demand multicast routing protocols such as multicast ad hoc on-demand distance vector (MAODV) routing protocol, on-demand multicast routing protocol (ODMRP) routing protocol and others. Here, the mobile agents move around the network and collect the routing information. This routing information assists on-demand multicast routing protocols in discovering the route in a definite path instead of flooding the route request messages, thereby achieving better end-to-end latency and reduced control traffic in the network. We have used MAODV protocol as an underlying protocol with mobile agents. The proposed MAMR protocol and MAODV have been compared through extensive simulations with end-to-end latency, packet delivery ratio and control overhead as performance parameters

Multicasting has emerged as one of the most focused areas in the field of networking. As the technology and popularity of the Internet grow, applications such as video conferencing that require the multicast feature are becoming more widespread. Another interesting development has been the emergence of dynamically reconfigurable wireless ad hoc networks to interconnect mobile users for applications ranging from disaster recovery to distributed collaborative computing. In this article we describe the on-demand multicast routing protocol for mobile ad hoc networks. ODMRP is a mesh-based, rather than conventional tree-based, multicast scheme and uses a forwarding group concept (only a subset of nodes forwards the multicast packets packets via scoped flooding). It applies on-demand procedures to dynamically build routes and maintain multicast group membership. We also describe our implementation of the protocol in a real laptop testbed.

Performance evaluation of a mesh-evolving quality-of-service-aware multicast routing protocol for mobile ad hoc networks

Mobile ad hoc networks (MANETs) are self-organizing, rapidly deployable network that require no fixed infrastructure. Their main components are wireless mobile or stationary hosts, both of which can be deployed anywhere, that cooperate in order to dynamically establish communications. Due to the dynamic nature of the network topology and restricted resources, finding and maintaining the routes for multicasting the data is still more challenging. Many Protocols have designed for multicasting in MANETs that On-Demand Multicast Routing Protocol (ODMRP) is one of them. In the basic ODMRP, a multicast receiver selects routes based on the minimum delay. But this route may not be stable route. Whereas stable route selection and increasing network reliability is very important issue in mobile ad hoc network applications. In this paper we propose a weighted function by which we take into account both delay and energy level of routes. In proposed approach for enhancing route stability we consider nodes energy in route selection from source to destination in ODMRP. Simulation results illustrate that our approach can improve stability and throughput of route.

PUMA (Protocol for Unified Multicasting through Announcements) is a mesh-based multicast routing protocol for mobile ad hoc networks distinguishing from others in its class by the use of only multicast control packets for mesh establishment and maintenance, allowing it to achieve impressive performances in terms of packet delivery ratios and control overhead. However, one of the main drawbacks of the PUMA protocol is that the core of the mesh remains fixed during the whole execution process. In this paper, we present an improvement of PUMA by introducing to it an adaptive core selection mechanism. The improved protocol produces higher packet delivery ratios and lower delivery time while incurring only little additional control overhead.

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.

Mobile ad hoc networks (MANET) are self-configured and self-maintained network without any central authority. In MANET the route discovery from source node to destination node is a critical issue due to frequent changes in network topology and mobility of nodes. The MANET consists of problems such as load balancing, scalability, stability, reliability security and robustness. It is therefore necessary to check node stability with respect to node mobility and Bandwidth during path establishment. The Scalable Multipath On-demand Routing Protocol for Mobile Ad-hoc Network (SMORT) is suitable for Scalability only. The proposed protocol is an advanced version of SMORT which includes additional stability factor. This paper presents a new multipath routing protocol, stable and scalable on-demand routing for mobile ad hoc networks which improves the lifetime of the network and improves the performance.

In this paper, we propose a new multicast routing protocol, named weight-based clustering multicast protocol (WCMP), for mobile ad hoc networks. The goal of this work is to improve multicasting performance in ad hoc networks by efficient use of the available knowledge of the networks.

Summary form only given. Service advertisement and discovery are important components for collaborative applications in mobile ad hoc networking (MANET) environment since they enable mobile communication and computing entities to provide services and associated data to peers and to be aware of and use the available services and data from peers. In this research, we design and implement a lightweight protocol for service advertisement and discovery based on a MANET multicast protocol ODMRP (on-demand multicast routing protocol). Service advertisement and discovery information is piggybacked in ODMRP routing control packets. NS-2 simulation results show that our protocol achieves the goal of service advertisement and discovery in mobile ad hoc networks with high successful data delivery ratio and low overheads.

One of the major issues in current routing protocols for mobile ad hoc networks (MANETs) is to develop a routing protocol that can satisfy different applications’ needs and optimize routing paths to cope with protocol topology changes. Thus, developing a new routing protocol to optimize routing paths based on dynamic topology changes is a challenging task in MANET. Position-based routing protocols are more suitable for high node mobility due to their dependability on local position information rather a global network knowledge. However, most existing position-based routing protocols forward packets greedily which leads to inaccurate location information and results in frequent route failures. Furthermore, incorporating fixed-interval beaconing to distribute local positions introduces high overheads. In this paper an on-demand geo-casting routing scheme which makes use of geographical information to establish cost-effective and reliable paths for packets to reach their destination is proposed. Through the proposed scheme, search area during route discovery process includes only promising search paths, which will alleviate the effect of control message overhead. Moreover, each node is able to independently adjust protocol parameters based on network environment, data traffic conditions, and node’s congestion level. The simulation results show that the proposed protocol outperforms existing routing protocols under different network conditions such as various mobility and traffic loads.

The multicast routing protocols used in wire network, such as distance vector multicast routing protocol(DVMRP), multicast open shortest path first(MOSPF), core based tree(CBT), do not run very well in ad hoc network because the dynamic net topology may destroy the distribution tree. Besides, distribution tree usually needs global routing structure. Which produces extra processing cost because the dynamic topology will introduce frequent exchange of routing vector or routing state between nodes. To deal with these problems multicast forwarding group routing protocol (MFGRP) which is based on route grid is designed on basis of dynamic source routing protocol (DSR). MFGRP ensures the multicast packets are sent to destination through dynamic topology network using multicast route grid.

On-Demand Multicast Routing Protocol (ODMRP) is a well-known protocol for ad hoc networks. This protocol is mesh based and exhibits a high packet delivery ratio even at high mobility. In ODMRP the robustness is achieved by using the number of multiple routes which is a solution for the high speed mobility and the subsequent route breaking. The ODMRP is such designed that the number of multiple routes only depends on the number of senders and receivers, irrespective of the node speed and the traffic load. In this paper we proposed a Reduced Data Transmission ODMRP (RDTODMRP) routing algorithm that considers the network conditions e.g. mobility speed and traffic load to determine the multiple routs. This cuts down the unnecessary redundant routes and their data transmissions. Furthermore in ODMRP and RDTODMRP, flooding of Join-Request packets causes excessive control overhead, In order to solve the problem, we Limit some nodes to Flood Join-Request packets and forbid it to be a forwarding node (LF-RDTODMRP). It is shown by simulation that the RDTODMRP and LF-RDTODMRP reduce the number of data transmission, control overhead, end to end delay and improve the data packet delivery ratio.