Literature Database Entry


Ion Turcanu, Minsuk Kim and Florian Klingler, "Towards 2-Hop Neighbor Management for Heterogeneous Vehicular Networks," Proceedings of 12th IEEE Vehicular Networking Conference (VNC 2020), Poster Session, Virtual Conference, December 2020.


Message dissemination protocols for vehicular networks often build upon information maintained in neighbor tables. Due to high mobility and scarce channel capacity available in such networks, algorithms for maintaining neighbor tables must carefully select which information is transmitted at which time. Recent approaches rely on probabilistic data structures (e.g., Bloom filter) for transmitting such neighbor information in order to reduce channel load, yet they still suffer from scarce channel capacities. In this paper we propose to use multiple communication technologies (heterogeneous networking) for maintaining neighbor tables by building upon recent 2- hop neighbor management strategies. Promising results show an increase of up to 19 % of covered neighbors in comparison to a Baseline approach that only uses one communication technology.

Quick access

BibTeX BibTeX


Ion Turcanu
Minsuk Kim
Florian Klingler

BibTeX reference

    author = {Turcanu, Ion and Kim, Minsuk and Klingler, Florian},
    title = {{Towards 2-Hop Neighbor Management for Heterogeneous Vehicular Networks}},
    publisher = {IEEE},
    address = {Virtual Conference},
    booktitle = {12th IEEE Vehicular Networking Conference (VNC 2020), Poster Session},
    month = {12},
    year = {2020},

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

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

This page was automatically generated using BibDB and bib2web.