Made available in DSpace on 2015-04-11T14:03:17Z (GMT). No. of bitstreams: 1 DISSERTACAO CLAUDIA SUZANY.pdf: 727638 bytes, checksum: 99ca8c710111acef29c2891b5586f81b (MD5) Previous issue date: 2008-11-12 / Coordenação de Aperfeiçoamento de Pessoal de Nível Superior / This thesis presents a prototype of admission control for VoIP calls in wireless mesh networks, called CAC-RM, using the IEEE 802.11g protocol. This admission control goal is to avoid that incoming VoIP data flows consume excessive resources and cause degradation in the established ones. The admission control proposed in our approach only accepts new VoIP calls if the inprogress calls quality do not become degraded. The main features of our approach are: (i) an estimated ocupation time at the channel with VoIP traffic and with traffic without quality requirements, so called BE (Best effort); (ii) the resources reservation for VoIP traffic; (iii) an integration of our prototype to the OLSR proactive routing protocol (sending control messages with information about the occupancy node time with BE and VoIP traffic); (iv) an intra-flow interference estimate with admission control integrated; (v) regulation for BE traffic; and (vi) prioritization to sending and receiving VoIP traffic. The prototype was initially evaluated by simulations of a wireless mesh network in a scenario where all nodes are neighbours, considering two variations: the first one has only VoIP data flows and the second has VoIP and BE data flows. We measured the packet loss and the delays of VoIP calls and evaluated the MOS (Mean Opinion Score) measure indicating the user s satisfaction. In the first scenario, without CAC-RM, when the number of VOIP calls increases, their quality are decreased (indicated by the MOS value measured). Using the proposed calls admission control some calls were rejected and the gains is about 70% in the MOS value measured. Besides there was a reduction up to 82% and 96%, respectively, in packets losses and delays. In the second variation the proposed CAC to avoid reduction to about 29% of VoIP with quality over 3.5, and reduces too the damagethe packet VoIP losses uppon 86 %. In other scenario using multiple hops, we used VoIP traffic and hop count, ETX and ML metrics. When the network is saturated, there are no calls with enough VoIP quality. But it s possible to get satisfatory VoIP calls rejecting some calls as done by the proposed CAC. This gives a gain of MOS and reduces to 75 % the packet loss. In both scenarios, the proposed VoIP call admission control has provem efficient avoiding admission of new VoIP calls would degrade the quality of already established connections and ensuring that BE traffic does not damage VoIP packets on the wireless mesh network. / Esta dissertação apresenta um controle de admissão para chamadas VoIP em Rede Mesh sem fio, denominado CAC-RM,que utiliza o protocolo IEEE 802.11g. Seu uso visa prevenir que a chegada de novas chamadas VoIP na rede consuma excessivamente recursos dos nós e causem degradação nos fluxos já estabelecidos, devido ao congestionamento do meio sem fio. Em nossa pesquisa, o controle de admissão proposto só aceitará novas chamadas VoIP caso a qualidade das chamadas em andamento não se torne insatisafatória. As principais características de nossa proposta são: (i) a estimativa do tempo de ocupação do meio com tráfego VoIP e tráfego que não necessita de requisitos de qualidade, denominado BE (Best effort); (ii) a reserva de recursos para tráfego VoIP; (iii) a integração do controle de admissão ao protocolo de roteamento pró-ativo OLSR (usando o envio de mensagens de controle com informações sobre o tempo de ocupação do nó com tráfego BE e VoIP); (iv) a estimativa sobre a interferência intra-fluxo integrada ao controle de admissão; (v) regulagem do tráfego BE; e (vi) a priorização do envio e recebimento do tráfego VoIP. Inicialmente, o controle de admissão proposto foi avaliado a partir de simulações de uma rede mesh sem fio em um cenário em que todos os nós são vizinhos e considerando duas variações: na primeira há somente tráfego VoIP e na segunda, tráfego VoIP e BE. Foram medidos e avaliados a perda e atrasos de pacotes das chamadas VoIP, assim como os valores do MOS (Mean Opinion Score), que indica a satisfação do usuário. No cenário em que os nós vizinhos só trafegam VoIP e não é utilizado o CAC-RM, à medida que a quantidade de chamadas VoIP cresce, sua qualidade é reduzida até que se torna inviável o uso do VoIP na rede. Com o uso do CAC-RM, obteve-se ganhos de até 70% no valor do MOS medido a partir da rejeição de algumas chamadas. Além disso, houve redução de até 82% e 96%, respectivamente, nas perdas de pacotes e atrasos. Já no cenário em que há tráfego VoIP e BE, o CAC proposto conseguiu evitar redução de, aproximadamenre, 29% das chamadas com qualidade, além de conseguir reduzir em até 86% as perdas de pacotes VoIP. No cenário com múltiplos saltos foram transmitidas chamadas VoIP na presença das métricas de roteamento Contagem de salto, ETX e ML. Sem o uso do CAC-RM e com tráfego intenso de dados, não há chamadas VoIP com qualidade satisfatória quando são necessários 02 saltos. A partir da rejeição de algumas chamadas feitas pelo CAC proposto, é possível obter chamadas VoIP com qualidade, contabilizando ganho no MOS, com redução de até 75% nas perdas de pacote. Em ambos os cenários simulados, o controle de admissão de chamadas proposto, mostrou-se eficiente ao evitar que a entrada de novas chamadas VoIP comprometesse o desempenho de chamadas já estabelecidas e que a existência de tráfego BE inviabilizasse o uso do VoIP na rede mesh sem fio.

The objective of this dissertation is to better understand the impact of the range extension and interference effects of opportunistic large arrays (OLAs), in the context of cooperative routing in multi-hop ad hoc networks. OLAs are a type of concurrent cooperative transmission (CCT), in which the number and location of nodes that will participate in a particular CCT cannot be known a priori. The motivation of this research is that the previous CCT research simplifies or neglects significant issues that impact the CCT-based network performance. Therefore, to develop and design more efficient and realistic OLA-based protocols, we clarify and examine through experimentation and analysis the simplified or neglected characteristics of CCT, which should be considered in the network-level system design. The main contributions of this research are (i) intra-flow interference analysis and throughput optimization in both disk- and strip-shaped networks, for multi-packet OLA transmission, (ii) CCT link modeling focusing on path-loss disparity and link asymmetry, (iii) demonstration of CCT range-extension and OLA-based routing using a software-defined radio (SDR) test-bed, (iv) a new OLA-based routing protocol with practical error control algorithm. In the throughput optimization in presence of the intra-channel interference, we analyze the feasibility condition of spatially pipelined OLA transmissions using the same channel and present numerical results with various system parameters. In the CCT link model, we provide the impact of path-loss disparity that are inherent in a virtual multiple-input-single-output (VMISO) link and propose an approximate model to calculate outage rates in high signal-to-noise-ratio (SNR) regime. Moreover, we present why link asymmetry is relatively more severe in CCT compared to single-input-single-output (SISO) links. The experimental studies show actual measurement values of the CCT range extension and realistic performance evaluation of OLA-based routing. Lastly, OLA with primary route set-up (OLA-PRISE) is proposed with a practical route recovery technique.

Même si les réseaux de données ont beaucoup évolué au cours des dernières décennies, les paquets sont presque toujours transmis d’un nœud à l’autre comme des blocs de données inaltérables. Cependant, ce paradigme fondamental est aujourd’hui remis en question par des techniques novatrices comme le codage réseau, qui promet des améliorations de performance et de fiabilité si les nœuds sont autorisés à mixer des paquets entre eux. Les réseaux sans fil manquent de fiabilité en raison des obstacles ou interférences que subissent les liens sans fil, et ces problèmes peuvent empirer dans des topologies maillées avec de multiples relais potentiels. Dans ce travail, nous nous concentrons sur l’application du codage réseau intra-flux aux flux unicast dans les réseaux sans fil, avec pour objectif d’améliorer la fiabilité des transferts de données et de discuter des opportunités de déploiement et des performances. Tout d’abord, nous proposons une borne inférieure pour la redondance, puis un algorithme opportuniste distribué, pour adapter le codage aux conditions du réseau et permettre la livraison fiable des données dans un réseau sans fil maillé, tout en prenant en compte les besoins de l’application. En outre, puisque les opérations requises pour le codage réseau sont coûteuses en termes de calcul et de mémoire, nous étendons cet algorithme pour s’adapter aux contraintes physiques de chaque nœud. Ensuite, nous étudions les interactions du codage intra-flux avec TCP et son extension MPTCP. Le codage réseau peut en effet améliorer les performances de TCP, qui ont tendance à être plus faibles sur les liens sans fil, moins fiables. Nous observons l’impact des problèmes d’équité qui se posent quand des flux codés fonctionnent en parallèle avec des flux traditionnels non codés. Pour finir, nous explorons deux manières différentes d’améliorer les performances de MPTCP dans les environnements sans fil : le faire fonctionner sur du codage réseau, et implémenter directement le codage directement dans le protocole MPTCP tout en préservant sa compatibilité avec TCP / Even if packet networks have significantly evolved in the last decades, packets are still transmitted from one hop to the next as unalterable pieces of data. Yet this fundamental paradigm has recently been challenged by new techniques like network coding, which promises network performance and reliability enhancements provided nodes can mix packets together. Wireless networks rely on various network technologies such as WiFi and LTE. They can however be unreliable due to obstacles, interferences, and these issues are worsened in wireless mesh network topologies with potential network relays. In this work, we focus on the application of intra-flow network coding to unicast flows in wireless networks. The main objective is to enhance reliability of data transfers over wireless links, and discuss deployment opportunities and performance. First, we propose a redundancy lower bound and a distributed opportunistic algorithm, to adapt coding to network conditions and allow reliable data delivery in a wireless mesh. We believe that application requirements have also to be taken into account. Since network coding operations introduce a non negligible cost in terms of processing and memory resources, we extend the algorithm to consider the physical constraints of each node. Then, we study the interactions of intra-flow coding with TCP and its extension MPTCP. Network coding can indeed enhance the performances of TCP, which tends to perform poorly over lossy wireless links. We investigate the pratical impact of fairness issues created when running coded TCP flows besides legacy non-coded TCP flows. Finally, we explore two different ways to enhance the performance of MPCTP in wireless environments : running it over network coding, and implementing the coding process directly in MPTCP while keeping it fully TCP-compatible.