Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 245

The DOI matches its Crossref record.

Decentralized discovery of free parking places

Caliskan, Murat, Graupner, Daniel, Mauve, Martin·2006·Proceedings of the 3rd international workshop on Vehicular ad hoc networks

Abstract

This paper proposes a topology independent, scalable information dissemination algorithm for spatio-temporal traffic information such as parking place availability using vehicular ad hoc networks (VANET) based on Wireless-LAN IEEE 802.11.The algorithm uses periodic broadcasts for information dissemination. Broadcast redundancy is minimized by evaluation of application layer information and aggregation. Due to the spatio-temporal characteristics of parking place information, the spatial distribution of information is limited by utilizing techniques, which take the local relevance and age of information into account.Based on a realistic model of a german city with up to 10000 vehicles, our results show that a decentralized parking place information system works efficiently even with 5% of vehicles equipped with Wireless-LAN and without the help of any message relaying infrastructure. This fact makes such a non-safety driver assistance application very interesting, especially in the rollout phase of vehicular ad hoc networks.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1145/1161064.1161070

Cites

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cited by

See all 245

Metadata

Authors
Caliskan, M., Graupner, D., & Mauve, M.
Venue
Proceedings of the 3rd international workshop on Vehicular ad hoc networks
Publisher
ACM
Published
2006-09-29
Pages
30-39
OpenAlex
W2009837731
Cited by
245
References
0
FWCI
26.01
Type
conference paper
Language
en
Open access
closed

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Decentralized discovery of free parking places. https://app.cochat.ai/papers/10.1145/1161064.1161070
The paper
Caliskan, M., Graupner, D., & Mauve, M. (2006). Decentralized discovery of free parking places. Proceedings of the 3rd international workshop on Vehicular ad hoc networks. https://doi.org/10.1145/1161064.1161070

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.