Weight based multicast routing protocol for ad hoc wireless 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 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.

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.

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

Opportunistic routing is a recent routing paradigm that achieves high throughput in the face of universally lossy wireless links in mobile ad hoc networks, likewise, network coding popularly investigated by many institutes is another approach for improving the throughput in wireless networks. How to combine both the techniques is an interesting research. To our knowledge, this is still an open issue to implement the multicast routing in mobile ad hoc networks simultaneously employing both the mechanisms. Due to feedback explosion, most existing wireless network multicast protocols do not guarantee the reliable delivery. In this paper, we propose a novel reliable multicast protocol based on the opportunistic routing and network coding. Additionally, we also provide an expected number of transmission-based cost metric formula of the multicast sub-group. Extensive simulation reveals that the performance of the novel presented multicast routing protocol outperforms the conventional multicast routing protocol in ad hoc wireless networks.

In this paper, we investigate two new hybrid protocols obtained by combination of proactive and reactive behaviors of other two well-known multicast routing protocols, namely the ODMRP and the MAODY. Hybrid routing protocols are known to perfonn better then either pure reactive or proactive protocols in the sense that they 1Iy to strike a balance between improved delay perfonnance and lower ovemead activities. In this work we combine the zone routing proactive behavior of the ZRP protocol with the reactive behavior of the ODMRP and MAODV protocols. The new protocols are named ZMAODV and WDMRP. Using Glomosim simulation we evaluate the perfonnance of these protocols and compare them to their original counte1parts as well as to the Multicast Zone Routing Protocol (MZR). The results reveal that the ZODMRP perfonns the best while the MZR exhibits the worst perfonnance.

The high-level contribution of this paper is the design and development of routing protocols to discover stable paths and trees for unicast and multicast communication based on the predicted link expiration times LETs of links in mobile ad hoc networks MANETs. Both of the stability-based unicast SILET and multicast MILET routing protocols discover routes through an on-demand request-reply cycle with a link weight being 1 plus the inverse of the LET of the link. The destination nodes and the multicast receiver nodes connect to the source node through paths that have the lowest sum of the link weights. The inclusion of a '1' in the link weight helps to minimise the hop count of the paths from the source node to each of the targeted end nodes of the communication session; the inclusion of the inverse of the LET in the path/tree optimisation function helps to maximise the path/tree lifetime. The proposed protocols effectively neutralise the stability-hop count tradeoff and are able to simultaneously maximise the path/tree lifetime and minimise the hop count per source-destination/source-receiver path. The performance of SILET and MILET has been extensively studied in the ns-2 simulator along with contemporary unicast and multicast routing protocols.

Vehicular Ad Hoc Networks (VANETs) are self-organizing, self-healing networks that provide wireless communication among vehicles and roadside equipment. Providing safety and comfort for drivers and passengers is a promising goal of these networks. Designing an appropriate routing protocol according to the network application is one of the essential requirements for implementing a successful vehicular network. In this paper, we report the results of a study on routing protocols related to vehicular applications and their communication needs. In general, all VANET communications can be implemented by either unicast or multicast routing protocols. The results of the study showed that multicast protocols, including geocast and mobility-based routing, are more promising than others for fulfilling the application requirements and, consequently, more research of these protocols is needed.

This paper discusses multicast routing in ad hoc networks. The multicast routing is defined as routing such that the same message is delivered from a node to a set of more than one node called multicast group. Since nodes move around in the ad hoc networks and members join and leaves from the multicast group, it is difficult to manage the multicast group and to maintain routes along which the same message is delivered to the multicast group. We have proposed an autonomous and adaptive clustering scheme to keep sets of connected nodes as clusters. In order to cope with the difficulties mentioned above, this paper proposes a new hierarchical multicast routing protocol to which the autonomous and adaptive clustering is applied in ad hoc networks. Simulation results show that the proposed protocol is effective from the viewpoint of the numbers of control packets and delivered data packets in comparison with a typical core-based multicast routing protocol MAODV.

Mobile ad hoc network is an autonomous system of mobile nodes characterized by wireless links. A major challenge lies in adapting multicast communication to environments where mobility is unlimited and failures are frequent. The multicasting concept deals with one to many data dissemination, many multicast routing algorithm have been proposed like ODMRP, CAMP, NTPMR and so on. In this paper we design fuzzy based priority scheduler and its performance is tested with these multicast routing protocols. The performance of the scheduler is evaluated in terms of the quantitative metrics such packet delivery ratio and average end-to-end delay

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.

A comparison of the Internet multicast routing protocols

In wireless ad hoc networks, many multicast routing protocols are proposed such as ODMRP, MAODV, etc. In general, the IEEE 802.11 standard is assumed as a MAC protocol in those protocol and multicast data packets are transmitted at the basic transmission rate which is 2Mbps at the IEEE 802.11 or 802.11b. However, if the multicast packet can be transmitted at higher transmission rates than 2Mbps in a multi-rate WLAN such as IEEE 802.11b, we can achieve higher throughput gain and lower transmission delay than those at 2Mbps transmission rate. In this paper, we propose a new multicast routing protocol in multi-rate wireless ad hoc networks. In the proposed protocol, we design a multicast mesh creation method considering multiple transmission rates between any two nodes in the ad hoc networks. We also design a multicast mesh maintenance scheme when the transmission rate between two nodes comprising a multicast mesh is changed because of node mobility. The performance of the proposed protocol is compared with ODMRP using ns2 simulation, and the proposed protocol shows higher packet delivery ratio and lower end-to-end delay than the ODMRP.

Intelligent Transportation Systems (ITS) combines telematics with the conventional world of surface transportation infrastructure to fulfill four major transportation goals including safety, environmental protection, efficiency, and economy. The promising technique for building the ITS, VANETs are a subclass of Mobile Ad-hoc Networks (MANETs) with unique characteristics such as special mobility patterns, rapidly changeable topology, and temporary network fragmentation. VANETs have the potential to enhance the transportation safety, support traveller information, improve traffic flow, and develop comfort applications. Realizing these applications has resulted in new challenges for VANETs' routing protocols. Providing one-to-many and many-to-many communications for the new applications of VANETs causes the popularity of multicast routing protocols. Therefore, in this paper, at first, some applications which inherently need multicast routing protocols are introduced. Then we precisely look over the usefulness of current multicast routing protocols for VANETs.

In MANET, the multicast routing is considered as a non-deterministic polynomial (NP) complexity, it contains assorted objectives and restrictions. In the multicast issue of MANET, the Quality of services (QoS) based upon cost, delay, jitter, bandwidth, these are constantly deemed as multi-objective for intending multiple cast routing protocols. Conversely, mobile node has finite battery energy and the lifetime of network depending on its mobile node battery energy. If the mobile node has high battery energy consumption, it automatically reduces the network’s life time because of their route breaks. Alternatively, node’s battery energy has to be consumed to ensure higher level quality of services in multicast routing for transmitting the accurate data anywhere and anytime. Therefore, the network lifespan is deemed as multi-objective in the multicast routing (MR) problem. To overcome these issues, QoS and Dr. Valli Kumari Vatsavayi2 2Professor, Department of Electronic Communication and Engineering, Andhra University, visakhapatnam,Andhra Pradesh ,India. 2Email:vallikumariv001@yahoo.com Network Lifetime Aware Reliable Multicast Routing Protocol are proposed by applying Chaos integrated Cuckoo Search Rider Optimization Algorithm for effectual data transmission in MANET (QOS-MRP-CSROA-MANET). The proposed method is the joint execution of both the Cuckoo Search Algorithm with chaos theory (Chaotic-CSA) and Rider Optimization (ROA) algorithm and hence it is called as Chaotic-CSA-ROA, which is utilized to solve the MR problem of MANET. Here, the MR problem of MANET have five objectives, viz cost, delay, jitter, bandwidth, network lifetime are optimized with the help of Chaotic-CSA-ROA. Then the proposed method is simulated in NS2 simulator for validating the performance of the proposed QOS-MRP- CSROA-MANET system. Here, evaluation metrics, via delay, delivery ratio, drop, Network lifespan, overhead and throughput are analyzed with node, rate and speed. The proposed QOS-MRP-CSROA-MANET provide higher throughput in node as 32.9496% and 65.5839%, higher throughput in rate as 16.6049% and 30.4654%, higherthroughput in speed as 10.1298% and 7.0825%, low packet drop in node as 63.7313% and 52.2255%, low packet drop in rate as 51.5528% and 25.6220%, low packet drop in speed as 18.0857% and 24.5953% compared with existing methods, like QOS aware of multicast routing protocol using particle swarm optimization algorithm in MANET (QOS-MRP-PSOA-MANET) and QOS aware of multicast routing protocol using genetic algorithm in MANET (QOS-MRP-GA-MANET) respectively.

This paper, evaluates the performance of two ad-hoc multicast routing protocols under varying traffic, density and mobility conditions. We observe that a large fraction of the traffic is being carried on the Internet today by TCP. Thus internet traffic has inherently different characteristics than CBR traffic, which is commonly used traffic type for evaluating MANET routing protocols performance. Previous efforts to evaluate performance of TCP and CBR in tree-based multicast routing protocol (MAODV) are done. But these tree based protocols face lot of problem like single path property, vulnerable to high mobility and large group, single point of failure which are removed in mesh-based multicast routing protocol like ODMRP, ADMR etc. It is observe that mesh based protocol are robust enough and performance of CBR is more in mesh based protocol as compare to TCP.