Literature Database Entry

kroupa2016evaluation


Michael Kroupa, "Evaluation of radio channel metrics in vehicular network simulations," Bachelor Thesis, Department of Computer Science, University of Paderborn, June 2016. (Advisors: Florian Klingler and Christoph Sommer)

Abstract

The evaluation of radio channel metrics is an important cornerstone to validate new protocols and applications. This thesis compares two different approaches for this evaluation. On the one hand we measure the metrics directly with the vehicles, what corresponds to state of the art. On the other hand we measure with sensors, which are uniformly allocated over the whole scenario. Simulation is the middle ground between expensive prototyping, which provides a high grade of realism, and very complex mathematical models, which allow to control the environment setting, to test hypotheses. For our comparison we use the simulation tool Veins. We implement different distribution patterns for the allocation of the sensors and investigate multiple radio channel metrics. Thereby we mainly focus on scenarios with heterogeneous distributed traffic. In average the measurements of the sensors yield better results than the measurements of the vehicles. The reason therefore was primarily the uniform distribution of the sensors in the scenario. Furthermore the investigation yield that sensors provide a better overall impression about the scenario. However, we do not recommend the usage of sensors for validations.

Quick access

BibTeX BibTeX

Contact

Michael Kroupa

BibTeX reference

@phdthesis{kroupa2016evaluation,
    author = {Kroupa, Michael},
    advisor = {Klingler, Florian and Sommer, Christoph},
    title = {{Evaluation of radio channel metrics in vehicular network simulations}},
    institution = {Department of Computer Science},
    year = {2016},
    month = {June},
    school = {University of Paderborn},
    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 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.