Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao IEEE Vehicular Techn...arrow_drop_down
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao
IEEE Vehicular Technology Magazine
Article . 2019 . Peer-reviewed
License: IEEE Copyright
Data sources: Crossref
versions View all 1 versions
addClaim

This Research product is the result of merged Research products in OpenAIRE.

You have already added 0 works in your ORCID record related to the merged Research product.

Task Offloading in Vehicular Mobile Edge Computing: A Matching-Theoretic Framework

Authors: Bo Gu; Zhenyu Zhou;

Task Offloading in Vehicular Mobile Edge Computing: A Matching-Theoretic Framework

Abstract

Mobile edge computing (MEC) is an emerging technology that leverages computing, storage, and network resources deployed in the proximity of users to offload terminals from computationintensive and delay-sensitive tasks. In this article, a vehicular MEC system is studied where edges, such as MEC servers deployed at roadside units (RSUs), and vehicles with excessive computing resources are able to provide offloading opportunities to other vehicles having limited computation capabilities. We first review the latest MEC research. Then, we focus on the task of offloading in an incomplete information environment and model the interactions between tasks and edges as a matching game. Our main objective is to minimize the average delay while taking into account vehicle mobility and energy consumption constraints. We elaborate on two typical application scenarios, namely, interference-free orthogonal multipleaccess (OMA) networks and interference nonorthogonal multiple-access (NOMA) networks, and develop two separate heuristic algorithms to solve the delay minimization problem. Simulation results demonstrate the efficiency of the proposed algorithms.

Related Organizations
  • BIP!
    Impact byBIP!
    citations
    This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    60
    popularity
    This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
    Top 1%
    influence
    This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    Top 10%
    impulse
    This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
    Top 1%
Powered by OpenAIRE graph
Found an issue? Give us feedback
citations
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Citations provided by BIP!
popularity
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
60
Top 1%
Top 10%
Top 1%