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

A Novel Approach to Reliable Message Broadcasting in Vehicular Ad hoc Networks by Prioritizing both Messages and Density Based Regions

Vehicular Ad hoc Networks (VANETs) are an outgrowth of traditional Mobile Ad hoc Networks (MANETs). VANET is mainly used to model communication in a Vehicular environment where the vehicles are considered as VANET nodes with wireless links. It enables the communications among vehicles and between vehicles and Road Side Units (RSU). In Peer-to-Peer communication, a vehicle can send message to any other vehicle in the network. In doing so, if the destination vehicle is farthest from the source vehicle, then propagation delay is more for the delivery of messages. For a better delivery ratio and to reduce broadcast storms, a message has to be relayed through intermediate nodes known as representative nodes (RN)s to the destination. The main requirement of VANET is location information. Using Greedy Forward algorithm, messages to farthest nodes are transmitted by computing RNs. Though we communicate with the farthest node through representative nodes, due to the special characteristics of VANETs such as high mobility, unstable links or dynamic nature of vehicles, representative nodes positions are to be computed dynamically. If the information about the high density region and low density region are gathered then the problems that arise with sparse VANETs also can be minimized. Otherwise the prior approach sends information to low density region continuously than high density regions. This problem can be minimized if we apply DBSCAN algorithm to form clusters (regions) using location information, then high density regions can be given highest priority for message transmission. As VANETs main characteristic is urgent message transmission, the messages are to be prioritized and then transmitted over the network. In this paper, Greedy forward approach and DBSCAN algorithms are pipelined to increase the performance of broadcasting messages over the VANET. In addition to this, in this paper, we also prioritize the messages for urgent message transmission over the VANET. This provides hybrid solution to the lossless instant messaging mechanism as this works on real time environment. Keywords: VANET, Representative Node (RN), Road Side Unit (RSU), Global Positioning System (GPS),Greedy Perimeter Stateless Routing (GPSR) , DBSCAN (Density Based Spatial Clustering of Applications with Noise)

A topology-oblivious routing protocol for NDN-VANETs

Vehicular Ad Hoc Networks (VANETs) are characterized by intermittent connectivity, which leads to failures of end-to-end paths between nodes. Named Data Networking (NDN) is a network paradigm that deals with such problems, since information is forwarded based on content and not on the location of the hosts. In this work, we propose an enhanced routing protocol of our previous topology-oblivious Multihop, Multipath, and Multichannel NDN for VANETs (MMM-VNDN) routing strategy that exploits several paths to achieve more efficient content retrieval. Our new enhanced protocol, i mproved MMM-VNDN (iMMM-VNDN), creates paths between a requester node and a provider by broadcasting Interest messages. When a provider responds with a Data message to a broadcast Interest message, we create unicast routes between nodes, by using the MAC address(es) as the distinct address(es) of each node. iMMM-VNDN extracts and thus creates routes based on the MAC addresses from the strategy layer of an NDN node. Simulation results show that our routing strategy performs better than other state of the art strategies in terms of Interest Satisfaction Rate, while keeping the latency and jitter of messages low

A RELIABILITY-BASED ROUTING PROTOCOL FOR VEHICULAR AD-HOC NETWORKS

Vehicular Ad hoc NETworks (VANETs), an emerging technology, would allow vehicles to form a self-organized network without the aid of a permanent infrastructure. As a prerequisite to communication in VANETs, an efficient route between communicating nodes in the network must be established, and the routing protocol must adapt to the rapidly changing topology of vehicles in motion. This is one of the goals of VANET routing protocols. In this thesis, we present an efficient routing protocol for VANETs, called the Reliable Inter-VEhicular Routing (RIVER) protocol. RIVER utilizes an undirected graph that represents the surrounding street layout where the vertices of the graph are points at which streets curve or intersect, and the graph edges represent the street segments between those vertices. Unlike existing protocols, RIVER performs real-time, active traffic monitoring and uses this data and other data gathered through passive mechanisms to assign a reliability rating to each street edge. The protocol then uses these reliability ratings to select the most reliable route. Control messages are used to identify a node’s neighbors, determine the reliability of street edges, and to share street edge reliability information with other nodes

Computational Intelligence Inspired Data Delivery for Vehicle-to-Roadside Communications

We propose a vehicle-to-roadside communication protocol based on distributed clustering where a coalitional game approach is used to stimulate the vehicles to join a cluster, and a fuzzy logic algorithm is employed to generate stable clusters by considering multiple metrics of vehicle velocity, moving pattern, and signal qualities between vehicles. A reinforcement learning algorithm with game theory based reward allocation is employed to guide each vehicle to select the route that can maximize the whole network performance. The protocol is integrated with a multi-hop data delivery virtualization scheme that works on the top of the transport layer and provides high performance for multi-hop end-to-end data transmissions. We conduct realistic computer simulations to show the performance advantage of the protocol over other approaches

EBP: An Efficient Broadcast Protocol for Warning Message Dissemination in VANETs

Vehicular Ad-hoc Networks (VANETs) enable vehicle-to-vehicle communications to share relevant road information with various applications. Road safety is one of the main objectives of VANETs that has attracted great interest from researchers. Other so-called comfort applications have also been studied which can improve driving experience and passenger safety. In all these applications, sharing of warning messages can help drivers minimize accidents and congestions, and plan better itinerary during the congestion situations or the anticipation of potential and highly hazardous events. In this paper, we present an efficient broadcast protocol (EBP) for broadcasting warning messages in VANETs. As an improved strategy for alert data dissemination, EBP can be applied in whatever the nature of the risk, with a particular focus on mobile dangers. We first conduct an in-depth analysis and evaluation, under different conditions, of the existing approaches and mechanisms used for information dissemination in VANETs. Then, we point out their drawbacks and design the EBP to avoid these drawbacks. As a result, the EBP is an improved, well-justified and more effective protocol. We validate it by simulation experiments under various scenarios

Broadcasting with Prediction and Selective Forwarding in Vehicular Networks

Broadcasting in vehicular networks has attracted great interest in research community and industry. Broadcasting on disseminating information to individual vehicle beyond the transmission range is based on inter-vehicle communication systems. It is crucial to broadcast messages to other vehicles as fast as possible because the messages in vehicle communication systems are often emergency messages such as accident warning or alarm. In many current approaches, the message initiator or sender selects the node among its neighbors that is farthest away from it in the broadcasting direction and then assigns the node to rebroadcast the message once the node gets out of its range or after a particular time slot. However, this approach may select a nonoptimal candidate because it does not consider the moving status of vehicles including their moving directions and speeds. In this paper, we develop a new approach based on prediction of future velocity and selective forwarding. The current message sender selects the best candidate that will rebroadcast the message to other vehicles as fast as possible. Key to the decision making is to consider the candidates\u27 previous moving status and predict the future moving trends of the candidates so that the message is spread out faster. In addition, this approach generates very low overhead. Simulations demonstrate that our approach significantly decreases end-to-end delay and improves message delivery ratio

Benets of tight coupled architectures for the integration of GNSS receiver and Vanet transceiver

Vehicular adhoc networks (VANETs) are one emerging type of networks that will enable a broad range of applications such as public safety, traffic management, traveler information support and entertain ment. Whether wireless access may be asynchronous or synchronous (respectively as in the upcoming IEEE 8021.11p standard or in some alternative emerging solutions), a synchronization among nodes is required. Moreover, the information on position is needed to let vehicular services work and to correctly forward the messages. As a result, timing and positioning are a strong prerequisite of VANETs. Also the diffusion of enhanced GNSS Navigators paves the way to the integration between GNSS receivers and VANET transceiv ers. This position paper presents an analysis on potential benefits coming from a tightcoupling between the two: the dissertation is meant to show to what extent Intelligent Transportation System (ITS) services could benefit from the proposed architectur