Literature Database Entry
qiu2020dcoa
Bo-Jun Qiu, Cheng-Ying Hsieh, Jyh-Cheng Chen and Falko Dressler, "DCOA: Double-Check Offloading Algorithm to Road-Side Unit and Vehicular Micro-Cloud in 5G Networks," Proceedings of IEEE Global Communications Conference (GLOBECOM 2020), Taipei, Taiwan, December 2020.
Abstract
Next generation intelligent transportation systems aim at many cooperative perception and cooperative driving functions that need significant computational resources. Offloading such tasks to some mobile edge computing solutions is considered part of the solution, which is currently investigated in the scope of 5G networks. In the automotive context, such edge systems could be road-side units (RSU), which, however, can easily be overloaded at peak times. Vehicular micro-cloud approaches have been proposed to overcome such problems by sharing computational resources of nearby cars. In this study, we propose an offloading system architecture to enable such offloading such vehicular micro-cloud interconnected by a 5G core network. We model the system as a queueing model to derive closed-form solutions for selected performance metrics. Based on these insights, we propose the Double-Check Offloading Algorithm (DCOA) to obtain the best offloading ratio to the vehicular micro-cloud. Our simulation results show the proposed DCOA has better system performances compared with four other offloading schemes.
Quick access
Original Version (at publishers web site)
Authors' Version (PDF on this web site)
BibTeX
Contact
Bo-Jun Qiu
Cheng-Ying Hsieh
Jyh-Cheng Chen
Falko Dressler
BibTeX reference
@inproceedings{qiu2020dcoa,
author = {Qiu, Bo-Jun and Hsieh, Cheng-Ying and Chen, Jyh-Cheng and Dressler, Falko},
doi = {10.1109/GLOBECOM42002.2020.9348224},
title = {{DCOA: Double-Check Offloading Algorithm to Road-Side Unit and Vehicular Micro-Cloud in 5G Networks}},
publisher = {IEEE},
address = {Taipei, Taiwan},
booktitle = {IEEE Global Communications Conference (GLOBECOM 2020)},
month = {12},
year = {2020},
}
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.