Literature Database Entry


Falko Dressler, Florian Klingler, Christoph Sommer and Reuven Cohen, "Not All VANET Broadcasts Are the Same: Context-Aware Class Based Broadcast," IEEE/ACM Transactions on Networking, vol. 26 (1), pp. 17–30, February 2018.


A major building block of Vehicular Ad Hoc Networks (VANETs) is broadcasting: the use of wireless communication for sharing information among vehicles, or between vehicles and infrastructure. Dozens of broadcast protocols have been developed in recent years, including protocols for 1-hop broadcasting of vehicle status information (beaconing) and for geocasting-based applications. However, most of these protocols were designed for one application and cannot co-exist, nor can one broadcast solution meet the demands of all applications. These observations motivated our effort to develop a holistic Network layer for VANETs. We identify the need for making VANET broadcast context-aware, and for supporting four different classes of broadcast protocols, each with its own properties. These classes are not only able to co-exist on the same Network layer, but also to complement one another's functionality. Thus, large applications as well as more holistic Transport protocols can be designed by combining two or more broadcast classes. We discuss the specific characteristics of these classes and design candidate protocols for each class.

Quick access

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


Falko Dressler
Florian Klingler
Christoph Sommer
Reuven Cohen

BibTeX reference

    author = {Dressler, Falko and Klingler, Florian and Sommer, Christoph and Cohen, Reuven},
    doi = {10.1109/TNET.2017.2763185},
    title = {{Not All VANET Broadcasts Are the Same: Context-Aware Class Based Broadcast}},
    pages = {17--30},
    journal = {IEEE/ACM Transactions on Networking},
    issn = {1063-6692},
    publisher = {IEEE},
    month = {2},
    number = {1},
    volume = {26},
    year = {2018},

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.

Last modified: 2024-07-21