hagenauer2017vehicular
Abstract
Automakers have already started rolling out cars with communication capabilities. They become more than simple means of transportation - their mobility combined with networking lets them interconnect people and machines. Looking at the network part, the most important aspect is to make the underlying network scaleable. Mobile edge computing has been introduced in 4G networks to achieve such scalability using caches and processing capabilities at eNodeBs, i.e., at the edge of the network. We introduce the concept of vehicular micro clouds as virtual edge servers. Micro clouds are conceptually clusters of cars, which help aggregating collected data that is transferred to some backend. In contrast to previous work on dynamic clustering in vehicular networks, we investigate the construction of such micro clouds using a map based approach.
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
- Florian Hagenauer
- Christoph Sommer
- Takamasa Higuchi
- Onur Altintas
- Falko Dressler
BibTeX reference
@inproceedings{hagenauer2017vehicular,
author = {Hagenauer, Florian and Sommer, Christoph and Higuchi, Takamasa and Altintas, Onur and Dressler, Falko},
title = {{Vehicular Micro Clouds as Virtual Edge Servers for Efficient Data Collection}},
booktitle = {23rd ACM International Conference on Mobile Computing and Networking (MobiCom 2017), 2nd ACM International Workshop on Smart, Autonomous, and Connected Vehicular Systems and Services (CarSys 2017)},
address = {Snowbird, UT},
doi = {10.1145/3131944.3133937},
month = {October},
pages = {31--35},
publisher = {ACM},
year = {2017},
}
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.