A scalable and secure transaction attachment algorithm for DAG-based blockchain

Blockchain, as an innovative distributed ledger technology, has attracted considerable attention in recent years from both academic circles and industry sectors. Its applications span a diverse range of domains, including finance and the Internet of Things (IoT). However, the scalability of blockcha...

Descripción completa

Detalles Bibliográficos
Autores: Guo, Fengyang, Hecker, Artur, Dustdar, Schahram
Tipo de recurso: artículo
Estado:Versión publicada
Fecha de publicación:2025
País:España
Institución:Varias* (Consorci de Biblioteques Universitáries de Catalunya, Centre de Serveis Científics i Acadèmics de Catalunya)
Repositorio:Recercat. Dipósit de la Recerca de Catalunya
OAI Identifier:oai:recercat.cat:10230/71753
Acceso en línea:http://hdl.handle.net/10230/71753
http://dx.doi.org/10.1109/JIOT.2024.3521680
Access Level:acceso abierto
Palabra clave:Distributed ledger system
Internet of Things (IoT)
IOTA blockchain network
Network modeling
id ES_d07e530afee6537cbebbc1f7c49ba113
oai_identifier_str oai:recercat.cat:10230/71753
network_acronym_str ES
network_name_str España
repository_id_str
spelling A scalable and secure transaction attachment algorithm for DAG-based blockchainGuo, FengyangHecker, ArturDustdar, SchahramDistributed ledger systemInternet of Things (IoT)IOTA blockchain networkNetwork modelingBlockchain, as an innovative distributed ledger technology, has attracted considerable attention in recent years from both academic circles and industry sectors. Its applications span a diverse range of domains, including finance and the Internet of Things (IoT). However, the scalability of blockchain technology is still a critical limitation with the increasing volume of data. To address this limitation, a directed acyclic graph (DAG) data structure has been proposed to improve scalability by supporting asynchronous process of transactions. IOTA is a well-known DAG-based blockchain that theoretically offers faster confirmation speeds with an increasing number of transactions. However, in practice, IOTA still faces the challenge of balancing scalability and security. In this article, we propose a scalable and secure transaction attachment algorithm for the DAG-based blockchain IOTA. We determine two critical parameters through our experimental analysis: one for calculating the selection probability and the other for setting the threshold for abnormal transactions. First, we calculate the selection probability of unconfirmed transactions. Then, we select abnormal transactions whose selection probability falls below the predefined threshold to maintain the security. Finally, new transactions attach randomly to former transactions with a time computational complexity O(n) , ensuring the scalability. Through experiments comparing the proposed algorithm to the current transaction attaching algorithm, we demonstrate the scalability and security of our proposed algorithm.Institute of Electrical and Electronics Engineers (IEEE)202520252025info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionapplication/pdfapplication/pdfhttp://hdl.handle.net/10230/71753http://dx.doi.org/10.1109/JIOT.2024.3521680http://hdl.handle.net/10230/71753reponame:Recercat. Dipósit de la Recerca de Catalunyainstname:Varias* (Consorci de Biblioteques Universitáries de Catalunya, Centre de Serveis Científics i Acadèmics de Catalunya)InglésIEEE Internet of Things Journal. 2025 May 1;12(9):12298-309© 2024 The Authors. This work is licensed under a Creative Commons Attribution 4.0 License. For more information, see https://creativecommons.org/licenses/by/4.0/http://creativecommons.org/licenses/by/4.0/info:eu-repo/semantics/openAccessoai:recercat.cat:10230/717532026-05-29T05:05:01Z
dc.title.none.fl_str_mv A scalable and secure transaction attachment algorithm for DAG-based blockchain
title A scalable and secure transaction attachment algorithm for DAG-based blockchain
spellingShingle A scalable and secure transaction attachment algorithm for DAG-based blockchain
Guo, Fengyang
Distributed ledger system
Internet of Things (IoT)
IOTA blockchain network
Network modeling
title_short A scalable and secure transaction attachment algorithm for DAG-based blockchain
title_full A scalable and secure transaction attachment algorithm for DAG-based blockchain
title_fullStr A scalable and secure transaction attachment algorithm for DAG-based blockchain
title_full_unstemmed A scalable and secure transaction attachment algorithm for DAG-based blockchain
title_sort A scalable and secure transaction attachment algorithm for DAG-based blockchain
dc.creator.none.fl_str_mv Guo, Fengyang
Hecker, Artur
Dustdar, Schahram
author Guo, Fengyang
author_facet Guo, Fengyang
Hecker, Artur
Dustdar, Schahram
author_role author
author2 Hecker, Artur
Dustdar, Schahram
author2_role author
author
dc.subject.none.fl_str_mv Distributed ledger system
Internet of Things (IoT)
IOTA blockchain network
Network modeling
topic Distributed ledger system
Internet of Things (IoT)
IOTA blockchain network
Network modeling
description Blockchain, as an innovative distributed ledger technology, has attracted considerable attention in recent years from both academic circles and industry sectors. Its applications span a diverse range of domains, including finance and the Internet of Things (IoT). However, the scalability of blockchain technology is still a critical limitation with the increasing volume of data. To address this limitation, a directed acyclic graph (DAG) data structure has been proposed to improve scalability by supporting asynchronous process of transactions. IOTA is a well-known DAG-based blockchain that theoretically offers faster confirmation speeds with an increasing number of transactions. However, in practice, IOTA still faces the challenge of balancing scalability and security. In this article, we propose a scalable and secure transaction attachment algorithm for the DAG-based blockchain IOTA. We determine two critical parameters through our experimental analysis: one for calculating the selection probability and the other for setting the threshold for abnormal transactions. First, we calculate the selection probability of unconfirmed transactions. Then, we select abnormal transactions whose selection probability falls below the predefined threshold to maintain the security. Finally, new transactions attach randomly to former transactions with a time computational complexity O(n) , ensuring the scalability. Through experiments comparing the proposed algorithm to the current transaction attaching algorithm, we demonstrate the scalability and security of our proposed algorithm.
publishDate 2025
dc.date.none.fl_str_mv 2025
2025
2025
dc.type.none.fl_str_mv info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
format article
status_str publishedVersion
dc.identifier.none.fl_str_mv http://hdl.handle.net/10230/71753
http://dx.doi.org/10.1109/JIOT.2024.3521680
http://hdl.handle.net/10230/71753
url http://hdl.handle.net/10230/71753
http://dx.doi.org/10.1109/JIOT.2024.3521680
dc.language.none.fl_str_mv Inglés
language_invalid_str_mv Inglés
dc.relation.none.fl_str_mv IEEE Internet of Things Journal. 2025 May 1;12(9):12298-309
dc.rights.none.fl_str_mv http://creativecommons.org/licenses/by/4.0/
info:eu-repo/semantics/openAccess
rights_invalid_str_mv http://creativecommons.org/licenses/by/4.0/
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
application/pdf
dc.publisher.none.fl_str_mv Institute of Electrical and Electronics Engineers (IEEE)
publisher.none.fl_str_mv Institute of Electrical and Electronics Engineers (IEEE)
dc.source.none.fl_str_mv reponame:Recercat. Dipósit de la Recerca de Catalunya
instname:Varias* (Consorci de Biblioteques Universitáries de Catalunya, Centre de Serveis Científics i Acadèmics de Catalunya)
instname_str Varias* (Consorci de Biblioteques Universitáries de Catalunya, Centre de Serveis Científics i Acadèmics de Catalunya)
reponame_str Recercat. Dipósit de la Recerca de Catalunya
collection Recercat. Dipósit de la Recerca de Catalunya
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869420178724356096
score 15.811543

Similares en LA Referencia