检索结果-内蒙古大学图书馆

USMN-SCA: A Blockchain Sharding consensus algorithm With Tolerance for an Unlimited Scale of Malicious Nodes

IEEE TRANSACTIONS ON NETWORK AND SERVICE MANAGEMENT 2025年第2期22卷 1083-1098页

作者： Wu, Canghai Chen, Lingdan Xiong, Huanliang Hu, Jianwen Jiangxi Agr Univ Software Coll Nanchang 330045 Peoples R China Jiangxi Agr Univ Sch Comp Sci & Engn Nanchang 330045 Peoples R China

The emergence of malicious nodes in blockchain networks poses a serious threat to the integrity and security of these systems. Malicious activities can disrupt the consensus process and compromise the overall security of the network. Although traditional consensus mechanisms have proven effective to some extent, they often struggle to tolerate many malicious nodes, which can lead to network instability or even failure. In response to these challenges, this paper presents a novel blockchain sharding consensus algorithm designed to withstand an unlimited scale of malicious nodes (USMN-SCA). Our approach leverages a dynamic credit mechanism to evaluate node behavior and categorize nodes into different credit levels. By dividing the blockchain network into credit-based shards and isolating low-credit nodes, we mitigate the impact of malicious activities and improve the network's resilience. USMN-SCA employs a two-stage consensus process: first, within each shard, and then between shards. This ensures that consensus is reached efficiently while maintaining a high level of security. We implement the USMN-SCA algorithm in a prototype via blockchain sharding and deploy it on the Alibaba Cloud. The experimental results show that our protocol significantly outperforms existing methods in terms of security, with a success probability of 100% in a real-world Web environment, even more then 50% of the nodes are malicious. Additionally, the consensus delay and throughput performance are comparable to those of other state-of-the-art consensus algorithms. These findings establish the USMN-SCA as a cutting-edge solution with high applicability, scalability, and compatibility across various blockchain platforms. This work represents a significant advancement in blockchain security and performance optimization, paving the way for more secure and efficient blockchain applications.

关键词： Blockchains consensus algorithm Security consensus protocol Sharding Nonce Heuristic algorithms Software Partitioning algorithms Fault tolerant systems Blockchain consensus mechanism malicious nodes sharding

来源：评论

学校读者我要写书评

暂无评论

Hybrid Raft-PoW Blockchain consensus algorithm

引用

IEEE Access 2025年 13卷 72067-72076页

作者： Kose Ulukok, Mehtap Sariyildiz, Irfan Evrim, Vesile Cyprus Aydın University Department of Software Engineering Northern Cyprus Mersin99010 Turkey European University of Lefke Department of Computer Engineering Northern Cyprus Mersin99010 Turkey

The Raft consensus algorithm is widely used in private networks as an alternative to the energy-intensive PoW consensus algorithm in blockchains. The Raft consensus algorithm’s voting mechanism performs well in reliable and well-planned networks with optimized timeouts. However, in unreliable or poorly configured networks, it encounters several challenges. These include multiple candidacies, repeated election cycles, insufficient or failed leader elections during network splits, prolonged leader election times and vulnerability to Sybil attacks. In this study, a novel Hybrid Raft-PoW consensus algorithm is introduced. It integrates the hash puzzle-based competition of the PoW consensus algorithm with the fast leader election mechanism of the Raft consensus algorithm. This combination ensures both speed and certainty in leader election, ensuring that leadership is delegated to the most capable nodes. At the same time, it promotes decentralization by ensuring a fair distribution across nodes, achieving at least 80% leadership distribution. Therefore, the proposed Hybrid Raft-PoW consensus algorithm improves or eliminates problems caused by Raft consensus algorithm’s leader election mechanism. © 2013 IEEE.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

Optimising islanded AC microgrid control: A hierarchical approach with FCS-VMPC and consensus algorithm

引用

RESULTS IN ENGINEERING 2025年 25卷

作者： Khan, Zawar Aamir, Muhammad Khan, Rizwanullah Yousof, Mohd Fairouz Mohd Pak Austria Fachhhsch Inst Appl Sci & Technol Mang Pakistan Univ Tun Hussein Onn Malaysia Fac Elect & Elect Engn Batu Pahat Johor Malaysia

The growing integration of distributed generation (DG) from renewable energy sources (RES) in modern power systems highlights the need for advanced hierarchical control strategies. The primary layer is typically implemented using a linear controller, while the secondary control relies on complex control strategies. Due to this hierarchical control AC microgrid (MG) faces unequal power sharing or power quality problems. This paper presents a hierarchical control scheme for islanded AC MG to effectively manage power between DG units. The scheme operates with a non-linear controller consisting of finite control set-voltage model predictive control (FCS-VMPC) at the primary layer and a consensus algorithm at the secondary layer. Primary control, utilizing droop control and FCS-VMPC, is independently implemented for frequency and voltage regulation across DG units. Droop control manages power distribution between DG units and loads. Meanwhile, the secondary layer based on the consensus algorithm collaborates with FCS-VMPC to establish reference voltage values and adjust deviations at the primary level. The proposed hierarchical control facilitates communication between adjacent nodes by a sparse network. This reduces the complexity of the network with FCS-VMPC at the primary and consensus algorithm at the secondary layer. The secondary controller's effectiveness is tested against transients, unbalanced loads, and dynamic load changes. The results confirm that the MG effectively supplies power while maintaining stable voltage and frequency, achieving a total harmonic distortion (THD) of 0.95 % and a maximum voltage deviation of 0.0001 pu respectively.

关键词： consensus algorithm Distributed generation units Droop control Model predictive control

来源：评论

学校读者我要写书评

暂无评论

Optimal Distributed Dispatch of Smart Multi-Agent Energy Hubs Based on consensus algorithm Considering Lossy Communication Network and Uncertainty

引用

CSEE Journal of Power and Energy Systems 2025年第1期11卷 352-364页

作者： Abdelfattah A.Eladl Magda I.El-Afifi Magdi M.El-Saadawi Bishoy E.Sedhom Electrical Engineering Department Faculty of EngineeringMansoura UniversityEl-MansouraEgypt

This paper proposes an IoT-Fog-Cloud distributed consensus algorithm for solving the energy hub(EH)dispatch problem with packet-dropping communication links and some of EH elements'*** generating and consumption unit in this algorithm is required to estimate total power generated,total load,and power *** node coordination is accomplished using a distributed *** a distributed approach wins in work sharing,enduring a single link failure,effective decision-making,quickest convergence,and autonomy for global power *** method works with all grid types in connected and islanded *** total operation cost and emissions while meeting total demand and system constraints are the most crucial contributions of this *** case studies are applied to explain performance and effectiveness of the proposed algorithm with different packet loss *** uncertainty,sensitivity of the system was *** show mismatch between generated and consumed power is improved by 100%in the electricity grid,99.94%in heating grid,and 99.91%in gas ***,total operating cost,total emissions,and emissions cost decreased by 8.6%,13.48%,and 18.73%,respectively.

关键词： consensus algorithm CO_(2)emissions energy hubs multi-energy systems packet drops

来源：评论

学校读者我要写书评

暂无评论

Integrating a Hybrid Lightweight consensus algorithm in HyperLedger Fabric 1st

Integrating a Hybrid Lightweight Consensus Algorithm in Hype...

引用

1st Global Internet of Things and Edge Computing Summit

作者： Michalopoulos, Fotis Vavilis, Sokratis Niavis, Harris Loupos, Konstantinos Inlecom Innovat Athens Greece

ISBN: (纸本)9783031785719;9783031785726

In today's interconnected IoT ecosystems, blockchain technology acts as a facilitator for decentralization. Hyperledger Fabric (HLF) is a renounced permissioned blockchain platform designed for enterprise use. Currently, HLF supports two primary consensus algorithms: Raft and smartBFT. Despite HLF's modular nature, integrating new consensus algorithms remains a challenging and intricate process that lacks sufficient guidelines. In this work, we bridge this gap by providing a novel, comprehensive, yet practical guide to simplify the integration of consensus algorithms into HLF. Furthermore, we demonstrate our approach by integrating a new hybrid algorithm into HLF, specifically tailored for the IoT ecosystem. Compared to the current algorithms, experiments indicate promising performance and reliability.

关键词： Blockchain IoT Hyperledger Fabric consensus algorithm Implementation Guidelines

来源：评论

学校读者我要写书评

暂无评论

Proof of Random Leader: A Fast and Manipulation-Resistant Proof-of-Authority consensus algorithm for Permissioned Blockchains Using Verifiable Random Function

引用

IEEE Transactions on Services Computing 2025年

作者： Islam, Md. Mainul Merlec, Mpyana Mwamba In, Hoh Peter Texas A&M University Department of Electrical and Computer Engineering College Station77843 United States Korea University Department of Computer Science and Engineering Seoul02841 Korea Republic of DAO Solution Inc. Seoul06247 Korea Republic of

Proof of Authority (PoA) is a widely adopted consensus algorithm for permissioned blockchain networks, where a group of trusted entities governs the network. PoA is known for achieving rapid consensus with minimal computational and energy requirements. However, existing PoA variants such as Aura and Clique suffer from low transaction throughput in high workload conditions and provide limited randomness in leader selection. They are also vulnerable to time and order manipulation attacks. To overcome these limitations, this paper introduces a novel PoA-based consensus algorithm called Proof of Random Leader (PoRL), which utilizes a verifiable random function to enhance transaction throughput, improve scalability, and ensure fair and unpredictable leader selection. The proposed PoRL algorithm was implemented in Python and evaluated using a network of six consensus nodes with varying computational capabilities. The performance of PoRL was assessed based on key metrics, including security, consistency, availability, fault tolerance, block time, and transaction throughput. Experimental results indicate that PoRL achieves lower consensus times and higher transaction throughput compared to Aura and Clique, making it a more efficient solution for permissioned blockchain networks. The findings of this study provide valuable insights for blockchain practitioners in selecting the most suitable PoA implementation based on their specific network requirements. © 2008-2012 IEEE.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

Asynchronous consensus algorithm Integrating Dynamic Weight Sharding Strategy

引用

Chinese Journal of Electronics 2025年第2期34卷 600-611页

作者： Ao Xiong Wang Zhang Yu Song Dong Wang Da Li Qinglei Guo Desheng Bai State Key Laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications Beijing China State Grid Blockchain Technology (Beijing) Co. Ltd Beijing China

Blockchain technology has broad application prospects in many fields due to its unique characteristics such as decentralization, traceability, and tamper-proofing, and has become a research hotspot in recent years. As a key component of blockchain technology, the consensus algorithm is one of the important factors affecting blockchain performance. Many consensus algorithms currently used in consortium chains are based on timing assumptions and lack horizontal scalability. That is to say, these algorithms cannot reach an agreement in an asynchronous network where the receiving time of network packets is uncertain, and their efficiency decreases as the number of nodes increases, which hinders the large-scale application of the consortium chain. In order to solve the above problems, this paper proposes the dynamic sharding Dumbo (DS-Dumbo) algorithm, an asynchronous consensus algorithm that integrates dynamic sharding strategies, based on the currently excellent Dumbo Byzantine fault tolerance (DumboBFT) asynchronous consensus algorithm. The main work of this paper revolves around how to fragment and optimize the consensus process. This paper designs a node asynchronous sharding model based on multi-dimensional weights, so that the re-sharding work of each blockchain node can be executed concurrently with the asynchronous consensus algorithm, reducing the conflict between blockchain sharding and asynchronous consensus algorithms. We also designed an intelligent transaction placement strategy, which calculates the relevance score of each transaction for all shards to determine which shard the transaction is processed in order to reduce the number of complex cross-shard transactions. We optimized the execution process of the DumboBFT algorithm, converted its internal synchronous working mode to an asynchronous working mode, and reduced the consumption of consensus work to a certain extent. The experimental evaluation shows that the DS-Dumbo algorithm has higher throughpu

关键词： Sharding Fault tolerance Pain Heuristic algorithms Scalability Power system dynamics Fault tolerant systems consensus algorithm Throughput Blockchains

来源：评论

学校读者我要写书评

暂无评论

An intelligent cyber-physical system based-consensus algorithm for sustainable edge service provisioning in 6G-based IIoT applications

引用

Cyber-Physical Systems 2025年

作者： Byeon, Haewon Jena, Soumya Ranjan Bhargavi, Kovvuri N. Ramesh, Janjhyam Venkata Naga Bozarboyevich, Abdullayev Abror Soni, Mukesh Shabaz, Mohammad Department of AI and Software Inje University Gimhae Korea Republic of NextGen University International United States School of Computing and Artificial Intelligence NIMS University Jaipur India Department of CSE Aditya University Surampalem India Department of CSE Graphic Era Hill University Dehradun India Department of CSE Graphic Era Deemed To Be University Uttarakhand Dehradun India The Department of Financial Analysis Tashkent State University of Economics Tashkent Uzbekistan Division of Research and Development Lovely Professional University Phagwara India Dr. D. Y. Patil School of Science & Technology Tathawade Pune India Model Institute of Engineering and Technology Jammu India

This paper proposes a credit-driven practical byzantine fault tolerance based on a consensus algorithm for sustainable 6G communication to address the potential threat of malicious activity in green and sustainable 6G-based Industrial Internet of Things (IIoT) applications. The dual-layer architecture allows for simultaneous verification of transactions and the execution of read-write operations. According to simulation studies, CD-PBFT enhances algorithm performance and stability while efficiently reducing validation time. Empirical findings demonstrate that CD-PBFT achieves both efficiency and security fault tolerance by reducing network transaction latency by an average of 34.8% and increasing throughput by 25.2% compared to PBFT. © 2025 Informa UK Limited, trading as Taylor & Francis Group.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

A Fair and Lightweight consensus algorithm for IoT

arXiv

引用

arXiv 2025年

作者： Vavilis, Sokratis Niavis, Harris Loupos, Konstantinos Inlecom Innovation Athens Greece

As hyperconnected devices and decentralized data architectures expand, securing IoT transactions becomes increasingly challenging. Blockchain offers a promising solution, but its effectiveness relies on the underlying consensus algorithm. Traditional mechanisms like PoW and PoS are often impractical for resource-constrained IoT environments. To address these limitations, this work introduces a fair and lightweight hybrid consensus algorithm tailored for IoT. The proposed approach minimizes resource demands on the nodes while ensuring a secure and fair agreement process. Specifically, it leverages a distributed lottery mechanism to fairly propose blocks without requiring specialized hardware. In addition, a reputation-based block voting mechanism is incorporated to enhance trust and establish finality. Finally, experimental evaluation was conducted to validate the key features of the consensus algorithm. Copyright © 2025, The Authors. All rights reserved.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

Strategic Research on the Health Management Data Storage Mechanism Integrating Blockchain Technology Based on the Improved PBFT consensus algorithm

Strategic Research on the Health Management Data Storage Mec...

引用

Power Electronics, Computer Applications (ICPECA), IEEE International Conference on

作者： Xuejie Liu Soochow University Suzhou China

ISBN: (数字)9798331533694

ISBN: (纸本)9798331533700

At present, the existing databases in medical institutions are characterized by singularity and centralization in storage methods. This makes it difficult to guarantee the security, integrity, and traceability of electronic medical data, thus posing a threat to patients' medical privacy. Although some studies have proposed data security storage solutions based on cloud storage and the like, such solutions rely on a completely trustworthy third-party to ensure the reliability of interactions. To address the above-mentioned problems, this paper proposes a decentralized health management data storage mechanism by integrating blockchain technology based on the improved PBFT consensus algorithm. This mechanism uses the improved PBFT consensus algorithm and the optimized Hash encryption algorithm to securely and effectively store health management data in a distributed database, ensuring the integrity and traceability of the data. At the same time, a new data interaction system is designed to prevent direct interaction between the third-party and the database, preventing untrustworthy third-parties from maliciously damaging the data and ensuring data security. In addition, through access control and the Lucene retrieval mechanism, patient privacy is protected and rapid retrieval of health management data is achieved. Experimental analysis shows that compared with algorithms such as Proof of Work (POW) and Delegated Proof of Stake (DPOS), the improved PBFT consensus algorithm endows the medical blockchain system with better stability and throughput. Compared with the ordinary database interaction method, the designed data interaction system effectively prevents direct operations on the database and has good security and anti-tampering properties. Experimental data indicates that the decentralized health management data storage system constructed by integrating blockchain technology based on the improved PBFT consensus algorithm realizes the secure storage, traceability, an

关键词： Access control Data privacy Data security Smart contracts Memory consensus algorithm Throughput Stability analysis Blockchains Secure storage

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：