Research Article
Data aggregation in VANETs: the VESPA approach
@INPROCEEDINGS{10.4108/ICST.MOBIQUITOUS2008.3897, author={Bruno Defude and Thierry Delot and Sergio Ilarri and Jos\^{e}-Luis Zechinelli Martini and Nicolas Cenerario}, title={Data aggregation in VANETs: the VESPA approach}, proceedings={1st International ICST Workshop on Computational Transportation Science}, publisher={ACM}, proceedings_a={IWCTS}, year={2010}, month={5}, keywords={VANETS Data Aggregation Data Storage}, doi={10.4108/ICST.MOBIQUITOUS2008.3897} }
- Bruno Defude
Thierry Delot
Sergio Ilarri
José-Luis Zechinelli Martini
Nicolas Cenerario
Year: 2010
Data aggregation in VANETs: the VESPA approach
IWCTS
ICST
DOI: 10.4108/ICST.MOBIQUITOUS2008.3897
Abstract
VESPA (Vehicular Event Sharing with a mobile P2P Architecture) 1 is a system for enabling vehicles to share information in vehicular ad-hoc networks (VANETs). The originality of VESPA is to process and disseminate any type of event (e.g., available parking spaces, accidents, emergency braking, information relative to the coordination of vehicles in emergency situations, etc.). The basic functions of VESPA are both disseminating events to potentially interested vehicles and evaluating their relevance once received in order to determine, for instance, whether the driver should be warned or not. This paper concentrates on knowledge extraction in VESPA. In particular, it focuses on how to exploit data exchanged among vehicles to produce knowledge to be used later on by drivers. Existing systems only use exchanged data to produce warnings for drivers when needed. Then, data is considered obsolete and is deleted. In contrast, we propose to aggregate data once it becomes “obsolete”. Our objective is to produce additional knowledge to be used by drivers when no relevant data has been communicated by neighboring vehicles. For example, by aggregating events it is possible to dynamically detect potentially dangerous road segments or to determine the areas where the probability to find an available parking space is high.