PF-BTS: A Privacy-Aware Fog-enhanced Blockchain-assisted task scheduling

被引:76
作者
Baniata, Hamza [1 ]
Anaqreh, Ahmad [2 ]
Kertesz, Attila [1 ]
机构
[1] Univ Szeged, Dept Software Engn, H-6720 Szeged, Hungary
[2] Univ Szeged, Dept Computat Optimizat, H-6720 Szeged, Hungary
基金
匈牙利科学研究基金会;
关键词
Cloud computing; Fog computing; Internet of Things; Blockchain; Task scheduling; Ant Colony Optimization; ANT-COLONY OPTIMIZATION; CHALLENGES; ASSIGNMENT; MANAGEMENT; INTERNET;
D O I
10.1016/j.ipm.2020.102393
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In recent years, the deployment of Cloud Computing (CC) has become more popular both in research and industry applications, arising form various fields including e-health, manufacturing, logistics and social networking. This is due to the easiness of service deployment and data management, and the unlimited provision of virtual resources (VR). In simple scenarios, users/applications send computational or storage tasks to be executed in the cloud, by manually assigning those tasks to the available computational resources. In complex scenarios, such as a smart city applications, where there is a large number of tasks, VRs, or both, task scheduling is exposed as an NP-Hard problem. Consequently, it is preferred and more efficient in terms of time and effort, to use a task scheduling automation technique. As there are many automated scheduling solutions proposed, new possibilities arise with the advent of Fog Computing (FC) and Blockchain (BC) technologies. Accordingly, such automation techniques may help the quick, secure and efficient assignment of tasks to the available VRs. In this paper, we propose an Ant Colony Optimization (ACO) algorithm in a Fog-enabled Blockchain-assisted scheduling model, namely PF-BTS. The protocol and algorithms of PF-BTS exploit BC miners for generating efficient assignment of tasks to be performed in the cloud's VRs using ACO, and award miner nodes for their contribution in generating the best schedule. In our proposal, PF-BTS further allows the fog to process, manage, and perform the tasks to enhance latency measures. While this processing and managing is taking place, the fog is enforced to respect the privacy of system components, and assure that data, location, identity, and usage information are not exposed. We evaluate and compare PF-BTS performance, with a recently proposed Blockchain-based task scheduling protocol, in a simulated environment. Our evaluation and experiments show high privacy awareness of PF-BTS, along with noticeable enhancement in execution time and network load.
引用
收藏
页数:18
相关论文
共 84 条
[41]  
King S., 2012, PPCOIN PEER PEER CRY
[42]   Difficulty control for blockchain-based consensus systems [J].
Kraft, Daniel .
PEER-TO-PEER NETWORKING AND APPLICATIONS, 2016, 9 (02) :397-413
[43]   Blockchain-Enabled E-Voting [J].
Kshetri, Nir ;
Voas, Jeffrey .
IEEE SOFTWARE, 2018, 35 (04) :95-99
[44]   Ant Colony Optimization Task Scheduling Algorithm for SWIM Based on Load Balancing [J].
Li, Gang ;
Wu, Zhijun .
FUTURE INTERNET, 2019, 11 (04)
[45]   Comparison Study toward the Influence of the Second Metals Doping on the Oxygen Evolution Activity of Cobalt Nitrides [J].
Liu, Tingting ;
Li, Mian ;
Bo, Xiangjie ;
Zhou, Ming .
ACS SUSTAINABLE CHEMISTRY & ENGINEERING, 2018, 6 (09) :11457-11465
[46]  
Mauw S, 2006, LECT NOTES COMPUT SC, V3935, P186
[47]   Ant colony optimization for resource-constrained project scheduling [J].
Merkle, D ;
Middendorf, M ;
Schmeck, H .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2002, 6 (04) :333-346
[48]   Ant colony optimization with global pheromone evaluation for scheduling a single machine [J].
Merkle, D ;
Middendorf, M .
APPLIED INTELLIGENCE, 2003, 18 (01) :105-111
[49]  
Milutinovic M., 2016, P ACM 1 WORKSH SYST, P1
[50]   Optimized Distributed Resource Management in Fog Computing by Using Ant-Colony Optimization [J].
Mirtaheri, Seyedeh Leili ;
Shirzad, Hamid Reza .
FUTURE TRENDS OF HPC IN A DISRUPTIVE SCENARIO, 2019, 34 :206-219