Study on mobile trading mechanism based on blockchain Byzantine consensus algorithm Online publication date: Fri, 03-Sep-2021
by Wei Hu; Huanhao Li; Hu Yawei; Wenhui Yao
International Journal of Mobile Communications (IJMC), Vol. 19, No. 5, 2021
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.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Mobile Communications (IJMC):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook