Enhancing fairness and scalability in IOTA tangle networks: a POMDP-based tip selection algorithm for decentralized systems
Year: 2025
Type: article
Abstract: The rise of decentralized technologies introduces challenges in fairness, efficiency, and scalability within distributed ledger protocols. The Internet of Things Applications (IOTA) Tangle, a directed acyclic graph (DAG)-based structure, addresses these challenges by enabling scalable, feeless transactions for IoT applications. This study presents a novel Partially Observable Markov Decision Process (POMDP)-based Tip Selection Algorithm (TSA) to optimize fairness in the IOTA Tangle. The proposed TSA reduces orphaned transactions to as low as 0.003% and eliminates lazy tip selection under medium network loads. Extensive simulations demonstrate that the POMDP-based TSA confirms up to 107 transactions at optimal lambda values, outperforming existing algorithms like Weighted TSA by 328% in efficiency. This algorithm offers significant scalability, fairness, and adaptability, making it a robust solution for IoT-based decentralized applications. These findings advance DAG-based distributed ledger systems by addressing orphaned transactions and lazy behavior, ensuring secure and efficient operations under diverse network conditions.
Source: Cluster Computing
Institution: Qatar University
Language: English
Subfield: Information Systems
Field: Computer Science
Domain: Physical Sciences
Open Access status: hybrid
Estimated APC paid: $3,190
Funders: Qatar University, Qatar National Library
OpenAlex ID: W4414629916
