hagenauer2018vehicular
Abstract
Recently, the concept of the vehicular micro cloud has been established. The core idea is to use cars as a main ICT resource in modern smart cities being able to store, to forward, and to process data. Relying on the communication capabilities of cars, particularly their ability to use short range communication technologies such as IEEE 802.11p, Wi-Fi, or LTE-D2D, virtual micro clouds can be established similar to the concept of the mobile edge in 5G networks, yet, without any infrastructure support. However, there is a key disadvantage: the network will very likely become fragmented due to the mobility of the cars within the city. Furthermore, low penetration rates in early deployments may amplify this fragmentation. In recent work, we proposed the use of clusters of parked cars to overcome such limitations, i.e., to provide a virtual infrastructure in form of a virtual Roadside Unit (RSU) being able to fulfill all the mentioned actions. In this paper, we investigate two core problems of this system, namely the selection of appropriate gateway nodes in the virtual cluster as well as seamless handovers among such gateways required due to very limited contact times of moving cars to a single gateway. Our simulation results confirm the strength of the proposed gateway selection and handover mechanisms.
Quick access
- 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
@article{hagenauer2018vehicular,
author = {Hagenauer, Florian and Sommer, Christoph and Higuchi, Takamasa and Altintas, Onur and Dressler, Falko},
title = {{Vehicular Micro Cloud in Action: On Gateway Selection and Gateway Handovers}},
journal = {Elsevier Ad Hoc Networks},
doi = {10.1016/j.adhoc.2018.05.014},
issn = {1570-8705},
month = {September},
pages = {73--83},
publisher = {Elsevier},
volume = {78},
year = {2018},
}
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.