Quality of service aware data dissemination in vehicular Ad Hoc networks

Des systèmes de transport intelligents (STI) seront éventuellement fournis dans un proche avenir pour la sécurité et le confort des personnes lors de leurs déplacements sur les routes. Les réseaux ad-hoc véhiculaires (VANETs) représentent l'élément clé des STI. Les VANETs sont formés par des véhicules qui communiquent entre eux et avec l'infrastructure. En effet, les véhicules pourront échanger des messages qui comprennent, par exemple, des informations sur la circulation routière, les situations d'urgence et les divertissements. En particulier, les messages d'urgence sont diffusés par des véhicules en cas d'urgence (p.ex. un accident de voiture); afin de permettre aux conducteurs de réagir à temps (p.ex., ralentir), les messages d'urgence doivent être diffusés de manière fiable dans un délai très court. Dans les VANETs, il existe plusieurs facteurs, tels que le canal à pertes, les terminaux cachés, les interférences et la bande passante limitée, qui compliquent énormément la satisfaction des exigences de fiabilité et de délai des messages d'urgence. Dans cette thèse, en guise de première contribution, nous proposons un schéma de diffusion efficace à plusieurs sauts, appelé Dynamic Partitioning Scheme (DPS), pour diffuser les messages d'urgence. DPS calcule les tailles de partitions dynamiques et le calendrier de transmission pour chaque partition; à l'intérieur de la zone arrière de l'expéditeur, les partitions sont calculées de sorte qu'en moyenne chaque partition contient au moins un seul véhicule; l'objectif est de s'assurer que seul un véhicule dans la partition la plus éloignée (de l'expéditeur) est utilisé pour diffuser le message, jusqu'au saut suivant; ceci donne lieu à un délai d'un saut plus court. DPS assure une diffusion rapide des messages d'urgence. En outre, un nouveau mécanisme d'établissement de liaison, qui utilise des tonalités occupées, est proposé pour résoudre le problème du problème de terminal caché. Dans les VANETs, la Multidiffusion, c'est-à-dire la transmission d'un message d'une source à un nombre limité de véhicules connus en tant que destinations, est très importante. Par rapport à la diffusion unique, avec Multidiffusion, la source peut simultanément prendre en charge plusieurs destinations, via une arborescence de multidiffusion, ce qui permet d'économiser de la bande passante et de réduire la congestion du réseau. Cependant, puisque les VANETs ont une topologie dynamique, le maintien de la connectivité de l'arbre de multidiffusion est un problème majeur. Comme deuxième contribution, nous proposons deux approches pour modéliser l'utilisation totale de bande passante d'une arborescence de multidiffusion: (i) la première approche considère le nombre de segments de route impliqués dans l'arbre de multidiffusion et (ii) la seconde approche considère le nombre d'intersections relais dans l'arbre de multidiffusion. Une heuristique est proposée pour chaque approche. Pour assurer la qualité de service de l'arbre de multidiffusion, des procédures efficaces sont proposées pour le suivi des destinations et la surveillance de la qualité de service des segments de route. Comme troisième contribution, nous étudions le problème de la congestion causée par le routage du trafic de données dans les VANETs. Nous proposons (1) une approche de routage basée sur l’infonuagique qui, contrairement aux approches existantes, prend en compte les chemins de routage existants qui relaient déjà les données dans les VANETs. Les nouvelles demandes de routage sont traitées de sorte qu'aucun segment de route ne soit surchargé par plusieurs chemins de routage croisés. Au lieu d'acheminer les données en utilisant des chemins de routage sur un nombre limité de segments de route, notre approche équilibre la charge des données en utilisant des chemins de routage sur l'ensemble des tronçons routiers urbains, dans le but d'empêcher, dans la mesure du possible, les congestions locales dans les VANETs; et (2) une approche basée sur le réseau défini par logiciel (SDN) pour surveiller la connectivité VANET en temps réel et les délais de transmission sur chaque segment de route. Les données de surveillance sont utilisées en entrée de l'approche de routage.Intelligent Transportation Systems (ITS) will be eventually provided in the near future for both safety and comfort of people during their travel on the roads. Vehicular ad-hoc Networks (VANETs), represent the key component of ITS. VANETs consist of vehicles that communicate with each other and with the infrastructure. Indeed, vehicles will be able to exchange messages that include, for example, information about road traffic, emergency situations, and entertainment. Particularly, emergency messages are broadcasted by vehicles in case of an emergency (e.g., car accident); in order to allow drivers to react in time (e.g., slow down), emergency messages must be reliably disseminated with very short delay. In VANETs, there are several factors, such as lossy channel, hidden terminals, interferences and scarce bandwidth, which make satisfying reliability and delay requirements of emergency messages very challenging. In this thesis, as the first contribution, we propose a reliable time-efficient and multi-hop broadcasting scheme, called Dynamic Partitioning Scheme (DPS), to disseminate emergency messages. DPS computes dynamic partition sizes and the transmission schedule for each partition; inside the back area of the sender, the partitions are computed such that in average each partition contains at least a single vehicle; the objective is to ensure that only a vehicle in the farthest partition (from the sender) is used to disseminate the message, to next hop, resulting in shorter one hop delay. DPS ensures fast dissemination of emergency messages. Moreover, a new handshaking mechanism, that uses busy tones, is proposed to solve the problem of hidden terminal problem. In VANETs, Multicasting, i.e. delivering a message from a source to a limited known number of vehicles as destinations, is very important. Compared to Unicasting, with Multicasting, the source can simultaneously support multiple destinations, via a multicast tree, saving bandwidth and reducing overall communication congestion. However, since VANETs have a dynamic topology, maintaining the connectivity of the multicast tree is a major issue. As the second contribution, we propose two approaches to model total bandwidth usage of a multicast tree: (i) the first approach considers the number of road segments involved in the multicast tree and (ii) the second approach considers the number of relaying intersections involved in the multicast tree. A heuristic is proposed for each approach. To ensure QoS of the multicasting tree, efficient procedures are proposed for tracking destinations and monitoring QoS of road segments. As the third contribution, we study the problem of network congestion in routing data traffic in VANETs. We propose (1) a Cloud-based routing approach that, in opposition to existing approaches, takes into account existing routing paths which are already relaying data in VANETs. New routing requests are processed such that no road segment gets overloaded by multiple crossing routing paths. Instead of routing over a limited set of road segments, our approach balances the load of communication paths over the whole urban road segments, with the objective to prevent, whenever possible, local congestions in VANETs; and (2) a Software Defined Networking (SDN) based approach to monitor real-time VANETs connectivity and transmission delays on each road segment. The monitoring data is used as input to the routing approach

Game-theoretical design of an adaptive distributed dissemination protocol for VANETs

Road safety applications envisaged for Vehicular Ad Hoc Networks (VANETs) depend largely on the dissemination of warning messages to deliver information to concerned vehicles. The intended applications, as well as some inherent VANET characteristics, make data dissemination an essential service and a challenging task in this kind of networks. This work lays out a decentralized stochastic solution for the data dissemination problem through two game-theoretical mechanisms. Given the non-stationarity induced by a highly dynamic topology, diverse network densities, and intermittent connectivity, a solution for the formulated game requires an adaptive procedure able to exploit the environment changes. Extensive simulations reveal that our proposal excels in terms of number of transmissions, lower end-to-end delay and reduced overhead while maintaining high delivery ratio, compared to other proposalsPeer ReviewedPostprint (published version

QoS Driven Routing Protocol in VANETs

Vehicular Ad Hoc Networks (VANETs) arespecial type of Mobile Ad hoc NETworks (MANETs). It is an effective new technology to forward packets or sharing messages between vehicles (V2V) or vehicle to infrastructure (V2I). VANETs are considered as one of the most emerging technologies for enhancing the efficiency and the safety applications of transportation systems. The main use of VANET is to exchange traffic related information between the vehicles and prevention of accidents in transportation system. In VANETs vehicles move with the high mobility so it can be considered as the major concern. The challenge in VANETs applications is to send the Emergency Message (EM) to all the vehicles which are available in the communication range. But, because of the wireless communication medium, sharing of the packets and broadcasting of traffic information may lead to frequent altercation and collision, this problem called "broadcast overhead problem". In this paper, a QoS driven protocol is proposed to utilize the network bandwidth efficiently by reducing the broadcast overhead and forwarding the urgent or emergency messages first compared to other messages. This new protocol first finds the Minimum Connected Dominating Set of Vehicle (MCDSV) to reduce the broadcast overhead and the MCDSV acts as a virtual backbone for communication within the Network. After finding the MCDSV, we use the concept of a priority Queue for emergency broadcast scheme (VDEB) to resolve the issue of high overhead in senderoriented schemes and long delay in receiveroriented schemes. For the safety applications the broadcast protocol has to guarantee the performance and the reliability context. This combined method of Minimum Connected Dominating Set and Priority Queue demonstrate the good performances and the robustness of such protocol compared to other Routing protocols

INRISCO: INcident monitoRing in Smart COmmunities

Major advances in information and communication technologies (ICTs) make citizens to be considered as sensors in motion. Carrying their mobile devices, moving in their connected vehicles or actively participating in social networks, citizens provide a wealth of information that, after properly processing, can support numerous applications for the benefit of the community. In the context of smart communities, the INRISCO [1] proposal intends for (i) the early detection of abnormal situations in cities (i.e., incidents), (ii) the analysis of whether, according to their impact, those incidents are really adverse for the community; and (iii) the automatic actuation by dissemination of appropriate information to citizens and authorities. Thus, INRISCO will identify and report on incidents in traffic (jam, accident) or public infrastructure (e.g., works, street cut), the occurrence of specific events that affect other citizens' life (e.g., demonstrations, concerts), or environmental problems (e.g., pollution, bad weather). It is of particular interest to this proposal the identification of incidents with a social and economic impact, which affects the quality of life of citizens.This work was supported in part by the Spanish Government through the projects INRISCO under Grant TEC2014-54335-C4-1-R, Grant TEC2014-54335-C4-2-R, Grant TEC2014-54335-C4-3-R, and Grant TEC2014-54335-C4-4-R, in part by the MAGOS under Grant TEC2017-84197-C4-1-R, Grant TEC2017-84197-C4-2-R, and Grant TEC2017-84197-C4-3-R, in part by the European Regional Development Fund (ERDF), and in part by the Galician Regional Government under agreement for funding the Atlantic Research Center for Information and Communication Technologies (AtlantTIC)

Design and Evaluation of a Traffic Safety System based on Vehicular Networks for the Next Generation of Intelligent Vehicles

La integración de las tecnologías de las telecomunicaciones en el sector del automóvil permitirá a los vehículos intercambiar información mediante Redes Vehiculares, ofreciendo numerosas posibilidades. Esta tesis se centra en la mejora de la seguridad vial y la reducción de la siniestralidad mediante Sistemas Inteligentes de Transporte (ITS). El primer paso consiste en obtener una difusión eficiente de los mensajes de advertencia sobre situaciones potencialmente peligrosas. Hemos desarrollado un marco para simular el intercambio de mensajes entre vehículos, utilizado para proponer esquemas eficientes de difusión. También demostramos que la disposición de las calles tiene gran influencia sobre la eficiencia del proceso. Nuestros algoritmos de difusión son parte de una arquitectura más amplia (e-NOTIFY) capaz de detectar accidentes de tráfico e informar a los servicios de emergencia. El desarrollo y evaluación de un prototipo demostró la viabilidad del sistema y cómo podría ayudar a reducir el número de víctimas en carretera

VANET-Based Traffic Monitoring and Incident Detection System: A Review

As a component of intelligent transport systems (ITS), vehicular ad hoc network (VANET), which is a subform of manet, has been identified. It is established on the roads based on available vehicles and supporting road infrastructure, such as base stations. An accident can be defined as any activity in the environment that may be harmful to human life or dangerous to human life. In terms of early detection, and broadcast delay. VANET has shown various problems. The available technologies for incident detection and the corresponding algorithms for processing. The present problem and challenges of incident detection in VANET technology are discussed in this paper. The paper also reviews the recently proposed methods for early incident techniques and studies them

Adaptive Mechanisms to Improve Message Dissemination in Vehicular Networks

En el pasado, se han dedicado muchos recursos en construir mejores carreteras y autovías. Con el paso del tiempo, los objetivos fueron cambiando hacia las mejoras de los vehículos, consiguiendo cada vez vehículos más rápidos y con mayor autonomía. Más tarde, con la introducción de la electrónica en el mercado del automóvil, los vehículos fueron equipados con sensores, equipos de comunicaciones, y otros avances tecnológicos que han permitido la aparición de coches más eficientes, seguros y confortables. Las aplicaciones que nos permite el uso de las Redes Vehiculares (VNs) en términos de seguridad y eficiencia son múltiples, lo que justifica la cantidad y recursos de investigación que se están dedicando en los últimos años. En el desarrollo de esta Tesis, los esfuerzos se han centrado en el área de las Vehicular Ad-hoc Networks, una subclase de las Redes Vehiculares que se centra en las comunicaciones entre los vehículos, sin necesidad de que existan elementos de infraestructura. Con la intención de mejorar el proceso de diseminación de mensajes de alerta, imprescindibles para las aplicaciones relacionadas con la seguridad, se ha propuesto un esquema de difusión adaptativo, capaz de seleccionar automáticamente el mecanismo de difusión óptimo en función de la complejidad del mapa y de la densidad actual de vehículos. El principal objetivo es maximizar la efectividad en la difusión de mensajes, reduciendo al máximo el número de mensajes necesarios, evitando o mitigando las tormentas de difusión. Las propuestas actuales en el área de las VANETs, se centran principalmente en analizar escenarios con densidades típicas o promedio. Sin embargo, y debido a las características de este tipo de redes, a menudo se dan situaciones con densidades extremas (altas y bajas). Teniendo en cuenta los problemas que pueden ocasionar en el proceso de diseminación de los mensajes de emergencia, se han propuesto dos nuevos esquemas de difusión para bajas densidades: el \emph{Junction Store and Forward} (JSF) y el \emph{Neighbor Store and Forward} (NSF). Además, para situaciones de alta densidad de vehículos, se ha diseñado el \emph{Nearest Junction Located} (NJL), un esquema de diseminación que reduce notablemente el número de mensajes enviados, sin por ello perder prestaciones. Finalmente, hemos realizado una clasificacion de los esquemas de difusión para VANETs más importantes, analizando las características utilizadas en su diseño. Además hemos realizado una comparación de todos ellos, utilizando el mismo entorno de simulación y los mismos escenarios, permitiendo conocer cuál es el mejor esquema de diseminación a usar en cada momento

SCALABLE MULTI-HOP DATA DISSEMINATION IN VEHICULAR AD HOC NETWORKS

Vehicular Ad hoc Networks (VANETs) aim at improving road safety and travel comfort, by providing self-organizing environments to disseminate traffic data, without requiring fixed infrastructure or centralized administration. Since traffic data is of public interest and usually benefit a group of users rather than a specific individual, it is more appropriate to rely on broadcasting for data dissemination in VANETs. However, broadcasting under dense networks suffers from high percentage of data redundancy that wastes the limited radio channel bandwidth. Moreover, packet collisions may lead to the broadcast storm problem when large number of vehicles in the same vicinity rebroadcast nearly simultaneously. The broadcast storm problem is still challenging in the context of VANET, due to the rapid changes in the network topology, which are difficult to predict and manage. Existing solutions either do not scale well under high density scenarios, or require extra communication overhead to estimate traffic density, so as to manage data dissemination accordingly. In this dissertation, we specifically aim at providing an efficient solution for the broadcast storm problem in VANETs, in order to support different types of applications. A novel approach is developed to provide scalable broadcast without extra communication overhead, by relying on traffic regime estimation using speed data. We theoretically validate the utilization of speed instead of the density to estimate traffic flow. The results of simulating our approach under different density scenarios show its efficiency in providing scalable multi-hop data dissemination for VANETs