Literature Database Entry

higuchi2017feasibility


Takamasa Higuchi, Joshua Joy, Falko Dressler, Mario Gerla and Onur Altintas, "On the Feasibility of Vehicular Micro Clouds," Proceedings of 9th IEEE Vehicular Networking Conference (VNC 2017), Torino, Italy, November 2017, pp. 179-182.

Abstract

This paper investigates the feasibility and the potential of vehicle cloudification, an emerging paradigm to utilize ever-growing computational resources of intelligent vehicles to form small-scale virtual cloud computing facilities. Multiple vehicles in communication range collaboratively form so-called vehicular micro clouds, which serve as virtual edge servers that offer data processing, data storage, communications, and sensing services not only to vehicles but also to any other types of authorized users. Although the conceptual design has been estab- lished already in the literature, the feasibility of vehicular micro clouds under practical road conditions has still to be thoroughly investigated. In this paper, we tackle this research question by analyzing vehicle probe datasets, generated by real road traffic models of the city of Luxembourg and a major intercity highway in Japan. The results indicate that connected vehicular micro clouds can be formed at many locations throughout the road networks, especially under heavy road traffic during rush hours.

Quick access

Original Version DOI (at publishers web site)
Authors' Version PDF (PDF on this web site)
BibTeX BibTeX

Contact

Takamasa Higuchi
Joshua Joy
Falko Dressler
Mario Gerla
Onur Altintas

BibTeX reference

@inproceedings{higuchi2017feasibility,
    author = {Higuchi, Takamasa and Joy, Joshua and Dressler, Falko and Gerla, Mario and Altintas, Onur},
    title = {{On the Feasibility of Vehicular Micro Clouds}},
    booktitle = {9th IEEE Vehicular Networking Conference (VNC 2017)},
    pages = {179-182},
    year = {2017},
    month = {November},
    address = {Torino, Italy},
    publisher = {IEEE},
    doi = {10.1109/VNC.2017.8275621},
   }
   
   

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.

This page was automatically generated using BibDB and bib2web.