Sharing with Caution: Managing Parking Spaces in Vehicular Networks

By exchanging events in a vehicular ad hoc network (VANET), drivers can receive interesting information while driving. For example, they can be informed of available parking spaces in their vicinity. A suitable protocol is needed to disseminate the events efficiently within the area where they are relevant. Moreover, in such a competitive context where each vehicle may be interested in a resource, it is crucial not to communicate that resource to each driver in the vicinity. Otherwise, those drivers would waste time trying to reach a parking space and only one of them would be fulfilled, which would lead to a poor satisfaction in the system. To solve this problem, we detail in this paper a reservation protocol that efficiently allocates parking spaces in vehicular ad hoc networks and avoids the competition among the vehicles. We have integrated our protocol within VESPA, a system that we have designed for vehicles to share information in VANETs. An experimental evaluation is provided, which proves the usefulness and benefits of our reservation protocol in both parking lots and urban scenarios. Besides, we present an in-depth study of the state of the art on this topic, that shows the interest and the originality of our approach

Partage d’informations dans les réseaux de communication inter-véhiculaire

This thesis is interested in the information sharing in inter-vehicle communication networks. Today, thanks to the positioning systems and to the wireless communication capacities, vehicles can exchange data relating different kind of events (emergency brake, traffic jam, available parking spot, etc.) in order to provide new assistance systems for the drivers. In this work, we focused on vehicle-to-vehicle communication (V2V). The absence of any fixed communication infrastructure and the high nodes' mobility (i.e. vehicles) in the network raise particularly interesting problems in term of data management, for example, in term of relevance estimation in these particularly dynamic environments. In this context, our main contributions concern : the proposal of mechanisms, based on the computation of an encounter probability, allowing to estimate the relevance of information exchanged between vehicles ; mechanisms of continuous query processing in decentralized environments allowing to keep information updated ; a dissemination protocol, exploiting our encounter probability, allowing to route data to vehicles potentially interested. Our proposals were evaluated in the VESPA (Vehicular Event Sharing with a mobile Peer-to-peer Architecture) system as well as through numerous simulations.Cette thèse s’intéresse au partage d’informations dans les réseaux de communication inter-véhicules. Grâce aux systèmes de positionnement et aux capacités de communication sans fil, les véhicules peuvent aujourd’hui s’échanger des données relatives à différents types d’événements (freinages d’urgence, embouteillages, places de stationnement disponibles, etc.) afin de proposer de nouveaux systèmes d’assistance aux conducteurs. Nous nous sommes focalisés dans ce travail sur la communication véhicule-à-véhicule (V2V). L’absence de toute infrastructure de communication fixe et la forte mobilité des nœuds (i.e., les véhicules) dans le réseau posent des problèmes particulièrement intéressant en terme de gestion des données, par exemple en terme d’estimation de la pertinence dans ces environnements particulièrement dynamiques. Dans ce contexte, nos principales contributions concernent : la proposition de mécanismes, basés sur des calculs de probabilité de rencontre, permettant d’estimer la pertinence des informations échangées entre les véhicules ; des mécanismes d’évaluation de requêtes continues dans les environnements décentralisés permettant de maintenir l’information à jour ; un protocole de dissémination, exploitant notre probabilité de rencontre, permettant d’acheminer les données vers les véhicules potentiellement intéressés. Nos propositions ont été évaluées dans le système VESPA (Vehicular Event Sharing with a mobile Peer-to-peer Architecture) ainsi qu’au travers de nombreuses simulations

Estimating the relevance of information in inter-vehicle ad hoc networks

This paper focuses on intelligent transportation systems. Specifically, we look at data management issues in intervehicle ad hoc networks. Such networks are highly dynamic due to the movements of the vehicles and the short range of the wireless communications. Thus, for example, we can only rely on short interactions between the vehicles. Consequently, new data management techniques adapted to this context are needed. More precisely, we propose a new technique to estimate the relevance of data to the drivers. The originality of our proposal is that we identify and classify the different types of information that may be shared on the roads (e.g., available parking spaces, obstacles in the road, information relative to the coordination of vehicles in emergency situations, etc.). We then propose a unified solution to support all those types of information. Our experimental evaluation shows the feasibility and interest of our approach.

Dissemination of information in inter-vehicle ad hoc networks

Abstract — This paper focuses on intelligent transportation systems and more precisely on inter-vehicle ad hoc networks. Such networks are highly dynamic due to the movements of the vehicles and the short range of the wireless communications. Thus, for example, we can only rely on short interactions between the vehicles to exchange data about relevant events. We propose a new dissemination technique for vehicles to share information using V2V communications. Our goal is to make possible the exchange of information between vehicles when they encounter each other, taking into account the relevance of the data to the drivers. The originality of our proposal is that it relies on an encounter probability to disseminate data about any type of event (e.g., available parking spaces, obstacles in the road, information relative to the coordination of vehicles in emergency situations, etc.) in the network. I

Sharing with Caution: Managing Parking Spaces in Vehicular Networks

By exchanging events in a vehicular ad hoc network (VANET), drivers can receive interesting information while driving. For example, they can be informed of available parking spaces in their vicinity. A suitable protocol is needed to disseminate the events efficiently within the area where they are relevant. Moreover, in such a competitive context where each vehicle may be interested in a resource, it is crucial not to communicate that resource to each driver in the vicinity. Otherwise, those drivers would waste time trying to reach a parking space and only one of them would be fulfilled, which would lead to a poor satisfaction in the system

kdeldycke/mail-deduplicate: v7.3.0

<p><a href="https://pypi.org/project/mail-deduplicate/7.3.0"> Available on PyPi</a></p&gt