Literature Database Entry


C. A. R. L. Brennand, Azzedine Boukerche, R. Meneguette and L. A. Villas, "A novel urban traffic management mechanism based on FOG," Proceedings of IEEE Symposium on Computers and Communications (ISCC 2017), Irákleion, Greece, July 2017, pp. 377–382.


An increase of vehicles in a city without an efficient infrastructure of traffic management can cause damages not only financial but also environmental and social. In order to support urban traffic system to relieve the traffic congestion and the damage caused by congestion of vehicles, in this paper, we propose a mechanism for Intelligent Transport Systems named FOg RoutE VEhiculaR (FOREVER), in order to assist the traffic management in Vehicular Networks (VANET). For achieving this, FOREVER will detect and recommend an alternative route for the vehicles to avoid previous congestion. FOREVER is based on FOG computing paradigm that aims of to compute and modify the route of the vehicle to avoid the formation of congestion. Thus, the results show that FOREVER had a reduction about 7.9% of the CO2 emissions, 8.3% the stop time and 7.6% of the trip time.

Quick access

Original Version DOI (at publishers web site)
BibTeX BibTeX


C. A. R. L. Brennand
Azzedine Boukerche
R. Meneguette
L. A. Villas

BibTeX reference

    address = {Ir{\'{a}}kleion, Greece},
    author = {Brennand, C. A. R. L. and Boukerche, Azzedine and Meneguette, R. and Villas, L. A.},
    booktitle = {IEEE Symposium on Computers and Communications (ISCC 2017)},
    doi = {10.1109/ISCC.2017.8024559},
    month = {7},
    pages = {377--382},
    publisher = {Institute of Electrical and Electronics Engineers},
    title = {{A novel urban traffic management mechanism based on FOG}},
    year = {2017},

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

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.