Performance Of Different Routing Protocols Research Articles

Performance and QoS Assessment in WSN: Comparative Analysis of MBC, ECHERP, and PDCH Routing Methods

Objective: The objective of this research is to assess the performance and Quality of Service (QoS) provided by PDCH when compared with ECHERP and MBC routing protocols(RPs) within Wireless Sensor Networks (WSNs). Methods: Utilizing the NS2 Simulator, this paper provides an in-depth exploration of three hierarchical RPs viz. Equalized Cluster Head Election RP (ECHERP), Mobility Based Clustering (MBC), and PDCH (PEGASIS with Double Cluster head). A thorough examination of each protocol's performance is conducted, focusing on a range of QoS metrics such as Energy Consumption, Packet Drop Ratio, Throughput, and Delay. Findings: A comparative assessment is conducted between PDCH, ECHERP, and MBC, extracting QoS parameters. The examination and findings reveal that PDCH exhibits superior performance over ECHERP by 26.15%, 20%, 15.71%, and 37.73%. Similarly, PDCH outperforms MBC by 23.19%, 14.29%, 4.87%, and 15.13% across the mentioned parameters. Novelty: In this simulation, the NS2 software is utilized, with a specific emphasis on the suggested parameters. These metrics are crucial for evaluating the overall performance of different RPs in Wireless Sensor Networks (WSNs).

Analysis of Latency and Bandwidth for Edge-Based Short Length in Edge Computing Devices for Short Ranges and Long Ranges

Objectives: To propose an IoT-based design in an edge computing environment for short ranges and long ranges of real-time data streaming to the client. Methods: Multimedia data is used in this work. Here we have used Opnet for creating a physical architecture and to analyze the quality-of-service parameters like delay, throughput, and jitter for different Ad-hoc routing protocols like Ad-hoc on-Demand Distance vector routing, Dynamic source routing, Optimized Link State Routing, Temporally ordered routing algorithm and Geographic Routing Protocol for edge-based short length in edge computing devices for short ranges and long ranges. Riverbed academic modeler (formerly known as OPNET) has been used as a simulation tool to analyze the latency and bandwidth for edge computing under the pre-configured set-up. The simulation is accomplished using MATLAB to find the fluctuation of the delay, throughput, and jitter for edge-based short length in edge computing devices for short ranges and long ranges by applying the datasets in the edge computing environment. Findings: The results we got through simulations from different routing protocols like AODV, DSR, OLSR, TORA, and GRP of delay, throughput, and jitter shows that the proposed system strengthens the existing cloud-based system, leading to greater QoS.AODV surpasses all other protocols with a minimal delay of 0.24 msec and OLSR achieves the best performance with an average delay of 0.3 msec, better throughput of 180 bits/sec, and a load of 1410 bits/sec for the three key parameters of latency, throughput, and jitter. Novelty: The study compares the performance of different routing protocols and shows a reduction in the delay of 0.24 msec with respect to time as compared to other existing works. The proposed research is designed for a media streaming application based on the mobile nodes regarded as an edge devices fordifferent QoS parameters like throughput, delay, and load, and by comparing the existing work we found that AODV outperforms all other routing protocols with a minimum delay. Keywords: Edge Computing; Cloud Computing; Latency; Bandwidth; Throughput; Jitter

Energy-Saving Routing Protocols for Smart Cities

In recent decades, expansion in urban areas has faced issues such as management of public waste, noise, mobility, and air quality, among others. In this scenario, Internet of Things (IoT) and Wireless Sensor Network (WSN) scenarios are being considered for Smart Cities solutions based on the deployment of wireless remote sensor nodes to monitor large urban areas. However, as the number of nodes increases, the amount of data to be routed increases significantly as well, meaning that the choice of the data routing process has great importance in terms of the energy consumption and lifetime of the network. In this work, we describe and evaluate the energy consumption of routing protocols for WSN-based Smart Cities applications in LoRa-based mesh networks, then propose a novel energy-saving radio power adjustment (RPA) routing protocol. The Cupcarbon network simulator was used to evaluate the performance of different routing protocols in terms of their data package delivery rate, average end-to-end delay, average jitter, throughput, and load consumption of battery charge. Additionally, a novel tool for determining the range of nodes based on the Egli propagation model was designed and integrated into Cupcarbon. The routing protocols used in this work are Ad Hoc On-Demand Distance Vector (AODV), Dynamic Source Routing (DSR), and Distance Vector Routing (DVR). Our simulation results show that AODV presents the best overall performance, DSR achieves the best results for power consumption, and DVR is the best protocol in terms of latency. Finally, the proposed RPA routing protocol presents power savings of 11.32% compared to the original DSR protocol.

Interference Aware Routing Protocols for Underlay Cognitive Radio Networks

In this paper, optimal and sub-optimal routing protocols are proposed for cognitive radio networks. We first investigate optimal routing that consists in searching among all paths, the one that minimizes the end-to-end outage while verifying interference constraint to primary receiver. A sub-optimal one-hop routing is proposed where the best relay is selected in each hop. The last routing protocol consists in decomposing the network in many sub-networks composed of K hops. Then the best route is determined in each of these sub-networks so that the K hops-outage probability is minimized. The proposed K-hops routing allows a good compromise between complexity and performance. The performance of different routing protocols are evaluated through simulation results in terms of outage probability.

A Study of Wireless Sensor Networks to Comprehend their Relevance to Different Applications

Wireless sensor networks (WSNs) have experienced enormous growth, both in terms of the technology used and their practical applications. In order to understand the features of WSNs that make the solution suitable for a specific purpose, one needs to be aware of the theoretical concepts behind and technological aspects of WSNs. In this paper, the significance of WSNs is illustrated, with a particular emphasis placed on their demands and on understanding researchrelated problems. A review of the literature available is presented as well. Detailed discussions concerning sensor node architecture, different types of sensors used and their relevance for various types of WSNs is presented, highlighting the need to achieve application-specific requirements without degrading service quality. Multipath and cluster-based routing protocols are compared in order to analyze QoS requirements they are capable of satisfying, and their suitability for different application areas is reviewed. This survey highlights the performance of different routing protocols, therefore providing guidelines enabling each of the routing techniques to be used, in an efficient manner, with factors such as specific network structure, protocol operation and routing path construction taken into consideration in order to achieve better performance.

Mobility and QoS based cross network for ICN Vehicular Communication

Abstract In this paper, Quality of service based numerous mobility models with network performance parameters for optimization of HANETSs are reviewed, observed and analyzed. In smart cities, emergency services, traffic congestion and safety issues can be resolute by intelligent communication heuristic and transforming information between vehicles and transportation infrastructure. Self-organization and optimization in ICN, congestion, dynamic topology, high mobility, scalability and self-organization makes it difficult and costly to implement in real time deployment. Under multiple scenarios and conditions performance of different routing heuristics and network performance parameters are observed in literature by different authors using different simulation tools. Variable speed of vehicles, Road conditions, unpredictable driver behavior and obstacles influence the performance of different routing protocols. Data size and high mobility put a great influence on network lifetime. In this paper we analyzed the speed impact on VANET performance parameters like throughput and packet delivery ratio at different BSMs in different scenarios. Mobility and link awareness can enhance the network lifetime and other parameters like throughput, goodput and packet delivery ratio of vehicular ad hoc network observed under simulation

Performance analysis of SDN vs OSPF in diverse network environments

SummaryNetwork convergence is an important aspect in networks because it can limit the damage resulting from network failures and changes. Consequently, a lot of research considered comparing the performance of different routing protocols, whether in IP or SDN, to assess their convergence speed and reaction to failures. We previously modeled OSPF vs SDN networks in general network deployments and studied their comparative convergence delays for different network conditions. However, the type of network and the architecture choices also affect performance. Consequently in this paper, we model network convergence for two network architectures, datacenters and WANs, to discern the difference in SDN and IP convergence processes and speeds when the network type and characteristics change.

Optimal routing and one hop routing for D2D communications in the presence of mutual interference

The concept of device to device (D2D) communications allows to increase the capacity of cellular systems. In such systems, a D2D pair directly communicate without passing through the base station and use the same frequency band. Therefore, this communication generates interference to the base station. In some contexts, the D2D pair are not close to each other and relaying should be performed. In this paper, we investigate the performance of different routing protocols for D2D communications. The network is composed of D2D pair, multiple relays organized in clusters, a cellular user communicating with a base station. In such network, there is interference from the relays to the base station and interference from the cellular user to the relays. We call it mutual interference. We investigate optimal and suboptimal routing for D2D communications in the presence of interference. Optimal routing consists to select the path among available ones with the largest end-to-end signal to interference plus noise ratio. A sub-optimal one-hop routing is also proposed.

Routing in a many-to-one communication scenario in a realistic VDTN

In this paper, we evaluate and compare the performance of different routing protocols in a many-to-one communication within a Vehicular Delay Tolerant Network (VDTN). Seven groups with three stationary sensor nodes sense the temperature, humidity and wind speed and send these data to a stationary destination node that collect them for statistical and data analysis purposes. Vehicles moving in Tirana city roads in Albania during the opportunistic contacts will exchange the sensed data to destination node. The simulations are conducted with the Opportunistic Network Environment (ONE) simulator. For the simulations we considered two different scenarios where the distance of the source nodes from the destination is short and long. For both scenarios the effect of node density, ttl and node movement model is evaluated. The performance is analyzed using delivery probability, overhead ratio, average latency, average number of hops and average buffer time metrics. The simulation results show that the increase of node density increases the delivery probability for all protocols and both scenarios, and better results are achieved when shortest-path map-based movement model is used. The increase of ttl slightly affects the performance of all protocols. By increasing the distance between source nodes and destination node, delivery probability is decreased almost 10% for all protocols, the overhead for sprayandwait protocol does not change, but for other protocols is slightly increased and the average number of hops and average latency is increased.

Routing protocols source of self-similarity on a wireless network

In this work, a model of a MANET has been developed, performance of different routing protocols (DSR, GRP and OLSR) have been analyzed in terms of bandwidth utilization, delay, media access delay, packet retransmission, traffic sent and received and self-similar nature of the network traffic is also examined. The results of the analysis showed that OLSR and GRP have better performance on a larger wireless networks than DSR. In additional, routing protocols and increasing the number of network users (mobile stations) does not induce self – similar properties on a wireless network and it is found that, OLSR is the best for large wireless networks.

Impact of node density and TTL in vehicular delay tolerant networks: performance comparison of different routing protocols

In this work, we evaluate the performance of different routing protocols in vehicular delay tolerant networks (VDTNs). We study the impact of vehicles density and TTL on the network performance. The simulations are conducted with the opportunistic network environment (ONE) simulator. The performance is analysed using delivery probability, overhead ratio, average latency and average number of hops metrics. The simulation results show that the increase of node density improves the network performance. In dense network scenario, the performance of epidemic and maxprop routing protocols is better because the number of opportunistic contacts between nodes increases. For spray and wait, the performance is not improved since it uses a maximum of two hops to deliver bundles. Hence, in dense networks, a bundle may have a significant delay because it can only be delivered when a relay or source node have an opportunistic contact with the destination. The increase of ttl from 30 to 120 min does not improve the performance of three routing protocols in both scenarios. Multiple-copy protocols perform better in terms of delivery probability compared with single-copy protocol. The single-copy protocol uses the highest average number of hops and higher average latency compared with multiple-copy protocols.

IJARCCE - Computer and Communication Engineering

Ad-hoc networks consist of a set of mobile nodes with a restricted power supply resources that can communicate with each other without any established infrastructure or centralized administration.In modern days communication plays a very important role. By considering the wireless communication networks Adhoc networks plays dominant role. The main problem of Adhoc network is route failure. To improve the life time of network different routing protocols are consider. In present routing protocols of ad hoc networks, routing is an act of moving information from a source to destination in an internetwork. Route is selected in the route discovery phase until all the packets are sent out. Due to the continuous flow of packets in a selected route leads to the route failure. In order to reduce this problem a novel routing protocol based on multipath considering the percentage of the optimum value is proposed. In this paper, the analysis of the performance of different routing protocols like DSR, MBCR and MMBCR to get maximum optimum value using Network Simulator Software is carried out.

Reliability-Oriented Single-Path Routing Protocols in Wireless Sensor Networks

Wireless sensor networks (WSNs) bring significant advantages over traditional communications in today's applications, such as environmental monitoring, homeland security, and health care. However, harsh and complex environments pose great challenges in the reliability of WSN communications. To achieve reliable wireless communications within WSNs, it is essential to have a reliable routing protocol and to have a means to evaluate the reliability performance of different routing protocols. In this paper, we first model the reliability of two different types of sensor nodes: 1) energy harvesting sensor nodes and 2) battery-powered sensor nodes. We then present wireless link reliability models for each type of sensor nodes, where effects of different parameters, such as battery life-time, shadowing, noise, and location uncertainty, are considered for analyzing the wireless link reliability. Based on the sensor node and wireless link reliability models, we compare the performance of different routing algorithms in terms of end-to-end path reliability and number of hops. A dynamic routing approach is then proposed to achieve the most reliable end-to-end path in WSNs. Furthermore, to facilitate a fair and comprehensive comparison among different routing algorithms, a cost function approach that integrates the end-to-end path reliability and number of hops is proposed, providing an indicator of quality of service of applications running on WSNs.

Impact of Freeway Mobility Pattern on Routing Performance of Mobile Ad Hoc Networks

In all applications which are based on Mobile Ad-Hoc Networks, node mobility has a significant impact on the performance of routing protocols; consequently affect the usefulness of these applications. This paper presents an investigation and analysis of the performance of different routing protocols (AODV, DSR and OLSR) under freeway mobility pattern in motorway surveillance system based on Ad hoc camera network as a case study. The evaluation and analysis were performed for several different performance metrics and under varying network conditions. It has been shown from the results that under various mobility speeds and different traffic loads, AODV outperforms DSR and OLSR protocols, with respect to network throughput and protocol overhead. The conclusions of this study are important to provide a qualitative assessment of the applicability of these protocols to realworld motorway surveillance systems, and also as a basis for developing new ways to improve routing performance under different freeway mobility pattern conditions.

HIERARCHICAL ROUTING PROTOCOLS FOR WIRELESS SENSOR NETWORK–A SURVEY

Wireless sensor networks are a web of sensor nodes with a set of processor and limited memory unit embedded in it. Reliable routing of packets from the sensor node to its base station is the most important task for the networks. The routing protocols applied for the other networks cannot be used here due to its battery powered nodes. This paper gives an overview of the different hierarchical routing strategies used in wireless sensor networks and gives a brief working model of energy efficient routing protocols in WSN. In this paper performance of different routing protocols are compared based on metrics such as mobility support, stability, energy efficiency.

PERFORMANCE COMPARISON AND ANALYSIS OF MOBILE AD HOC ROUTING PROTOCOLS

A mobile ad hoc network (MANET) is a wireless network that uses multi-hop peer-to-peer routing instead of static network infrastructure to provide network connectivity. MANETs have applications in rapidly deployed and dynamic military and civilian systems. The network topology in a MANET usually changes with time. Therefore, there are new challenges for routing protocols in MANETs since traditional routing protocols may not be suitable for MANETs. Researchers are designing new MANET routing protocols and comparing and improving existing MANET routing protocols before any routing protocols are standardized using simulations. However, the simulation results from different research groups are not consistent with each other. This is because of a lack of consistency in MANET routing protocol models and application environments, including networking and user traffic profiles. Therefore, the simulation scenarios are not equitable for all protocols and conclusions cannot be generalized. Furthermore, it is difficult for one to choose a proper routing protocol for a given MANET application. According to the aforementioned issues, this paper focuses on MANET routing protocols. Specifically, my contribution includes the characterization of different routing protocols and compare and analyze the performance of different routing protocols.

Scenario Based Performance Analysis of variants of TCP using NS2-Simulator

The increasing demands and requirements for wireless communication systems especially in settings where access to wired infrastructure is not possible like natural disasters, conferences and military settings have led to the need for a better understanding of fundamental issues in TCP optimization in MANETS.TCP primarily designed for wired networks, faces performance degradation when applied to the ad-hoc scenario. Earlier work in MANETs focused on comparing the performance of different routing protocols. Our analysis is on performance of the variants of TCP in MANETS. Several different variants have been developed in order to refine congestion control in Mobile Adhoc Networks. These variants of TCP perform better under specific scenarios, our Analysis of the variants of TCP is based on three performance metrics: TCP Throughput ,Average End- to -End delay and Packet Delivery Fraction in high and low mobility. This analysis will be useful in determining the better variant among TCP Protocols to ensure better data transfer, speed, and reliability and congestion control. In this paper we carry out performance study of six variants of TCP to be able to classify which variant of TCP performs better in various possible scenarios in MANETs.