Wireless sensor networks (WSNs) are frequently deployed unattended and can be easily captured or compromised. Once compromised, intrusion prevention methods such as encryption can no longer provide any protection, as a compromised node is considered a legitimate node and possesses the secret key for decryption. Compromised nodes are essentially inside attackers and can perform various attacks to break the functionality of the system. Thus, for safety-critical WSNs, intrusion detection techniques must be used to detect and remove inside attackers and fault tolerance techniques must be used to tolerate inside attackers to prevent security failure. In this dissertation research, we develop a class of dynamic redundancy management algorithms for redundancy management of multisource multipath routing for fault and intrusion tolerance, and majority voting for intrusion detection, with the goal of maximizing the WSN lifetime while satisfying application quality-of-service and security requirements, for base station based WSNs, homogeneous clustered WSNs, and heterogeneous clustered WSNs. By means of a novel model-based analysis methodology based on probability theory, we model the tradeoff between energy consumption vs. reliability, timeliness and security gain, and identify the optimal multisource multipath redundancy level and intrusion detection settings for maximizing the lifetime of the WSN while satisfying application quality-of-service requirements. A main contribution of our research dissertation is that our dynamic redundancy management protocol design addresses the issues of "how many paths to use" and "what paths to use" in multisource multipath routing for intrusion tolerance. Another contribution is that we take an integrated approach combining intrusion detection and tolerance in the protocol design to address the issue of "how much intrusion detection is enough" to prevent security failure and prolong the WSN lifetime time. We demonstrate resiliency of our dynamic redundancy management protocol design for intrusion detection and tolerance against sophisticated attacker behaviors, including selective and random capture, as well as persistent, random, opportunistic and insidious attacks, by model-based performance analysis with results supported by extensive simulation based on ns3. / Ph. D.

As developments in wireless ad hoc networks continue, there is an increasing expectation with regard to supporting content-rich multimedia communications (e.g., video) in such networks, in addition to simple data communications. The recent advances in multiple description (MD) video coding have made it highly suitable for multimedia applications in such networks. In this thesis, we study three important problems regarding multiple description video communications in wireless ad hoc networks. They are multipath routing for MD video, MD video multicast, and joint routing and server selection for MD video in wireless ad hoc networks. In multipath routing for MD video problem, we follow an applicationcentric cross-layer approach and formulate an optimal routing problem that minimizes the application layer video distortion. We show that the optimization problem has a highly complex objective function and an exact analytic solution is not obtainable. However, we find that a metaheuristic approach such as Genetic Algorithms (GAs) is eminently effective in addressing this type of complex cross-layer optimization problems. We provide a detailed solution procedure for the GA-based approach, as well as a tight lower bound for video distortion. We use numerical results to compare this approach to several other approaches and demonstrate its superior performance. In MD video multicast problem, we take the similar application-centric, cross-layer approach as in the multipath routing problem. We propose an MD video multicast scheme where multiple source trees are used. Furthermore, each video description is coded into multiple layers in order to cope with diversity in wireless link bandwidths. Based on this multicast model, we formulate the multicast routing as a combinatorial optimization problem and apply Genetic Algorithm (GA)-based metaheuristic procedure to solove this problem. Performance comparisons with existing approaches show significant gains for a wide range of network operating conditions. In the last problem, we study the important problem of joint routing and server selection for MD video in ad hoc networks. We formulate the task as a combinatorial optimization problem and present tight lower and upper bounds for the achievable distortion. The upper bound also provides a feasible solution to the formulated problem. Our extensive numerical results show that the bounds are very close to each other for all the cases studied, indicating the near-global optimality of the derived upper bounding solution. Moreover, we observe significant gains in video quality achieved by the proposed approach over existing server selection schemes. This justifies the importance of jointly considering routing and server selection for optimal MD video streaming in wireless ad hoc networks. / Master of Science

Aujourd'hui, la prolifération de matériel peu coûteux tels que les caméras et les microphones capables de capturer du contenu multimédia de façon ubiquitaire a conduit à l'émergence des réseaux de capteurs sans fil multimédia/vidéo (RCSFM /RCSFV). En conséquence, un grand éventail d'applications peuvent être projetées dans de nombreux domaines de la vie de tous les jours. Par rapport aux réseaux de capteurs traditionnels (RCSF), les RCSFVs présentent des défis uniques principalement en raison de la grande quantité de données à capturer et à transmettre au-dessus d'un réseau contraint en ressources. Dans ce travail, nous avons d'abord proposé un protocole de routage hiérarchique appelé ELPC (Energy Level Passive Clustering) dont l'objectif principal est d'améliorer la durée de vie du réseau en présence de flux vidéo. Ceci est obtenu grâce à l'équilibrage des charges au moment de la construction de la topologie où le rôle de tête de groupe est alterné entre les noeuds candidats en fonction de leur niveau d'énergie. La deuxième contribution consiste en un protocole de routage multichemin qui prend les interférences inter-chemin en considération. Au lieu de supprimer complètement les interférences, notre protocole de routage multichemin tente de les minimiser en se basant sur l'ajout d'informations supplémentaires sur les noeuds voisins dans les messages de construction de la topologie. De plus, nous proposons un schéma de files d'attente à priorités multiples où l'influence des types de données. Les résultats des simulations montrent que l'utilisation de chemins moins interférents combinée à un régime de multipriorité permet une meilleure qualité vidéo / Nowadays, the proliferation of inexpensive hardware such as CMOS cameras and microphones that are able to ubiquitously capture multimedia content has led to the emergence of wireless multimedia/video sensor networks (WMSN/WVSN). As a consequence, a wide spectrum of applications can be projected in many areas and everyday life. Compared to traditional WSNs, WVSNs introduce unique challenges due mainly to the big amount of data to be captured and transmitted over a constrained network. In this work, we first propose a cluster-based (hierarchical) routing protocol called ELPC (Energy Level Passive Clustering) where the main objective is to enhance the network lifetime while handling video applications. This is achieved thanks to a load balancing feature where the role of clusterheads is alternated among candidate nodes depending on their energy level. The second contribution consists in a multipath routing protocol with interference awareness. Instead of completely suppressing interferences, our multipath routing protocol tries to minimize them through a simple algorithm without extra overhead. Multiple paths are built at once while minimizing their inter-path interferences thanks to some additional information on neighboring nodes piggybacked on the route request messages. In addition to interference awareness, we propose a multiqueue multipriority scheme where the influence of data type in a video is considered. Simulation results show that using less interfering paths combined to a multiqueue multipriority scheme allows for better video quality

Traditional routing protocols select paths based on static link weights and converge to new paths only when there is an outright reachability failure (such as a link or router failure). This design allows routing scale to hundreds of thousands of nodes, but it comes at the cost of functionality: routing provides only simple, single path connectivity. Networked applications in the wide-area, enterprise, and data center can all benefit from network protocols that allow traffic to be sent over multiple routes en route to a destination. This ability, also called multipath routing, has other significant benefits over single-path routing, such as more efficiently using network resources and recovering more quickly from network disruptions. This dissertation explores the design of an architecture for path selection in the network and proposes a "narrow waist" interface for networks to expose choice in routing traffic to end systems. Because most networks are also business entities, and are sensitive to the cost of routing traffic in their network, this dissertation also develops a framework for exposing paths based on their cost. For this purpose, this dissertation develops a cost model for routing traffic in a network. In particular, this dissertation presents the following contributions: * Design of path bits, a "narrow waist" for multipath routing. Our work ties a large number of multipath routing proposals by creating an interface (path bits) for decoupling the multipath routing protocols implemented by the network and end systems (or other network elements) making a choice for path selection. Path bits permit simple, scalable, and efficient implementations of multipath routing protocols in the network that still provide enough expressiveness for end systems to select alternate paths. We demonstrate that our interface is flexible and leads to efficient network implementations by building prototype implementations on different hardware and software platforms. * Design of path splicing, a multipath routing scheme. We develop, path splicing, a multipath routing technique, which uses random perturbations from the shortest path to create exponentially large number of paths with only a linear increase in state in a network. We also develop a simple interface to enable end systems to make path selection decisions. We present various deployment paths for implementing path splicing in both intradomain and interdomain routing on the Internet. * Design of low cost path-selection framework for a network. Network operators and end systems can have conflicting goals, where the network operators are concerned with saving cost and reducing traffic uncertainty; and end systems favor better performing paths. Exposing choice of routing in the network can thus, create a tension between the network operators and the end systems. We propose a path-selection framework where end systems make path selection decisions based on path performance and networks expose paths to end systems based on their cost to the network. This thesis presents a cost model for routing traffic in a network to enable network operators to reason about "what-if " scenarios and routing traffic on their network.

Submitted by João Arthur Martins (joao.arthur@ufpe.br) on 2015-03-11T18:10:20Z No. of bitstreams: 2 license_rdf: 1232 bytes, checksum: 66e71c371cc565284e70f40736c94386 (MD5) Dissertaçao JOSIAS de LIMA JUNIOR.pdf: 4252506 bytes, checksum: 714cb7aa7e2dc62943c697bd35a222ed (MD5) / Approved for entry into archive by Daniella Sodre (daniella.sodre@ufpe.br) on 2015-03-13T13:00:53Z (GMT) No. of bitstreams: 2 license_rdf: 1232 bytes, checksum: 66e71c371cc565284e70f40736c94386 (MD5) Dissertaçao JOSIAS de LIMA JUNIOR.pdf: 4252506 bytes, checksum: 714cb7aa7e2dc62943c697bd35a222ed (MD5) / Made available in DSpace on 2015-03-13T13:00:53Z (GMT). No. of bitstreams: 2 license_rdf: 1232 bytes, checksum: 66e71c371cc565284e70f40736c94386 (MD5) Dissertaçao JOSIAS de LIMA JUNIOR.pdf: 4252506 bytes, checksum: 714cb7aa7e2dc62943c697bd35a222ed (MD5) Previous issue date: 2013-05 / Recent years have witnessed the emergence of new communication techniques in Computer Science that use both wireless technologies and self-organizing features. Their combination eliminates the need for using pre-defined wired structures and prior configurations. In this work, we develop a simulated version, using the network simulator 3 (ns-3), of the Heterogeneous Technologies Routing (HTR) framework that is suitable for interconnecting devices in a heterogeneous ad hoc network, extending its supported heterogeneous technologies with the addition of WiMAX and LTE devices, proposes an extension to enable multipath routing over this framework and investigates the impact of tuning routing parameters on convergence interval and energy consumption. Although a large number of works exist that investigate the tuning of routing parameter settings, to the best of our knowledge, none of them investigate the impact of these on protocol convergence and energy consumption. Multipath HTR routing, the extension we propose, offers several benefits such as load balancing, fault tolerance, routing loop prevention, energy-conservation, low end-to-end delay, and congestion avoidance, among others. This work performs a comparative analysis of the proposed HTR extension, with the baseline HTR, and the widely used Optimized Link State Routing (OLSR) protocol. Moreover, we investigate the impacts of tuning the HELLO refresh interval and perform a comparative analysis of the tuned HTR with the OLSR protocol. Both evaluations are validated through the simulation of heterogeneous technologies such as WiMAX, 3GPP LTE and Wi-Fi. Results show that the multipath extension effectively improves the data delivery ratio, and reduces the end-to-end delay without major impact on network energy consumption. For the tuned HTR, results show that varying the HELLO refresh interval can improve the convergence of the protocol and reduce the energy consumption. / Recentemente, novas técnicas de comunicação surgiram que usam tecnologia sem fio e são capazes de se autoconfigurar. A combinação desses fatores elimina a necessidade de utilizar estruturas cabeadas e configurações pré-definidas. Neste trabalho, o autor desenvolve uma versão simulada, através do simulador de rede “network Simulator 3” (ns-3), do arcabouço “Heterogeneous Technologies Routing” (HTR), que se propõe à interconectar dispositivos em redes heterogêneas ad hoc, estendendo o seu suporte às tecnologias heterogêneas com a adição de dispositivos WiMAX e LTE, propõe uma extensão para fornecer um roteamento baseado em múltiplos caminhos (“Multipath”) e investiga o impacto de modificar os parâmetros de configuração do roteamento no tempo de convergência da rede e consumo de energia. Apesar de um grande número de obras existentes que investigam o impacto da mudança de parâmetros de configuração do roteamento, no meu conhecimento, nenhum deles investiga o impacto destes no tempo de convergência do protocolo e consumo de energia. O “Multipath HTR”, a extensão proposta, oferece vários benefícios como balanceamento de carga, tolerância a falhas, prevenção de “loops” de roteamento, conservação de energia, baixo atraso fim-a-fim, e evita o congestionamento, entre outros. Este trabalho faz uma análise comparativa da extensão ao HTR proposta, com a base do HTR, e o protocolo amplamente utilizado “Optimized Link State Routing” (OLSR). Além disso, o esse trabalho investiga o impacto de variar o intervalo de envio de mensagens de HELLO e realiza uma análise comparativa do HTR modificado (“Tuned HTR”) com o protocolo OLSR. As duas avaliações são realizadas através de simulação usando tecnologias heterogêneas como WiMAX, 3GPP LTE e Wi-Fi. Resultados mostram que a extensão de múltiplos caminhos proposta melhora a taxa de transmissão de dados, e reduz o atraso fim-a-fim sem maiores impactos no consumo de energia da rede. Para o “Tuned HTR”, resultados mostram que a variação do intervalo de envio de mensagens de HELLO pode melhorar a convergência do protocolo e reduz o consumo de energia.