A protocol for scalable loop-free multicast routing

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

In this paper, we considered previously existing multicast routing algorism and protocol and especially put more attention on CBT routing protocol to analyze its strength and weakness. As a result, traffic was converged upon core router because of structural problem of CBT protocol and according to the converged traffic, there was congestion at the core link, thus it caused efficiency degrades of the whole routing. Therefore, we proposed a way of conversion to Anycast Routing method from the method of CBT multicast tree routing that was suitable for traffic decentralization even though there was high bandwidth depended on increment of traffic load. In order to support multimedia service that requires from small to large bandwidth and to consider multicast routing protocol to improve characteristic of multicast packet’s delay, CBT/Anycast routing method can be proposed as an alternative plan for freedom of bandwidth in traffic.KeywordsInternet applicationsmulticast routinganycast routingcore base tree

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

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.

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.

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.

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.

Distributed shortest-path routing algorithms based on the Ford-Fulkerson method are simple to implement but they suffer from the cost-dependent looping problem: when link costs increase, routing table loops may form and convergence to correct paths may be too slow, depending on link costs. This problem can be eliminated if constraints are imposed on the order in which routing tables are updated at different nodes but the resulting internode protocols tend to be relatively complex. Furthermore, update constraints may restrict a node's ability to obtain alternate paths quickly in an environment where topology changes are frequent. In this paper, a new distributed shortest-path routing scheme based on the Ford-Fulkerson method is presented. Under the new scheme, each node uses partial topology information to eliminate the cost-dependent looping problem. No update constraints are imposed and no assumptions are made regarding link costs. In the worst case, the new scheme responds to link cost changes in O(D) update steps, where D is the diameter of the network after the occurrence of the changes.

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.

Wavelength‐division multiplexed (WDM) networks using wavelength‐routing are considered to be potential candidates for the next generation wide‐area backbone networks. At present, Internet Protocol (IP) is considered as de facto standard for transferring data in a wide‐area network. As WDM technology matures, there is a growing interest in integrated IP‐over‐WDM networks. Supporting multicasting in these networks poses a challenging topic. In IP multicast routing, only a subset of nodes may have multicast capability. The nodes that are not supporting multicast routing are by‐passed using IP tunneling concept. Because of IP tunneling, a node with optical splitting capability may not be considered while constructing a multicast tree. This results in poor bandwidth utilization. Some times, non‐delivery of data to some destinations may also happen. Hence, the IP multicast routing protocol need to consider the capabilities of the nodes. But, it may require some modifications to the existing IP multicast routing algorithms. We propose an approach, where nodes with splitting capability and wavelength conversion capability are connected and form a backbone. Hence, IP multicast routing algorithms need not consider the special capabilities of the nodes and these algorithms do not require any modifications. In multicast routing establishing a protection path is a difficult task, since the capabilities of nodes differ from each other. Using our approach it is possible to recover from a link or node failure. Also in a wide area network, delay involved in generating and establishing connections for multicast traffic is very high. In our approach, this delay is low, since it makes use of pre‐established connections (i.e., pre‐established backbone). The effectiveness of our proposed approach is demonstrated using extensive simulation experiments. The blocking performance of the proposed approach is also studied for dynamically arriving multicast sessions.

An Efficient Backbone Based Quick Link Failure Recovery Multicast Routing Protocol

In this paper, we study the multicast routing problem in ATM networks. The multicast routing problem, also known as the Steiner tree problem, has been well studied in the literature. However, less attention has been made for the definition of link costs and evaluating the performance of multicast routing algorithm from the network revenue point of view. Therefore, in this paper, we first proposed two approaches, namely, the Markov decision process-based (MDP) and maximum free residual capacity-based (MFC) approaches for defining link costs. We then developed three heuristic algorithms for finding near optimal multicast trees. Our simulation results indicate algorithms that estimating link costs based on the MDP approach yield better performance than those that based on the MFC approach. Among the three multicast routing algorithms that use MDP approach for estimating link costs, the algorithm that treats a multicast call as a collection of multiple point-to-point calls yields the worst performance while the algorithm that based on the genetic algorithm yields the best performance.

A lightweight and distributed geographic multicast routing protocol for IoT applications