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 条
  • [31] Caching-based task scheduling for edge computing in intelligent manufacturing
    Wang, Zhongmin
    Wang, Gang
    Jin, Xiaomin
    Wang, Xiang
    Wang, Jianwei
    JOURNAL OF SUPERCOMPUTING, 2022, 78 (04): : 5095 - 5117
  • [32] Deep Reinforcement Learning Based Task Scheduling in Edge Computing Networks
    Qi, Fan
    Li Zhuo
    Chen Xin
    2020 IEEE/CIC INTERNATIONAL CONFERENCE ON COMMUNICATIONS IN CHINA (ICCC), 2020, : 835 - 840
  • [33] An Enhanced Task Scheduling Approach for Grid Computing
    Bisht, Aarti
    Verma, Shashi Kant
    PROCEEDINGS OF THE 2018 SECOND INTERNATIONAL CONFERENCE ON INTELLIGENT COMPUTING AND CONTROL SYSTEMS (ICICCS), 2018, : 371 - 376
  • [34] Task Scheduling Game Optimization for Mobile Edge Computing
    Wang, Wei
    Lu, Bingxian
    Li, Yuanman
    Wei, Wei
    Li, Jianqing
    Mumtaz, Shahid
    Guizani, Mohsen
    IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC 2021), 2021,
  • [35] A hierarchical task scheduling strategy in mobile edge computing
    Shen, Xiaoyang
    INTERNET TECHNOLOGY LETTERS, 2021, 4 (05)
  • [36] Task Scheduling for Mobile Edge Computing with Multiple Links
    Yang, Lichao
    Zhang, Heli
    Ji, Hong
    Li, Xi
    2019 IEEE 30TH ANNUAL INTERNATIONAL SYMPOSIUM ON PERSONAL, INDOOR AND MOBILE RADIO COMMUNICATIONS (PIMRC), 2019, : 278 - 283
  • [37] Task Offloading Scheduling in Mobile Edge Computing Networks
    Wang, Zhonglun
    Li, Peifeng
    Shen, Shuai
    Yang, Kun
    12TH INTERNATIONAL CONFERENCE ON AMBIENT SYSTEMS, NETWORKS AND TECHNOLOGIES (ANT) / THE 4TH INTERNATIONAL CONFERENCE ON EMERGING DATA AND INDUSTRY 4.0 (EDI40) / AFFILIATED WORKSHOPS, 2021, 184 : 322 - 329
  • [38] Joint Task Scheduling and Containerizing for Efficient Edge Computing
    Zhang, Jiawei
    Zhou, Xiaochen
    Ge, Tianyi
    Wang, Xudong
    Hwang, Taewon
    IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2021, 32 (08) : 2086 - 2100
  • [39] Representation and Reinforcement Learning for Task Scheduling in Edge Computing
    Tang, Zhiqing
    Jia, Weijia
    Zhou, Xiaojie
    Yang, Wenmian
    You, Yongjian
    IEEE TRANSACTIONS ON BIG DATA, 2022, 8 (03) : 795 - 808
  • [40] Dynamic semi-online task scheduling method for the edge computing platform
    Zhao, Hui
    Feng, Nanzhi
    Wang, Quan
    Wan, Bo
    Wang, Jing
    Xi'an Dianzi Keji Daxue Xuebao/Journal of Xidian University, 2021, 48 (06): : 8 - 15