A dynamic core based multicast routing protocol for ad hoc wireless 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 multicast routing protocol (ODMRP) is a typical mesh-based multicast routing protocol for mobile ad hoc network, but its poor scalability limits its application in large scale network. This paper presents a timer forecasting zone based on demand multicast routing protocol (TFZMP) for mobile ad hoc network (MANET). In TFZMP, the network is divided into zones based on timer forecasting mechanism. Mesh structures inside each zone provide good adaptability to network topology changes. Zone division based on timer forecasting mechanism decreases the data overhead of multicast routing and enhances the scalability of the network. The proposed TFZMP protocol is simulated and compared with ODMRP on OPNET. Simulation results show that TFZMP performs better than ODMRP on the aspects of normalized overhead and packet forwarding efficiency at any mobility model.

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

n/a

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.

Multicasting is an essential service for ad-hoc wireless networks. In a multicasting environment with multiple senders, receivers or meeting members, traditional multicast routing protocols must pay great overhead for multiple multicast sessions. This work presents a scalable and reliable multicasting protocol for ad-hoc wireless networks. A virtual backbone is used as a shared structure for multiple sessions. A clustering scheme is used to reduce the routing path length. A novel scheme is developed to effectively multicast packets using forwarding gates. Furthermore, a lost packet recovery scheme is developed for reliable packet transmission. This scheme can be used to improve the reliability of traditional non-acknowledged multicasting approach. Experiments were conducted to evaluate the proposed multicasting scheme and the results demonstrate that our scheme outperforms other schemes in terms of packet delivery ratio, packet delivery time, control overhead, multicast efficiency, and cost effect. Furthermore, our approach is stable for networks with high mobility and the lost packet recovery scheme is cost-effective.

In MANETs, there are many critical issues such as energy consumption, QoS, exposure to attacks, link stability etc. that need to be addressed for improved communication. `Link Stability' is important because radio links are likely to be unreliable due to node mobility. This instability leads to increased rerouting which further escalates routing overhead. One way of reducing routing overhead is use of multicasting instead of unicast routing. Multicast Routing Protocol transmits data simultaneously to a group of destination nodes to achieve better resource utilization. In this paper, we present a multicasting routing protocol that uses received signal strength as a metric to estimate link stability. Estimated SINR (Signal to Interference plus Noise Ratio) at every node in respect of different senders is used to determine a reliable path that is likely to mitigate link failures and reduce end-to-end delay. For any two nodes, we aim at finding best link with high probability of longer lifetime. We have simulated our experiment on Exata/Cyber Simulator and compared the result of the proposed routing protocol with ODMRP (On-Demand Multicast Routing Protocol) based on minimum hop count. Analysis of our simulation results show improvement of various routing performance metrics such as PDR, Routing Overhead and packet drop ratio.

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.

Recent development has a tremendous growth in the ad-hoc wireless networks. Ad-hoc wireless networks are dynamic topology networks organized by a collection of mobile nodes that utilize multi-hop radio relaying and are capable of operating without the support of any fixed infrastructure. Ad-hoc wireless networks are very useful in emergency operations, collaborative and distributed computing and military applications. Multicasting plays an important role in the ad-hoc wireless networks, where nodes form groups to carry out certain tasks that require point-to-multipoint and multipoint-to-multipoint voice and data communication. The biggest challenge in the ad-hoc wireless networks is to find an optimized path between the two nodes. In this paper, we present an ant colony based metaheuristic multicast routing protocol for ad-hoc wireless networks, in that we analyzed the performance of dynamic core based multicast routing protocol (DCMP). This approach maps the solution capability of swarm intelligence to mathematical and engineering problems. The DCMP is highly adaptive, efficient and scalable. The performance of these protocols has been examined under realistic scenarios using NS 2, the network simulator tool. Performance has been analyzed for the metrics packet delivery ratio and control overheads with the multicast routing protocol. The proposed ant colony based routing protocol reduce the overheads in routing.

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

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 apart from military applications. Multicasting plays a crucial role in the application of ad hoc networks. Since bandwidth is limited in ad hoc wireless networks, a multicast routing protocol must be efficient. It is well known that tree based multicast routing protocols are efficient. But, the main drawback of these protocols is that they are not robust enough to achieve high packet delivery ratios. We propose a tree based multicast protocol in which, to make the protocol robust as well as efficient, a node joins the multicast tree by taking into consideration not only the number of forwarding nodes but also the distance between the source and receiver. For tree maintenance, we have used a localized prediction scheme which results in a high packet delivery ratio.

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.

The mathematical framework for member reliability of Multicasting in BitTorrent Enabled Ad Hoc Network (MBEAN) routing protocol is reported in this paper. Analytical expressions for packet delivery ratio and bounds for routing and control overhead are also derived. Simulations conducted demonstrate that MBEAN achieves higher member-to-member connectivity, and therefore, higher member reliability compared to other multicast routing protocols such as Multicasting in Ad hoc On Demand Distance Vector (MAODV) routing protocol and Protocol for Unified Multicasting through Announcements (PUMA).MBEAN also shows improved packet delivery ratio with reduced overall overhead compared to MAODV and PUMA.

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.

Routing protocols for wireless sensor networks are important in addressing the various quality-of-service (QoS) issues pertaining to different applications. The most important QoS issues while designing routing protocols for WSN are energy awareness, scalability and network lifetime. However to deal with these issues the solutions provided in related literature have certain inherent disadvantages like high control overhead, low packet delivery ratio and requirement of global location information. In order to resolve these issues, we propose an orthogonal transmission based scalable, lightweight and energy aware routing protocol named as OD-PPRP which does not require global location information and has low control overhead. The proposed protocol OD-PRRP has the characteristics of both reactive and proactive routing protocols and utilizes fuzzy logic and Ant Colony Optimization to identify energy efficient and optimal paths. The simulation results show in both static and dynamic environment, OD-PRRP has better network lifetime, low end to end transmission delay, less overhead and high packet delivery ratio than other state of art QoS aware routing protocol viz. EARQ, EAODV and EEABR.