Poster: Cuckoo Filters for Two-Hop Neighbor Management in Vehicular Networks

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.