Mobility aware blockchain enabled offloading and scheduling in vehicular fog cloud computing

The development of vehicular Internet of Things (IoT) applications, such as E-Transport, Augmented Reality, and Virtual Reality are growing progressively. The mobility aware services and network-based security are fundamental requirements of these applications. However, multi-side offloading enablin...

Full description

Saved in:
Bibliographic Details
Main Authors: Lakhan, Abdullah, Ahmad, Muneer, Bilal, Muhammad, Jolfaei, Alireza, Mehmood, Raja Majid
Format: Article
Published: Institute of Electrical and Electronics Engineers 2021
Subjects:
Online Access:http://eprints.um.edu.my/27979/
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The development of vehicular Internet of Things (IoT) applications, such as E-Transport, Augmented Reality, and Virtual Reality are growing progressively. The mobility aware services and network-based security are fundamental requirements of these applications. However, multi-side offloading enabling blockchain and cost-efficient scheduling in heterogeneous vehicular fog cloud nodes network become a challenging task. The study formulates this problem as a convex optimization problem, where all constraints are the convex set. The goal of the study is to minimize communication cost and computation cost of applications under mobility, security, deadline, and resource constraints. Initially, we propose a novel vehicular fog cloud network (VFCN) which consists of different components and heterogeneous computing nodes. The ensure mobility privacy, the study devises Mobility Aware Blockchain-Enabled offloading scheme (MABOS). It extends blockchain enable multi-side offloading (e.g., offline offloading and online offloading) with proof of work (PoW), proof of creditability (PoC) and fault-tolerant techniques. The purpose is to offload all tasks under the secure network without any violation. Furthermore, to ensure Quality of Service (QoS) of applications, this work suggests linear search based task scheduling (LSBTS) method, which maps all tasks onto appropriate computing nodes. The experimental results show that devise schemes outperform all existing baseline approaches to the considered problem.