The authors propose an algorithm for the hierarchical aggregation of observations in dissemination-based, distributed traffic information systems. Instead of carrying specific values (e. g., the number of free parking places in a given area), their aggregates contain a modified Flajolet-Martin sketch as a probabilistic approximation. The main advantage of this approach is that the aggregates are duplicate insensitive. This overcomes two central problems of existing aggregation schemes for VANET (vehicular ad hoc network) applications. First, when multiple aggregates of observations for the same area are available, it is possible to combine them into an aggregate containing all information from the original aggregates. This is fundamentally different from existing approaches where typically one of the aggregates is selected for further use while the rest is discarded. Second, any observation or aggregate can be included into higher level aggregates, regardless if it has already been previouslydirectly or indirectlyadded. As a result of those characteristics the quality of the aggregates is high, while their construction is very flexible. The authors demonstrate these traits of their approach by a simulation study.
Probabilistic aggregation for data dissemination in VANETs
2007
8 Seiten, 8 Bilder, 18 Quellen
Aufsatz (Konferenz)
Englisch
Data Dissemination in VANETs: A Scheduling Approach
IEEE | 2014
|Reliable and efficient data dissemination in vanets
Tema Archiv | 2009
|SODA: a Smart Opportunistic Data Dissemination Approach for VANETs
Kraftfahrwesen | 2009
|SODA: A smart opportunistic data dissemination approach for VANETs
Tema Archiv | 2009
|A data dissemination mechanism for motorway environment in VANETs
Tema Archiv | 2015
|