Cell Based Raft Algorithm for Optimized Consensus Process on Blockchain in Smart Data Market

doi:10.1109/ACCESS.2022.3197758

2022-01-01

Dana Yang

Inshil Doh

Kijoon Chae *

DOI：10.1109/ACCESS.2022.3197758

原文链接

原文求助

摘要

En 中文

Due to the explosive increase in IoT devices and traffic, big data is developing into smart data that helps the data science experts understand human activities, through the relationship between mobility and resource application of the users in public spaces. For example, smart data markets help to predict crimes or understand the cause of COVID-19 infections. For these smart services, the users agree to the privacy policy so that the personal and sensitive information can be collected by a third party. But the conditions of the privacy policy do not specify whether the information of the users can be tracked. To ensure data transparency, many systems are applying consortium/private blockchains with raft algorithm. The raft algorithm requires nodes to check countless messages for a single transaction. Eventually, as the number of nodes increases, the overall system degradation is derived from the burden of the leader node. This paper proposes a method to process the collected transactions by dividing a certain amount of transactions into cells, without any extra protocol. The proposed scheme also uses the federated learning model with high accuracy and data privacy, in order to determine the optimized cell size in a blockchain system that should lead to consensus on multiple servers. Therefore, the proposed CBR (Cell-based Raft) consensus algorithm proposes a protocol that reduces the number of messages, without interfering with the concept of the existing raft algorithm, in order to maintain stable throughput in the smart data market where massive transactions occur.

Keyword:

Blockchains

Servers

Consensus algorithm

Collaborative work

Internet of Things

Throughput

Smart devices

Data science

Smart service

blockchain

consensus algorithm