Literature Database Entry

klingler2016mcb


Florian Klingler, Falko Dressler, Jiannong Cao and Christoph Sommer, "MCB - A Multi-Channel Beaconing Protocol," Elsevier Ad Hoc Networks, vol. 36 (1), pp. 258–269, January 2016.


Abstract

We present Multi-Channel Beacon (MCB), a novel approach for efficient wide area data dissemination in vehicular networks using all the DSRC/WAVE channels. Current standardization efforts towards beaconing (i.e., one-hop broadcasting) protocols in vehicular networks focus on the use of a single radio channel only. This is a major bottleneck at high vehicle densities, leading to high delays or packet loss. Instead, the main focus has been to use adaptive transmit rates in order not to overload the wireless channel. Based on our previous work towards multi-channel operation, we developed a novel approach, MCB, which provides adaptivity not only in time, i.e., congestion control, but also in space by selecting appropriate channels for upcoming data transmissions. We evaluated our approach in simulations, comparing our solution to state of the art beaconing protocols, most importantly to the current ETSI Decentralized Congestion Control (DCC) standard. Our results clearly demonstrate the feasibility of our multi-channel approach, showing that it successfully reduces channel utilization and observed packet collisions without sacrificing goodput.

Quick access

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

Contact

Florian Klingler
Falko Dressler
Jiannong Cao
Christoph Sommer

BibTeX reference

@article{klingler2016mcb,
    author = {Klingler, Florian and Dressler, Falko and Cao, Jiannong and Sommer, Christoph},
    doi = {10.1016/j.adhoc.2015.08.002},
    title = {{MCB - A Multi-Channel Beaconing Protocol}},
    pages = {258--269},
    journal = {Elsevier Ad Hoc Networks},
    issn = {1570-8705},
    publisher = {Elsevier},
    month = {1},
    number = {1},
    volume = {36},
    year = {2016},
   }
   
   

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.