Literature Database Entry

sgarbi2019dynamic

Marcello Sgarbi, "Dynamic e-Traffic Light management using ITS systems," Master's Thesis, Politecnico di Torino, July 2019.

Abstract

European Union’s strategies to reduce traffic jams and reduce fatalities are constantly improved and they adopt all the newest technologies available to reach these targets. E-Mobility is having a key role trying to get this purpose, as pointed out in Strategic Transport Research Innovation Agenda ( STRIA ). In this context, the focus has been set on the congestion problem generated by traffic lights. This issue has been faced using vehicles driving into a Vehicular Ad Hoc Network (VANET), able to communicate using Vehicle-to-Vehicle (V2V) technology. SUMO simulator has been used to develop the environment, while the simulation framework Veins (Vehicles in Network Simulation), based on OMNeT++ simulator, has been used to implement vehicles’ networking. To reduce traffic problem, a distributed heuristic algorithm has been designed. A bit-based representation has been used to mathematically describe the intersection and, using the data collected via V2V communication, search for the optimal solution. In addition, V2V allows vehicles to detect when they have the right to move into the intersection without producing hazardous situations. To compare the result, the same intersection has been simulated using a traffic light whose phase’s signal has been designed using Webster’s method. The comparison shows that it is worthy to use the developed algorithm to empty the intersection.

Quick access

BibTeX BibTeX

Contact

Marcello Sgarbi

BibTeX reference

@phdthesis{sgarbi2019dynamic,
    author = {Sgarbi, Marcello},
    title = {{Dynamic e-Traffic Light management using ITS systems}},
    location = {Turin, Italy},
    month = {7},
    school = {Politecnico di Torino},
    type = {Master's Thesis},
    year = {2019},
   }
   
   

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.