Blockchain Transactions Using Attached Blocks and Discrete Token Negotiation for Delay-Tolerant Networks

Abstract

The essence of blockchain is the competition for node mining rights, and the real-time connectivity of the network is prerequisite and guarantee. However, there exist delay-tolerant networks with data transmission latency, which puts nodes at a disadvantage in blockchain activities. To address this problem, a transaction architecture is constructed to provide service support for nodes in discontinuous connectivity networks to participate in blockchain activities. Firstly, an auxiliary block named as an attached block is constructed as a basis for distinguishing new blocks generated when the network is connected or disconnected. Secondly, with the miner’s identity and several random numbers as parameters, unique and verifiable discrete tokens are generated to obtain mining qualifications. On this basis, the mining qualification attribution algorithm and branch processing algorithm are designed. The former avoids the problem of the richest man doing evil in PoS (proof of stake) and DPoS (delegated proof of stake), and the latter ensures the attached chains are added to the main chain with an equal probability. Finally, a quadratic consensus scheme is designed to solve the problem of false and duplicate transactions that may exist in generated blocks when the network is disconnected. Theoretical proof and experimental analysis show that the architecture has advantages in indices such as reliability, acceptability, transaction throughput, confirmation time and branching rate.

Keywords

• blockchain; discrete token; attached block; attached chain; negotiation mechanism; delay-tolerant networks