Dynamic balance tip selection algorithm for IOTA

Abstract

Traditional distributed ledger technology has the disadvantages of low throughput, high resource consumption and poor scalability, which make it difficult to be applied in the field of Internet of things. As a new distributed ledger technology based on directed acyclic graph, IOTA aims to be applied in the field of Internet of things. However, IOTA suffers from the problem of fairness. In IOTA,a large number of honest transactions may not be approved, and the system has the risk of parasitic chain attack and splitting attack. In this paper we proposes a new tip selection algorithm, which can dynamically change the tip selection strategy. Interestingly, the concept of sharpness is proposed firstly to describe the extreme degree of a tangle-fragment in this paper.Experimental results show that our algorithm can make most honest transactions be verified, while always keeping the security of the tangle in an acceptable range.