Task offloading in vehicular fog computing: State-of-the-art and open issues

Hamdi, AMA; Hussain, FK; Hussain, OK

Task offloading in vehicular fog computing: State-of-the-art and open issues

Hamdi, AMA Hussain, FK Hussain, OK

Permalink

Publisher:: Elsevier
Publication Type:: Journal Article
Citation:: Future Generation Computer Systems, 2022, 133, pp. 201-212
Issue Date:: 2022-08-01

Closed Access

	Filename	Description	Size
	1-s2.0-S0167739X22000942-main.pdf	Published version	1.03 MB	Adobe PDF	View/Open

Copyright Clearance Process

Recently Added
In Progress
Closed Access

This item is closed access and not available.

Full metadata record

Field	Value	Language
dc.contributor.author	Hamdi, AMA
dc.contributor.author	Hussain, FK
dc.contributor.author	Hussain, OK
dc.date.accessioned	2023-03-24T03:41:50Z
dc.date.available	2023-03-24T03:41:50Z
dc.date.issued	2022-08-01
dc.identifier.citation	Future Generation Computer Systems, 2022, 133, pp. 201-212
dc.identifier.issn	0167-739X
dc.identifier.uri	http://hdl.handle.net/10453/168315
dc.description.abstract	Vehicular fog computing (VFC) has been proposed as a promising solution to overcome the limitations of edge computing. In VFC, the idle resources of moving and parked vehicles can be used for compute-intensive applications of resource-limited vehicles by offloading their tasks to them. For this to succeed, selecting an appropriate target fog node needs to consider various constraints. This paper argues that the selection process should broadly follow the steps needed to form a service level agreement (SLA) to ensure that the right target fog node is selected. We identify the different requirements that need to be addressed in forming such a SLA before surveying the existing literature to determine if the existing approaches of task offloading in VFC address them or not. Based on the analysis, we conclude the paper by discussing open gaps that need to be addressed for efficient task offloading in VFC.
dc.language	en
dc.publisher	Elsevier
dc.relation.ispartof	Future Generation Computer Systems
dc.relation.isbasedon	10.1016/j.future.2022.03.019
dc.rights	info:eu-repo/semantics/closedAccess
dc.subject	0803 Computer Software, 0805 Distributed Computing, 0806 Information Systems
dc.subject.classification	Distributed Computing
dc.title	Task offloading in vehicular fog computing: State-of-the-art and open issues
dc.type	Journal Article
utslib.citation.volume	133
utslib.for	0803 Computer Software
utslib.for	0805 Distributed Computing
utslib.for	0806 Information Systems
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology
pubs.organisational-group	/University of Technology Sydney/Strength - AAII - Australian Artificial Intelligence Institute
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology/School of Computer Science
utslib.copyright.status	closed_access	*
dc.date.updated	2023-03-24T03:41:48Z
pubs.publication-status	Published
pubs.volume	133

Abstract:

Vehicular fog computing (VFC) has been proposed as a promising solution to overcome the limitations of edge computing. In VFC, the idle resources of moving and parked vehicles can be used for compute-intensive applications of resource-limited vehicles by offloading their tasks to them. For this to succeed, selecting an appropriate target fog node needs to consider various constraints. This paper argues that the selection process should broadly follow the steps needed to form a service level agreement (SLA) to ensure that the right target fog node is selected. We identify the different requirements that need to be addressed in forming such a SLA before surveying the existing literature to determine if the existing approaches of task offloading in VFC address them or not. Based on the analysis, we conclude the paper by discussing open gaps that need to be addressed for efficient task offloading in VFC.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/168315