Catch-up
Authors:
Open Access
- 15 September 2008
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 49-57
Abstract
In-network data aggregation is a useful technique to reduce redundant data and improve communication efficiency. One challenge in data aggregation is how reports can be routed to the same node so that the reports can be merged. Most of existing approaches rely on maintaining a routing structure to achieve this purpose. However, these approaches are not applicable to the mobile environment of Vehicular Ad hoc Networks (VANETs). In this paper, we design a cooperative model to facilitate the aggregation of adjacent traffic reports. The basic idea behind this work is that we can adaptively change the forwarding delay of individual reports in a manner that a report can have a better chance to meet other reports. The decision is made distributedly by each vehicle based on local observations. Actually, our scheme is also a tradeoff between communication overhead and propagation delay. Simulation results based on realistic map data and traffic models demonstrate that our scheme can effectively reduce communication overhead with acceptable delay.Keywords
This publication has 12 references indexed in Scilit:
- Probabilistic aggregation for data dissemination in VANETs2007
- Scalable data aggregation for dynamic events in sensor networks2006
- VADD: Vehicle-Assisted Data Delivery in Vehicular Ad Hoc Networks2006
- GrooveSim2005
- Fair sharing of bandwidth in VANETs2005
- Information Dissemination in Self-Organizing Intervehicle NetworksIEEE Transactions on Intelligent Transportation Systems, 2005
- Synopsis diffusion for robust aggregation in sensor networks2004
- TrafficViewACM SIGMOBILE Mobile Computing and Communications Review, 2004
- Aggregation in sensor networks: an energy–accuracy trade-offAd Hoc Networks, 2003
- Directed diffusion2000