Optimization of IOTA Tangle Cumulative Weight Calculation Using Depth-First and Iterative Deepening Search Algorithms

Abstract

The IOTA Tangle, a Directed Acyclic Graph (DAG)-based distributed ledger, is popular for its scalability and suitability for IoT applications, offering fee-less transactions. A critical component of IOTA’s architecture is the Cumulative Weight Calculation (CWC), essential for its tip selection mechanism. This paper introduces an optimization of the IOTA Reference Implementation (IRI) CWC process originally implemented using Breadth-First Search (BFS) by employing Depth-First Search (DFS) and Iterative Deepening Search (IDS) algorithms. We present a comparative analysis of these methods, demonstrating that DFS and IDS provide significant improvements in computational efficiency, particularly beneficial for IoT devices with limited processing capabilities. Our findings are substantiated through a series of experiments on a Tangle snapshot, highlighting the enhanced performance and reduced resource utilization of the proposed methods. This study contributes to the ongoing development of DAG-based distributed ledgers, offering insights into more efficient algorithmic solutions for large-scale, decentralized networks.

Keywords

• IOTA
• Tangle
• graph
• Depth-First Search
• Iterative Deepening Search
• Breadth-First Search