4.4 Article

EIoT-PBFT: A multi-stage consensus algorithm for IoT edge computing based on PBFT

期刊

MICROPROCESSORS AND MICROSYSTEMS
卷 95, 期 -, 页码 -

出版社

ELSEVIER
DOI: 10.1016/j.micpro.2022.104713

关键词

IoT edge computing; Blockchain; PBFT algorithm; Geographical location; Trust score

资金

  1. Natural Science Basic Research Plan in Shaanxi Province of China [2020JM-361]
  2. Young and Middle-aged Scientific Research Backbone Projects of Engineering University of PAP [KYGG201905]
  3. Basic Research Foundation Project of Engineering University of PAP [WJY202019, WJY202144]
  4. PAP's Military Scientific Research Mandatory Project [WJ2020A020048, WJ2021A030100]

向作者/读者索取更多资源

This article discusses the research progress on the application of blockchain in Cognitive Internet of Things (CIoT) with edge computing, as well as the efficiency issue of existing consensus algorithms. Based on this, a multi-stage consensus algorithm of EIoT-PBFT, which improves consensus efficiency by refining the algorithm and introducing a scoring mechanism, is proposed.
With the introduction of edge computing into the field of Internet of Things (IoT), the Cognitive Internet of Things (CIoT) has emerged as the next-generation solution for trust and intelligent reasoning in the IoT. That also puts blockchain, with its unique consensus mechanism, transparency and trustworthiness, on the stage of IoT applications. At present, not much research is focused on blockchain's application in CIoT, whose development is to a large extent restricted by the inefficiency of the consensus algorithm. Considering the characteristics of CIoT, a multi-stage consensus algorithm of EIoT-PBFT is proposed on the basis of PBFT algorithm, which includes the Grouping stage, Scoring stage and Consensus reaching stage. EIoT-PBFT meets the IoT edge computing setup by adopting a two-phase improved PBFT algorithm and a scoring mechanism based on both location and reputation, thus achieving a great increase in consensus efficiency. Evaluation results show that EIoT-PBFT takes 36.4% less time than PBFT for a single consensus, and the performance remains stable over the 2500 node configurations we set up. Moreover, at a scale of 1000 nodes, the number of edge nodes to be configured to reduce the number of system communications by 90% compared to the PBFT algorithm is only 5, making blockchain more customized for CIoT settings.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.4
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据