Literature Database Entry


Loris Maximilian Mundry, "Investigating Medium Access Schemes for Vehicular Visible Light Communication," Bachelor Thesis, Department of Computer Science, Paderborn University, June 2018. (Advisors: Agon Memedi and Falko Dressler)


The promising usage of Visible Light Communication (VLC) in the vehicular environment is caused by multiple factors. Recent research in Vehicular Visible Light Communication (V-VLC) showed that there is a need for Medium Access Control (MAC), since the number of collisions can reach a substantial level. The increased amount of collisions is limiting the number of sucessful transmissions and, therefore, causes a performance loss in throughput. Moreover, it has not been investigated how different medium access schemes are able to deal with the different properties of V-VLC. For example, the asymmetric radiation patterns of lighting modules, the directionality or the Line-Of-Sight (LOS) characteristic are distinct properties of V-VLC. By means of simulation, the ability of a MAC to decrease the perfor- mance loss is investigated. Hence, two Carrier Sense Multiple Access with Collision Avoidance (CSMA/CA) approaches and a Slotted Reservation Mechanism (SRM) are implemented and compared to ALOHA and slotted ALOHA. The implemented IEEE 802.15.7 random access algorithm making use of CSMA/CA is able to limit collisions by slightly reducing throughput. Whereas the busy tone scheme extending the CSMA/CA approach is able to improve the gains from the CSMA/CA mechanism in a highway scenario, it is not performing sufficient in a crossing scenario. Thus, the network topology can have a lot of influence on MAC performance. In general, the results show that it is possible to limit collisions while increasing the throughput.

Quick access

BibTeX BibTeX


Loris Maximilian Mundry

BibTeX reference

    author = {Mundry, Loris Maximilian},
    advisor = {Memedi, Agon and Dressler, Falko},
    title = {{Investigating Medium Access Schemes for Vehicular Visible Light Communication}},
    institution = {Department of Computer Science},
    year = {2018},
    month = {June},
    school = {Paderborn University},
    type = {Bachelor Thesis},

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 proceeedings 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.