Title: Study on mobile trading mechanism based on blockchain Byzantine consensus algorithm

Authors: Wei Hu; Huanhao Li; Hu Yawei; Wenhui Yao

Addresses: School of Economics and Management, Shanghai University of Electric Power, Shanghai 200090, China ' School of Economics and Management, Shanghai University of Electric Power, Shanghai 200090, China ' School of Economics and Management, Shanghai University of Electric Power, Shanghai 200090, China ' School of Economics and Management, Shanghai University of Electric Power, Shanghai 200090, China

Abstract: The central node of traditional mobile transactions is vulnerable to attack and causes user privacy disclosure. To solve this problem, blockchain and mobile transactions are combined to construct a decentralised mobile trading platform. This paper designs a Byzantine consensus algorithm based on spanning tree and minimal gossip sequence (BCA-TG) ensuring the accuracy and reliability of the transaction information. First, the gossip protocol was introduced to the Byzantine consensus algorithm, requiring the nodes to communicate in the push-pull mode. In this way, every two nodes can sync their information within one cycle. Next, the minimal gossip sequence was constructed by spanning tree, and used as the basis for the communication and consensus-making between the nodes. On this basis, the node views in the network were transformed by the gossip protocol, which further enhances the scalability and fault-tolerance of the algorithm. The research findings provide a good reference for problem-solving in blockchain-based mobile transactions.

Keywords: mobile transaction; blockchain; spanning tree; minimal gossip sequence; Byzantine node.

DOI: 10.1504/IJMC.2021.117378

International Journal of Mobile Communications, 2021 Vol.19 No.5, pp.547 - 563

Received: 27 Jul 2019
Accepted: 25 May 2020
Published online: 03 Sep 2021 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article