Creating consensus group using online learning based reputation in blockchain networks


Bugday A., ÖZSOY A. , Oztaner S. M. , Sever H.

PERVASIVE AND MOBILE COMPUTING, vol.59, 2019 (Journal Indexed in SCI) identifier identifier

  • Publication Type: Article / Article
  • Volume: 59
  • Publication Date: 2019
  • Doi Number: 10.1016/j.pmcj.2019.101056
  • Title of Journal : PERVASIVE AND MOBILE COMPUTING

Abstract

One of the biggest challenges to blockchain technology is the scalability problem. The choice of consensus algorithm is critical to the practical solution of the scalability problem. To increase scalability, Byzantine Fault Tolerance (BFT) based methods have been most widely applied. This study proposes a new model instead of Proof of Work (PoW) for forming the consensus group that allows the use of BFT based methods in the public blockchain network. The proposed model uses the adaptive hedge method, which is a decision-theoretic online learning algorithm (Qi et al., 2016). The reputation value is calculated for the nodes that want to participate in the consensus committee, and nodes with high reputation values are selected for the consensus committee to reduce the chances of the nodes in the consensus committee being harmful. Since the study focuses on the formation of the consensus group, a simulated blockchain network is used to test the proposed model more effectively. Test results indicate that the proposed model, which is a new approach in the literature making use of machine learning for the construction of consensus committee, successfully selects the node with the higher reputation for the consensus group. (C) 2019 Elsevier B.V. All rights reserved.