INDF: Efficient Transaction Publishing in Blockchain

Abstract

Blockchain is a distributed ledger technology based on the underlying peer-to-peer network. In this paper, we focus on improving the chances of a transaction being packaged into a valid block so as to be recorded on the main chain. Blockchain nodes typically broadcast transactions they receive to the whole network. Hence, for recording transactions on the blockchain more efficiently, it becomes essential to determine influential nodes to publish transactions, where influential nodes are more actively involved in mining, recording, or broadcasting transactions in the network. To that aim, we propose an Influential Node Determination Framework (INDF) using a series of significant factors, such as hash rate, latency, active time, and degree of a node. Specifically, INDF consists of two parallel schemes: the first scheme figures out influential pools according to their hash rates where a truth-telling mechanism design is employed to encourage the pool nodes to report their true hash rate values; the second one determines influential individual nodes based on an improved L-H index algorithm. Remarkably, the proposed truth-telling mechanism is proved to be incentive-compatible. Our improved L-H index algorithm is comparatively studied to reflect the impacts of different node parameters on the node’s ranking. Extensive experiments are conducted to demonstrate the effectiveness of our proposed framework.