Literature Database Entry

welzel2023cuckoo

Simon Welzel, Falko Dressler and Florian Klingler, "Cuckoo Filters for Two-Hop Neighbor Management in Vehicular Networks," Proceedings of 14th IEEE Vehicular Networking Conference (VNC 2023), Poster Session, Istanbul, Turkey, April 2023, pp. 155–156.

Abstract

Neighbor management in vehicular networks comes with the risk of unnecessarily overloading the wireless channel, particularly when two-hop neighbor information is required. A possible solution to this challenge is the use of probabilistic data structures. In our previous work, we explored the benefits of using Bloom filters for maintaining this neighbor information showing promising results. In this paper, we now evaluate the usage of a additional probabilistic data structure, the Cuckoo Filter, which is advertised as a superior alternative to Bloom filter. We assess the performance of the Cuckoo approach in a vehicular networking scenario and find that it does not meet these expectations. In fact, it may lead to worse performance in specific configurations.

Quick access

Original Version DOI (at publishers web site)
Authors' Version PDF (PDF on this web site)
BibTeX BibTeX

Contact

Simon Welzel
Falko Dressler
Florian Klingler

BibTeX reference

@inproceedings{welzel2023cuckoo,
    author = {Welzel, Simon and Dressler, Falko and Klingler, Florian},
    doi = {10.1109/VNC57357.2023.10136341},
    title = {{Cuckoo Filters for Two-Hop Neighbor Management in Vehicular Networks}},
    pages = {155--156},
    publisher = {IEEE},
    issn = {2157-9865},
    address = {Istanbul, Turkey},
    booktitle = {14th IEEE Vehicular Networking Conference (VNC 2023), Poster Session},
    month = {4},
    year = {2023},
   }
   
   

Copyright notice

Links to final or draft versions of papers are presented here to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted or distributed for commercial purposes without the explicit permission of the copyright holder.

The following applies to all papers listed above that have IEEE copyrights: Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.

The following applies to all papers listed above that are in submission to IEEE conference/workshop proceedings or journals: This work has been submitted to the IEEE for possible publication. Copyright may be transferred without notice, after which this version may no longer be accessible.

The following applies to all papers listed above that have ACM copyrights: ACM COPYRIGHT NOTICE. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Publications Dept., ACM, Inc., fax +1 (212) 869-0481, or permissions@acm.org.

The following applies to all SpringerLink papers listed above that have Springer Science+Business Media copyrights: The original publication is available at www.springerlink.com.

This page was automatically generated using BibDB and bib2web.