The increasing growth of mobile devices in the whole world, and the forecasts for the coming years has been indicated by several reports. Nonetheless, this need for ubiquitous collaboration has brought new possibilities and challenges to the scientific community. Mobile Ad hoc Networks (MANETs) emerges in this scenario allowing devices to interconnect autonomously, without the need of a fixed infrastructure, in order to provide communication and information services. Due to such decentralization and the natural constraints of mobile devices, it remains, to this day, a challenge to provide efficient routing for MANETs. In this dissertation we propose new routing enhancements based on policies for MANETs running the HTR protocol. We consider the role(s) a user associated to a device performs within an organization. Hence our policies can guide the routing based on these roles. With this scheme we improve communication according to different business needs and scenario requirements. To this end, we propose a set of policies that affects the routing behavior and present four case studies to present each policy. Then we analyze two policies in terms of end-to-end delay, and nodes’ lifetime. Through simulation we evaluate these metrics while varying parameters such as the amount of nodes participating in the network, the mobility characteristics, and the number of traffic sources. Our results show that it is possible to achieve these goals without causing great impact on the average end-to-end delay and energy consumption, two important metrics in any MANET evaluation. We explore the results in several scenarios and detail our findings, which can provide a different perspective for future MANET applications. / Submitted by João Arthur Martins (joao.arthur@ufpe.br) on 2015-03-10T18:42:15Z No. of bitstreams: 2 Dissertação Gabriela Coutinho.pdf: 1701782 bytes, checksum: 113328c2efdd1ba97f7a237d03cab574 (MD5) license_rdf: 1232 bytes, checksum: 66e71c371cc565284e70f40736c94386 (MD5) / Made available in DSpace on 2015-03-11T17:46:06Z (GMT). No. of bitstreams: 2 Dissertação Gabriela Coutinho.pdf: 1701782 bytes, checksum: 113328c2efdd1ba97f7a237d03cab574 (MD5) license_rdf: 1232 bytes, checksum: 66e71c371cc565284e70f40736c94386 (MD5) Previous issue date: 2013-09-13 / O crescimento das vendas de aparelhos móveis em todo o mundo, bem como as previsões para os próximos anos são apontadas em diversos relatórios. No entanto, essa necessidade de colaboração ubíqua trouxe novas possibilidades e desafios para a comunidade científica. Redes móveis ad hoc (Mobile Ad hoc Networks - MANETs) surgem diante deste cenário e permite que dispositivos se comuniquem de forma autônoma, sem a necessidade de uma infraestrutura predefinida para fornecer comunicação e serviços. Porém, essa descentralização junto com as restrições naturais dos dispositivos móveis, proporcionar roteamento eficiente para MANETs permanece um desafio. Este trabalho propõe novas melhorias para o roteamento em MANETs que utilizam o protocolo HTR. Também considera o papel que usuários associados aos dispositivos desempenham dentro de uma organização. Desta forma, as políticas desenvolvidas podem guiar o roteamento também com base nestes papéis. Com este esquema, é possível melhorar a comunicação de acordo com necessidades de negócio e requerimentos de cenário. Para este fim, esta dissertação propõe um conjunto de políticas que afetam o comportamento do roteamento e analisa os impactos em termos de atraso, energia gasta e tempo de vida dos nós. Através de simulações, essas métricas são avaliadas também com variação de parâmetros como a quantidade de nós que participam da simulação, as características de mobilidade e o número de fontes de tráfego. Resultados mostram que é possível atingir esses objetivos sem causar grande impacto negativo no atraso fim a fim e no consumo de energia, duas métricas importantes em avaliações de redes MANET. Nós exploramos esses resultados em diversos cenários e detalhamos nossas descobertas, que podem servir como uma perspectiva diferente para futuras aplicações de redes MANET.

Orientadores: Michel Daoud Yacoub, Paulo Cardieri / Dissertação (mestrado) - Universidade Estadual de Campinas, Faculdade de Engenharia Eletrica e de Computação / Made available in DSpace on 2018-08-08T19:06:07Z (GMT). No. of bitstreams: 1 Seo_CarlosEduardo_M.pdf: 1219462 bytes, checksum: 82d4d1e386063360592e56cb2b76b1b3 (MD5) Previous issue date: 2007 / Resumo: Este trabalho visa o estudo de redes ad hoc sem ?o, em especial, os protocolos da subcamada MAC do modelo OSI. Neste tipo de rede sem controle centralizado, o acesso ao meio se torna uma parte crítica no processo de comunicação entre terminais. Assim sendo, a principal motivação deste trabalho é investigar como os protocolos da subcamada MAC podem afetar o desempenho da rede do ponto de vista das aplicações, em especial, tráfego VoIP e de dados. Para tal, foram feitas análises comparativas entre diversos protocolos, baseadas em resultados de simulações feitas no simulador de redes ns2. Tais resultados mostram que a maior parte das alternativas ao protocolo padrão IEEE 802.11 ainda precisam amadurecer para que possam tornarse comercialmente viáveis. Um protocolo, no entanto, se destaca dos demais em cenários de tráfego misto (voz e dados), apresentando melhoria de desempenho em relação ao IEEE 802.11: o IEEE 802.11e, variante do IEEE 802.11 com funções de suporte a QoS / Abstract: This work presented here is focused on studying ad hoc wireless networks, in particular, the MAC sublevel protocols from the OSI reference model. In these networks, the lack of a centralized control makes the medium access control a critical part in the communication process between network terminals. Thus, the main objective of this work is to investigate how the MAC sublevel protocols may interfere in network performance from the application point of view, in particular, VoIP and data transmission. In order to accomplish this goal, several comparative analysis between protocols have been made, based on simulation results from the ns2 network simulator. The results show that the alternatives to the IEEE 802.11 standard suggested so far aren¿t mature enough to be commercially viable, although there is one protocol that is very promising: the IEEE 802.11e, a variant of IEEE 802.11 with QoS support functions / Mestrado / Telecomunicações e Telemática / Mestre em Engenharia Elétrica

Orientador: Paulo Cardieri / Dissertação (mestrado) - Universidade Estadual de Campinas, Faculdade de Engenharia Eletrica e de Computação / Made available in DSpace on 2018-08-11T20:35:16Z (GMT). No. of bitstreams: 1 Nardelli_PedroHenriqueJuliano_M.pdf: 487443 bytes, checksum: d0645b76b7fd0f22601a42712d440da4 (MD5) Previous issue date: 2008 / Resumo: As características inerentes às redes ad hoc sem fio como, por exemplo, a ausência de uma infraestrutura pré-determinada e a possibilidade de enlaces de múltiplos saltos, exigem medidas de desempenho que capturem as inter-relações entre as camadas física, de acesso ao meio e de enlace. Com base na métrica eficiência de informação agregada e no atraso de pacote, as relações de compromisso entre diversas variáveis da rede são analisadas neste trabalho. É mostrado também que a possibilidade de retransmissão para pacotes recebidos em erro pode melhorar o desempenho da rede. Considerando sistemas em que uma parcela dos enlaces ativos estão em situação de outage, observa-se que os melhores resultados ocorrem para probabilidade de ocorrência de outage na rede entre 50% e 80%. Para enlaces de múltiplos saltos, os resultados mostram que é preferível ter transmissões formadas por um número maior de saltos, com receptores que exijam uma maior potência mínima para a recepção de um pacote. / Abstract: The inherent characteristics of ad hoc networks such as the lack of infrastructure and the possibility of multi-hop links require performance measures that capture the relationships between physical layer, medium access control and link layer. Based on aggregate information efficiency metric and packet delay, trade-offs involving several networks variables are analyzed. It is shown that the possibility of packet retransmission improves the network performance. In networks where part of the active links is in outage, the best results are found for outage probabilities between 50% and 80%. Concerning multi-hop links, the results show that it is preferable having transmissions with a greater number of hops formed by receptor terminals that require higher threshold powers for a packet reception. / Mestrado / Telecomunicações e Telemática / Mestre em Engenharia Elétrica

Made available in DSpace on 2016-08-17T14:53:06Z (GMT). No. of bitstreams: 1 Diego_Souza_Gomes.pdf: 2086164 bytes, checksum: d2a9f245dd16522cb21c6fcb10bb8447 (MD5) Previous issue date: 2009-12-07 / Mobile computing technologies and wireless networks have evolved very quickly. Nowadays, many of the portable devices have significant processing power, storage and communication capacity. At the same time, grid computing technology became an important tool for collaborative work among users and organizations enabling the sharing of computing resources and services through multiple administrative domains. Due to the popularity of mobile computing, users of handheld devices form an important and new segment of the computing grid, assuming both the role of consumers and providers of resources and services. The integration of these two categories of distributed systems aims to extend the capabilities of portable devices, enabling access to a infrastructure of shared resources, as well as provide faster and easier means for grid services users to access information produced by these systems at any time and place. This work describes the MInteGrade (Mobile InteGrade), a software infrastructure that provides access to the InteGrade grid middleware from mobile devices connected through IEEE 802.11 wireless networks in infrastructure mode, and Bluetooth networks in Ad hoc mode. Through this mechanism for access to a computational grid, mobile clients can request the execution of applications on the grid, monitor the execution of applications and view the computation results already completed. The MInteGrade was designed so as to consider the dynamics of wireless networks. Specifically, it supports disconnections of devices and dynamic changes of the Ad hoc network topology, aswell as content adaptation of the output of the grid computations. / Tecnologias de computação móvel e de redes sem fio têm evoluído muito rapidamente, de forma que muitos dos dispositivos portáteis possuem atualmente considerável capacidade de processamento, armazenamento e comunicação. Paralelo a isso, a tecnologia de grades computacionais se consolidou como um ferramental importante para o trabalho colaborativo entre usuários e organizações, através do compartilhamento de recursos e serviços computacionais entre múltiplos domínios administrativos. Devido a esta popularização da computação móvel, usuários de dispositivos portáteis formam um importante e novo segmento da computação em grade, assumindo tanto o papel de usuários como também de provedores de recursos e serviços. A integração dessas duas categorias de sistemas distribuídos, objetiva estender as capacidades dos dispositivos computacionais móveis através do acesso a uma infra-estrutura de recursos compartilhados, além de fornecer aos usuários de serviços de grade meios mais rápidos e fáceis de acesso as informações produzidas por estes sistemas em qualquer hora e lugar. Este trabalho descreve oMInteGrade (Mobile InteGrade), uma infra-estrutura de software para acesso aos serviços do middleware de grade InteGrade a partir de dispositivos móveis conectados através de redes sem fio IEEE 802.11 em modo infraestruturado e redes bluetooth em modo Ad hoc. Através deste mecanismo para acesso a uma grade de computadores, clientes móveis podem solicitar a execução de aplicações na grade, realizar o acompanhamento da execução das aplicações e visualizar o resultado de computações já concluídas. O MInteGrade foi projetado para levar em consideração o dinamismo das redes sem fio, provendo suporte a períodos de desconexão e variações na topologia das redes Ad hoc, bem como a adaptação de conteúdo dos resultados das computações realizadas pela grade.

Nous proposons un algorithme original de structuration des réseaux ad hoc nommé SDEAC dans le but d'optimiser les communications et de tolérer les pannes transitoires. SDEAC est auto-stabilisant, distribué et déterministe. Il utilise un modèle asynchrone à passage de messages et se fonde sur un voisinage à distance 1 pour construire des clusters non-recouvrants à k sauts. Nous montrons que partant d'une configuration quelconque et sans occurrence de pannes transitoires, SDEAC structure le réseau dans le pire des cas en n+2 transitions. En outre, son exécution nécessite une occupation mémoire de (Δu+1)*log(2n+k+3) bits pour chaque noeud u, avec Δu étant le degré de u, k le rayon maximal des clusters et n la taille du réseau. Par simulation sous OMNeT++, nous observons pour un réseau quelconque un temps de stabilisation très inférieur à celui du pire des cas d'une part. D'autre part, suite à l'occurrence de pannes transitoires après la stabilisation, nous constatons un temps de stabilisation inférieur à celui du clustering. Dans le contexte des RCSF, nous étudions la consommation énergétique de SDEAC suivant trois critères d'élection des cluster-heads (identité, degré et énergie résiduelle des noeuds) puis nous la comparons avec celle de la solution de Mitton et al. opérant dans le même modèle. Les résultats montrent que SDEAC permet le passage à l'échelle et réduit la consommation énergétique de 42% à 49%. Enfin, pour l'utilisation de SDEAC dans l'acheminement de l'information, nous proposons deux approches efficaces : (i) un routage sans agrégation qui minimise les délais de bout en bout et (ii) un routage avec agrégation partielle qui réduit la consommation énergétique totale offrant ainsi une meilleure durée de vie du réseau. / We propose SDEAC, a self-Stabilizing Distributed Energy-Aware and fault-tolerant Clustering algorithm. SDEAC uses an asynchronous message-passing model and is based on 1-hop neighboring to build non-overlapping k-hops clusters. We prove that, starting from an arbitrary configuration, SDEAC structures the network after at most n + 2 transitions and requires (Δu+1)log(2n+k+3) memory space for each node u, where n is the number of network nodes, Δu is the degree of u and k represents the maximum hops number. Through simulations under OMNeT++, we observe that over arbitrary network, the stabilization time is far below the worst case scenario. Furthermore, we remark that after faults, the re-clustering cost is significantly lower than the clustering cost. In the context of Wireless Sensor Networks (WSNs), we evaluate the energy consumption of SDEAC according to multiple criteria in the election of cluster-heads, such as nodes' identity, residual energy or degree and we compare it with the well-known message-passing based self-stabilizing clustering algorithm proposed by Mitton et al. Results show that SDEAC is scalable and reduces energy consumption between 42% and 49%.Afterwards, we propose efficient scenarios in order to transfer information: (i) the non-aggregation scenario that provides a better end-to-end delay and (ii) the partially-decentralized aggregation scenario that reduces the total energy consumption and prolongs the network lifetime.

Abstract In this thesis we study the spatial throughput of interference-limited wireless networks from different perspectives, considering that the spatial distribution of nodes follows a 2-dimensional homogeneous Poisson point process and transmitters employ Gaussian point-to-point codes. To carry out this analysis, we model the interrelations between network elements using concepts from stochastic geometry, communication theory and information theory. We derive closed-form equations to compute/approximate the performance metric that is chosen to evaluate the system for each given specific scenario. Our first contribution is an investigation about whether it is preferable to have a large number of short single-hop links or a small number of long hops in multi-hop wireless networks, using a newly proposed metric denominated aggregate multi-hop information efficiency. For single-hop systems, we revisit the transmission capacity framework to study medium access protocols that use asynchronous transmissions and allow for packet retransmissions, showing when a carrier sensing capability is more suitable than synchronous transmissions, and vice-versa. We also cast the effective link throughput and the network spatial throughput optimization problems to find the combination of medium access probability, coding rate and maximum number of retransmissions that maximize each metric under packet loss and queue stability constraints, evincing when they do (and do not) have the same solution. Furthermore we analyze the expected maximum achievable sum rates over a given area – or spatial capacity – based on the capacity regions of Gaussian point-to-point codes for two decoding rules, namely (i) treating interference as noise (IAN) and (ii) jointly detecting the strongest interfering signals treating the others as noise (OPT), proving the advantages of the second. We additionally demonstrate that, when the same decoding rule and network density are considered, the spatial-capacity-achieving scheme always outperforms the spatial throughput obtained with the best predetermined fixed rate strategy. With those results in hand, we discuss general guidelines on the construction of ad hoc adaptive algorithms that would improve the information flow throughout the interference network, respecting the nodes’ internal and external constraints. / Tiivistelmä Tässä työssä tutkitaan häiriörajoitteisten langattomien verkkojen tila-alueen suorituskykyä, olettaen verkkosolmujen sijoittuvan 2-ulotteisen Poissonin pisteprosessin mukaisesti, sekä olettaen lähettimien hyödyntävän Gaussisia pisteestä-pisteeseen -koodeja. Suorituskykyanalyysi pohjautuu stokastiseen geometriaan, tietoliikenneteoriaan sekä informaatioteoriaan. Suljetun muodon suorituskyky-yhtälöitä hyödyntäen arvioidaan suorityskykymetriikoita eri skenaarioissa. Työn aluksi esitetään uusi monihyppyverkkojen informaatiotehokkuuteen perustuva metriikka. Sen avulla voidaan tutkia onko tehokkaampaa käyttää useita lyhyen hypyn linkkejä vai pienempää määrää pidempien hyppyjen linkkejä. Yhden hypyn verkoissa tutkitaan mediaanpääsyprotokollia asynkronisissa verkoissa pakettien uudelleenlähetykseen perustuen ja verrataan tätä synkroniseen lähetykseen ilman vapaan kanavan tunnistusmekanismia. Työssä tutkitaan myös linkin efektiivisen suorituskyvyn ja verkon tila-alueen suorituskyvyn optimointia, jotta sopiva yhdistelmä mediaan pääsyn todennäköisyydelle, koodausnopeudelle ja uudelleenlähetysten maksimilukumäärälle löytyisi ja samalla maksimoisi jokaisen käytetyn metriikan ehdollistettuna paketin menetyksille ja jonon stabiilisuudelle. Lisäksi arvioidaan maksimaalista odotettavaa nettosiirtonopeutta tietyllä alueella, eli tila-alueen kapasiteettia, Gaussimaisen pisteestä-pisteeseen koodien kapasiteettialueisiin perustuen kahta eri dekoodaussääntöä hyödyntäen: (i) olettaen häiriön olevan kohinaa tai (ii) ilmaisemalla voimakkaimmat häiriösignaalit ja olettaen muiden olevan kohinaa. Jälkimmäinen osoittautui tehokkaammaksi menetelmäksi. Työssä osoitetaan myös, että samalla dekoodaussäännöllä ja verkon tiheydellä tila-alueen kapasiteetin saavuttava menetelmä on aina tehokkaampi kuin tavanomainen tila-alueen suorituskykyyn perustuva kiinteän siirtonopeuden menetelmä. Saavutettujen tulosten valossa työssä esitetään yleisiä suunnittelumenetelmiä mukautuville ad hoc -algoritmeille, joiden avulla voidaan parantaa tiedonsiirtoa häiriörajoitteisissa verkoissa, ehdollistettuna verkon solmujen sisäisille ja ulkoisille rajoitteille.

With the constant development of wireless technologies, the usageof wireless devices tends to increase even more in the future.Wireless multi-hop networks (WMNs) have emerged as a keytechnology to numerous potential scenarios, ranging from disasterrecovery to wireless broadband internet access. The distributedarchitecture of WMNs enables nodes to cooperatively relay othernode's packets. Because of their advantages over other wirelessnetworks, WMNs are undergoing rapid progress and inspiringnumerous applications. However, many technical issues still existin this field. In this thesis we investigate how Voice over IP(VoIP) and peer-to-peer (P2P) application are influenced bywireless multi-hop network characteristics and how to optimizethem in order to provide scalable communication.We first consider the deployment of VoIP service in wirelessmulti-hop networks, by using the Session Initiation Protocol (SIP)architecture. Our investigation shows that the centralized SIParchitecture imposes several challenges when deployed in thedecentralized wireless multi-hop environment. We find that VoIPquality metrics are severely degraded as the traffic and number ofmultiple hops to the gateway increase. In the context ofscalability, we further propose four alternative approaches whichavoid current limitations.In the second part of this thesis we tackle the network capacityproblem while providing scalable VoIP service over wirelessmulti-hop networks. The performance evaluation shows the influenceof intra and inter-flow interference in channel utilization, whichdirect impacts the VoIP capacity. In order to avoid the small VoIPpacket overhead, we propose a new adaptive hop-by-hop packetaggregation scheme based on wireless link characteristics. Ourperformance evaluation shows that the proposed scheme can increasethe VoIP capacity by a two-fold gain.The study of peer-to-peer applicability over wireless multi-hopnetworks is another important contribution. A resource lookupapplication is realized through structured P2P overlay. We showthat due to several reasons, such as characteristics of wirelesslinks, multi-hop forwarding operation, and structured P2Pmanagement traffic aggressiveness the performance of traditionalP2P applications is rather low in wireless multi-hop environments.Therefore, we suggested that a trade-off between the P2P lookupefficiency and the P2P management traffic overhead can be achievedwhile maintaining the overlay network consistency in wirelessmulti-hop networks.

Abstract Medium access control (MAC) in wireless ad hoc networks has received considerable attention for almost a couple of decades; however, there are still open problems which deserve thorough study in order to facilitate migration to the next generation broadband wireless communication systems. In ad hoc networks, a detected frame collision can be due to the so-called unreachability problem, where the destination station is situated either in the transmission or interference range of an emitting station and is unable to receive connection establishment frames from any of its neighboring stations. Unreachability might also be due to the inability of a radio station to respond to any connection establishment request, though when the unreachable station receives the connection establishment requests, however, it is prohibited from responding to the requests due to being situated in the interference range of the emitting neighbor. To investigate the impact of this problem, we have to be equipped with a proper analytical framework; therefore, as the first part of this thesis, a scalable framework called Parallel Space – Time Markov chain (PSTMC) is proposed, through which a finite load non-saturated ad hoc network can be easily modeled. At the first step, a single-hop ad hoc network is considered and the accuracy of the model is evaluated using extensive numerical results. Subsequently, the proposed framework is further extended to model multi-hop ad hoc networks. Several discussions are also given on how the framework can be deployed for an arbitrary network topology. One of the main key features of the PSTMC model is its remarkable scalability in modeling complex network configurations. In fact, it is shown that multi-hop ad hoc networks have bounded complexity in being modeled by the PSTMC framework due to its spectacular specifications. These features lead us to a powerful tool by which an arbitrary network topology can be studied. In addition, the proposed models clearly facilitate demonstrating the impact of the unreachability problem on the performance of multi-hop networks. The introduced framework shows how the unreachability problem degrades the achieved throughput and channel capacity by the contending radio stations depending on the deployed network topology. In the remainder of the thesis the unreachability problem in mobile ad hoc networks is tackled and a new MAC protocol to enhance the performance of the network is proposed. This MAC scheme is equipped with smart decision-making algorithms as well as adaptive management mechanisms to reduce the impact of the unreachability problem in single channel scenarios. Subsequently, the problem of concurrent radio resource management and contention resolution in multi-channel cognitive ad hoc networks is considered. In particular, a multi-channel technique for traffic distribution among a set of data channels without centralized control, which is enabled by a probabilistic channel selection algorithm as well as a multi-channel binary exponential backoff mechanism, is proposed. It is shown through simulations that the suggested scheme outperforms the existing MAC protocols in multi-channel environments as well as cognitive networks coexisting with primary users. A mathematical model is also introduced to study the performance of the multi-channel MAC protocol in a single-hop non-saturated wireless network.

[pt] Uma rede móvel ad hoc consiste de uma coleção de dispositivos computacionais portáteis, equipados com uma interface de comunicação sem fio, com uma distribuição arbitrária e dinâmica no espaço, e onde cada host também serve de roteador para os demais hosts, descobrindo e mantendo rotas multi-hop entre os hosts. De uma forma geral, os protocolos para redes móveis ad hoc são mais complexos do que os protocolos para as redes fixas, devido à várias características destas redes, como por exemplo, a topologia dinâmica, a interferência mútua, o acesso compartilhado e a largura de banda restrita dos enlaces sem fio, bem como a operação com energia restrita e menor quantidade de recursos disponíveis nos hosts móveis. Um grande foco da pesquisa em redes móveis ad hoc tem sido o desenvolvimento, a análise e a comparação de protocolos de roteamento. Por isto, existe a demanda por ambientes para a prototipação rápida, a simulação e a depuração de protocolos de roteamento (e de outras camadas) para este tipo de redes. Preferencialmente estes ambientes devem ser flexíveis, ser simples de usar, e permitir definir vários níveis de abstrações para descrever as características físicas da rede móvel, tais como o padrão de mobilidade, os enlaces sem fio, consumo de energia, etc. Esta dissertação trata do projeto e implementação de um framework para a simulação de redes móveis ad hoc que visa facilitar a criação de ambientes para prototipação, teste, análise de desempenho e complexidade de protocolos para este tipo de redes. / [en] A mobile ad hoc network consists of a set of portable computational devices, equipped with a wireless communication interface, that are randomly and dynamically distributed in space, and where each host serves as a router for the other hosts by discovering and maintaining multi-hop routes among the hosts. In general, protocols for mobile ad hoc networks are more complex than equivalent protocols for static networks, due to several properties of such networks, such as its dynamic topology, the mutual interference, concurrent access and smaller communication bandwidth of the wireless links, as well as, operation with restricted amount of energy, and scarce resources of the mobile devices. A main focus of research in mobile ad hoc networks has been the development, analysis and comparison of routing protocols for such networks. Therefore, there is some demand for environments that facilitate the rapid prototyping, the simulation and the debugging of protocols at the network and other layers for such networks. These environments should preferably be flexible, easy to use, and allow for the definition of different levels of abstractions for modeling the main characteristics of the mobile network, such as the pattern of mobility, the wireless links, the energy consumption, etc. This thesis describes the design and implementation of a framework for the simulation of mobile ad hoc networks, which aims at supporting the development of concrete simulation environments for prototyping, testing and doing the complexity and performance analysis of protocols for such networks.

Le cadre général de cette thèse porte sur les communications véhicule à véhicule (V2V). L'objectif principal de ce type de communication est d'améliorer la sécurité routière et d'optimiser la fluidité du trafic. Les performances de systèmes de communication embarqués dépendent principalement de la configuration des antennes, du type de récepteurs utilisés (modem) et du canal de propagation. Le sujet de la thèse se concentre précisément sur l'élaboration d'un outil de simulation robuste et fiable pour optimiser les choix technologiques d'antennes et leurs implantations à bord. Il permettra de limiter ainsi le recours aux prototypes et aux essais de roulage. Dans un premier temps, nous avons proposé une méthode de type géométrique-stochastique pour modéliser des canaux de propagation d'un système de communication V2V. Cette méthode permet de définir des scénarios dynamiques et sa flexibilité nous offre l'opportunité de paramétrer les caractéristiques d'un canal de propagation. Nous montrons pour l'essentiel de quelle manière l'agencement et le nombre de diffuseurs de forme simple peuvent contribuer à influencer les statistiques de l'étalement des retards, la distribution des angles d'arrivée et les spectres Doppler. Dans la deuxième partie de ces travaux, nous nous focalisons sur la problématique d'intégration d'antenne. Il a été constaté qu'il est particulièrement utile de simplifier la maquette numérique du véhicule complet lors d'une simulation électromagnétique de l'antenne intégrée à bord de ce véhicule. De plus, dans cette section, nous avons étudié la limite de la validité de substitution d'une antenne intégrée à bord par son seul diagramme de rayonnement dans les modèles de canaux de propagation. A partir de cette étude, nous en avons déduit, que les interactions électromagnétiques avec les éléments se situant dans le champ-proche n'étaient plus valides. Ainsi, une stratégie de correction a été trouvée en considérant l'élément en champ proche dans la simulation initiale de l'antenne intégrée sur le véhicule. L'évaluation des performances d'antennes, en termes de taux d'erreurs paquet, après l'implémentation de la couche physique du standard 802. 11 p, est au cœur de la troisième partie de cette thèse. Des résultats de simulation, pour chaque configuration d'antenne, ont été donnés pour plusieurs combinaisons de paramètres de couche PHY tels que le débit et la longueur de paquet. La dernière partie de ce manuscrit traite de la présentation d'une campagne de mesure qui a été réalisée principalement dans un environnement de type rural. Les essais de roulage avaient pour but de démontrer la capacité des méthodes de simulation à faire un choix approprié d'installation d'antenne. Nous avons constaté que les tendances attendues des performances de communication en termes de PER sont globalement prévisibles à partir de notre modèle bien que nous ayons obtenu des résultats surprenants dans certains cas. Ce qui nécessitera une enquête plus approfondie. / The general framework of this Ph.D. thesis deals with Vehicle to Vehicle (V2V) communications. This communication is principally dedicated to reinforce security through exchange of information between vehicles in case of unexpected events. The development of V2V solutions requires the understanding and merging of a number of techniques from several communication technology areas. Indeed, the performance of these systems are related to three main blocks: the implementation of the modems, the antenna configuration and the fast varying electromagnetic environment surrounding the transmitter and the receiver. The purpose of this PhD thesis is precisely to elaborate a design strategy to investigate all the different blocks constituting the communication chain. The ultimate goal is to optimize antenna selection and location on board the vehicle. In the first place, we proposed a geometry-based stochastic channel modelling approach to develop virtual dynamic scenarios. It was shown that the most common propagation environments such as rural, highway or urban-like propagation channels are reached through adjustment or numbers and location of simple metallic plates. Using this method, we are able to emulate the characteristics, such as the delay spread, angles of arrival distribution and the Doppler spectrum, of these typical driving scenarios. Moreover, we dealt with antenna integration problems in the second part of this work. A study on the simplification of numerical models of vehicles was carried out. Furthermore in this section, we investigated the limit of validity of representing the integrated antenna on board vehicle solely by its radiation pattern. We deduced from this study that the interactions with the elements present in the near-field is no longer valid. Thus, a strategy to alleviate the degree of error was found upon consideration of the near-field scatter in the a-priori simulation of the antenna integrated on the vehicle. In the third part of this thesis, we evaluated the performance of different antenna configurations in terms of packet error rate after the embodiment of the PHY layer of the LEEE 802.11p standard. Simulation results, for each antenna configurations, was given for several combinations of PHY layer parameters such as data rate and packet length. The last part of this manuscript is dedicated to the presentation of a measurement campaign that was carried out in a rural driving environment. Results obtained from these functional tests were confronted with simulation results to demonstrate the strength of the latter. We found that the expected trends in communication performance in terms of PER are globally predictable from our model though we obtained surprising results in some cases, needing further investigation.