Achieving High Efficiency and High Throughput in Erasure Code-Based Distributed Storage for Blockchain

A blockchain is a decentralized peer-to-peer network in which all nodes store data in copies, ensuring data integrity, as transactions cannot be changed or deleted. This can lead to duplicate data storage, resulting in high storage overhead, especially in storage-constrained environments, such as th...

Full description

Saved in:
Bibliographic Details
Main Authors: So-Hyun Park, So-Yeon Kim, So-Hui Kim, Il-Gu Lee
Format: Article
Language:English
Published: MDPI AG 2025-03-01
Series:Sensors
Subjects:
Online Access:https://www.mdpi.com/1424-8220/25/7/2161
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1850212747112873984
author So-Hyun Park
So-Yeon Kim
So-Hui Kim
Il-Gu Lee
author_facet So-Hyun Park
So-Yeon Kim
So-Hui Kim
Il-Gu Lee
author_sort So-Hyun Park
collection DOAJ
description A blockchain is a decentralized peer-to-peer network in which all nodes store data in copies, ensuring data integrity, as transactions cannot be changed or deleted. This can lead to duplicate data storage, resulting in high storage overhead, especially in storage-constrained environments, such as the Internet of Things (IoT) or sensor systems. Distributed storage techniques utilizing erasure code (EC) have been investigated to address this issue. Although EC-based blockchain storage increases storage efficiency, encoded chunks distributed across multiple nodes must be received to restore and access the original blocks. However, studies on increasing the data transmission efficiency of EC-based blockchain storage are limited. In this study, we propose a data transmission technique called trigger-based automatic repeat request (ARQ), enabling stable data recovery while ensuring low latency and high-throughput performance, even with frequent node failure. This technique increased the throughput efficiency by 8% while maintaining the decentralization of the blockchain. Furthermore, it maximized the storage efficiency of EC-based distributed blockchain storage by >99.8%, while solving the recovery overhead problem due to data transmission. Using the trigger-based ARQ scheme with an EC-based distribution technique, blockchains can reduce storage overhead while effectively accessing the original blocks, overcoming the limitations of conventional EC-based distributed storage.
format Article
id doaj-art-b9cc344683e249cc8537fc74faa97eb4
institution OA Journals
issn 1424-8220
language English
publishDate 2025-03-01
publisher MDPI AG
record_format Article
series Sensors
spelling doaj-art-b9cc344683e249cc8537fc74faa97eb42025-08-20T02:09:17ZengMDPI AGSensors1424-82202025-03-01257216110.3390/s25072161Achieving High Efficiency and High Throughput in Erasure Code-Based Distributed Storage for BlockchainSo-Hyun Park0So-Yeon Kim1So-Hui Kim2Il-Gu Lee3Department of Future Convergence Technology Engineering, Sungshin Women’s University, Seoul 02844, Republic of KoreaDepartment of Future Convergence Technology Engineering, Sungshin Women’s University, Seoul 02844, Republic of KoreaDepartment of Future Convergence Technology Engineering, Sungshin Women’s University, Seoul 02844, Republic of KoreaDepartment of Future Convergence Technology Engineering, Sungshin Women’s University, Seoul 02844, Republic of KoreaA blockchain is a decentralized peer-to-peer network in which all nodes store data in copies, ensuring data integrity, as transactions cannot be changed or deleted. This can lead to duplicate data storage, resulting in high storage overhead, especially in storage-constrained environments, such as the Internet of Things (IoT) or sensor systems. Distributed storage techniques utilizing erasure code (EC) have been investigated to address this issue. Although EC-based blockchain storage increases storage efficiency, encoded chunks distributed across multiple nodes must be received to restore and access the original blocks. However, studies on increasing the data transmission efficiency of EC-based blockchain storage are limited. In this study, we propose a data transmission technique called trigger-based automatic repeat request (ARQ), enabling stable data recovery while ensuring low latency and high-throughput performance, even with frequent node failure. This technique increased the throughput efficiency by 8% while maintaining the decentralization of the blockchain. Furthermore, it maximized the storage efficiency of EC-based distributed blockchain storage by >99.8%, while solving the recovery overhead problem due to data transmission. Using the trigger-based ARQ scheme with an EC-based distribution technique, blockchains can reduce storage overhead while effectively accessing the original blocks, overcoming the limitations of conventional EC-based distributed storage.https://www.mdpi.com/1424-8220/25/7/2161automatic repeat requestblockchaindata recoverydistributed storageerasure codewireless sensor networks
spellingShingle So-Hyun Park
So-Yeon Kim
So-Hui Kim
Il-Gu Lee
Achieving High Efficiency and High Throughput in Erasure Code-Based Distributed Storage for Blockchain
Sensors
automatic repeat request
blockchain
data recovery
distributed storage
erasure code
wireless sensor networks
title Achieving High Efficiency and High Throughput in Erasure Code-Based Distributed Storage for Blockchain
title_full Achieving High Efficiency and High Throughput in Erasure Code-Based Distributed Storage for Blockchain
title_fullStr Achieving High Efficiency and High Throughput in Erasure Code-Based Distributed Storage for Blockchain
title_full_unstemmed Achieving High Efficiency and High Throughput in Erasure Code-Based Distributed Storage for Blockchain
title_short Achieving High Efficiency and High Throughput in Erasure Code-Based Distributed Storage for Blockchain
title_sort achieving high efficiency and high throughput in erasure code based distributed storage for blockchain
topic automatic repeat request
blockchain
data recovery
distributed storage
erasure code
wireless sensor networks
url https://www.mdpi.com/1424-8220/25/7/2161
work_keys_str_mv AT sohyunpark achievinghighefficiencyandhighthroughputinerasurecodebaseddistributedstorageforblockchain
AT soyeonkim achievinghighefficiencyandhighthroughputinerasurecodebaseddistributedstorageforblockchain
AT sohuikim achievinghighefficiencyandhighthroughputinerasurecodebaseddistributedstorageforblockchain
AT ilgulee achievinghighefficiencyandhighthroughputinerasurecodebaseddistributedstorageforblockchain