Performance Evaluation of Algorithms of Dynamic Rendezvous Point Relocation

The Protocol Independent Multicast - Sparse Mode (PIM-SM) uses one center (referred here as the Rendezvous Point “RP”) for all sources in a multicast group. PIM-SM distributes the multicast traffic of a source through a so-called shared distribution tree, whose root is at a predefined core called Rendezvous Point (RP). It also builds source-specific trees to the sources whose data rates exceed a defined threshold. In the literature, several investigations are done to improve and provide an efficient mechanism for the dynamic relocation of the RP depending on the sources or the members of the multicast group. In this paper, we extend the investigation of three search algorithms used to find the optimal RP position. To evaluate the performance of these algorithms, Estimated Tree Cost (ETC) and our improvement Enhanced Estimated Tree Cost (EETC), are used. The reason behind our choice these two methods is a comparative investigation of the RP-selection methods proposed in the literature. From the comparison we can see that ETC finds the most optimal position of the rendezvous point. The Hill-Climbing algorithm and the standard PIM-SM protocol with static RP-selection are used as a reference for comparison. Our algorithms result in a lower network load compared to RP-selection algorithm. However, they need additional control messages.

Performance Comparison Among Reactive And Proactive Routing Protocols in Vehicular Networks with Low Vehicular Density

Vehicular Ad Hoc Network (VANET) is a form of Mobile Ad Hoc Networks, but the nodes of this network are vehicles with special equipment to enable them to communicate with each other. These networks need to implement protocols to ensure that messages are reached to their destinations and achieve the desired goal of the application. In this paper, we present an analysis of the performance of a number of major routing protocols used in these networks which protocols AODV (Ad hoc On-Demand Distance Vector), DSR (Dynamic Source Routing), and OLSR (Optimized link state routing). This analysis is based on various parameters such as packet delivery ratio and end-to-end delay, in order to find the best protocol can be used in the network with low density. To achieve this purpose, we used a simulator OPNET_17.5. Depending on the simulation results we have obtained and the analysis and comparison of these protocols at different low density contract .We found that the protocol AODV is the best among the studied protocols under the conditions set out in this study.

Performance Evaluation for GPSR and AODV routing protocols at the junctions in VANET

A Vehicular Ad-hoc Network (VANET) is a collection of nodes forming a wireless network, but the nodes of this network are vehicles with special equipment that enable them to communicate with each other. VANET protocols have to face high challenges due to dynamically changing topologies, link breakage and low vehicular density. A suitable and effective routing protocol helps to ensure that messages are reached to their destinations and achieve the desired aim of the application. In this research, we present an analysis of the performance of two major routing protocols used in these networks, which are AODV (Ad hoc On-Demand Distance Vector) and GPSR (Greedy Perimeter Stateless Routing). This analysis is based on various parameters such as end-to-end delay and average dropped packets, in order to find the best protocol which can be used in the network with low density at the junctions. To achieve this purpose, we used a simulator OPNET_17.5. Depending on the simulation results, we have obtained and the analysis and comparison of two protocols at different low density contract. We found that GPSR protocol has better performance end-to-end delay and average dropped packets are used as the performance metrics, and is better for VANET under the low vehicular density simulation scenario at junctions.

Integrating security keys exchange in the secure routing in AODV protocol

Mobile ad-hoc Networking MANETS is a promising concept to provide flexible, adaptive, and reconfigurable architecture, cost effective solution.In the mobile ad hoc network security is the basic concern for network functions work properly.Routing is the corner stone in Mobile ad-hoc Networks, A lot of known vulnerabilities and security threats can be exploited to attack routing messages, so it is important to provide secure routing protocol for MANETs.In this paper, we present a secure extension for ad-hoc On Demand Distance Vector Protocol (AODV). The default routing protocol for MANETs. The proposed protocol ensures that discovery of the route between the nodes is functioning properly and securely, achieving mutual authentication between nodes, routing message integrity, generating a security key of data sent and exchanges it securely to ensure confidentiality and all of these are in one stage. By this we save in wireless band, resource consumption, preventing duplicate of authentication algorithms.