Literature Database Entry


Guilherme B. Araujo, Matheus M. Queiroz, Fatima de L.P. Duarte-Figueiredo, Anna I.J. Tostes and Antonio A.F. Loureiro, "CARTIM: A proposal toward identification and minimization of vehicular traffic congestion for VANET," Proceedings of IEEE Symposium on Computers and Communication (ISCC 2014), Madeira, Portugal, June 2014, pp. 1–6.


identification, Intelligent Transport Systems (ITS) can assist in the and reduction of vehicular traffic congestion. In this context, this paper proposes CARTIM, a proposal for collaborative identification and minimization of vehicular congestion. CARTIM uses V2V (Vehicle-to-Vehicle) communication to cooperatively measure the local level of vehicular traffic congestion. Additionally, if any infrastructure is present, the dissemination of consolidated information may occur to vehicles in other regions through V2I (Vehicle-to-Infrastructure) communication. To effectively identify a traffic congestion locally (in vehicles), CARTIM employs a fuzzy logic-based system, which is used in the treatment of qualitative information (e.g., vehicle density etc). The proposed technique also efficiently uses the collaborative communication channel, preventing overload. The simulation results showed that CARTIM can detect congestion (better than related works) and heuristic)., minimize it (based on a

Quick access

Original Version DOI (at publishers web site)
BibTeX BibTeX


Guilherme B. Araujo
Matheus M. Queiroz
Fatima de L.P. Duarte-Figueiredo
Anna I.J. Tostes
Antonio A.F. Loureiro

BibTeX reference

    address = {Madeira, Portugal},
    author = {Araujo, Guilherme B. and Queiroz, Matheus M. and Duarte-Figueiredo, Fatima de L.P. and Tostes, Anna I.J. and Loureiro, Antonio A.F.},
    booktitle = {IEEE Symposium on Computers and Communication (ISCC 2014)},
    doi = {10.1109/ISCC.2014.6912491},
    month = {6},
    pages = {1--6},
    title = {{CARTIM: A proposal toward identification and minimization of vehicular traffic congestion for VANET}},
    year = {2014},

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.