The distribution of dynamic information from many sources to many destinations is a key challenge for vehicular ad hoc network (VANET) applications such as cooperative traffic information management or decentralized parking guidance systems. In order for these systems to remain scalable it has been proposed to aggregate the information within the network as it travels from the sources to the destinations. However, so far it has remained unclear by what amount the aggregation scheme needs to reduce the original data in order to be considered scalable. In this paper the authors prove formally that any suitable aggregation scheme must reduce the bandwidth at which information about an area at distance d is provided to the cars asymptotically faster than 1/d2. Furthermore, they constructively show that this bound is tight: for any arbitrary epsilon > 0, there exists a scalable aggregation scheme that reduces information asymptotically like 1/d(2+epsilon). The paper is structured as follows. In Section 2 the authors introduce a model of data dissemination as a basis for further considerations. In Section 3 they then prove the abovementioned bound on the necessary bandwidth reduction. That it can be approached arbitrarily closely is shown in Section 4. Subsequently, the authors discuss implications and applicability of their results in Section 5 and review related work in Section 6. Finally, they conclude with a summary in Section 7.
A fundamental scalability criterion for data aggregation in VANETs
2009
12 Seiten, 3 Bilder, 26 Quellen
Conference paper
Storage medium
English
Probabilistic aggregation for data dissemination in VANETs
Tema Archive | 2007
|Catch-up: A data aggregation scheme for VANETs
Tema Archive | 2008
|An improved rank criterion-based NLOS node detection mechanism in VANETs
Emerald Group Publishing | 2020
|