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

Devi, C. H. Sarada and Anand, R. and Hemalatha, R. and Maheswari, B. Uma (2024) Duo‐H: An Effectual Consensus Algorithm Using Two‐Tier Shard Consortium Blockchain Mechanism for Enhanced Privacy Protection. International Journal of Network Management, 34 (6). ISSN 1055-7148

Full text not available from this repository.

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 (Formula presented) 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. © 2024 Elsevier B.V., All rights reserved.

Item Type: Article
Subjects: Computer Science > Computer Science
Divisions: Arts and Science > Vinayaka Mission's Kirupananda Variyar Arts & Science College, Salem > Computer Science
Depositing User: Unnamed user with email techsupport@mosys.org
Last Modified: 27 Nov 2025 05:14
URI: https://vmuir.mosys.org/id/eprint/1428

Actions (login required)

View Item
View Item