Current network architectures, as well as mobility management protocols, are generally deployed in a centralized manner. Moreover, these protocols are designed to be always activated, even when not needed. As the number of mobile users and the volume of their traffic increase, such centralized architectures are expected to encounter scalability issues as well as performance issues. Recently, mobile network operators are experiencing a rapid increase in mobile data traffic. In order to cope with this, a new trend is to flatten networks architectures and hence IP mobility management protocols need to be adapted for such evolution. Therefore, there is a need to define novel mobility management mechanisms that are both distributed and offered dynamically. In order to cope with this context, the thesis concerns designing, analyzing, and evaluating novel IPv6 network architectures and mobility protocols that are distributed and dynamic, and in particular Distributed Mobility Management (DMM). Before proposing any extension, we categorize the existing mobility schemes and carry out a comparative analysis on each category. Then, we propose a new distributed dynamic mobility management scheme based on the Mobile IPv6 (MIPv6) protocol, with an optional extension for the joint use with the Session Initiation Protocol (SIP). After, we carry out a performance analysis in terms of mobility costs, handover, and quality-of-service. Finally, we study the impacts on other aspects such as security considerations and location management.

In networks, using large buffers tend to increase end-to-end packet delay and its deviations, conflicting with real-time applications such as online gaming, audio-video services, IPTV, and VoIP. Further, large buffers complicate the design of high speed routers, leading to more power consumption and board space. According to Moore's law, switching speeds double every 18 months while memory access speeds double only every 10 years. Hence, as memory requirements increasingly become a limiting aspect of router design, studying networks in finite-buffer regime seems necessary for network engineers. This work focuses on both practical and theoretical aspects of finite-buffer networks. In Chapters 1-7, we investigate the effects of finite buffer sizes on the throughput and packet delay in different networks. These performance measures are shown to be linked to the stationary distribution of an underlying irreducible Markov chain that exactly models the changes in the network. An iterative scheme is proposed to approximate the steady-state distribution of buffer occupancies by decoupling the exact chain to smaller chains. These approximate solutions are used to analytically characterize network throughput and packet delay, and are also applied to some network performance optimization problems. Further, using simulations, it is confirmed that the proposed framework yields accurate estimates of the throughput and delay performance measures and captures the vital trends and tradeoffs in these networks. In Chapters 8-10, we address the problem of modeling and analysis of the performance of finite-memory random linear network coding in erasure networks. When using random linear network coding, the content of buffers creates dependencies which cannot be captured directly using the classical queueing theoretical models. A careful derivation of the buffer occupancy states and their transition rules are presented as well as decodability conditions when random linear network coding is performed on a stream of arriving packets.

This research work provides the development of an Adaptive Flight Control System (AFCS) for autonomous hover of a Rotary-wing Unmanned Aerial Vehicle (RUAV). Due to the complex, nonlinear and time-varying dynamics of the RUAV, indirect adaptive control using the Model Predictive Control (MPC) is utilised. The performance of the MPC mainly depends on the model of the RUAV used for predicting the future behaviour. Due to the complexities associated with the RUAV dynamics, a neural network based black box identification technique is used for modelling the behaviour of the RUAV. Auto-regressive neural network architecture is developed for offline and online modelling purposes. A hybrid modelling technique that exploits the advantages of both the offline and the online models is proposed. In the hybrid modelling technique, the predictions from the offline trained model are corrected by using the error predictions from the online model at every sample time. To reduce the computational time for training the neural networks, a principal component analysis based algorithm that reduces the dimension of the input training data is also proposed. This approach is shown to reduce the computational time significantly. These identification techniques are validated in numerical simulations before flight testing in the Eagle and RMAX helicopter platforms. Using the successfully validated models of the RUAVs, Neural Network based Model Predictive Controller (NN-MPC) is developed taking into account the non-linearity of the RUAVs and constraints into consideration. The parameters of the MPC are chosen to satisfy the performance requirements imposed on the flight controller. The optimisation problem is solved numerically using nonlinear optimisation techniques. The performance of the controller is extensively validated using numerical simulation models before flight testing. The effects of actuator and sensor delays and noises along with the wind gusts are taken into account during these numerical simulations. In addition, the robustness of the controller is validated numerically for possible parameter variations. The numerical simulation results are compared with a base-line PID controller. Finally, the NN-MPCs are flight tested for height control and autonomous hover. For these, SISO as well as multiple SISO controllers are used. The flight tests are conducted in varying weather conditions to validate the utility of the control technique. The NN-MPC in conjunction with the proposed hybrid modelling technique is shown to handle additional disturbances successfully. Extensive flight test results provide justification for the use of the NN-MPC technique as a reliable technique for control of non-linear complex dynamic systems such as RUAVs.

Thesis (Master').

Multi-Processor System-on-Chip (MPSoC) possui vários processadores, em um único chip. Várias aplicações podem ser executadas de maneira paralela ou uma aplicação paralelizável pode ser particionada e alocada em cada processador, a fim de acelerar a sua execução. Um problema em MPSoCs é a comunicação entre os processadores, necessária para a execução destas aplicações. Neste trabalho, propomos uma arquitetura de rede de interconexão baseada na topologia crossbar, com memória compartilhada. Esta arquitetura é parametrizável, possuindo N processadores e N módulos de memórias. A troca de informação entre os processadores é feita via memória compartilhada. Neste tipo de implementação cada processador executa a sua aplicação em seu próprio módulo de memória. Através da rede, todos os processadores têm completo acesso a seus módulos de memória simultaneamente, permitindo que cada aplicação seja executada concorrentemente. Além disso, um processador pode acessar outros módulos de memória, sempre que necessite obter dados gerados por outro processador. A arquitetura proposta é modelada em VHDL e seu desempenho é analisado através da execução paralela de uma aplicação, em comparação à sua respectiva execução sequencial. A aplicação escolhida consiste na otimização de funções objetivo através do método de Otimização por Enxame de Partículas (Particle Swarm Optimization - PSO). Neste método, um enxame de partículas é distribuído igualmente entre os processadores da rede e, ao final de cada interação, um processador acessa o módulo de memória de outro processador, a fim de obter a melhor posição encontrada pelo enxame alocado neste. A comunicação entre processadores é baseada em três estratégias: anel, vizinhança e broadcast. Essa aplicação foi escolhida por ser computacionalmente intensiva e, dessa forma, uma forte candidata a paralelização. / Multi-Processor System-on-Chip (MPSoC) has multiple processors in a single chip. Multiple applications can be executed in parallel or a parallelizable application can be partitioned and allocated to each processor in order to accelerate their execution. One problem in MPSoCs is the communication between the processors required to implement these applications. In this work, we propose the architecture of an interconnection network based on the crossbar topology, with shared memory. This architecture is parameterizable, having N processors and N memory modules. The exchange of information between processors is done via shared memory. In this type of implementation each processor executes its application stored in its own memory module. Through the network, all processors have complete access to their own memory modules simultaneously allowing each application to run concurrently. Moreover, a processor can access other memory modules, whenever it needs to retrieve data generated by another processor. The proposed architecture is modelled in VHDL and its performance is analysed by the execution of a parallel aplication, in comparison to its sequencial one. The chosen application consists of optimizing some objetive functions by using the Particle Swarm Optimization method. In this method, particles of a swarm are distributed among the processors and, at the end of each iteration, a processor accesses the memory module of another one in order to obtain the best position found in the swarm. The communication between processors is based on three strategies: ring, neighbourhood and broadcast. This application was chosen due to its computational intensive characteristic and, therefore, a strong candidate for parallelization.

Multi-Processor System-on-Chip (MPSoC) possui vários processadores, em um único chip. Várias aplicações podem ser executadas de maneira paralela ou uma aplicação paralelizável pode ser particionada e alocada em cada processador, a fim de acelerar a sua execução. Um problema em MPSoCs é a comunicação entre os processadores, necessária para a execução destas aplicações. Neste trabalho, propomos uma arquitetura de rede de interconexão baseada na topologia crossbar, com memória compartilhada. Esta arquitetura é parametrizável, possuindo N processadores e N módulos de memórias. A troca de informação entre os processadores é feita via memória compartilhada. Neste tipo de implementação cada processador executa a sua aplicação em seu próprio módulo de memória. Através da rede, todos os processadores têm completo acesso a seus módulos de memória simultaneamente, permitindo que cada aplicação seja executada concorrentemente. Além disso, um processador pode acessar outros módulos de memória, sempre que necessite obter dados gerados por outro processador. A arquitetura proposta é modelada em VHDL e seu desempenho é analisado através da execução paralela de uma aplicação, em comparação à sua respectiva execução sequencial. A aplicação escolhida consiste na otimização de funções objetivo através do método de Otimização por Enxame de Partículas (Particle Swarm Optimization - PSO). Neste método, um enxame de partículas é distribuído igualmente entre os processadores da rede e, ao final de cada interação, um processador acessa o módulo de memória de outro processador, a fim de obter a melhor posição encontrada pelo enxame alocado neste. A comunicação entre processadores é baseada em três estratégias: anel, vizinhança e broadcast. Essa aplicação foi escolhida por ser computacionalmente intensiva e, dessa forma, uma forte candidata a paralelização. / Multi-Processor System-on-Chip (MPSoC) has multiple processors in a single chip. Multiple applications can be executed in parallel or a parallelizable application can be partitioned and allocated to each processor in order to accelerate their execution. One problem in MPSoCs is the communication between the processors required to implement these applications. In this work, we propose the architecture of an interconnection network based on the crossbar topology, with shared memory. This architecture is parameterizable, having N processors and N memory modules. The exchange of information between processors is done via shared memory. In this type of implementation each processor executes its application stored in its own memory module. Through the network, all processors have complete access to their own memory modules simultaneously allowing each application to run concurrently. Moreover, a processor can access other memory modules, whenever it needs to retrieve data generated by another processor. The proposed architecture is modelled in VHDL and its performance is analysed by the execution of a parallel aplication, in comparison to its sequencial one. The chosen application consists of optimizing some objetive functions by using the Particle Swarm Optimization method. In this method, particles of a swarm are distributed among the processors and, at the end of each iteration, a processor accesses the memory module of another one in order to obtain the best position found in the swarm. The communication between processors is based on three strategies: ring, neighbourhood and broadcast. This application was chosen due to its computational intensive characteristic and, therefore, a strong candidate for parallelization.

The purpose of this thesis was to investigate the feasibility of a wireless architectural approach for intra-vehicle communications. The current wired architecture was compared to a wireless approach based on three prominent wireless protocols, namely Bluetooth Low-Energy, Ultra Wide-Band, and 60 GHz Millimeter wave technology. The evaluation was focused on their potential use within the intra-vehicle domain, and judged by characterizing properties such as frequency, bandwidth utilization, and power efficiency. A theoretical study targeting the propagating behavior of electromagnetic waves was also involved. In particular, wireless behavior has been investigated both in general aspects as well as specifically aimed towards the intra-vehicle application. The theoretical study was then concluded and presented with a course of action regarding wireless connectivity. Beneficial design considerations, potentials and challenges were highlighted together with a discussion on the feasibility of a wireless architectural approach. Suggestions for future work and research have been given, which include further expansion of targeted protocols, alleviating the restricted security aspects, and extend the physical aspects onto more software based approaches.

Orientador: Leonardo de Souza Mendes / Dissertação (mestrado) - Universidade Estadual de Campinas, Faculdade de Engenharia Elétrica e de Computação / Made available in DSpace on 2018-08-21T21:10:42Z (GMT). No. of bitstreams: 1 Nunes_FabioPessoa_M.pdf: 6956532 bytes, checksum: 55194ac0a721f75279923f8424903edc (MD5) Previous issue date: 2012 / Resumo: O resumo poderá ser visualizado no texto completo da tese digital / Abstract: The abstract is available with the full electronic document / Mestrado / Telecomunicações e Telemática / Mestre em Engenharia Elétrica

Orientador: Leonardo de Souza Mendes / Tese (doutorado) - Universidade Estadual de Campinas, Faculdade de Engenharia Elétrica e de Computação / Made available in DSpace on 2018-08-18T16:50:00Z (GMT). No. of bitstreams: 1 Panhan_AndreMarcelo_D.pdf: 1974417 bytes, checksum: 984825f99aaa2e172e580c7197422517 (MD5) Previous issue date: 2011 / Resumo: As cidades digitais compõem um movimento emergente que visa a criação de ambientes virtuais, os quais surgem como uma alternativa para potencializar a promoção de comunidades e regiões de modo a complementar a organização das cidades reais. Elas representam ambientes com capacidade cognitiva e criativa, construídos a partir de competências individuais e sistemas de informação que operam sobre os espaços físicos, institucionais e digitais das cidades. Duas questões principais guiaram este estudo: o desenvolvimento de ambientes inovadores para cidades e a interoperabilidade de sistemas distribuídos das cidades digitais. Após uma introdução sobre o significado de cidades digitais, será apresentada a arquitetura proposta para a criação de um ambiente computacional para cidades digitais, baseado em um middleware peer-topeer (P2P). A arquitetura proposta para cidades digitais neste trabalho proporciona escalabilidade, interoperabilidade, independência de plataformas e fomento da produção comercial, cultural e tecnológica / Abstract: Digital cities comprise an emerging movement that aims to create virtual environments, which arise as an alternative to potentiate the promotion of communities and regions to complement the organization of real cities. They represent environments with cognitive ability and creative, constructed from individual skills and information systems that operate on the physical, institutional and digital spaces from cities. Two main questions guided this study: the development of innovative environments for cities and interoperability of distributed systems of digital cities. After an introduction on the meaning of digital cities, will be presented the proposed architecture to create a computational environment for digital cities, based on a peer-to-peer (P2P) middleware. The proposed architecture for digital cities in this work provides scalability, interoperability, platform independence and promoting commercial production, cultural and technological / Doutorado / Telecomunicações e Telemática / Doutor em Engenharia Elétrica

Orientador: Cecília Mary Fischer Rubira / Tese (doutorado) - Universidade Estadual de Campinas, Instituto de Computação / Made available in DSpace on 2018-08-24T09:31:42Z (GMT). No. of bitstreams: 1 NascimentoeSilva_AmandaSavio_D.pdf: 8931458 bytes, checksum: 448739042e9597c70abf120976d316b8 (MD5) Previous issue date: 2013 / Resumo: A confiabilidade é um requisito de qualidade indispensável a muitos sistemas orientados a serviços, cada vez mais disseminados em várias atividades humanas. Composições confiáveis de serviços são formadas por um conjunto de serviços com diversidade de projetos, isto é, um conjunto de serviços funcionalmente equivalentes, ou serviços alternativos, usados para implementar técnicas de tolerância a falhas. Uma determinada técnica, como por exemplo, Recovery Blocks ou N-version Programming, pode ser mais adequada para um contexto específico de execução do que outra, dependendo dos requisitos exigidos pela aplicação, como por exemplo, desempenho. Sistemas orientados a serviços são usualmente implantados num ambiente altamente dinâmico, em que são comuns alterações nos requisitos dos clientes e flutuações na qualidade de serviços. Portanto, uma composição de serviços confiável deveria poder modificar seu próprio comportamento dinamicamente em resposta a essas mudanças. Entretanto, as soluções existentes, que usam diversidade de projetos para implementar composições confiáveis, apresentam algumas limitações: (i) não apóiam a seleção de serviços alternativos adequados que garantam que a composição realmente tolere falhas de software; (ii) em geral implementam uma única técnica de tolerância a falhas, não apoiando os requisitos diversos de clientes; e (iii) não apoiam um mecanismo autoadaptativo capaz de mudar a estratégia de tolerância a falhas em tempo de execução. Nessa tese, é apresentada uma solução baseada em linhas de produtos de software, que explora a variabilidade de software existente nas técnicas de tolerância a falhas e nas mudanças ocorridas no ambiente de execução, para a implementação de composições de serviços tolerantes a falhas e autoadaptativas. A solução encompassa: (a) um conjunto de diretrizes para investigar até que ponto serviços alternativos são realmente diversos entre si para tolerar falhas de software; (b) uma família de técnicas de tolerância a falhas para construir composições confíaveis que permite a escolha de uma técnica mais adequada para o contexto; e (c) uma infraestrutura autoadaptiva que apoia a instanciação de técnicas diferentes de tolerância a falhas como resposta a mudanças ocorridas no contexto, baseando-se no gerenciamento dinâmico de variabilidades de software. Resultados de estudos empíricos sugerem que a solução é eficiente para apoiar composições de serviços tolerantes a falhas e autoadaptativas. Direções para trabalhos futuros são apresentadas / Abstract: Nowadays, society is dependent on systems based on Service-Oriented Architecture (SOA) for its basic day-to-day functioning. As a consequence, these systems should be reliable. Fault-tolerant service compositions encompass a set of services, each with equivalent functionality yet different designs, called alternate services, that are used to implement fault tolerance techniques. A particular technique, for example, Recovery Blocks or N-version Programming, might be more suitable in a context than in another one, depending on non-functional requirements of an application, for example, performance or reliability. SOA-based applications often rely in an environment that is highly dynamic and several decisions should be postponed until runtime, where we have different stakeholders with conflicting requirements, and fluctuations in the quality of services (QoS) are recurrent. Therefore, a fault-tolerant service composition should adapt itself to meet the dynamically and widely changing context. Nevertheless, the existing diversity-based solutions for fault-tolerant service compositions present some drawbacks: (i) they do not support the selection of alternate services that in fact efficient to support a reliable service composition; (ii) they usually support only one fault tolerance technique, thus not being able to face various clients' requirements; (iii) they do not support an adaptive fault tolerance mechanism able to instantiate different fault tolerance strategies at runtime to cope with dynamic changes in the context. In this thesis, we present a solution based on software product line, which explores the variability among various software fault tolerance techniques and changes in the execution environment, to implement fault-tolerant and self-adaptive service compositions. The proposed solution encompasses: (a) a set of directives to investigate to what extent alternate services are able to tolerate software faults; (b) a family of software fault tolerance techniques to support reliable service compositions, such as the most suitable technique can be chosen according to the context; (c) a self-adaptive infrastructure to instantiate at runtime appropriate fault tolerance techniques in response to changes in the context, through dynamic management of software variability. Results from empirical studies suggest that the proposed solution is efficient to support fault-tolerant and self-adaptive service compositions. Directions for future work are also presented / Doutorado / Ciência da Computação / Doutora em Ciência da Computação