Literature Database Entry

buse2016improving


Dominik S. Buse, "Improving Traveling Times in Paderborn using Vehicular Networking," Master's Thesis, Department of Computer Science, University of Paderborn, February 2016. (Advisors: Falko Dressler and Christoph Sommer)

Abstract

Vehicular networking technologies are emerging and may help to solve traffic optimization problems. Simulation can be used to evaluate applications before hardware can be deployed. But it requires realistic and up-to-date scenarios and there are no well-established ones in the community yet. This thesis describes a scenario generation toolchain and its application to create a city-scale scenario. The resulting scenario covers the whole administrative area of the city of Paderborn and provides 24 hours of traffic with a total number of 210 000 trips and up to 3000 vehicles driving at the same time. In addition, I examined a traffic light controller using vehicular networking to explore the potential of vehicular networking for travel time improvement. It outperformed two classical controllers without networking capabilities, which rely on static schedules and induction loop detectors instead. I have shown that there is potential to improve traveling times (in Paderborn) using vehicular networking. To allow further investigation, the simulation scenario will be released for public use and cooperative improvement.

Quick access

BibTeX BibTeX

Contact

Dominik S. Buse

BibTeX reference

@phdthesis{buse2016improving,
    author = {Buse, Dominik S.},
    advisor = {Dressler, Falko and Sommer, Christoph},
    title = {{Improving Traveling Times in Paderborn using Vehicular Networking}},
    institution = {Department of Computer Science},
    year = {2016},
    month = {February},
    school = {University of Paderborn},
    type = {Master's 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.