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

Doppel: A BFT consensus algorithm for cyber-physical systems with low latency

JOURNAL OF SYSTEMS ARCHITECTURE 2024年 148卷

作者： Hao, Rui Dai, Xiaohai Xie, Xia Wuhan Univ Technol Sch Comp Sci & Artificial Intelligence Wuhan 430070 Peoples R China Huazhong Univ Sci & Technol Sch Comp Sci & Technol Serv Comp Technol & Syst Lab Cluster & Grid Comp Lab Wuhan 430074 Peoples R China Hainan Univ Sch Comp Sci & Technol Haikou 570228 Peoples R China

The integration of blockchain technology with Cyber-Physical Systems (CPS) has gained significant attention across various industry domains such as manufacturing, healthcare, transportation, and energy management. The consensus mechanism serves as the fundamental component of decentralized blockchain systems, and the efficiency of the consensus algorithm greatly impacts the practicality of the entire system. One of the most well-known representative algorithms in the field of Byzantine Fault Tolerance (BFT) consensus is PBFT, which operates through successive views where a replica is designated as the leader in each view. The leader assumes the responsibility of proposing new requests and gathering votes from other replicas. However, in cases where the leader becomes Byzantine or faulty, a view -change process is triggered after a A timer expires, transitioning to the next view. Requests that failed to commit in a previous view may experience a delay of up to A + 66 (6 representing the actual network delay) before being committed in the new view. Given that A is typically set to a large value, this latency becomes unacceptable for CPS, which necessitates realtime transaction processing or data exchange. Following PBFT, several works, including SBFT, have aimed to improve consensus performance. However, all these works primarily focus on reducing latency in the normal case and overlook the aforementioned issue that existed during the view -change process. To address this issue, we propose Doppel, an approach that reduces the latency caused by a faulty leader. Doppel achieves this by introducing two leaders, namely L1 and L2 , in each view and enabling request commitment during the view -change process. These leaders are assigned different priorities. If L1 is non -faulty, Doppel can commit requests within 56 , which is equivalent to PBFT and SBFT. Conversely, if L1 is faulty but L2 is non -faulty, Doppel significantly reduces latency to 76 , which is notably smaller

关键词： Byzantine fault tolerance Byzantine generals consensus algorithm Blockchain Cyber physical systems

来源：评论

学校读者我要写书评

暂无评论

Augmented consensus algorithm for Discrete-time Dynamical Systems

引用

IFAC-PapersOnLine 2019年第20期52卷 115-120页

作者： Chengda Ji Yue Shen Marin Kobilarov Dennice F. Gayme Dept. of Mechanical Engineering the Johns Hopkins University 3400 N. Charles St. Baltimore MD 21218 USA Dept. of Electrical and Computer Engineering Johns Hopkins University 3400 N. Charles St. Baltimore MD 21218 USA

We propose a novel state estimation algorithm for consensus dynamics subject to measurement error. We first demonstrate that with properly tuned parameters, our algorithm attains the same equilibrium value that would be attained using the traditional algorithm based on local state feedback (nominal consensus). We then show that our approach improves consensus performance in a particular class of problems by reducing the state error (i.e., the difference between the agent states and the consensus value). A numerical example compares the performance of the distributed algorithm we propose to that of the traditional local feedback scheme. The results show that the proposed algorithm significantly reduces the state error.

关键词： Distributed Control Networked Dynamical Systems Discrete-time Systems consensus algorithm Measurement Error

来源：评论

学校读者我要写书评

暂无评论

Teegraph: A Blockchain consensus algorithm based on TEE and DAG for data sharing in IoT

引用

JOURNAL OF SYSTEMS ARCHITECTURE 2022年 122卷

作者： Fu Xiang Wang Huaimin Shi Peichang Zhang Xunhui Natl Univ Def Technol Coll Comp Changsha 410073 Peoples R China Key Lab Software Engn Complex Syst Changsha 410073 Peoples R China

Blockchain offers new ways to the data sharing-based collaboration among IoT devices when a centralized IT infrastructure is unavailable. As one of the critical elements in a Blockchain system, the existing consensus algorithms still have some weaknesses, such as energy-wasting, low throughput, high latency, and increased network communication requirements. In this paper, we focus on designing a highly efficient Blockchain consensus algorithm for data sharing among IoT devices. We present the detailed design of Teegraph, which is a Trusted Execution Environment (TEE) and Directed Acyclic Graph (DAG)-based consensus algorithm. A proof-of-concept implementation of Teegraph is presented. The simulation results demonstrate that TEE usage in Teegraph is more efficient than that of the existing state of the art TEE-based consensus algorithms such as MinBFT and MinZyzzyva. Moreover, Teegraph outperforms Hashgraph, one of the most popular DAG-based consensus algorithms in throughput and latency.

关键词： Blockchain consensus algorithm IoT Data sharing TEE DAG

来源：评论

学校读者我要写书评

暂无评论

A Blockchain-Based Byzantine consensus algorithm for Information Authentication of the Internet of Vehicles

引用

IEEE ACCESS 2019年 7卷 139703-139711页

作者： Hu, Wei Hu, Yawei Yao, Wenhui Li, Huanhao Shanghai Univ Elect Power Sch Econ & Management Shanghai 200090 Peoples R China

This paper attempts to solve the security problems in communication, consensus-making and authentication of nodes in the Internet of vehicles (IoV) for intelligent transport. Considering the defects of the central node and service complexity in the IoV, the blockchain was integrated with the IoV to create a decentralized mechanism for communication and consensus-making. In the architecture of the blockchain-based IoV, the Byzantine consensus algorithm based on time sequence and gossip protocol is used to complete information communication and consensus authentication, which not only ensures communication security, improves the consensus efficiency of nodes, but also improves the fault tolerance of the algorithm. The experimental results show that our algorithm outshined the traditional authentication method in information security and consensus efficiency of the IoV. The research findings provide a reference solution to the authentication problems in the IoV for intelligent transport.

关键词： Blockchain consensus algorithm intelligent transport Internet of vehicles (IoV)

来源：评论

学校读者我要写书评

暂无评论

Post-Quantum Delegated Proof of Luck for Blockchain consensus algorithm

引用

APPLIED SCIENCES-BASEL 2024年第18期14卷 8394页

作者： Kim, Hyunjun Kim, Wonwoong Kang, Yeajun Kim, Hyunji Seo, Hwajeong Hansung Univ Div IT Convergence Engn Seoul 02876 South Korea

The advancements in quantum computing and the potential for polynomial-time solutions to traditional public key cryptography (i.e., Rivest-Shamir-Adleman (RSA) and elliptic-curve cryptography (ECC)) using Shor's algorithm pose a serious threat to the security of pre-quantum blockchain technologies. This paper proposes an efficient quantum-safe blockchain that incorporates new quantum-safe consensus algorithms. We integrate post-quantum signature schemes into the blockchain's transaction signing and verification processes to enhance resistance against quantum attacks. Specifically, we employ the Falcon signature scheme, which was selected during the NIST post-quantum cryptography (PQC) standardization process. Although the integration of the post-quantum signature scheme results in a reduction in the blockchain's transactions per second (TPSs), we introduce efficient approaches to mitigate this performance degradation. Our proposed post-quantum delegated proof of luck (PQ-DPoL) combines a proof of luck (PoL) mechanism with a delegated approach, ensuring quantum resistance, energy efficiency, and fairness in block generation. Experimental results demonstrate that while post-quantum cryptographic algorithms like Falcon introduce larger signature sizes and slower processing times, the PQ-DPoL algorithm effectively balances security and performance, providing a viable solution for secure blockchain operations in a post-quantum era.

关键词： post-quantum blockchain consensus algorithm quantum computing post-quantum cryptography

来源：评论

学校读者我要写书评

暂无评论

Decentralized Multi-Area Economic Dispatch in Power Systems Using the consensus algorithm

引用

ENERGIES 2024年第15期17卷 3609页

作者： Hong, Ying-Yi Zeng, Hao Chung Yuan Christian Univ Dept Elect Engn Taoyuan 320 Taiwan

A multi-area power system requires coordination to enhance reliability and reduce operating costs. Economic dispatch in such systems is crucial because of the uncertainties associated with variable loads and the increasing penetration of renewable energy sources. This paper presents a hierarchical consensus algorithm designed to determine the economic dispatch in a multi-area power system, accounting for the uncertainties in load and renewable generation. The proposed algorithm, which utilizes distributed agents, operates across three levels. Level 1 coordinates all areas, while levels 2 and 3 form a leader-follower consensus algorithm for overall economic dispatch. Breadth-first search is employed to identify the leader agent within each area. To address the uncertainties in loads and renewable generation, Monte Carlo simulations are performed. The efficacy of the proposed method is validated using the IEEE 39-bus and 118-bus systems, as well as a realistic 1968-bus power system in Taiwan. The traditional equal lambda method is employed to verify that the proposed approach is suitable for multi-area power systems using distributed computation.

关键词： breadth-first search consensus algorithm decentralized operation economic dispatch multi-agent system uncertainty

来源：评论

学校读者我要写书评

暂无评论

SV-PBFT: An Efficient and Stable Blockchain PBFT Improved consensus algorithm for Vehicle-to-Vehicle Energy Transactions

引用

JOURNAL OF INTERNET TECHNOLOGY 2022年第6期23卷 1191-1201页

作者： Suo, Yao Wang, Yingsen Luo, Shichao Yang, Qianqian Zhao, Juanjuan Taiyuan Univ Technol Coll Informat & Comp Taiyuan Peoples R China Jinzhong Coll Informat Coll Informat Jinzhong Peoples R China

Aiming at the problems of difficult charging, long waiting time and energy loss of IoEV (Internet of electric vehicles) during peak charging period, we design a V2V (vehicle to vehicle) energy trading model to simulate the energy trading process. Considering the problems of malicious node attacks and privacy protection, we combine the V2V energy transaction model with a federated chain and explore a distributed ledger to record the V2V energy transaction process. In addition, we design a credibility mechanism to initialize nodes according to their comprehensive strength and select master nodes based on their behavioral performance of participating in consensus, which ensures the reliability of the consensus. Based on this, we propose a more efficient and promising consensus algorithm SV-PBFT (shapley value-PBFT), which simplifies the consensus process, reduces the communication overhead, and improves the consensus efficiency. The SV-PBFT consensus algorithm is used to replace the traditional consensus algorithm in V2V energy trading. The proposed SV-PBFT algorithm is validated by extensive simulation experiments, and numerical results are provided to confirm the good performance of SV-PBFT in V2V energy trading models.

关键词： Blockchain consensus algorithm Vehicle to Vehicle Reputation mechanism

来源：评论

学校读者我要写书评

暂无评论

Green-PoW: An energy-efficient blockchain Proof-of-Work consensus algorithm

引用

COMPUTER NETWORKS 2022年 214卷

作者： Lasla, Noureddine Al-Sahan, Lina Abdallah, Mohamed Younis, Mohamed Hamad Bin Khalifa Univ Coll Sci & Engn Div Informat & Comp Technol Ar Rayyan Qatar Univ Maryland Baltimore Cty Baltimore MD USA

This paper opts to mitigate the energy-inefficiency of the Blockchain Proof-of-Work (PoW) consensus algorithm by rationally repurposing the power spent during the mining process. The original PoW mining scheme is designed to consider one block at a time and assign a reward to the first place winner of a computation race. To reduce the mining-related energy consumption, we propose to compensate the computation effort of the runner(s)-up of a mining round, by granting them exclusivity of solving the upcoming block in the next round. This will considerably reduce the number of competing nodes in the next round and consequently, the consumed energy. Our proposed scheme divides time into epochs, where each comprises two mining rounds;in the first one, all network nodes can participate in the mining process, whereas in the second round only runners-up can take part. Thus, the overall mining energy consumption can be reduced to nearly 50%. To the best of our knowledge, our proposed scheme is the first to considerably decrease the energy consumption of the original PoW algorithm. Our analysis demonstrates the effectiveness of our scheme in reducing energy consumption, the probability of fork occurrences, the level of mining centralization presented in the original PoW algorithm, and the effect of transaction censorship attack.

关键词： Blockchain consensus algorithm Proof-of-Work Energy-efficiency

来源：评论

学校读者我要写书评

暂无评论

Improved PBFT consensus algorithm Based on Node Role Division

引用

Journal of Computer and Communications 2023年第2期11卷 20-38页

作者： Xiyu Ren Xiangrong Tong Wei Zhang School of Computer and Control Engineering Yantai University Yantai China

The PBFT (Practical Byzantine Fault Tolerance, PBFT) consensus algorithm, which addressed the issue of malicious nodes sending error messages to disrupt the system operation in distributed systems, was challenging to support massive network nodes, the common participation over all nodes in the consensus mechanism would lead to increased communication complexity, and the arbitrary selection of master nodes would also lead to inefficient consensus. This paper offered a PBFT consensus method (Role Division-based Practical Byzantine Fault Tolerance, RD-PBFT) to address the above problems based on node role division. First, the nodes in the system voted with each other to divide the high reputation group and low reputation group, and determined the starting reputation value of the nodes. Then, the mobile node in the group was divided into roles according to the high reputation value, and a total of three roles were divided into consensus node, backup node, and supervisory node to reduce the number of nodes involved in the consensus process and reduced the complexity of communication. In addition, an adaptive method was used to select the master nodes in the consensus process, and an integer value was introduced to ensure the unpredictability and equality of the master node selection. Experimentally, it was verified that the algorithm has lower communication complexity and better decentralization characteristics compared with the PBFT consensus algorithm, which improved the efficiency of consensus.

关键词： Blockchain consensus algorithm Practical Byzantine Fault Tolerance Node Role Division

来源：评论

学校读者我要写书评

暂无评论

Advances in Consortium Chain Scalability: A Review of the Practical Byzantine Fault Tolerance consensus algorithm

引用

INTERNATIONAL JOURNAL OF ADVANCED COMPUTER SCIENCE AND APPLICATIONS 2024年第7期15卷 977-991页

作者： Wahab, Nur Haliza Abdul Dayong, Zhang Fadila, Juniardi Nur Wong, Keng Yinn Univ Teknol Malaysia Fac Comp Johor Baharu Malaysia Univ Teknol Malaysia Fac Mech Johor Baharu Malaysia

technology, renowned for its decentralized, immutable, and transparent features, offers a reliable framework for trust in distributed systems. The growing popularity of consortium blockchains, which include public, private, hybrid, and consortium chains, stems from their balance of privacy and collaboration. A significant challenge in these systems is the scalability of consensus mechanisms, particularly algorithm. This review focuses on enhancing PBFT's scalability, a critical factor in the effectiveness of consortium chains. Innovations such as Boneh-Lynn-Shacham (BLS) signatures and Verifiable Random Functions (VRF) are highlighted for their ability to reduce algorithmic complexity and increase transaction throughput. The discussion extends to real-world applications, particularly in platforms like Hyperledger Fabric, showcasing the practical benefits of these advancements. This paper provides a concise overview of the latest methodologies that enhance the performance scalability of PBFT-based consortium chains, serving as a valuable resource for researchers and practitioners aiming to optimize these systems for high-performance demands.

关键词： Blockchain Practical Byzantine Fault Tolerance (PBFT) consensus algorithm cryptography

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：