Duo‐H: An Effectual Consensus Algorithm Using Two‐Tier Shard Consortium Blockchain Mechanism for Enhanced Privacy Protection

ABSTRACT Blockchain is an innovative technology for storing data in decentralized, distributed, and secure chain blocks. Consortium blockchains are commonly used in transactions where transactions between organizations are also achieved by the blockchain. In the classic consortium blockchain system, entire nodes are added to each other in the process of transaction consensus. This leads to lower confidentiality in protecting transaction data within the organizations in the consortium. The throughput of the existing consortium blockchain system is still low. To solve the above problems, the paper proposes a two‐tier consortium blockchain with transaction privacy based on sharding technology. First, a trust value assessment is carried out to select the nodes of the blockchain. The duo‐head observation strategy uses these trust values to identify the nonmalicious node. Finally, the consensus separation approach based on the guarantee mechanism strategy with the shard nodes is presented. This approach is used to select reliable nodes for the blocks to be stored. The proposed consortium blockchain approach evaluation is done in terms of latency, throughput, and transactions per second metrics. As a result of the evaluations, the proposed model with 32 shards possesses 143,891 of throughput and 1.11 s of latency. Moreover, by the proposed two‐tier consortium model, time consumption is also decreased when uploading data. For a data set of 50,000, the suggested model has a time consumption of 96 s. The proposed research results in higher throughput and less latency in transactions. Also, the research enhances the scalability and reliability by overcoming the poor node issues.

Authors

Institutions

Publication Details

Journal
International Journal of Network Management
Published
2024-09-02
DOI
https://doi.org/10.1002/nem.2300
Citations
1
Primary Topic
Blockchain Technology Applications and Security
Type
article
Field-Weighted Citation Impact
0.78
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Duo‐H: An Effectual Consensus Algorithm Using Two‐Tier Shard Consortium Blockchain Mechanism for Enhanced Privacy Protection

Rahul Anand, C. H. Sarada Devi, R. Hemalatha, B. Uma Maheswari
1 citations
International Journal of Network Management
Blockchain Technology Applications and Security
0.78
article

Duo‐H: An Effectual Consensus Algorithm Using Two‐Tier Shard Consortium Blockchain Mechanism for Enhanced Privacy Protection

Rahul Anand, C. H. Sarada Devi, R. Hemalatha, B. Uma Maheswari
article en
1 citations

Abstract

ABSTRACT Blockchain is an innovative technology for storing data in decentralized, distributed, and secure chain blocks. Consortium blockchains are commonly used in transactions where transactions between organizations are also achieved by the blockchain. In the classic consortium blockchain system, entire nodes are added to each other in the process of transaction consensus. This leads to lower confidentiality in protecting transaction data within the organizations in the consortium. The throughput of the existing consortium blockchain system is still low. To solve the above problems, the paper proposes a two‐tier consortium blockchain with transaction privacy based on sharding technology. First, a trust value assessment is carried out to select the nodes of the blockchain. The duo‐head observation strategy uses these trust values to identify the nonmalicious node. Finally, the consensus separation approach based on the guarantee mechanism strategy with the shard nodes is presented. This approach is used to select reliable nodes for the blocks to be stored. The proposed consortium blockchain approach evaluation is done in terms of latency, throughput, and transactions per second metrics. As a result of the evaluations, the proposed model with 32 shards possesses 143,891 of throughput and 1.11 s of latency. Moreover, by the proposed two‐tier consortium model, time consumption is also decreased when uploading data. For a data set of 50,000, the suggested model has a time consumption of 96 s. The proposed research results in higher throughput and less latency in transactions. Also, the research enhances the scalability and reliability by overcoming the poor node issues.

International Journal of Network ManagementVol. 34(6)
Vinayaka Missions University (IN), Meenakshi Academy of Higher Education and Research (IN), St. Joseph's Institute of Technology (IN), St. Joseph’s College of Engineering (IN)
Openalex Percentile: Top 22%
Blockchain Technology Applications and Security
0.78
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.