Security Enhanced Edge Computing Task Scheduling Method Based on Blockchain and Task Cache

被引:0
|
作者
Li, Cong [1 ]
机构
[1] Yellow River Conservancy Tech Inst, Informat Engn Inst, Kaifeng 475004, Peoples R China
关键词
Blockchain; task cache; edge computing; task scheduling; industrial internet;
D O I
10.14569/IJACSA.2024.0150748
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Aiming at edge computing nodes' limited computing and storage capacity, a two-layer task scheduling model based on blockchain and task cache was proposed. The high-similarity task results were cached in the edge cache pool, and the blockchainassisted task caching model was combined to enhance system security. The genetic evolution algorithm was used to solve the minimum cost that the optimal scheduling model can obtain. The genetic algorithm's initialization and mutation operations were adjusted to improve the convergence rate. Compared with algorithms without cache pooling and blockchain, the proposed joint blockchain and task caching task scheduling model reduced the cost by 9.4% and 14.3%, respectively. As the capacity space of the cache pool increased, the system cost gradually decreased. Compared with the capacity space of 3GB, the system cost of 10Gbit capacity space was reduced by 10.6%. The system cost decreased as the computing power of edge nodes increased. Compared with edge nodes with a computing frequency of 8GHz, the nodes cost at 18GHz was reduced by 36.4%. Therefore, the proposed edge computing task scheduling model ensures the security of task scheduling based on reducing delay and control costs, providing a foundation for modern industrial task scheduling.
引用
收藏
页码:479 / 487
页数:9
相关论文
共 50 条
  • [21] An Enhanced Task Scheduling in Cloud Computing Based on Hybrid Approach
    Alworafi, Mokhtar A.
    Dhari, Atyaf
    El-Booz, Sheren A.
    Nasr, Aida A.
    Arpitha, Adela
    Mallappa, Suresha
    DATA ANALYTICS AND LEARNING, 2019, 43 : 11 - 25
  • [22] Task Scheduling Strategy of Logistics Cloud Robot Based on Edge Computing
    Tang, Hengliang
    Jiao, Rongxin
    Xue, Fei
    Cao, Yang
    Yang, Yongli
    Zhang, Shiqiang
    WIRELESS PERSONAL COMMUNICATIONS, 2024, 137 (04) : 2339 - 2358
  • [23] INT Based Network-Aware Task Scheduling for Edge Computing
    Shreshta, Bibek
    Cziva, Richard
    Arslan, Engin
    2021 IEEE INTERNATIONAL PARALLEL AND DISTRIBUTED PROCESSING SYMPOSIUM WORKSHOPS (IPDPSW), 2021, : 879 - 886
  • [24] Multi-Task Scheduling Based on Classification in Mobile Edge Computing
    Zheng, Xiao
    Chen, Yuanfang
    Alam, Muhammad
    Guo, Jun
    ELECTRONICS, 2019, 8 (09)
  • [25] Online task scheduling for edge computing based on repeated Stackelberg game
    Jie, Yingmo
    Tang, Xinyu
    Choo, Kim-Kwang Raymond
    Su, Shenghao
    Li, Mingchu
    Guo, Cheng
    JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2018, 122 : 159 - 172
  • [26] Task Scheduling Strategy Based on Resource Constraint in Edge Computing System
    Qing, Ren
    Rao, Huanle
    Jia, Gangyong
    Xu, Youqing
    Wei, Wang
    Xie, GuoJie
    2024 IEEE 7TH INTERNATIONAL CONFERENCE ON INDUSTRIAL CYBER-PHYSICAL SYSTEMS, ICPS 2024, 2024,
  • [27] A new task scheduling scheme based on genetic algorithm for edge computing
    State Grid Information and Telecommunication Group Co. Ltd, Beijing
    102200, China
    不详
    Comput. Mater. Continua, 1 (843-854):
  • [28] A New Task Scheduling Scheme Based on Genetic Algorithm for Edge Computing
    Nan, Zhang
    Li Wenjing
    Zhu, Liu
    Zhi, Li
    Liu Yumin
    Nahar, Nurun
    CMC-COMPUTERS MATERIALS & CONTINUA, 2022, 71 (01): : 843 - 854
  • [29] Caching-based task scheduling for edge computing in intelligent manufacturing
    Zhongmin Wang
    Gang Wang
    Xiaomin Jin
    Xiang Wang
    Jianwei Wang
    The Journal of Supercomputing, 2022, 78 : 5095 - 5117
  • [30] Task scheduling optimization strategy based on chaos theory in edge computing
    Xue J.
    Wang Z.
    Zhang Y.
    Huazhong Keji Daxue Xuebao (Ziran Kexue Ban)/Journal of Huazhong University of Science and Technology (Natural Science Edition), 2022, 50 (03): : 18 - 23