Evaluation Of Routing Algorithms Research Articles

An Evaluation of Routing Algorithms in Traffic Engineering and Quality of Service Provision of Network on Chips

Nowadays the number of cores that are integrated into NoC (Network on Chip) systems is steadily increasing, and real application traffic, running in such multi-core environments requires more and more bandwidth. In that sense, NoC architectures should be properly designed so as to provide efficient traffic engineering, as well as QoS support. Routing algorithm choice in conjunction with other parameters, such as network size and topology, traffic features (time and spatial distribution), as well as packet injection rate, packet size, and buffering capability, are all equivalently critical for designing a robust NoC architecture, on the grounds of traffic engineering and QoS provision. In this paper, a thorough numerical investigation is achieved by taking into consideration the criticality of selecting the proper routing algorithm, in conjunction with all the other aforementioned parameters. This is done via implementation of four routing evaluation traffic scenarios varying each parameter either individually, or as a set, thus exhausting all possible combinations, and making compact decisions on proper routing algorithm selection in NoC architectures. It has been shown that the simplicity of a deterministic routing algorithm such as XY, seems to be a reasonable choice, not only for random traffic patterns but also for non-uniform distributed traffic patterns, in terms of delay and throughput for 2D mesh NoC systems.

A Simulation Environment for Evaluation of Routing Algorithms for Improvement of Electromobility Related Services

This paper describes the formulation and simulation of an optimization algorithm for a remote valet charging service for electric vehicles in Singapore. The problem is formulated as a modified Sequential Ordering Problem (SOP) for multiple clusters, and a simulation tool is created for the development and analysis of proposed solutions.

The Improvement of LEACH Algorithm in Wireless Sensor Networks

This paper covers a novel routing algorithm called Multi-Group based LEACH (MG-LEACH) that has been utilized the redundant deployed sensor nodes to improve the network life time. It has been suppressing the correlated data gathered by the sensor nodes by monitoring the similar event. Thus reduces not only the data transmission inside the clusters but also conserve the energy of deployed sensor nodes consequently improve the overall network lifetime. This is a simple idea that has been implemented over LEACH protocol however it is valid for almost all clustering based routing algorithms/protocols specially those variants based upon frame work of LEACH. The proposed routing algorithm has been simulated using MATLAB to verify the efficiency in enhancing network life time. A critical evaluation of routing algorithm is conducted to determine the relevance and applicability in increasing network life time. Simulation results confirmed that it has performed better than LEACH and enhanced network life time up to approximately 90%.

Routing Algorithm for Delay Tolerance in Wireless Sensor Networks

In a regular sensor node, there are three activities that are the core sources of energy consumption i.e. sensing, computation, and radio operations. Multi-Group, a novel routing algorithm based on LEACH (MG-LEACH) that has been utilized in redundant deployed sensor nodes to improve the network lifetime is explored. It has been suppressing the correlated data gathered by the sensor nodes by monitoring the similar event, thus not only reducing the data transmission inside the clusters but also conserving the energy of deployed sensor nodes consequently to improve the overall network lifetime. The proposed routing algorithm has been simulated using MATLAB to verify the efficiency in enhancing network lifetime. A critical evaluation of routing algorithm is conducted to determine the relevance and applicability in increasing network lifetime. Simulation results demonstrated that it has performed better than LEACH and enhanced network lifetime by up to approximately 90%.

Performance Evaluation of routing algorithms used in largescale WSN: A Step Towards A Smart City

Performance Evaluation of routing algorithms used in largescale WSN: A Step Towards A Smart City

Tightest constraint first: An efficient delay sensitive multicast routing algorithm

As a key issue in multicast routing with quality of service (QoS) support, constrained minimum Steiner tree (CMST) problem has been a research focus for more than a decade, and tens of heuristics have been developed to solve this NP-complete problem. Among all the previously proposed algorithms, the bounded shortest path algorithm (BSMA) (IEEE INFOCOM'95 1995; 1:377–385) have been proved to be capable of producing a multicast tree that has on average the lowest cost. However, such an excellent cost performance is accompanied with an extremely high time complexity. Recently, Feng et al. presented an alternative implementation of BSMA, which makes use of the latest research results on the delay-constrained least cost (DCLC) routing problem. Simulations indicate that, in comparison with the original implementation, the alternative implementation has a much lower time complexity with virtually identical cost performance, and it also runs much faster than many renowned heuristics such as KPP (IEEE/ACM Trans. Networking 1993; 1(3):286–292) and CAO (The design and evaluation of routing algorithms for real-time channels. Technical Report ICSI TR-94-024, International Computer Science Institute, University of California at Berkeley, June 1994). In this paper, we propose a brand new heuristic TCF, which is based on an idea called ‘tightest constraint first.’ TCF runs a DCLC heuristic only once for each destination and therefore has a provably low time complexity. We further propose an iterative heuristic ITCF, which uses TCF to obtain an initial tree and then gradually refines it. Extensive simulations demonstrate that, in the average sense, TCF can achieve a cost performance comparable to or better than that of BSMA, the cost performance of ITCF is even better than that of TCF, TCF runs approximately twice as fast as ITCF, and ITCF runs 2–4 times as fast as the best implementation of BSMA. Copyright © 2005 John Wiley & Sons, Ltd.

Performance Evaluation of Routing Algorithms for Mobility Models in Ad hoc Network

Mobile Ad hoc Networks (MANET) have been the focus of many recent research and development efforts because of the necessity of decentralized network configuration. An ad hoc network is characterized by multi-hop wireless connectivity and frequently changing network topology. To facilitate communication in this dynamically changing network topology, several routing protocols are proposed such as Dynamic Source Routing protocol, Ad hoc On-demand Distance Vector protocol and Destination Sequenced Distance Vector protocol. Most of research works are carried out by assuming random mobility models for speed and direction of the mobile. Such models can generate an unrealistic behavior such as sudden stopping and turning. Later, researchers used Uniform mobility models for both speed and position of the node. In this work, we define an exponential distribution model for speed and Gaussian distribution model for nodes position with its intuitively appealing natural formulation rather than earlier assumptions. We have applied our model to different routings protocols and have evaluated network performance under different mobility patterns. It is observed that when the mobile's position follows Gaussian distribution and its speed follows an exponential distribution, the performances of the routing protocol are better compared to uniform distribution.

Routing and admission control algorithms for multimedia traffic

Interactive voice and video applications (e.g. teleconferencing) over multi-hop packet-switched networks require bounds on delay, loss and jitter. This paper compares routing algorithms and admission control methods which are intended to provide the quality of service required by such applications. The method of comparison is detailed simulation. As part of this work, we propose several novel real-time routing algorithms. The best-performing routing algorithm is a new method which takes into account the constraints imposed by the admission control algorithm. A routing algorithm similar to those used in the phone system is the worst of the dynamic algorithms; static routing is far worse than any of these. The differences between the routing algorithms are greatest when the network is highly connected, and when admission control constraints are difficult to meet. The issue of fairness is also considered in the evaluation of the routing algorithms. Three admission control algorithms were compared under varying traffic conditions and QoS requirements. The impact of traffic shaping on link utilizations was investigated. Overall, the choice of admission control method was more important than the choice of routing algorithm. This work is the first detailed evaluation of routing algorithms for voice and video traffic in multi-hop networks that provide strong end-to-end guarantees.