tangirala2024simulating
Abstract
Vehicular Ad-hoc Network (VANET) simulations are integral to pave way for rapid adoption of Intelligent Transportation Systems (ITS) applications. Popular VANET simulators are built with high-fidelity network and mobility models to enable comprehensive evaluation. However, the computational complexity of high-fidelity models inhibits scalability. Further, the increasing infrastructure density of 5G and beyond increases the node count, thereby imposing further performance constraints. In this paper, we present a VANET simulation methodology called Disolv to enable large-scale analysis. The key decisions towards performance enhancement include simplifying mobility and network models, abstraction of packets to messages, utilization of a discrete-time instead of discrete-event paradigm for message exchanges, incorporation of data streams, and pre-computation of network links. The proposed methodology is implemented to evaluate the benefits through experiments. Results indicate that significant performance gains are observed with statistically irrelevant loss of precision. Further experiments are carried out to highlight the limitations of the Disolv approach. Finally, ITS applications suitable for evaluation with the Disolv approach are discussed.
Quick access
- Original Version (at publishers web site)
- BibTeX
Contact
- Nagacharan Teja Tangirala
- Christoph Sommer
- Alois Knoll
BibTeX reference
@inproceedings{tangirala2024simulating,
author = {Tangirala, Nagacharan Teja and Sommer, Christoph and Knoll, Alois},
title = {{Simulating Data Flows of Very Large Scale Intelligent Transportation Systems}},
booktitle = {38th ACM SIGSIM International Conference on Principles of Advanced Discrete Simulation (SIGSIM-PADS 2024)},
address = {Atlanta, GA},
doi = {10.1145/3615979.3656062},
month = {June},
pages = {98--107},
publisher = {ACM},
year = {2024},
}
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.
The following applies to all papers listed above that have IFIP copyrights: © IFIP, (YEAR). This is the author's version of the work. It is posted here by permission of IFIP for your personal use. Not for redistribution. The definitive version was published in PUBLICATION, {VOL#, ISS#, (DATE)}, http://IFIP DL URL.