A Task Offloading and Reallocation Scheme for Passenger Assistance Using Fog Computing

A Fog computing-based transportation system envisions to reduce energy consumption and communication delay. This paper presents a Fog computing-based scheme for assisting passengers, which involves task offloading and reallocation. We consider a dynamic environment where the passengers frequently ch...

Full description

Saved in:
Bibliographic Details
Published inIEEE eTransactions on network and service management Vol. 19; no. 3; pp. 3032 - 3047
Main Authors Mishra, Rahul, Gupta, Hari Prabhat, Kumari, Preti, Suh, Doug Young, Piran, Md. Jalil
Format Journal Article
LanguageEnglish
Published New York IEEE 01.09.2022
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects
Online AccessGet full text

Cover

Loading…
More Information
Summary:A Fog computing-based transportation system envisions to reduce energy consumption and communication delay. This paper presents a Fog computing-based scheme for assisting passengers, which involves task offloading and reallocation. We consider a dynamic environment where the passengers frequently change their locations. Additionally, the scheme mitigates the sudden failure of the Fog devices. We employ a game-theoretic approach to determine optimal fractions of a task associated with the passengers to be offloaded among the Fog devices and Cloud. It also supports the reallocation of the allocated fractions of the task. This offloading and reallocation of tasks ensures the execution within a given time constraint and requires minimal execution cost. We also prove the existence of near Nash equilibrium for the allocated fractions of the task on Fog devices. Further, this work covers different possibilities of dependencies among the fractions of the task and corresponding utilities of Fog devices in the dynamic environment. Finally, we present the empirical and real-world evaluations to verify the effectiveness of the proposed scheme in terms of the number of Fog devices, the deadline of the task, and game parameters.
ISSN:1932-4537
1932-4537
DOI:10.1109/TNSM.2022.3172602