Survey of Routing Algorithms for Computer Networks

This thesis gives a general discussion of routing for computer networks, followed by an overview of a number of typical routing algorithms used or reported in the past few years. Attention is mainly focused on distributed adaptive routing algorithms for packet switching (or message switching) networks. Algorithms for major commercial networks (or network architectures) are reviewed as well, for the convenience of comparison

Self-stabilizing cluster routing in Manet using link-cluster architecture

We design a self-stabilizing cluster routing algorithm based on the link-cluster architecture of wireless ad hoc networks. The network is divided into clusters. Each cluster has a single special node, called a clusterhead that contains the routing information about inter and intra-cluster communication. A cluster is comprised of all nodes that choose the corresponding clusterhead as their leader. The algorithm consists of two main tasks. First, the set of special nodes (clusterheads) is elected such that it models the link-cluster architecture: any node belongs to a single cluster, it is within two hops of the clusterhead, it knows the direct neighbor on the shortest path towards the clusterhead, and there exist no two adjacent clusterheads. Second, the routing tables are maintained by the clusterheads to store information about nodes both within and outside the cluster. There are two advantages of maintaining routing tables only in the clusterheads. First, as no two neighboring nodes are clusterheads (as per the link-cluster architecture), there is no need to check the consistency of the routing tables. Second, since all other nodes have significantly less work (they only forward messages), they use much less power than the clusterheads. Therefore, if a clusterhead runs out of power, a neighboring node (that is not a clusterhead) can accept the role of a clusterhead. (Abstract shortened by UMI.)

Implementación de un sistema SDN para la movilidad en redes OMNIRAN

This document details all the information needed to understand and test distributed mobility management using the SDN paradigm. This project stars by an analysis of the mobility problem in dense networks. Traditionally mobility has been managed with hierarchical approaches extending the current mobility protocols. But thinking in the future evolution of the network into dense environments some scalability problems appear. The traditional centralized elements may not be able to handle all the traffic in the network and bottlenecks appear at the Mobility Anchors. Nowadays, the problems related to scalability are mostly resolved with hardware upgrades, but in dense environments this couldn’t be enough and surely it would be quite expensive. To find a solution to this problem the IETF has chartered the Distributed Mobility Management (DMM) Group.This project focus on implementing a DMM-based mobility solution designed within the EU FP7 CROWD project. Once the analysis of the problem ended and the requirements of the theoretical solution were defined, we developed all the necessary elements to physically build a distributed network using SDN to manage layer 2 and layer 3.The entities of the network are defined by the CROWD projectin its related publications[9][10]. These districts were run using an SDN implementation called OpenFlow. With all the elements developed we proceed to perform the necessary tests in order to evaluate the distributed mobility management as a solution. This document explains the full design, execution and validationprocesses. Finally all the measurements and statistical data are detailed in order to have an approximation of the services that could achieve the developed network.Ingeniería Telemátic

Guided Target Control System Final Design Report

Daimler Automotive, the parent company of Mercedes-benz requires improved methods for testing their Autonomous Emergency Braking Systems. To this end they have presented a series of four senior projects to California Polytechnic State University in San Luis Obispo. One of the Projects is to build a facsimile of a human crossing the street. The other three projects of which this is a part; are to produce an autonomous car facsimile. These projects are intended for use in testing new Autonomous Emergency Braking Systems and may serve as the basis for future senior projects

A Novel Path Planning Optimization Algorithm for Semi-Autonomous UAV in Bird Repellent Systems Based in Particle Swarm Optimization

Bird damage to fruit crops causes significant monetary losses to farmers annually. The application of traditional bird repelling methods such as bird cannons and tree netting became inefficient in the long run, keeping high maintenance and reduced mobility. Due to their versatility, Unmanned Aerial Vehicles (UAVs) can be beneficial to solve this problem. However, due to their low battery capacity that equals low flight duration, it is necessary to evolve path planning optimization. A path planning optimization algorithm of UAVs based on Particle Swarm Optimization (PSO) is presented in this dissertation. This technique was used due to the need for an easy implementation optimization algorithm to start the initial tests. The PSO algorithm is simple and has few control parameters while maintaining a good performance. This path planning optimization algorithm aims to manage the drone's distance and flight time, applying optimization and randomness techniques to overcome the disadvantages of the traditional systems. The proposed algorithm's performance was tested in three study cases: two of them in simulation to test the variation of each parameter and one in the field to test the influence on battery management and height influence. All cases were tested in the three possible situations: same incidence rate, different rates, and different rates with no bird damage to fruit crops. The proposed algorithm presents promising results with an outstanding reduced average error in the total distance for the path planning obtained and low execution time. However, it is necessary to point out that the path planning optimization algorithm may have difficulty finding a suitable solution if there is a bad ratio between the total distance for path planning and points of interest. The field tests were also essential to understand the algorithm's behavior of the path planning algorithm in the UAV, showing that there is less energy discharged with fewer points of interest, but that do not correlates with the flight time. Also, there is no association between the maximum horizontal speed and the flight time, which means that the function to calculate the total distance for path planning needs to be adjusted.Anualmente, os danos causados pelas aves em pomares criam perdas monetárias significativas aos agricultores. A aplicação de métodos tradicionais de dispersão de aves, como canhões repelentes de aves e redes nas árvores, torna-se ineficiente a longo prazo, sendo ainda de alta manutenção e de mobilidade reduzida. Devido à sua versatilidade, os Veículos Aéreos Não Tripulados (VANT) podem ser benéficos para resolver este problema. No entanto, devido à baixa capacidade das suas baterias, que se traduz num baixo tempo de voo, é necessário otimizar o planeamento dos caminhos. Nesta dissertação, é apresentado um algoritmo de otimização para planeamento de caminhos para VANT baseado no Particle Swarm Optimization (PSO). Para se iniciarem os primeiros testes do algoritmo proposto, a técnica utilizada foi a supracitada devido à necessidade de um algoritmo de otimização fácil de implementar. O algoritmo PSO é simples e possuí poucos parâmetros de controlo, mantendo um bom desempenho. Este algoritmo de otimização de planeamento de caminhos propõe-se a gerir a distância e o tempo de voo do drone, aplicando técnicas de otimização e de aleatoriedade para superar a sua desvantagem relativamente aos sistemas tradicionais. O desempenho do algoritmo de planeamento de caminhos foi testado em três casos de estudo: dois deles em simulação para testar a variação de cada parâmetro e outro em campo para testar a capacidade da bateria. Todos os casos foram testados nas três situações possíveis: mesma taxa de incidência, taxas diferentes e taxas diferentes sem danos de aves. Os resultados apresentados pelo algoritmo proposto demonstram um erro médio muto reduzido na distância total para o planeamento de caminhos obtido e baixo tempo de execução. Porém, é necessário destacar que o algoritmo pode ter dificuldade em encontrar uma solução adequada se houver uma má relação entre a distância total para o planeamento de caminhos e os pontos de interesse. Os testes de campo também foram essenciais para entender o comportamento do algoritmo na prática, mostrando que há menos energia consumida com menos pontos de interesse, sendo que este parâmetro não se correlaciona com o tempo de voo. Além disso, não há associação entre a velocidade horizontal máxima e o tempo da missão, o que significa que a função de cálculo da distância total para o planeamento de caminhos requer ser ajustada

Performance Evaluation of Load-Balanced Routing via Bounded Randomization

Future computer networks are expected to carry bursty traffic. Shortest-path routing protocols such as OSPF and RIP have t he disadvantage of causing bottlenecks due to their inherent single-path routing. That is, the uniformly selected shortest path between a source and a destination may become highly congested even when many other paths have low utilization. We propose a family of routing schemes that distribute data traffic over the whole network via bounded randomization; in this way, they remove bottlenecks and consequently improve network performance. For each data message to be sent from a source s to a destination d, each of the proposed routing protocols randomly choose an intermediate node e from a selected set of network nodes, and routes the data message along a shortest path from s to e. Then, it routes the data message via a shortest path from e to d. Intuitively, we would expect that this increase the effective bandwidth between each source-destination pair. Our simulation results indicate that the family of proposed load-balanced routing protocols distribute traffic evenly over the whole network and, in consequence, increases network performance with respect to throughput, message loss, message delay and link utilization. Moreover, implementing our scheme requires only a simple extension to any shortest-path routing protocol