ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2501.16763
52
0

Utilizing Transaction Prioritization to Enhance Confirmation Speed in the IOTA Network

28 January 2025
Seyyed Ali Aghamiri
Reza Sharifnia
Ahmad Khonsari
ArXivPDFHTML
Abstract

With the rapid advancement of blockchain technology, a significant trend is the adoption of Directed Acyclic Graphs (DAGs) as an alternative to traditional chain-based architectures for organizing ledger records. Systems like IOTA, which are specially designed for the Internet of Things (IoT), leverage DAG-based architectures to achieve greater scalability by enabling multiple attachment points in the ledger for new transactions while allowing these transactions to be added to the network without incurring any fees. To determine these attachment points, many tip selection algorithms commonly employ specific strategies on the DAG ledger. Transaction prioritization is not considered in the IOTA network, which becomes especially important when network bandwidth is limited. In this paper, we propose an optimization framework designed to integrate a priority level for critical or high-priority IoT transactions within the IOTA network. We evaluate our system using fully based on the official IOTA GitHub repository, which employs the currently operational IOTA node software (Hornet version), as part of the Chrysalis update (1.5). The experimental results show that higher-priority transactions in the proposed algorithm reach final confirmation in less time compared to the original IOTA system.

View on arXiv
@article{aghamiri2025_2501.16763,
  title={ Utilizing Transaction Prioritization to Enhance Confirmation Speed in the IOTA Network },
  author={ Seyyed Ali Aghamiri and Reza Sharifnia and Ahmad Khonsari },
  journal={arXiv preprint arXiv:2501.16763},
  year={ 2025 }
}
Comments on this paper