A TSGP-Based Tip Search Optimization Algorithm

Abstract

Blockchain is an underlying technology that initially implemented for Bitcoin. Data consistency, decentralization, and non-tamperability of this technology provide unique proposition values in many applications. However, slow transaction speed, high demand of resources, and scalability have become the bottlenecks that limit the blockchain's applicability. Instead of a chain, IOTA is a network of tangle distributed ledger in order to offer higher scalability and quicker transaction time, compared to blockchain. In this paper, we propose a new TSGP (Tree Solve Graph Problem) tip selection algorithm for IOTA. Our experiments show that our algorithm performs better than tip selection algorithms in the literature. Moreover, increasing the number of transactions plays no impact on the transaction connection speed in our algorithm.