Abstract

International audience; Today, thanks to vehicular networks, drivers may receive useful information produced or relayed by neighboring sensors or vehicles (e.g., the location of an available parking space, of a traffic congestion, etc.). In this paper, we address the problem of providing assistance to the driver when no recent information has been received on his/her vehicle. Therefore, we present a cooperative scheme to aggregate, store and exchange these events in order to have an history of past events. This scheme is based on a dedicated spatio-temporal aggregation structure using Flajolet-Martin sketches and deployed on each vehicle. Contrary to existing approaches considering data aggregation in vehicular networks, our main goal here is not to save network bandwidth but rather to extract useful knowledge from previous observations. In this paper, we present our aggregation data structure, the associated exchange protocol and a set of experiments showing the effectiveness of our proposal.


Original document

The different versions of the original document can be found in:

https://dl.acm.org/citation.cfm?doid=2351476.2351488,
http://doi.org/10.1145/2351476.2351488,
https://hal.archives-ouvertes.fr/hal-00737675,
https://dblp.uni-trier.de/db/conf/ideas/ideas2012.html#ZekriDD12,
https://dl.acm.org/citation.cfm?id=2351488,
https://hal.inria.fr/hal-00737675,
https://academic.microsoft.com/#/detail/2025461646
http://dx.doi.org/10.1145/2351476.2351488
Back to Top

Document information

Published on 01/01/2012

Volume 2012, 2012
DOI: 10.1145/2351476.2351488
Licence: CC BY-NC-SA license

Document Score

0

Views 2
Recommendations 0

Share this document

claim authorship

Are you one of the authors of this document?