Literature Database Entry


Sergio M. Tornell, Carlos T. Calafate, Juan-Carlos Cano and Pietro Manzoni, "Accelerating vehicle network simulations in urban scenarios through caching," Proceedings of International Symposium on Performance Evaluation of Computer and Telecommunication Systems (SPECTS 2014), Monterey, CA, July 2014, pp. 654–661.


When designing new Vehicular Network (VN) protocols, the cost and time required for deploying real prototypes to run tests and evaluate new proposals becomes excessive. Consequently, simulation plays a key role in Vehicular Networks development. Simulation models and tools have been improved to better mimic the different factors that affect communications in real world scenarios. In terms of the communications channel, models have evolved from simplistic distance-based models to elaborated stochastic models that take into account both distance and the obstacle layout. However, increasing the complexity of the models also increases the time needed to run simulations. In this paper, we present an optimization applicable to the obstacle model included in VEINS, a well-known VN simulator, which relays on a cache table to accelerate ray-tracing calculations at the physical layer. Our results show that the proposed optimization can reduce by up to 75% the simulation time with minimal differences in terms of simulation results.

Quick access

Original Version DOI (at publishers web site)
BibTeX BibTeX


Sergio M. Tornell
Carlos T. Calafate
Juan-Carlos Cano
Pietro Manzoni

BibTeX reference

    address = {Monterey, CA},
    author = {Tornell, Sergio M. and Calafate, Carlos T. and Cano, Juan-Carlos and Manzoni, Pietro},
    booktitle = {International Symposium on Performance Evaluation of Computer and Telecommunication Systems (SPECTS 2014)},
    doi = {10.1109/SPECTS.2014.6880007},
    month = {7},
    pages = {654--661},
    publisher = {Institute of Electrical and Electronics Engineers},
    title = {{Accelerating vehicle network simulations in urban scenarios through caching}},
    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.