dressler2014vehicular
Abstract
We investigate the potentials of a vehicular cloud based on parked vehicles as a spatio-temporal network and storage infrastructure. Vehicular networking solutions have been investigated for more than a decade but recent standardization efforts just enable a broad use of this technology to build large scale Intelligent Transportation Systems (ITS). One of the key questions is whether some pre-deployed infrastructure is needed to enable and to boost vehicular networks. We see many benefits in such infrastructure to store information and to provide connectivity among the vehicles. Yet, instead of using Roadside Units (RSUs), we envision to rely on parked vehicles to provide such vehicular cloud services. In this paper, we demonstrate the feasibility of this idea using the Virtual Cord Protocol (VCP) protocol to enable dynamic cloud services. Our simulation results indicate that this concept is sound and scales even with a highly dynamic number of parkers on the streets.
Quick access
- Original Version (free download, provided by ACM Author-Izer)
- Original Version (at publishers web site)
- Authors' Version (PDF on this web site)
- BibTeX
Contact
- Falko Dressler
- Philipp Handle
- Christoph Sommer
BibTeX reference
@inproceedings{dressler2014vehicular,
author = {Dressler, Falko and Handle, Philipp and Sommer, Christoph},
title = {{Towards a Vehicular Cloud - Using Parked Vehicles as a Temporary Network and Storage Infrastructure}},
booktitle = {15th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc 2014), ACM International Workshop on Wireless and Mobile Technologies for Smart Cities (WiMobCity 2014)},
address = {Philadelphia, PA},
doi = {10.1145/2633661.2633671},
isbn = {978-1-4503-2620-9},
month = {August},
pages = {11--18},
publisher = {ACM},
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 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.