Made available in DSpace on 2016-04-04T18:31:25Z (GMT). No. of bitstreams: 1 Marcia Maria Savoine.pdf: 2175715 bytes, checksum: 355bcfef34d422002fc47ef44d62e191 (MD5) Previous issue date: 2009-02-06 / This work presents the comparison made through simulations of discreet events, accomplished with the software ARENA, the techniques of Time Division Duplex (TDD) and Frequency Division Duplex (FDD). Techniques present in the pattern IEEE 802.16 and used by WiMAX in the bi-directional channels of uplink and downlink. The simulation model considered in the line of arrival of the services the concept FIFO (First-In, First-Out) and the simulations were accomplished considering five applications (Streaming, Download, Web, E-mail and Small-Transaction) for downlink and uplink. The number of channels in the Base Station varied from 4 to 60, with a throughput of 600 kbps. The regarded efficiency parameter was the minimum number of channels necessary in each one of the standard channels. The simulations were accomplished in three sceneries., In the first scenery it was considered the same profile of traffic for downlink and uplink, in the second scenery a traffic of downlink 2, 5, 10 and 15 times larger than the one of uplink. And, in the third scenery it was considered different proportions of traffics varying from 2 to 5 times more, 5 to 10 times more and from 10 to 15 times more. The analyses were done considering as efficiency parameter the converge of the waiting time of the users. ,It was verified that in asymmetric data traffic, the TDD technique was more efficient and there were spectrum idleness in the FDD technique. / Este trabalho apresenta a compara??o efetuada por meio de simula??es de eventos discretos, realizadas com o software ARENA, das t?cnicas de Duplexa??o por Divis?o no Tempo (TDD) e Duplexa??o por Divis?o da Freq??ncia (FDD), t?cnicas presentes no padr?o IEEE 802.16 e utilizadas pelo WiMAX nos canais bidirecionais de uplink e downlink. O modelo de simula??o considerou na fila de chegada dos servi?os o conceito FIFO (First-In, First-Out) e as simula??es foram realizadas considerando cinco aplica??es (Streaming, Download, Web, E-mail e Small-Transaction) para downlink e uplink. O n?mero de canais na Base Station variou de 4 a 60, com um throughput de 600 kbps. O par?metro de efici?ncia considerado foi o n?mero m?nimo de canais necess?rio em cada um dos canais padr?es. As simula??es foram realizadas em tr?s cen?rios, sendo que, no primeiro cen?rio se considerou o mesmo perfil de tr?fego para downlink e uplink, no segundo cen?rio com tr?fego de downlink 2, 5, 10 e 15 vezes maior que o de uplink. E, no terceiro cen?rio com propor??es variadas de tr?fegos variando de 2 a 5 vezes mais, 5 a 10 vezes mais e de 10 a 15 vezes mais. Realizadas as simula??es foram feitas as an?lises dos desempenhos, tomando como par?metro de efici?ncia a taxa de chegada e o tempo de espera do usu?rio perante aplica??es t?picas utilizadas na tecnologia de banda licenciada WiMAX, que segue este padr?o. A an?lise efetuada permitiu identificar, dada estas condi??es de tr?fego, qual das t?cnicas seria a mais indicada. Constatou-se ainda que em tr?fego de dados assim?tricos a t?cnica TDD se apresentou mais eficiente e, observou-se existir ociosidade de espectro na t?cnica FDD.

Neste trabalho propomos e analisamos algoritmos de alocação dinâmica de banda para rede óptica passiva (PON) de acesso padrão GPON (Gigabit PON). Estes algoritmos utilizam dados oriundos de SLA (service level agreement) para gerenciar a alocação de banda e classificar em 4 contêineres de tráfego (T-CONT) o tráfego gerado em 16 ONUs (optical network unit). Na transmissão upstream é utilizada a técnica de multiplexação por divisão de tempo (TDM) para gerenciar o acesso ao meio, evitando colisões. O primeiro algoritmo proposto aloca banda garantida para as ONUs e distribui a banda não utilizada de acordo com critério baseado em três SLAs. A taxa de bit upstream é 1,25 Gbps e o desempenho do algoritmo é analisado com base na variação do atraso de pacotes em função do tráfego gerado nas ONUs. O segundo algoritmo proposto utiliza ponderação de tráfego. Neste, analisamos o comportamento dos atrasos e a quantidade de banda solicitada e atendida por ONU quando as bandas garantida e extra são alteradas. Por fim, acrescentamos em nossa implementação um intervalo para o processamento do algoritmo de alocação dinâmica de banda (DBA) e resposta do hardware relacionado ao ciclo de interrogação. Então, analisamos o atraso de pacotes quando variamos o intervalo de processamento do DBA. Ao final, propomos uma solução preliminar para minimizar estes atrasos. Os resultados obtidos por meio de simulação computacional mostram a versatilidade dos algoritmos. / In this work we propose and analyze the performance of dynamic bandwidth allocation algorithms for optical passive networks (PON) in GPON standard (Gigabit PON). These algorithms use data from SLA (service level agreement) to manage bandwidth allocation and classify in 4 traffic containers (T-CONT) the traffic generated by 16 ONUs (optical network unit). In the upstream transmission the time division multiplexing (TDM) technique is used to manage the medium access, avoiding collisions. The first proposed algorithm allocates guaranteed bandwidth for the ONUs and distributes the bandwidth not used according to the criteria based on three SLAs. The upstream bit rate is 1.25 Gbps and the algorithm performance is analyzed based on the packets delay variation versus the traffic generated by ONUs. The second proposed algorithm uses weighted traffic. In this, we analyze the delay performance and the required bandwidth for each ONU and how much it is served when the guaranteed and extra bandwidth are changed. Finally, we added in our implementation an interval for the processing of the dynamic bandwidth allocation algorithm (DBA) and response of the hardware related to the interrogation cycle. In the end, we propose a preliminary solution to minimize these delays. The results obtained by means of computational simulation show the versatility of the algorithms.

Road accidents represent a serious social problem and are one of the leading causes of human death and disability on a global scale. To reduce the risk and severity of a road accident, a variety of new safety applications can be realized through wireless communications among vehicles driving nearby each other, or among vehicles and especially deployed road side units (RSUs), a technology known as a vehicular ad hoc network (VANET). Most of the VANET-enabled safety applications are based on broadcasting of safety messages by vehicles or RSUs, either periodically or in case of an unexpected event, such as a hard brake or dangerous road condition detection. Each broadcast safety message should be successfully delivered to the surrounding vehicles and RSUs without any excess delay, which is one of the main functions of a medium access control (MAC) protocol proposed for VANETs. This thesis presents VeMAC, a new multichannel time division multiple access (TDMA) protocol specifically designed to support the high priority safety applications in a VANET scenario. The ability of the VeMAC protocol to deliver periodic and event-driven safety messages in VANETs is demonstrated by a detailed delivery delay analysis, including queueing and service delays, for both types of safety messages. As well, computer simulations are conducted by using MATLAB, the network simulator ns-2, and the microscopic vehicle traffic simulator VISSIM, in order to evaluate the performance of the VeMAC protocol, in comparison with the IEEE 802.11p standard and the ADHOC MAC protocol (another TDMA protocol proposed for ad hoc networks). A real city scenario is simulated and different performance metrics are evaluated, including the network goodput, protocol overhead, channel utilization, protocol fairness, probability of a transmission collision, and safety message delivery delay. It is shown that the VeMAC protocol considerably outperforms the existing MAC schemes, which have significant limitations in supporting VANET safety applications. In addition to enhancing road safety, in-vehicle Internet access is one of the main applications of VANETs, which aims at providing the vehicle passengers with a low-cost access to the Internet via on-road gateways. This thesis presents a new strategy for deploying Internet gateways on the roads, in order to minimize the total cost of gateway deployment, while ensuring that a vehicle can connect to an Internet gateway (using multihop communications) with a probability greater than a specified threshold. This cost minimization problem is formulated by using binary integer programming, and applied for optimal gateway placement in a real city scenario. To the best of our knowledge, no previous strategy for gateway deployment has considered the probability of multihop connectivity among the vehicles and the deployed gateways. In order to allow a vehicle to discover the existence of an Internet gateway and to communicate with the gateway via multihops, a novel data packet routing scheme is proposed based on the VeMAC protocol. The performance of this cross-layer design is evaluated for a multichannel VANET in a highway scenario, mainly in terms of the end-to-end packet delivery delay. The packet queueing at each relay vehicle is considered in the end-to-end delay analysis, and numerical results are presented to study the effect of various parameters, such as the vehicle density and the packet arrival rate, on the performance metrics. The proposed VeMAC protocol is a promising candidate for MAC in VANETs, which can realize many advanced safety applications to enhance the public safety standards and improve the safety level of drivers/passengers and pedestrians on roads. On the other hand, the proposed gateway placement strategy and packet routing scheme represent a strong step toward providing reliable and ubiquitous in-vehicle Internet connectivity.

[Truncated abstract] This thesis develops a scheduled protocol (time division multiple access, TDMA) called flexible-schedule-based TDMA Protocol (FlexiTP), to address the problem of providing end-to-end guarantees on data delivery, whilst also respecting severe resource constraints of wireless sensor networks. FlexiTP achieves this balance through a distributed, synchronised, and loose slot structure in which sensor nodes can build, modify, or extend their schedules based on their local information. In FlexiTP, it is not necessary to predetermine the number of slots required for a network. FlexiTP's local repair scheme allows nodes to adjust their schedules dynamically and autonomously to recover from node and communication faults. Hence, it maintains a reliable and selforganising multihop network. Most sensor network protocols designed for data gathering applications implicitly assume a periodic rate of data collection from all nodes in the network to the base station. However, nodes may want to report their data more rapidly or slowly depending on the significance and importance of their data to the end-user. The problem is that traditional TDMA-based protocols are not flexible to changes in traffic patterns because of their rigid slot structure schemes. This thesis aims to solve this problem by developing an ondemand TDMA slot transfer method that leverages the flexible-slot structure algorithm of FlexiTP to transfer time slots from one part of the network to another part. ... While these communication patterns are sufficient for monitoring applications, individual sensor nodes may need to send their data to multiple destination nodes across the network in order to execute a distributed cooperative-function based on their local environment. This peer-to-peer communication pattern makes sensor networks more reactive to triggers from the environment. This thesis attempts to solve the problem of lack of peer-to-peer communication in the design of a TDMA-driven protocol by extending the idea of on-demand TDMA slot transfer method to allow each sensor node in the network to claim extra time slots to communicate with any other nodes (peers) in the network, without going through the base station. Nodes in the network may have different priorities of data because of event-triggering sensor readings or various types of sensor readings (e.g., light, temperature, and humidity) they provide. When nodes with high priority packets increase the frequency of their data collections, the network bandwidth may be dominated by these nodes. It is desirable to allow nodes with low priority packets to aggregate their packets and so enabling these nodes to send their data to the base station under the current available network bandwidth. This thesis proposes an on-demand data aggregation algorithm that enables sensor nodes to perform an in-network-aggregation based on their current sensing requirements and network capacity constraints. In summary, this thesis describes the design, implementation, and evaluation of protocols for wireless sensor networks that focus on achieving energy-efficiency, provisioning performance assurances, and supporting reactivity and adaptability in constantly changing environment.

Conselho Nacional de Desenvolvimento CientÃfico e TecnolÃgico / CoordenaÃÃo de AperfeiÃoamento de Pessoal de NÃvel Superior / Neste trabalho, alÃm dos capÃtulos que envolvem a teoria e definiÃÃes, foi basicamente divido em trÃs estudos: Primeiro (capÃtulo 4), apresentamos uma investigaÃÃo numÃrica do desempenho de um filtro passa-banda totalmente Ãptico composto por um acoplador direcional duplo seguido de duas grades de Bragg simetricamente iguais gravadas nos seus braÃos de saÃda. Esta configuraÃÃo caracteriza um InterferÃmetro de Michelson com caracterÃsticas de um filtro add/drop. As caracterÃsticas de transmissÃo (T), taxa de extinÃÃo (XR) e âcrosstalkâ (XT) foram estudadas a partir da aplicaÃÃo de um sinal CW (onda contÃnua) na entrada do dispositivo. A teoria de modos acoplados e o mÃtodo de Runge Kutta de 4a ordem foram aplicados, respectivamente para resolver as equaÃÃes diferenciais acopladas. Este à o primeiro estudo feito considerando a nÃo linearidade do acoplador e a linearidade das grades de Bragg. O dispositivo apresenta um comportamento altamente nÃo-linear em funÃÃo do defasamento entre as amplitudes dos feixes refletidos e em funÃÃo da potÃncia de entrada. Num segundo momento (capÃtulo 5) apresentamos a propagaÃÃo e chaveamento de pulsos ultracurto (~2ps) usando um interferÃmetro de Michelson de Fibras Ãpticas. Neste estudo o desempenho do interferÃmetro à estudado como uma funÃÃo das caracterÃsticas nÃo lineares do acoplador e das grades de Bragg. Os estudos numÃricos foram feitos a partir das equaÃÃes de modos acoplados resolvidas usando o mÃtodo de Runge-Kutta de 4 ordem. As caracterÃsticas de chaveamento do pulso foram analisadas em funÃÃo da potÃncia de entrada e do defasamento aplicado em uma das grades de Bragg. As caracterÃsticas de transmissÃo (T), coeficiente de ExtinÃÃo (XR), âcrosstalkâ (XT), fator de compressÃo (FC). Utilizamos trÃs valores de potÃncia de entrada: abaixo da potÃncia critica (P0=1W), igual a potÃncia crÃtica (P0=1,73W) e acima da potÃncia crÃtica (P0=1,95W). AtravÃs deste estudo, pode-se verificar que a transmissÃo, taxa de extinÃÃo, âcrosstalkâ e fator de compressÃo dependem da potÃncia da bombeio inserida no dispositivo e da defasagem aplicada. O interferÃmetro de Michelson em fibras implementa componente de grande importÃncia para aplicaÃÃes em redes Ãpticas, como os demultiplexadores add/drop. Este dispositivo tem atraÃdo bastante interesse no campo das telecomunicaÃÃes devido a sua alta capacidade de taxas de transmissÃo. Num terceiro momento foi apresentado um estudo de simulaÃÃo numÃrica do desempenho da codificaÃÃo e decodificaÃÃo de pulsos Ãpticos curtos (ps) em sistemas OCDMA (Optical Code Division Multiple Access â acesso VIII mÃltiplo por divisÃo de cÃdigo no domÃnio Ãptico) baseado em FBG (Fiber Bragg Grating â grade de Bragg em fibra Ãptica) onde os cÃdigos sÃo inseridos atravÃs de saltos discretos na fase Ãptica (Âπ). Para geraÃÃo de pulsos codificados foram utilizados cÃdigos de Gold obtidos analiticamente. Analisamos como a inserÃÃo de cÃdigos adicionais afetam a autocorrelaÃÃo e correlaÃÃo cruzada. O interferÃmetro de Michelson inicialmente estudado no capÃtulo 4 foi utilizado para propagaÃÃo e chaveamento de sinais codificados. Baseados nas caracterÃsticas de TransmissÃo (T) e Taxa de extinÃÃo (XR) fizemos um estudo do dispositivo como multiplexador /demultiplexador add/drop na recuperaÃÃo de pulsos codificados. / This work, in addition the chapters which involves both theory and definitions, was basically divided three studies: First (chapter 4),we present a numerical investigation of the performance of a bandpass filter composed of an all-optical directional coupler, followed by two double bars Bragg recorded symmetrically equal outputs in their arms. This configuration features a Michelson interferometer with characteristics of an add/ drop filter. The transmission characteristics (T), extinction rate (XR) and "crosstalk" (XT) were studied based on the application of a CW signal (continuous wave) into the device. Theory of coupled modes and the Runge Kutta fourth order were applied respectively to solve the coupled differential equations. This is the first study considering the nonlinearity of the coupler and the linearity of Bragg gratings. The device features a highly nonlinear behavior as a function of dephasing between the amplitudes of the reflected beams and depending on the input power. In a second step (section 5), the propagation and switching of ultrashort pulse (~ 2PS) Michelson interferometer using an optical fiber. In this study the performance of the interferometer is studied as a function of the nonlinear characteristics of the coupler and Bragg gratings. The numerical studies were made from the coupled mode equations solved using the Runge-Kutta 4th order. The pulse switching characteristics were analyzed as a function of input power and applied to one dephasing Bragg gratings. The transmission characteristics (T), extinction coefficient (XR), "crosstalk" (XT), the compression factor (CF)and shape of the pulses were analyzed for different values of phase and different input powers. We use three values of input power: below the critical power (1W = P0), equal to the critical power (P0 = 1.73W) and above the critical power (P0 = 1.95W). Through this study, it is found that the transmission rate of extinction, "crosstalk" and compression factor depends on the power of the pump device inserted into the gap and applied The Michelson interferometer fiber implement major component with applications in optical networks, such as demultiplexers add/drop. This device has attracted considerable interest in the field of telecommunications due to its ability of high transmission rates. In the third place was presented a numerical simulation study of the performance of encoding and decoding of short optical pulses (ps) systems OCDMA (Optical Code Division Multiple Access based on FBG (Fiber Bragg Grating ) where codes are inserted through discrete jumps in the optical phase ( π). For generation of coded pulses were used Gold codes obtained analytically. We look at how the inclusion of additional codes affect the autocorrelation and cross correlation.The Michelson interferometer initially studied Chapters 4 was used for propagation and switching of encrypted signals. Based on the characteristics of transmission (T) and extinction rate (XR) did a study of the device as multiplexer/demultiplexer add / drop in the recovery of coded pulses.

Neste trabalho propomos e analisamos algoritmos de alocação dinâmica de banda para rede óptica passiva (PON) de acesso padrão GPON (Gigabit PON). Estes algoritmos utilizam dados oriundos de SLA (service level agreement) para gerenciar a alocação de banda e classificar em 4 contêineres de tráfego (T-CONT) o tráfego gerado em 16 ONUs (optical network unit). Na transmissão upstream é utilizada a técnica de multiplexação por divisão de tempo (TDM) para gerenciar o acesso ao meio, evitando colisões. O primeiro algoritmo proposto aloca banda garantida para as ONUs e distribui a banda não utilizada de acordo com critério baseado em três SLAs. A taxa de bit upstream é 1,25 Gbps e o desempenho do algoritmo é analisado com base na variação do atraso de pacotes em função do tráfego gerado nas ONUs. O segundo algoritmo proposto utiliza ponderação de tráfego. Neste, analisamos o comportamento dos atrasos e a quantidade de banda solicitada e atendida por ONU quando as bandas garantida e extra são alteradas. Por fim, acrescentamos em nossa implementação um intervalo para o processamento do algoritmo de alocação dinâmica de banda (DBA) e resposta do hardware relacionado ao ciclo de interrogação. Então, analisamos o atraso de pacotes quando variamos o intervalo de processamento do DBA. Ao final, propomos uma solução preliminar para minimizar estes atrasos. Os resultados obtidos por meio de simulação computacional mostram a versatilidade dos algoritmos. / In this work we propose and analyze the performance of dynamic bandwidth allocation algorithms for optical passive networks (PON) in GPON standard (Gigabit PON). These algorithms use data from SLA (service level agreement) to manage bandwidth allocation and classify in 4 traffic containers (T-CONT) the traffic generated by 16 ONUs (optical network unit). In the upstream transmission the time division multiplexing (TDM) technique is used to manage the medium access, avoiding collisions. The first proposed algorithm allocates guaranteed bandwidth for the ONUs and distributes the bandwidth not used according to the criteria based on three SLAs. The upstream bit rate is 1.25 Gbps and the algorithm performance is analyzed based on the packets delay variation versus the traffic generated by ONUs. The second proposed algorithm uses weighted traffic. In this, we analyze the delay performance and the required bandwidth for each ONU and how much it is served when the guaranteed and extra bandwidth are changed. Finally, we added in our implementation an interval for the processing of the dynamic bandwidth allocation algorithm (DBA) and response of the hardware related to the interrogation cycle. In the end, we propose a preliminary solution to minimize these delays. The results obtained by means of computational simulation show the versatility of the algorithms.

Clock synchronization in a wireless sensor network (WSN) is essential as it provides a consistent and a coherent time frame for all the nodes across the network. Typically, clock synchronization is achieved by message passing using carrier sense multiple access (CSMA) for media access. The nodes try to synchronize with each other, by sending synchronization request messages. If many nodes try to send messages simultaneously, contention-based schemes cannot efficiently avoid collisions which results in message losses and affects the synchronization accuracy. Since the nodes in a WSN have limited energy, it is required that the energy consumed by the clock synchronization protocols is as minimum as possible. This can be achieved by reducing the duration for which the clock synchronization protocols execute. Synchronous clock synchronization protocols in WSNs execute the clock synchronization process at each node, roughly during the same real-time interval, called synchronization phase. The duration when there is no synchronization activity is called the synchronization interval. Synchronization phases are divided into synchronization rounds. The energy consumed by these protocols depends on the duration of the synchronization phase and how frequently the synchronization phase is executed. Hence, to minimize the energy consumption by each node, the duration of synchronization phase should be as small as possible. Due to different drift rates of the clocks, the synchronization phases at different nodes drift apart and special techniques are required to keep them in sync. An existing protocol, called improved weighted-average based clock synchronization (IWICS) uses a pullback technique to achieve this. If a message from (i + 1)th synchronization round is received by a node still executing the ith synchronization round, the receiving node reduces its next synchronization interval to ensure greater overlap in the synchronization rounds. The reduction in overlap is a gradual and continuous phenomenon, and so, it can be detected and dealt with continuously. In this thesis, first, we make use of TDMA-based MAC protocols, instead of CSMA, to deal with the problem of message losses. We discuss the challenges of using TDMA-based MAC protocols for clock synchronization and how to overcome these challenges. Second, The IWICS protocol calculates the virtual drift rate which we use to modify the duration of the synchronization interval so that there is more overlap between the synchronization phases of neighbouring nodes. We refer to this technique as drift rate correction. Finally, we propose a different pullback technique where the pullback detection is carried out in each of the synchronization phase as opposed to the old pullback mechanism where it would be detected only when an out-of-round synchronization message is received. The proposed pullback technique when applied to the current synchronization interval ensures that the synchronization phases, that follow the current synchronization interval, are better synchronized with each other. As a result of this, we are able to reduce the duration of synchronization phases further. The IWICS protocol with all these modifications incorporated is termed as the TIWICS (TDMA-based IWICS) protocol. Simulation and experimental results confirm that the TIWICS protocol performs better in comparison to the existing protocols.

No description available.

Le but principal des réseaux mesh sans fil (Wireless Mesh Networks-WMNs) est de fournir une dorsale de communication pour un grand nombre d'utilisateurs, car les WMNs doivent supporter un trafic énorme. Dans cette thèse, nous visons la maximisation d'utilisation et la répartition équitable de la bande passante dans les WMNs. Nous considérons deux environnements : WMN utilisant la norme IEEE 802.11 MAC, qui est caractérisée par son déploiement répandu et peu cher, et WMN utilisant les antennes directionnelles, qui représentent une technologie clé pour la réutilisation spatiale dans les réseaux sans fil. Pour les WMMs basés sur IEEE 802.11, nous concevons NICC, un protocole de contrôle de congestion qui reconnaît la congestion comme un problème lié au voisinage, et non pas au lien. NICC gère la congestion par une collaboration entre les nœuds d’un voisinage sans fil. En faisant usage de certains champs sous-exploités dans l'en-tête IEEE 802.11, NICC fournit un retour de congestion implicite et multi-bit. Ceci assure un contrôle précis du trafic sans affecter la bande passante. Pour les WMNs utilisant les antennes directionnelles, nous concevons FreeDMAC, un protocole MAC basé sur la technologie TDMA. FreeDMAC garantit que chaque nœud est conscient de toutes les transmissions dans son voisinage, ce qui évite les problèmes MAC causés par les antennes directionnelles, et ainsi, améliore l'utilisation de la bande passante. En outre, FreeDMAC est capable de fournir deux niveaux d’équité: équité entre les liens et équité entre les flux / The main purpose of Wireless Mesh Networks (WMNs) is to provide a communication backbone for a high number of end-users, thus WMNs have to support heavy traffic load. In this thesis, we intend to maximize utilization and achieve fair allocation of the bandwidth resources in WMNs. We consider two WMN environments: WMN using the IEEE 802.11 MAC standard, which is characterized by its cheap devices and widespread deployment, and WMN using directional antennas, which are emerged as an attractive technology to enhance the spatial reusability in wireless networks. For WMM based on IEEE 802.11, we design NICC, a congestion control scheme that recognizes congestion as neighborhood-related problem, and not a link-based one. Indeed, complex interference among neighboring nodes is the main starvation cause in WMNs. Therefore, NICC handles congestion using mutual cooperation within a wireless neighborhood. NICC makes use of some underexploited fields in the IEEE 802.11frame header in order to provide an implicit multi-bit congestion feedback, and thus ensure accurate rate control without generating overhead, making efficient use of bandwidth. For WMN with directional antennas, we design FreeDMAC, a TDMA-based MAC scheme with contention-free scheduling. FreeDMAC guarantees that each node is aware of all ongoing transmissions in its neighborhood, and thus avoids directional-related problems such as deafness, making efficient use of bandwidth. Moreover, FreeDMAC presents a link-slot assignment that provides two levels of fairness: Per-link and per-flow fairness

Les réseaux mesh sans fil (Wireless Mesh Networks-WMNs) sont des réseaux facilement déployables et à faible coût qui peuvent étendre l’Internet dans des zones où les autres réseaux peuvent difficilement accéder. Cependant, plusieurs problèmes de qualité de service (QoS) et de sécurité freinent le déploiement à grande échelle des WMNs. Dans cette thèse, nous proposons un modèle de contrôle d’admission (CA) et un système de réputation afin d’améliorer les performances du réseau mesh et de le protéger des nœuds malveillants. Notre système de CA vise à assurer la QoS des flux admis dans le réseau en termes de bande passante et de délai tout en maximisant l’utilisation de la capacité du canal. L’idée de notre solution est d’associer au contrôle d’admission une planification de liens afin d’augmenter la bande passante disponible. Nous proposons également un système de réputation ayant pour but de détecter les nœuds malveillants et de limiter les fausses alertes induites par la perte de paquets sur les liens du réseau. L’idée de notre solution est d’utiliser des tests statistiques comparant la perte de paquets sur les liens avec un modèle de perte préétabli. De plus, il comprend un système de surveillance composé de plusieurs modules lui permettant détecter un grand nombre d’attaques. Notre CA et notre système de réputation ont été validés, les résultats montrent qu’ils atteignent tous deux leurs objectifs / Wireless mesh networks (WMNs) are a very attractive new field of research. They are low cost, easily deployed and high performance solution to last mile broadband Internet access. However, they have to deal with security and quality of service issues which prevent them from being largely deployed. In order to overcome these problems, we propose in this thesis two solutions: an admission control with links scheduling and a reputation system which detects bad nodes. These solutions have been devised in order to further merge into a secure admission control. Our admission control schedules dynamically the network’s links each time a new flow is accepted in the network. Its goal is to accept only flows which constraints in terms of delay and bandwidth can be respected, increase the network capacity and decrease the packet loss. Our reputation system aims at assigning each node of the network a reputation which value reflects the real behavior of the node. To reach this goal this reputation system is made of a monitoring tool which can watch many types of attacks and consider the packet loss of the network. The evaluations of our solutions show that they both meet their objectives in terms of quality of service and security