Les réseaux véhiculaires, connus sous le terme VANETs, sont des réseaux impliquant des communications entre deux ou plusieurs véhicules et éventuellement une communication avec des éléments d’infrastructure sur la route. Récemment, le concept de systèmes de transport intelligents (STI) a connu beaucoup d’intérêt. Les STI sont des systèmes utilisant les nouvelles technologies de communication sans fil appliquées au domaine du transport pour améliorer la sécurité routière, la logistique et les services d’information. Des défis majeurs ont besoin cependant d'être abordés pour offrir une communication sur la route sécurisée et fiable dans des environnements anonymes et quelquefois hostiles à la communication. Comme dans tout système de communication, les réseaux véhiculaires doivent opérer en respectant des contraintes en termes de qualité de service. Ces contraintes sont d’autant plus strictes quand il s’agit de fournir des services de sécurité sur la route. Ce projet vise à développer des techniques de communication véhiculaires pour le transfert des informations de manière fiable entre véhicules roulant à grande vitesse tout en contrôlant la surcharge du réseau. Ces techniques visent la prise en compte des contraintes temporelles sur les délais de transfert afin d’envisager leur utilisation dans des applications critiques telle que la sécurité sur la route. Pour ce faire, cette thèse propose d’abord un protocole optimal de dissémination de messages d’urgence pour les VANETs. Il est basé sur une stratégie de diffusion qui exploite les véhicules sur la direction opposée afin d’accélérer la dissémination du message d’urgence tout en réduisant le nombre de transmissions. Ainsi, et dans le but d’assurer une dissémination fiable et à faible surcoût, une technique de retransmission périodique intelligente permettant l’adaptation du protocol proposé à différentes densités du trafic routier est proposée. Dans un second volet, ce projet propose une approche hybride de dissémination de messages d’urgence qui combine alternativement les avantages des deux principales approches de dissémination existantes (Sender-oriented et Receiver-oriented dont notre première proposition fait partie) afin de garantir une transmission fiable des alertes tout en réduisant les délais. Les approches Receiver-Oriented qui sont les plus adaptées pour les applications de sécurité dans les VANETs peuvent minimiser la latence et les limitations des approches Sender-Oriented. Mais, ilsdoivent aussi mieux exploiter les apports des messages hello (beacons) échangés dans la technologie IEEE802.11P. Ainsi, et dans le but de surmonter les limites des approches de retransmissions périodiques et celles de relais- multiples afin d’assurer des échanges fiables de messages de sécurité tout en réduisant la surcharge de la bande passante, nous introduisons un nouveau mécanisme DR/BDR (Designated Relay/Backup Designated Relay). Le BDR, dans ce mécanisme, doit remplacer le DR et assurer sa tâche quand il détecte, à travers les beacons colorés échangés,l’échec de ce dernier dans la dissémination du message d’urgence. / Vehicular Ad hoc NETworks (VANETs) have gained considerable attention in the past few years due to their promising applications such as safety warning, transport efficiency or mobile infotainment. Avoiding accidents and traffic jams are two main immediate benefits of vehicular networks. For instance, most drivers would like to receive real-time alerts about accidents happening at a short distance in front of their vehicles since these accidents could lead to collision chains involving tens of vehicles. Also, the ability to receive an alert about a potential traffic jam would allow drivers to take alternate routes, saving both time and fuel. In both cases, warning messages should be broadcasted to all vehicles traveling over a geographical area, and need to be delivered with high reliability, low delay and low overhead. It is therefore important to develop a reliable and efficient safety information dissemination protocol in vehicular networks. Due to the vehicle mobility and lossy wireless channel, highly reliable, scalable and fast multi-hop broadcast protocol is very challenging to design. A number of solutions have been proposed in the past few years. However, the tradeoff between reliability and efficiency in such solutions needs to be carefully considered. This thesis presents an optimal protocol for the broadcast of safety messages in VANETs. Optimality, in terms of delay and transmission count, is achieved using a broadcast strategy that exploits opposite vehicles. To carry out reliable and efficient broadcast coordination, intelligent periodic rebroadcasts, which effectively adapt our protocol to sparse and dense networks, are proposed. Simulations are conducted and results are presented to show that it has a better performance over existing competing protocols. As a second contribution, we propose an alternative Receiver-Sender approach that combines advantages of the two existing dissemination approaches (Sender-oriented and Receiver-oriented to which our first proposal belongs) to ensure low latency and high reliability. The proposal can use any sender or receiver oriented protocol but the same selected one is used during all the dissemination process. In order to overcome the unreliability and broadcast overhead generated by periodic rebroadcasts and multiple relays schemes, we introduce a DR/BDR (Designated Relay/Backup Designated Relay) mechanism where the BDR has to replace the DR when detecting,from exchanged colored beacons, its failure in informing concerned vehicles.

Les accidents routiers et leurs dommages représentent un problème croissant dans le monde entier. Dans ce contexte, les réseaux véhiculaires (VANETs) peuvent être déployés pour réduire les risques et pour améliorer le confort. Ils permettent aux véhicules d'échanger différents types de données qui vont des applications de sécurité et de gestion du trafic aux applications de confort. De nos jours, les applications de sécurité sont l’objet de beaucoup d'attention des chercheurs ainsi que des fabricants d'automobiles. Dans cette thèse, nous étudierons les applications critiques pour la sécurité routière visant à fournir une assistance dans des situations dangereuses ou difficiles. Notre objectif principal sera de proposer de nouveaux protocoles de contrôle d'accès au support de transmission (MAC) et de routage, qui peuvent s’adapter dynamiquement aux changements fréquents de topologies des VANETs. Après un aperçu des protocoles d’accès sans contention dans les VANETs, nous proposons des solutions basées sur la technique de division du temps: Time Division Multiple Access (TDMA). D’abord, nous nous concentrons sur le développement d’un nouveau protocole distribué (DTMAC), qui ne repose pas sur l’utilisation d’infrastructure. DTMAC utilise les informations de localisation et un mécanisme de réutilisation des slots pour assurer que les véhicules accèdent au canal efficacement et sans collision. Les résultats obtenus ont confirmé l’efficacité de notre protocole, DTMAC se comporte très significativement mieux que VeMAC (protocole MAC basé sur TDMA.) Ensuite nous proposons TRPM, un protocole de routage basé sur une approche cross-layer. Dans TRPM, l’ordonnancement des slots TDMA construit par DTMAC et la position de la destination sont utilisés pour choisir le meilleur relais. Les résultats montrent que TRPM offre de meilleures performances, du nombre moyen de relais et de la fiabilité de livraison des messages comparé à d’autres protocoles. Dans la deuxième partie de cette thèse, nous nous focaliserons sur les mécanismes centralisés d’allocation de slots qui utilisent des coordinateurs. D’abord, nous proposons CTMAC, un protocole basé sur TDMA centralisé utilisant les RSUs (RoadSide Units) pour créer et maintenir les ordonnancements. CTMAC met en œuvre un mécanisme qui permet d’empêcher les “Access Collisions” de se produire plus que deux fois entre les véhicules qui tentent d’acquérir un même slot disponible. Les résultats ont montré que CTMAC permet de mieux minimiser les collisions, ainsi que le surcoût généré pour créer et maintenir les ordonnancements par rapport aux protocoles MAC, basés sur TDMA distribué. Cependant, dans CTMAC, les véhicules roulant vite devront acquérir des nouveaux slots après une courte période de temps à chaque fois qu’ils quittent les zones de leurs RSUs courants. Cette situation rend les protocoles centralisés inefficaces et couteux dans les réseaux à grande vitesse. Afin de pallier à ce problème inhérent à l’utilisation des RSUs, nous adaptons un algorithme d’ordonnancement basé sur le clustering dans lequel certains véhicules sont élus pour gérer l'accès au canal. Ceci permet aux véhicules de rester attachés à leurs clusters plus longtemps. Pour ce faire, nous proposons 1- un protocole de clustering nommé AWCP afin de former des clusters stables avec une longue durée de vie. AWCP est basé sur l’algorithme de clustering pour les réseaux mobiles WCA dans lequel les têtes des clusters sont élues en se basant sur une fonction de poids. 2- Nous formulons le réglage des paramètres de protocole AWCP comme un problème d’optimisation multi-objective et nous proposons un outil d’optimisation qui combine la version multi-objective de l’algorithme génétique appelé NSGA-II avec le simulateur de réseau ns-2 pour trouver les meilleurs paramètres du protocole AWCP. 3- Nous proposons ASAS, une stratégie adaptative pour l’attribution des slots temporels basée sur une approche cross-layer entre TDMA et AWCP / Road crashes and their damages represent a serious issue and are one of the main causes of people death. In this context, Vehicular Ad hoc NETworks (VANETs) are deployed to reduce the risk of road accident as well as to improve passengers’ comfort by allowing vehicles to exchange different kinds of data which ranges widely from road safety and traffic management to infotainment. Nowadays, safety applications are receiving a great deal of attention from researchers as well as from automobile manufacturers. In this thesis, we particularly focus on safety-critical applications, designed to provide drivers assistance in dangerous situations and to avoid accidents in highway environments. Such applications must guarantee to the vehicles access to the medium and have strict requirements regarding end-to-end delay and packet loss ratio. Therefore, our main goal is to propose new medium access control and routing protocols, which can efficiently adapt to frequent changing VANET network topologies. After a comprehensive overview of free-contention MAC protocols, we propose several solutions, based on Time Division Multiple Access Technique (TDMA). We have designed DTMAC, a fully distributed TDMA-based MAC protocol, which does not rely on an expensive infrastructure. DTMAC uses vehicles’ locations and a slot reuse concept to ensure that vehicles in adjacent areas have collision-free schedule. Using simulations, we prove that DTMAC provides a lower rate of access and merging collisions than VeMAC, a well-known TDMA based MAC protocol in VANET. Then, in order to ensure that event-driven safety messages can be sent over a long distance, we propose TRPM, a TDMA aware Routing Protocol for Multi-hop communication. Our routing scheme is based on a cross layer approach between the MAC and the routing layers, in which the intermediate vehicles are selected using TDMA scheduling information. Simulation results show that TRPM provides better performances in terms of average end-to-end delay, average number of hops and average delivery ratio. In the second part, we focus on coordinator-based TDMA scheduling mechanisms. First, we propose the Centralized TDMA based MAC protocol (CTMAC) which uses Road Side Units (RSUs) as a central coordinator to create and maintain the TDMA schedules. CTMAC implements an Access Collision Avoidance mechanism that can prevent the access collision problem occurring more than twice between the same vehicles that are trying to access the channel at the same time. Using simulation we show an improvement in terms of access and merging collisions as well as the overhead required to create and maintain the TDMA schedules compared to distributed scheduling mechanisms. However, in the CTMAC protocol, fast moving vehicles will need to compete for new slots after a short period of time when they leave their current RSU area, which makes a centralized scheduling approach very expensive. In order to further improve the performance of coordinator-based TDMA scheduling mechanisms, we focus on cluster-based TDMA MAC protocols in which some vehicles in the network are elected to coordinate the channel access, allowing the vehicles to remain connected with their channel coordinator for a longer period of time. To this end, first we propose an adaptive weighted clustering protocol, named AWCP, which is road map dependent and uses road IDs and vehicle directions to make the clusters’ structure as stable as possible. Then, we formulate the AWCP parameter tuning as a multi-objective problem and we propose an optimization tool to find the optimal parameters of AWCP to ensure its QoS. Next, we propose ASAS, an adaptive slot assignment strategy for a cluster-based TDMA MAC protocol. This strategy is based on a cross layer approach involving TDMA and AWCP. The objective is to overcome the inter-cluster interference issue in overlapping areas by taking into account vehicles’ locations and directions when the cluster head assign slots

The safety-message dissemination problem for vehicular ad hoc networks (VANETs) was investigated. Four novel techniques were contributed for the efficient and reliable routing of safety messages in the vehicular ad hoc networks. The instant-broadcast technique was proposed to improve the end-to-end dissemination delay. The lane-based sectoring mechanism was presented for the collision mitigation in the dense-urban traffic scenario. The negative acknowledgment with smart neighborhood (NSN) technique was proposed to ensure the reliability of reception through recovering the packet loss caused by interference. Finally, the negative acknowledgment with smart neighborhood - hole recovery (NSN-H) technique was presented to provide guaranteed reception of the safety message at each individual node in the VANET. The investigation of the safety message routing in VANET conducted in this research also revealed the significance of hitherto-neglected factors that influence the vehicular network. Significance of the small payload size of the VANET safety message, the effect of road width on the multi-hop relay, and the attenuation caused by vehicles in the propagation path were among the important revealed factors.

Information exchange in wireless communication without being blocked by terrain or infrastructure is easier and simpler than that in the traditional wired communication environments. Due to the transmission type, anonymity is urgently required in wireless communications for concealing the footprint of mobile users. Additionally, the mobility of a mobile device may incur possible threats to the past encrypted transmitted data, where the past session keys for the encryptions of wireless communications may be derived by the long-term secret stored the mobile device if it is lost. In this thesis, we propose an efficient solution by using symmetry-based cryptosystems for forward secrecy and anonymity in the standards of mobile networks, such as GSM, UMTS, and LTE, without losing the compatibility. By adopting secret chain (SC) based mechanism, the generation of every session key involves a short-term secret, changed in every session, to achieve forward secrecy and anonymity. Furthermore, synchronization mechanism required for the SC-protocol is also proposed. For more advanced security requirements of truly non-repudiation and strong anonymity, which is additionally anonymous to systems, certificateless signatures and group signatures are applied in the authentication protocols for UMTS and VANETs. Certificateless signatures can eliminate the overhead of using public-key infrastructure (PKI) in wireless communications. Our work proposed a certificateless signature scheme achieving the same security level of non-repudiation as that in the PKI-based signature scheme, that most of the proposed certificateless signatures cannot fulfill. Group signatures practice the privacy of the participants of the authentication protocol by originating the group signatures belonging to their group. However, directly applying group signatures in wireless communications results in inefficiency of computation when a group has a large amount of members. Therefore, we aim at reducing the computation costs of membership revocation on the proposed group signature scheme to constant without being influenced by the amount of members and then apply the scheme to VANETs and UMTS. Eventually, all the proposed schemes in the thesis are theoretically proven secure under the standard reduction.

Submitted by Hellen Luz (hellencrisluz@gmail.com) on 2017-07-04T17:43:29Z No. of bitstreams: 2 license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5) Tese_ControleQualidadeExperiencia.pdf: 8181720 bytes, checksum: 7826f189d56eff472b6b822d6be6de2d (MD5) / Approved for entry into archive by Irvana Coutinho (irvana@ufpa.br) on 2017-08-09T14:22:52Z (GMT) No. of bitstreams: 2 license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5) Tese_ControleQualidadeExperiencia.pdf: 8181720 bytes, checksum: 7826f189d56eff472b6b822d6be6de2d (MD5) / Made available in DSpace on 2017-08-09T14:22:52Z (GMT). No. of bitstreams: 2 license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5) Tese_ControleQualidadeExperiencia.pdf: 8181720 bytes, checksum: 7826f189d56eff472b6b822d6be6de2d (MD5) Previous issue date: 2017-03-24 / CAPES - Coordenação de Aperfeiçoamento de Pessoal de Nível Superior / A disseminação de vídeos em tempo real sobre Redes Veiculares (do Inglês, Vehicular Ad hoc Networks - VANETs) é fundamental para inúmeros serviços, como: vídeos de emergência, anúncios, monitoramento inteligente etc. Essas aplicações enfrentam muitos desa fios devido os requisitos de qualidade de vídeo, topologia dinâmica e ambiente das VANETs. Para lidar com esses desafios e reduzir a sobrecarga de roteamento na rede, protocolos de roteamento estatásticos (do Inglês, Statistical Routing Protocols - SRPs) tem sido propostos para a distribuição de fluxos de vídeo em VANETs, normalmente usando parâmetros de posicionamento e Qualidade de Serviço. Porém, além desses parâmetros, a disseminação de vídeo, considerando a perspectiva dos usuários, também exige a preocupação com questões relacionadas a aceitação pelo Sistema Visual Humano (SVH). Devido aos diferentes requisitos e a estrutura hierárquica de vídeos, apenas parâmetros de posição e do nível de rede não são sufi cientes para disseminação de vídeo com níveis satisfatórios de Qualidade de Experiência (do Inglês Quality of Experience - QoE) e alcançabilidade. Esta tese foca na melhoria do QoE dos vídeos em tempo real disseminados em VANETs. Assim, propõe-se um mecanismo cross-layer para Broadcast baseado em Receptor dirigido a QoE (BRQ), modularmente acoplado em SRPs para oferecer parâmetros relacionados a vídeo no processo de seleção de nodos encaminhadores dos fluxos de vídeo e manutenção de rotas. A partir do BRQ, os nodos da rede decidem por eles mesmos, se devem retransmitir as sequências de vídeo ou não, melhorando a capacidade do sistema em distribuir vídeos com melhor QoE. No topo dessa arquitetura, uma técnica para Correção de Erros, nomeadamente Entrelaçamento (do Inglês, Interleaving), foi adicionada, permitindo mitigar ainda mais os efeitos de perdas em rajadas de quadros relativos ao ambiente de conexão inseguro de VANETs. Para validação, o mecanismo BRQ foi adicionado a um SRP projetado usando a estratégia de encaminhamento baseada em Distância, chamado de protocolo DBRQ (Distance BRQ). Os resultados mostram que os ganhos do protocolo DBRQ comparado a outros atuais SRPs, forneceram disseminação de vídeo com maior suporte da QoE, menos sobrecarga de roteamento e alcançabilidade satisfatória. / Live video dissemination over Vehicular Ad hoc Networks (VANETs) is fundamental for several services, e.g., roadside video emergency, advertisement's broadcast, and smart video surveillance. All these applications face many challenges due to stringent video quality level requirements, dynamic topologies, and broadcast environments. To deal with these challenges, as well as reduce network routing overhead, geographic Statistical Routing Protocols (SRPs) have been proposed as a suitable solution for the distribution of video flows in VANETs, usually by using positioning and Quality of Service (QoS) parameters. However, rather than only these parameters, a satisfactory video dissemination from the user's perspective also requires video and human-awareness issues. In real situations, due to different requirements and hierarchical structures of multimedia applications, network level and position parameters alone are not enough to select the best relay nodes and build up reliable routes to multi-hop video dissemination with satisfactory reachability and Quality of Experience (QoE) levels. This thesis focuses on improving the disseminated quality of on-road live videos in VANETs. Thus, we propose the cross-layer Broadcast Receiver-based and QoE-driven (BRQ) mechanism, which is modularly coupled to SRPs to offer QoE-aware and video-related parameters for the relay node selection and route maintenance. Thus, nodes decide for themselves to retransmit further the video sequences, enhancing the capacity of the system in delivering videos with better QoE assurance. On top of this, an application-level Error-Control (EC) scheme, namely Interleaving, allows mitigating the effects of frame loss. BRQ was added to a straightforward SRP built using the Distance method, named DBRQ protocol. Results show the gains of DBRQ compared to current SRPs, achieving video dissemination with QoE support, less routing overhead, and satisfactory reachability.

[EN] Intelligent Transportation Systems (ITS) can make transportation safer, more efficient, and more sustainable by applying various information and communication technologies. One of these technologies are \acfp{VN}. \acp{VN} combine different communication solutions such as cellular networks, \acfp{VANET}, or IEEE 802.11 technologies to provide connectivity among vehicles, and between vehicles and road infrastructure. This thesis focuses on VNs, and considers that the high speed of the nodes and the presence of obstacles like buildings, produces a highly variable network topology, as well as more frequent partitions in the network. Therefore, classical \ac{MANET} protocols do not adapt well to VANETs. Under these conditions, \ac{DTN} have been proposed as an alternative able to cope with these adverse characteristics. In DTN, when a message cannot be routed to its destination, it is not immediately dropped but it is instead stored and carried until a new route becomes available. The combination of VN and DTN is called \acp{VDTN}. In this thesis, we propose a new VDTN protocol designed to collect information from vehicular sensors. Our proposal, called \ac{MSDP}, combines information about the localization obtained from a GNSS system with the actual street/road layout obtained from a Navigation System (NS) to define a new routing metric. Both analytical and simulation results prove that MSDP outperforms previous proposals. Concerning the deployment of VNs and VANET technologies, technology already left behind the innovation and the standardization phases, and it is about time it reach the first early adopters in the market. However, most car manufacturers have decided to implement VN devices in the form of On Board Units (OBUs), which are expensive, heavily manufacturer dependent, and difficult to upgrade. These facts are delaying the deployment of VN. To boost this process, we have developed the GRCBox architecture. This architecture is based on low-cost devices and enables the establishment of V2X, \emph{i.e.} V2I and V2V, communications while integrating users by easing the use of general purpose devices like smartphones, tablets or laptops. To demonstrate the viability of the GRCBox architecture, we combined it with a DTN platform called Scampi to obtain actual results over a real VDTN scenario. We also present several GRCBox-aware applications that illustrate how developers can create applications that bring the potential of VN to user devices. / [ES] Los sistemas de transporte inteligente (ITS) son el soporte para el establecimiento de un transporte más seguro, más eficiente y más sostenible mediante el uso de tecnologías de la información y las comunicaciones. Una de estas tecnologías son las redes vehiculares (VNs). Las VNs combinan diferentes tecnologías de comunicación como las redes celulares, las redes ad-hoc vehiculares (VANETs) o las redes 802.11p para proporcionar conectividad entre vehículos, y entre vehículos y la infraestructura de carreteras. Esta tesis se centra en las VNs, en las cuales la alta velocidad de los nodos y la presencia de obstáculos como edificios producen una topología de red altamente variable, así como frecuentes particiones en la red. Debido a estas características, los protocolos para redes móviles ad-hoc (MANETs) no se adaptan bien a las VANETs. En estas condiciones, las redes tolerantes a retardos (DTNs) se han propuesto como una alternativa capaz de hacer frente a estos problemas. En DTN, cuando un mensaje no puede ser encaminado hacia su destino, no es inmediatamente descartado sino es almacenado hasta que una nueva ruta esta disponible. Cuando las VNs y las DTNs se combinan surgen las redes vehiculares tolerantes a retardos (VDTN). En esta tesis proponemos un nuevo protocolo para VDTNs diseñado para recolectar la información generada por sensores vehiculares. Nuestra propuesta, llamada MSDP, combina la información obtenida del servicio de información geográfica (GIS) con el mapa real de las calles obtenido del sistema de navegación (NS) para definir una nueva métrica de encaminamiento. Resultados analíticos y mediante simulaciones prueban que MSDP mejora el rendimiento de propuestas anteriores. En relación con el despliegue de las VNs y las tecnologías VANET, la tecnología ha dejado atrás las fases de innovación y estandarización, ahora es el momento de alcanzar a los primeros usuarios del mercado. Sin embargo, la mayoría de fabricantes han decidido implementar los dispositivos para VN como unidades de a bordo (OBU), las cuales son caras y difíciles de actualizar. Además, las OBUs son muy dependientes del fabricante original. Todo esto esta retrasando el despliegue de las VNs. Para acelerar la adopción de las VNs, hemos desarrollado la arquitectura GRCBox. La arquitectura GRCBox esta basada en un dispositivo de bajo coste que permite a los usuarios usar comunicaciones V2X (V2V y V2I) mientras utilizan dispositivos de propósito general como teléfonos inteligentes, tabletas o portátiles. Las pruebas incluidas en esta tesis demuestran la viabilidad de la arquitectura GRCBox. Mediante la combinación de nuestra GRCBox y una plataforma de DTN llamada Scampi hemos diseñado y probado un escenario VDTN real. También presentamos como los desarrolladores pueden crear nuevas aplicaciones GRCBox para llevar el potencial de las VN a los dispositivos de usuario. / [CA] Els sistemes de transport intel·ligent (ITS) poden crear un transport més segur, més eficient i més sostenible mitjançant l'ús de tecnologies de la informació i les comunicacions aplicades al transport. Una d'aquestes tecnologies són les xarxes vehiculars (VN). Les VN combinen diferents tecnologies de comunicació, com ara les xarxes cel·lulars, les xarxes ad-hoc vehiculars (VANET) o les xarxes 802.11p, per a proporcionar comunicació entre vehicles, i entre vehicles i la infraestructura de carreteres. Aquesta tesi se centra en les VANET, en les quals l'alta velocitat dels nodes i la presència d'obstacles, com els edificis, produeixen una topologia de xarxa altament variable, i també freqüents particions en la xarxa. Per aquest motiu, els protocols per a xarxes mòbils ad-hoc (MANET) no s'adapten bé. En aquestes condicions, les xarxes tolerants a retards (DTN) s'han proposat com una alternativa capaç de fer front a aquests problemes. En DTN, quan un missatge no pot ser encaminat cap a la seua destinació, no és immediatament descartat sinó que és emmagatzemat fins que apareix una ruta nova. Quan les VN i les DTN es combinen sorgeixen les xarxes vehicular tolerants a retards (VDTN). En aquesta tesi proposem un nou protocol per a VDTN dissenyat per a recol·lectar la informació generada per sensors vehiculars. La nostra proposta, anomenada MSDP, combina la informació obtinguda del servei d'informació geogràfica (GIS) amb el mapa real dels carrers obtingut del sistema de navegació (NS) per a definir una nova mètrica d'encaminament. Resultats analítics i mitjançant simulacions proven que MSDP millora el rendiment de propostes prèvies. En relació amb el desplegament de les VN i les tecnologies VANET, la tecnologia ha deixat arrere les fases d'innovació i estandardització, ara és temps d'aconseguir als primers usuaris del mercat. No obstant això, la majoria de fabricants han decidit implementar els dispositius per a VN com a unitats de bord (OBU), les quals són cares i difícils d'actualitzar. A més, les OBU són molt dependents del fabricant original. Tot això està retardant el desplegament de les VN. Per a accelerar l'adopció de les VN, hem desenvolupat l'arquitectura GRCBox. L'arquitectura GRCBox està basada en un dispositiu de baix cost que permet als usuaris usar comunicacions V2V mentre usen dispositius de propòsit general, com ara telèfons intel·ligents, tauletes o portàtils. Les proves incloses en aquesta tesi demostren la viabilitat de l'arquitectura GRCBox. Mitjançant la combinació de la nostra GRCBox i la plataforma de DTN Scampi, hem dissenyat i provat un escenari VDTN pràctic. També presentem com els desenvolupadors poden crear noves aplicacions GRCBox per a portar el potencial de les VN als dispositius d'usuari. / Martínez Tornell, S. (2016). Delay Tolerant Networks for Efficient Information Harvesting and Distribution in Intelligent Transportation Systems [Tesis doctoral]. Universitat Politècnica de València. https://doi.org/10.4995/Thesis/10251/68486

La dissémination d’information dans les réseaux VANET est une opération fondamentale pour la sécurité routière. Il est dès lors nécessaire de concevoir et mettre en oeuvre des algorithmes efficaces et adaptatifs pour la dissémination d’informations sélectives et pertinentes.Dans ce travail, des approches Bio-inspirées sont proposées, à partir des comportements auto-organisés des essaims comme les colonies de fourmis et d’abeilles. Ces approches visent à fournir à chaque véhicule des informations en provenance de son environnement et alerter les conducteurs. Dans la première approche, le système de communication direct et indirect des fourmis est utilisé. Les fourmis partagent les informations sur les sources de nourriture avec des membres de la colonie en sécrétant la phéromone sur leurs chemins. La deuxième approche est inspirée par le système de communication des abeilles. Les abeilles partagent les informations à propos des sources de nourriture avec les autres membres de la ruche par des messages spécifiques, selon l’importance de ces sources.Une nouvelle mesure de "pertinence" associée aux messages est définie, par analogie à la sécrétion des phéromones des fourmis et au niveau de l’intensité des messages pour les abeilles, pour disséminer des informations de sécurité dans une zone géographique. Les simulations sont effectuées en utilisant le simulateur NS2 pour mesurer l’efficacité des approches proposées sous différentes conditions, en particulier en termes de densités et vitesses des véhicules. / Information dissemination in Vehicular Ad hoc Networks (VANETs) is a fundamental operation to increase the safety awareness among vehicles on roads. Thus, the design and implementation of efficient and scalable algorithms for relevant information dissemination constitutes a major issue that should be tackled.In this work, bio-inspired information dissemination approaches are proposed, that use self-organization principles of swarms such as Ant and Honey Bee colonies. These approaches are targeted to provide each vehicle with the required information about its surrounding and assist drivers to be aware of undesirable road conditions. In the first approach, Ant’s direct and indirect communication systems are used. Ants share information about food findings with colony members by throwing pheromone on the returning to the nest. The second, an RSU-based approach is inspired by the Bee communication system. Bees share profitable food sources with hive-mates in their hive by specific messages.A “relevance” value associated to the emergency messages is defined as an analogue to pheromone throwing in Ant colony, and as an analogue to profitability level in Bee colony, to disseminate safety information within a geographical area. Simulations are conducted using NS2 network simulator and relevant metrics are evaluated under different node speeds and network densities to show the effectiveness of the proposed approaches.

Made available in DSpace on 2016-06-02T19:06:08Z (GMT). No. of bitstreams: 1 5463.pdf: 18006027 bytes, checksum: 047b84b38eb03b475dacbf51b7bf50b1 (MD5) Previous issue date: 2013-07-31 / Financiadora de Estudos e Projetos / Vehicular ad-hoc networks (VANETs) are networks capable of establishing communications between vehicles and road-side units. VANETs could be employed in data transmission applications. However, due to vehicle mobility, VANETs present intermittent connectivity, making message transmission a challenging task. Due to the lack of an end-to-end connectivity, messages are forwarded from vehicle to vehicle and stored when it is not possible to retransmit. Additionally, in order to improve delivery probability, messages are replicated and disseminated over the network. However, message replication may cause high network overhead and resource usage. As result, considerable research e_ort has been devoted to develop algorithms for speci_c scenarios: low, moderate and high connectivity. Nevertheless, algorithms projected for scenarios with a speci_c connectivity lack the ability to adapt to situations with zones presenting diferent node density. This lack of adaptation may negatively a_ect the performance in application such as data transmission in cities. This masters project proposes develops a method to automatically adapt message replication routing algorithms to diferent node density scenarios. The proposed method is composed of three phases. The first phase collects data from message retransmission events using a standard routing algorithms. The second phase consists in training a decision tree classifier based on the collected data. Finally, in the third phase the trained classifier is used to determine whether a message should be retransmitted or not based on the local node density. Therefore, the proposed method allows routing algorithms to query the trained classifier to decide if a message should be retransmitted. The proposed method was evaluated with real movement traces in order to improve Spray and Wait and Epidemic routing algorithms. Results indicate that the proposed method may contribute to performance enhancement. / As VANETs são redes de veículos com capacidade de estabelecer comunicações sem fio entre veículos e com equipamentos nas estradas. Estas redes poderiam ser usadas para a transferência de dados de diversas aplicações. No entanto, devido á mobilidade dos veículos, as VANETs apresentam conectividade intermitente entre os nós, dificultando a transmissão de mensagens. Ante a impossibilidade de ter conectividade de fim a fim, as mensagens são encaminhadas progressivamente de veículo em veículo, e armazenadas quando não houver a possibilidade de retransmitir. Adicionalmente, para incrementar a probabilidade de entrega, as mensagens são replicadas e disseminadas pela rede. Não obstante, a replicação de mensagens pode gerar alta sobrecarga de rede e alto consumo de recursos. Por causa disto, projetaram-se algoritmos para cenários específicos de: baixa, moderada e alta conectividade. Estes algoritmos, quando aplicados em ambientes de zonas de diferente densidade de nós,como cidades, podem diminuir o seu desempenho pela falta da capacidade de se adaptar a diferentes condições de conectividade. Contudo, neste trabalho foi desenvolvido um método para adaptar o comportamento dos algoritmos de roteamento por replicação de mensagens a diferentes situações de conectividade segundo a densidade das zonas onde se movimentam os nós retransmissores. O método consiste em três fases. Na primeira, são coletados os dados dos eventos de repasse de mensagens utilizando o algoritmo de roteamento padrão. Na segunda fase, utilizam-se os dados coletados para treinar um classificador baseado em _arvores de decisão. Na _ultima fase, o classificador é então empregado para determinar se uma situação de repasse de mensagem _e favorável segundo a densidade de nós. Desta forma, os algoritmos de roteamento podem decidir se repassar ou não uma mensagem com o suporte do classificador. Esta abordagem foi avaliada com traces de movimentos reais, para aprimorar o desempenho dos algoritmos de roteamento Spray and Wait e Epidemic. Os resultados dos experimentos realizados revelam que esta abordagem pode contribuir para o aprimoramento do desempenho.

Efforts towards standardization of Vehicular Communication Systems (VCSs) have been conclusive on the use of Vehicular Public-Key Infrastructure (VPKI) for the establishment of trust among network participants. Employing VPKI in Vehicular Communication (VC) guarantees the integrity and authenticity of Cooperative Awareness Messages (CAMs) and Decentralized Environmental Notification Messages (DENMs). It also offers a level of privacy for vehicles as VPKI provides them with a set of non-linkable short-lived certificates, called pseudonyms, which are used to sign outgoing messages by vehicles while they communicate with other vehicles referred to as Vehicle-to-Vehicle (V2V) or Roadside Units (RSUs) referred to as Vehicle-to-Infrastructure (V2I). Each vehicle uses a pseudonym for its lifetime and by switching to a not- previously- used pseudonym, it continues to communicate without risking its privacy. There have been two approaches suggested by the literature on how to provide vehicles with pseudonyms. One is the so-called pre-loading mode, suggesting to pre-load vehicles with all pseudonyms they need, which increases the cost of revocation in case they are compromised. The other one is the on-demand mode, suggesting a real-time offering of pseudonyms by VPKI at vehicles request e.g., on starting each trip. Choosing the on-demand approach imposes a considerable burden of availability and resilience on VPKI services. In this work, we are confronting the problems regarding a large-scale deployment of an on-demand VPKI that is resilient, highly available, and dynamically scalable. In order to achieve that, by leveraging state-of-the-art tools and design paradigms, we have enhanced a VPKI system to ensure that it is capable of meeting enterprise-grade Service Level Agreement (SLA) in terms of availability, and it can also be cost-efficient as services can dynamically scale-out in the presence of high load, or possibly scale-in when facing less demand. That has been made possible by re-architecting and refactoring an existing VPKI into a cloud-native solution deployed as microservices. Towards having a reliable architecture based on distributed microservices, one of the key challenges to deal with is Sybil-based misbehavior. By exploiting Sybil-based attacks in VPKI, malicious vehicles can gain influential advantage in the system, e.g., one can affect the traffic to serve its own will. Therefore, preventing the occurrence of Sybil attacks is paramount. On the other hand, traditional approaches to stop them, often come with a performance penalty as they verify requests against a relational database which is a bottleneck of the operations. We propose a solution to address Sybil-based attacks, utilizing Redis, an in-memory data store, without compromising the system efficiency and performance considerably. Running our VPKI services on Google Cloud Platform (GCP) shows that a large-scale deployment of VPKI as a Service (VPKIaaS) can be done efficiently. Conducting various stress tests against the services indicates that the VPKIaaS is capable of serving real world traffic. We have tested VPKIaaS under synthetically generated normal traffic flow and flash crowd scenarios. It has been shown that VPKIaaS managed to issue 100 pseudonyms per request, submitted by 1000 vehicles where vehicles kept asking for a new set of pseudonyms every 1 to 5 seconds. Each vehicle has been served in less than 77 milliseconds. We also demonstrate that, under a flash crowd situation, with 50000 vehicles, VPKIaaS dynamically scales out, and takes ≈192 milliseconds to serve 100 pseudonyms per request submitted by vehicles. / Ansträngningar för standardisering av Vehicular Communication Systems har varit avgörande för användandet av Vehicular Public-Key Infrastructure (VPKI) för att etablera förtroende mellan nätverksdeltagare. Användande av VPKI i Vehicular Communication (VC) garanterar integritet och autenticitet av meddelanden. Det erbjuder ett lager av säkerhet för fordon då VPKI ger dem en mängd av icke länkbara certifikat, kallade pseudonym, som används medan de kommunicerar med andra fordon, kallat Vehicle-to-Vehicle (V2V) eller Roadside Units (RSUs) kallat Vehicle-to-Infrastructure (V2I). Varje fordon använder ett pseudonym under en begränsad tid och genom att byta till ett icke tidigare använt pseudonym kan det fortsätta kommunicera utan att riskera sin integritet. I litteratur har två metoder föreslagits för hur man ska ladda fordon med pseudonym de behöver. Den ena metoden det så kallade offline-läget, som proponerar att man för-laddar fordonen med alla pseudonym som det behöver vilket ökar kostnaden för revokering i fall de blir komprometterat. Den andra metoden föreslår ett on-demand tillvägagångssätt som erbjuder pseudonym via VPKI på fordonets begäran vid början av varje färd. Valet av på begäran metoden sätter en stor börda på tillgänglighet och motståndskraft av VPKI tjänster. I det här arbetet, möter vi problem med storskaliga driftsättningar av en på begäran VPKI som är motståndskraftig, har hög tillgänglighet och dynamiskt skalbarhet i syfte att uppnå dessa attribut genom att nyttja toppmoderna verktyg och designparadigmer. Vi har förbättrat ett VPKI system för att säkerställa att det är kapabelt att möta SLA:er av företagsklass gällande tillgänglighet och att det även kan vara kostnadseffektivt eftersom tjänster dynamiskt kan skala ut vid högre last eller skala ner vid lägre last. Detta har möjliggjorts genom att arkitekta om en existerande VPKI till en cloud-native lösning driftsatt som mikrotjänster. En av nyckelutmaningarna till att ha en pålitlig arkitektur baserad på distribuerade mikrotjänster är sybil-baserad missuppförande. Genom att utnyttja Sybil baserade attacker på VPKI, kan illvilliga fordon påverka trafik att tjäna dess egna syften. Därför är det av största vikt att förhindra Sybil attacker. Å andra sidan så dras traditionella metoder att stoppa dem med prestandakostnader. Vi föreslår en lösning för att adressera Sybilbaserade attacker genom att nyttja Redis, en in-memory data-store utan att märkbart kompromissa på systemets effektivitet och prestanda. Att köra våra VPKI tjänster på Google Cloud Platform (GCP) och genomföra diverse stresstester mot dessa har visat att storskaliga driftsättningar av VPKI as a Service (VPKIaaS) kan göras effektivt samtidigt som riktigt trafik hanteras. Vi har testat VPKIaaS under syntetisk genererat normalt trafikflöde samt flow och flash mängd scenarier. Det har visat sig att VPKIaaS klarar att utfärda 100 pseudonym per förfråga utsänt av 1000 fordon (där fordonen bad om en ny uppsättning pseudonym varje 1 till 5 sekunder), och varje fordon fått svar inom 77 millisekunder. Vi demonstrerar även att under en flashcrowd situation, där antalet fordon höjs till 50000 med en kläckningsgrad på 100. VPKIaaS dynamiskt skalar ut och tar ≈192 millisekunder att betjäna 100 pseudonymer per förfrågan gjord av fordon.

Pendant les deux dernières décennies, les technologies de réseaux ad-hoc de véhicules (VANETs : Vehicular Ad-Hoc Networks) ont été développées sous l’impulsion du monde de la recherche comme de l’industrie, étant donnés les liens des VANETs avec la sécurité routière, l’internet des objets (IoT/WoT : Internet of Things/Web of Things) pour les systèmes de transport intelligents (ITS : Intelligent Transportation Systems), les villes intelligentes et les villes vertes. Composant essentiel des VANETs, les protocoles de communication inter-véhicules (IVC : Inter-Vehicle Communication) font face à des défis techniques, en particulier à cause de la diversité des applications dans lesquelles ils sont impliqués. Dans cette thèse, après une présentation des VANETs et de l’état de l’art des IVC, nous proposons un protocole de dissémination de données, TrAD, conçu pour diffuser de manière efficiente des messages d’une source vers les véhicules présents dans la zone d’intérêt (ROI : Range of Interest). TrAD se base sur les états du trafic routier et du trafic réseau pour adapter localement la stratégie et les paramètres de transmission des données afin d’optimiser les performances des applications qui l’utilisent. De plus, un algorithme de classification des clusters locaux de véhicules est conçu pour permettre l’usage de TrAD sur autoroute aussi bien qu’en ville. Pour éviter l’encombrement des canaux de communication, un mécanisme illustratif de contrôle de la congestion reposant sur une approche distribuée est utilisé. Trois protocoles IVC de l’état de l’art ont été comparés à TrAD dans des scénarios réalistes de simulation, basés sur différentes villes réelles, différents trajets et densités véhiculaires. Les performances de TrAD surpassent celles des protocoles de référence en termes de taux de délivrance des paquets (PDR : Packet Delivery Ratio), nombre de transmissions et latence. De plus, nous montrons que TrAD est tolérant, dans une certaine mesure, aux erreurs sur les données GPS. Pour s’assurer de la qualité des simulations, nous avons étudié le modèle de déplacement employé dans le simulateur de trafic, puis couplé ce dernier au simulateur de réseau, afin que les deux s’échangent des informations en temps-réel. Grâce à la compréhension acquise lors de l’analyse du modèle de déplacement, nous avons pu développer un simulateur de conduite de tramway pour la T2C (Transports en Commun de l’agglomération Clermontoise). Des tests menés sur le matériel roulant nous ont permis d’élaborer des modèles de déplacement fidèles correspondants aux diverses situations rencontrées par le tramway. L’affichage de la simulation est assuré par un flux vidéo ajusté plutôt que des images de synthèse, ce qui permet de limiter le coût de développement tout en garantissant un certain réalisme dans l’affichage. Ce projet est soutenu par la T2C pour une durée de deux ans. / In the last two decades, Vehicular Ad hoc Network (VANETs) were developed significantly by both academic institute and industries association, since VANETs originate from traffic safety and are also an important application of Internet of Things / Web of Things (IoT/WoT) for Intelligent Transportation System (ITS), Intelligent Vehicles and Smart Cities. As an essential component of VANETs, Inter-Vehicle Communication (IVC) protocols face many critical challenges, in particular, because they relate to various specific applications. In this thesis, after elaborating on related knowledge of VANETs and state-of-the-art of IVC protocols, we propose a data dissemination protocol for vehicular networking, named TrAD, to disseminate efficiently warning messages from a source to vehicles in a range of interest (ROI). TrAD considers the status of road traffic and network traffic to adapt locally the strategy and the parameters of transmissions in order to optimize the global performance of IVC application. Moreover, a local vehicular cluster classification algorithm is designed to support TrAD to be performed in both highway and urban scenarios. In addition, an illustrative congestion control mechanism is used to avoid channel congestion using a distributed approach. Three state-of-the-art IVC protocols have been compared with TrAD by means of realistic simulations. The performance of all those protocols is evaluated quantitatively in various scenarios by taking into account different real road maps, trafic routes and vehicular densities. Compared with the reference protocols, TrAD gains an outstanding overall performance in terms of packet delivery ratio, number of transmissions and delay. Furthermore, TrAD also can tolerate a reasonable degree of GPS drift while achieving efficient data dissemination. In order to ensure the quality of simulations, we deeply investigated the mobility model of road traffic simulator, and then performed the bidirectionally coupled simulation in which the network simulator and the road trafic simulator can exchange information in real-time. Upon understanding of the mobility model, we obtained a chance to develop a low-cost tram simulator for the local public transportation provider, the T2C (Transports en Commun de l’agglomération Clermontoise). We attempt to design accurate mobility models from different scenarios for the specific type of tram used by T2C. Real world trials are carried out to explore the key parameters required by theoretical deduction for our mobility model. Moreover, the display GUI relies on a video stream, rather than 3D graphics, which can reduce the cost while guaranteeing the quality of service. This project was supported for two years by T2C.