Ethereum Based Storage Aware Mining for Permissioned Blockchain Network

被引:0
|
作者
Igboanusi, Ikechi Saviour [1 ]
Allwinnaldo [1 ]
Alief, Revin Naufal [1 ]
Ansori, Muhammad Rasyid Redha [1 ]
Lee, Jae-Min [1 ]
Kim, Dong-Seong [1 ]
机构
[1] Kumoh Natl Inst Technol, Networked Syst Lab, IT Convergence Engn, Gumi, South Korea
基金
新加坡国家研究基金会;
关键词
Auto integrated mining (AIM); Blockchain; low latency; real time; storage efficiency; wireless network;
D O I
10.1109/ICUFN55119.2022.9829669
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
This work aims to reduce transaction time by integrating the mining process with the sending of transactions to reduce overall transaction time. This work also decreased the overhead of mining in a private network, by reducing the production of empty blocks in the network which saves energy, storage space, network bandwidth and computational complexity. We proposed an Auto Integrated Mining (AIM) algorithm which starts the mining process only when there is at least one pending transaction in the network, and stops mining as soon as the pending transactions are mined. The results show that the AIM algorithm reduced the number of mined blocks in a 12 hour period by producing only 24% of the original number of blocks. The proposed algorithm is also able to reduce the storage used to save chaindata by 16%. The experiment shows that the mining latency of AIM varied between 200-650ms when the number of pending transactions was between 1-1,000, and had a latency between 350-1,350ms when there were 1,000-10,000 pending transactions in the private blockchain network.
引用
收藏
页码:161 / 166
页数:6
相关论文
共 50 条
  • [1] Kriper: A blockchain network with permissioned storage
    Rojo-Rivas, Maria Isabel
    Diaz-Sanchez, Daniel
    Almenarez, Florina
    Marin-Lopez, Andres
    [J]. FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE, 2023, 138 : 160 - 171
  • [2] Automating ETL and Mining of Ethereum Blockchain Network
    Su, Voon Hou
    Sen Gupta, Sourav
    Khan, Arijit
    [J]. WSDM'22: PROCEEDINGS OF THE FIFTEENTH ACM INTERNATIONAL CONFERENCE ON WEB SEARCH AND DATA MINING, 2022, : 1581 - 1584
  • [3] Distributed Storage System based on Permissioned Blockchain
    Nygaard, Racin
    Meling, Hein
    Jehl, Leander
    [J]. SAC '19: PROCEEDINGS OF THE 34TH ACM/SIGAPP SYMPOSIUM ON APPLIED COMPUTING, 2019, : 338 - 340
  • [4] A Reliable Storage Partition for Permissioned Blockchain
    Qi, Xiaodong
    Zhang, Zhao
    Jin, Cheqing
    Zhou, Aoying
    [J]. IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2021, 33 (01) : 14 - 27
  • [5] BSS: A Storage Optimization Scheme for the Permissioned Blockchain
    Yan, Meng
    Yang, Ying
    Wang, Gang
    Liu, Xiao-Guang
    [J]. Tien Tzu Hsueh Pao/Acta Electronica Sinica, 2024, 52 (04): : 1364 - 1376
  • [6] Automated calibration and DCC generation system with storage in private permissioned Blockchain network
    Zet, Cristian
    Dumitriu, Gabriel
    Fosalau, Cristian
    Sarbu, Gabriel Constantin
    [J]. ACTA IMEKO, 2023, 12 (01):
  • [7] CLEC: Combination Locality Based Erasure Code for Permissioned Blockchain Storage
    Wu, Jiabin
    Yang, Boai
    Liu, Yang
    Liu, Fang
    Xiao, Nong
    Li, Shuo
    [J]. CMC-COMPUTERS MATERIALS & CONTINUA, 2022, 73 (03): : 5137 - 5150
  • [8] A Byzantine Fault Tolerant Storage for Permissioned Blockchain
    Qi, Xiaodong
    Chen, Zhihao
    Zhang, Zhao
    Jin, Cheqing
    Zhou, Aoying
    Zhuo, Haizhen
    Xu, Quangqing
    [J]. SIGMOD '21: PROCEEDINGS OF THE 2021 INTERNATIONAL CONFERENCE ON MANAGEMENT OF DATA, 2021, : 2770 - 2774
  • [9] Security-Aware GA based Practical Byzantine Fault Tolerance for Permissioned Blockchain
    Kashyap, R.
    Arora, K.
    Sharma, M.
    Aazam, A.
    [J]. 2019 4TH INTERNATIONAL CONFERENCE ON CONTROL, ROBOTICS AND CYBERNETICS (CRC 2019), 2019, : 162 - 168
  • [10] Permissioned Blockchain-based Trustworthy Edge Storage Scheme for Smart Grid
    Liu, Yan
    Zhang, Yan
    Liu, Haiqing
    Li, Yuancheng
    [J]. RECENT ADVANCES IN ELECTRICAL & ELECTRONIC ENGINEERING, 2022, 15 (02) : 171 - 181