sommer2010feasibility
Abstract
Intelligent Transportation Systems (ITS) are a hot topic in the communications society. Currently, research is primarily focusing on setting up Vehicular Ad Hoc Networks (VANETs) based on WLAN technology. However, VANETs are heavily dependent on high market penetration or infrastructure support. Third-generation (3G) networks might complement these efforts. They are already widely deployed and can serve as the basis for Car-to-Infrastructure (C2I) applications. We developed a simulation framework for holistic analysis of complex UMTS-based ITS. This framework couples simulation models with corresponding protocols of the UMTS link level, of higher network layers, and of road traffic. Based on our simulation framework and real-world 3G network coverage data, we evaluated a UMTS-based Traffic Information System (TIS) in a typical highway scenario in which information about traffic jams needed to be communicated to other cars for optimized route planning. The evaluation clearly outlines the capabilities of the simulation framework and evaluation results are consistent with all expectations. For example, we show that the availability of UMTS multicast distribution services are demanded for an efficient operation of the TIS application.
Quick access
- Original Version (at publishers web site)
- Authors' Version (PDF on this web site)
- BibTeX
Contact
- Christoph Sommer
- Armin Schmidt
- Yi Chen
- Reinhard German
- Wolfgang Koch
- Falko Dressler
BibTeX reference
@article{sommer2010feasibility,
author = {Sommer, Christoph and Schmidt, Armin and Chen, Yi and German, Reinhard and Koch, Wolfgang and Dressler, Falko},
title = {{On the Feasibility of UMTS-based Traffic Information Systems}},
journal = {Elsevier Ad Hoc Networks, Special Issue on Vehicular Networks},
doi = {10.1016/j.adhoc.2009.12.003},
issn = {1570-8705},
month = {July},
number = {5},
pages = {506--517},
publisher = {Elsevier},
volume = {8},
year = {2010},
}
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.