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

Improvement of Multi-Mechanism PBFT consensus algorithm Based on Attribute-Based Encryption Grouping

Improvement of Multi-Mechanism PBFT Consensus Algorithm Base...

Computer Science, Electronic Information Engineering and Intelligent Control Technology (CEI), IEEE International Conference on

作者： Puzhou Wang Ping Lou Junwei Yan Jianjun Bai School of Information Engineering Wuhan University of Technology Wuhan China

ISBN: (数字)9798350372052

ISBN: (纸本)9798350372069

The PBFT consensus algorithm is widely used in consortium blockchains due to its good performance in Byzantine fault tolerance, but problems still exist in some aspects such as random election of master nodes, high communication overhead, and poor network scalability. Many researchers use node grouping to solve the above problems, but there are still some deficiencies in the credibility mechanism, grouping algorithm and consistency mechanism. To address the shortcomings of existing researches, this paper proposes a multi-mechanism PBFT consensus improvement algorithm based on attribute-based encryption grouping (ABE-MPBFT). Firstly, based on the nodes' positivity, honesty and computational ability, we design the credibility evaluation mechanism to establish the grouping criteria, then construct the credibility reward and penalty mechanism to update the nodes' grouping. Secondly, attribute sets are assigned to nodes, and node grouping is spontaneously realized using CP-ABE in the process of consensus message encryption and decryption transmission, which solves the problem of large computational overhead and reuse of traditional grouping algorithms. According to different node properties of inter-group and intra-group, we design two-phase, three-phase and four-phase consistency mechanisms for each group to further reduce the communication overhead. Finally, it is proved through experiments that this algorithm can effectively reduce the number of communication, and improve consensus delay and TPS.

关键词： Fault tolerance Scalability Voting Fault tolerant systems consensus algorithm Throughput Encryption

来源：评论

学校读者我要写书评

暂无评论

Application of consensus algorithm for Power Dispatch in Autonomous Microgrid

Application of Consensus Algorithm for Power Dispatch in Aut...

引用

Computational Intelligence on Power, Energy and Controls with their impact on Humanity (CIPECH), Innovative Applications of

作者： Rucha Joshi Leena Heistrene Elijah Toppo Reema Patel Department of Electrical Engineering Pandit Deendayal Petroleum University Gandhinagar India Department of Computer Science and Engineering Pandit Deendayal Petroleum University Gandhinagar India

ISBN: (纸本)9781538664735

Microgrid consists of conventional generators, energy storage systems, distributed generators (DGs) such as wind power and photo voltaic (PV) power generation units and their respective control devices. Integration of these DGs with the grid causes technical issues such as voltage and frequency deviations. Microgrid operates in both modes - grid connected as well as islanded mode. But these unwarranted deviations are predominantly observed in the islanded mode wherein the microgrid must maintain its own active power supply-demand balance. In order to minimize these deviations, different control strategies have been implemented. Owing to several disadvantages of different types of centralized control strategies, this work has adopted the distributed control scheme for power dispatch in microgrid that controls the unwarranted deviations in the microgrid network in the islanded mode.

关键词： consensus algorithm Microgrids Frequency control Petroleum Renewable energy sources Decentralized control Mathematical model

来源：评论

学校读者我要写书评

暂无评论

Distributed HALS algorithm for NMF based on Simple Average consensus algorithm

Distributed HALS Algorithm for NMF based on Simple Average C...

引用

Symposium of Image, Signal Processing, and Artificial Vision (STSIVA)

作者： Keiju Hayashi Tsuyoshi Migita Norikazu Takahashi Okayama University Okayama Japan

ISBN: (纸本)9781665426565

Nonnegative Matrix Factorization (NMF) is an efficient dimensionality reduction method for nonnegative data. Recently, a distributed algorithm has been proposed for multiple agents in a network to execute the hierarchical alternating least squares algorithm, which is well known as a fast computation method for NMF. However, the average consensus algorithm used there requires each agent to store the entire history of the values of its variables until the complete average consensus is reached, which increases the memory usage and computational cost. In this paper, we propose to replace the complicated average consensus algorithm with a simple one, and show through simulations that this replacement does not degrade the quality of the result if the values of the hyper-parameters are properly chosen.

关键词： Dimensionality reduction Sufficient conditions Conferences Memory management consensus algorithm Linear programming Data models

来源：评论

学校读者我要写书评

暂无评论

SBHPS: A High Performance consensus algorithm For Blockchain

SBHPS: A High Performance Consensus Algorithm For Blockchain

引用

High Performance Big Data and Intelligent Systems (HPBD&IS)

作者： Xiubo Liang Yu Zhao Deng Zhang Junhan Wu Yijun Zhao Zhejiang University Ningbo China

ISBN: (纸本)9781665413282

Blockchain is one of the most promising new technologies with its characteristics of decentralization, traceability, and trustlessness. However, it has two problems: 1) the system throughput rate is low and cannot meet the requirements of large-scale scenarios. As the core technology of blockchain technology, the consensus algorithm has become an important factor affecting the performance of blockchain. 2) The ever-increasing volume of transaction data rapidly consumes system storage resources which restricts the development of blockchain ***, this paper combines the hybrid consensus algorithm and blockchain sharding technology to design and implement a consensus algorithm that can greatly improve the performance of public blockchain. Firstly, this paper makes some improvements to PoA, and on this basis, it combines with SBFT consensus algorithm, and proposes a high performance scalable hybrid consensus algorithm based on sharding technology, named SBHPS. Experimental results show that the SBHPS consensus algorithm has higher throughput and lower transaction confirmation delay.

关键词： consensus algorithm Throughput Blockchains Delays

来源：评论

学校读者我要写书评

暂无评论

RSA based consensus algorithm for resource-constrained distributed devices

引用

INTERNET TECHNOLOGY LETTERS 2023年第6期6卷

作者： Gupta, Nishant Jain, Ankit Kumar Natl Inst Technol Dept Comp Engn Kurukshetra 136119 India

With the proliferation of resource-constrained distributed devices, such as Internet of Things devices, there is a growing need for efficient consensus algorithms to enable secure and reliable communication among these devices. This paper proposes an RSA-based consensus algorithm explicitly designed for resource-constrained distributed devices. The algorithm leverages the RSA (Rivest-Shamir-Adleman) cryptography scheme to achieve secure communication and consensus among the devices. To evaluate the performance of the RSA-based consensus algorithm, a simulation is conducted in the Python programming language. The simulation considers a network with a fixed number of participants and miner nodes. The average execution time of the algorithm is measured over multiple iterations to assess its efficiency. The simulation results demonstrate that the proposed algorithm reduces latency in block validation, and the algorithm's low computational requirement reduces energy consumption for each transaction.

关键词： blockchain consensus algorithm internet of things (IoT) resource-constrained devices RSA

来源：评论

学校读者我要写书评

暂无评论

MOCA: A Scalable consensus algorithm Based on Cellular Automata

MOCA: A Scalable Consensus Algorithm Based on Cellular Autom...

引用

IEEE International Conference on Software Engineering and Service Sciences (ICSESS)

作者： Zhancang Wang Department of Research & Development NKN Labs Singapore

ISBN: (纸本)9781538665664;9781538665657

In recent years, with Bitcoin taking the lead, the blockchain technology has been put in the spotlight as it introduced a method for multiple parties to achieve consensus without trust. Nevertheless, the according application is constrained due to its limitations in scalability. In this paper, we proposed a highly scalable consensus model based on majority voting cellular automata, namely the MOCA consensus, with a distinctive blockchain-based distributed ledger in which the state change of each node depends on its neighbors. MOCA consensus origins from the zero-temperature Ising model with spontaneous magnetization achieving scalability of number of nodes with high probability Byzantine fault tolerance.

关键词： Mathematical model Automata Magnetization Silicon consensus algorithm Scalability Entropy

来源：评论

学校读者我要写书评

暂无评论

Efficient multi-tier, multiple entry PBFT consensus algorithm for IoT

Efficient multi-tier, multiple entry PBFT consensus algorith...

引用

IEEE International Conference on Communications (ICC)

作者： Haytham Qushtom Jelena Miš ić Vojislav B. Miš ić Ryerson University Toronto ON Canada

ISBN: (数字)9781538683477

ISBN: (纸本)9781538683484

An implementation of a blockchain-based data storage and Internet of Things (IoT) system is described in this paper. A Practical Byzantine Fault Tolerance (PBFT)-like protocol is used to achieve consensus. The proposed approach consists of two layers, the lower layer with a number of clusters and the upper layer. The upper layer consists of virtual cluster composed of delegate nodes from lower clusters. Each cluster in the lower layer allows its member nodes to initiate simultaneous consensus rounds, implemented using a dedicated overlay network per node. Each overlay network is rooted in one node and connects it with every other node. This allows concurrent multiple entry PBFT consensus sessions in each lower layer cluster. In the upper layer, the virtual cluster members have to contend for linking their accepted blocks into the blockchain ledger. Performance analysis of the proposed approach is performed using a discrete-time Markov Chain (DTMC) and M/G/1 queuing-based analytical model. The efficiency of the proposed model is verified by testing over a wide range of parameter values.

关键词： Fault tolerance Overlay networks Protocols Fault tolerant systems Merging consensus algorithm Performance analysis

来源：评论

学校读者我要写书评

暂无评论

WBRP: consensus algorithm Based on Weak Proof of Work

WBRP: Consensus Algorithm Based on Weak Proof of Work

引用

IEEE International Conference on Blockchain (Blockchain)

作者： Jiarui Li Dongbin Wang Hui Zhi Wencheng Zhu Jianing Li Zedong Wang School of Cyberspace Engineering Beijing University of Post and Telecommunications Beijing China National Engineering Laboratory for Mobile Network Beijing China TravelSky Technology Limited Beijing China Key Laboratory of Ministry of Education and Trustworthy Distributed Computing and Service Beijing China

ISBN: (数字)9798350351590

ISBN: (纸本)9798350351606

Nakamoto consensus (NC) is a classic Proof of Work (PoW) consensus algorithm where the probability of miners earning the right to a block is proportional to their computational power. To prevent blockchain forks, the interval between block outputs is restricted, which results in lower throughput for PoW. To address blockchain performance issues, a transaction ledger scheme based on weak PoW consensus has been proposed. This approach combines strong and weak blocks, allowing miners to submit weak blocks with lower mining difficulty. Nodes can then use these weak blocks to organize transaction information on the main chain and ensure strict linear ordering of blocks and transactions through sorting rules. Experimental results demon-strate that the consensus algorithm based on weak PoW can significantly enhance system performance, allowing transaction throughput to increase linearly with bandwidth. Specifically, with a node bandwidth of 1 Gb/s, the performance can exceed NC by more than 300 times.

关键词： System performance consensus algorithm Bandwidth Throughput Proof of Work Extensibility Blockchains

来源：评论

学校读者我要写书评

暂无评论

Discrete Time consensus algorithm In Multi-Agent System

Discrete Time Consensus Algorithm In Multi-Agent System

引用

Control Conference (ICC), 2019 Sixth Indian

作者： Amol Patil Gautam Shah Electronics and Telecommunication Engineering St. Francis Institute of Technology University of Mumbai Mumbai Faculty of Electronics and Telecommunication Engineering St. Francis Institute of Technology University of Mumbai Mumbai

ISBN: (纸本)9781665409797

This paper explains mathematical framework of coordination phenomenon happening in nature and social dynamics. Distributed control law is designed for multi-agent dynamical systems using Perron-Frobenius theory. algorithm convergence is analyzed for balanced and unbalanced communication graph. The consensus value and the topological condition under which the algorithm converges is also derived and explained. Simulation results shows the effective implementation of proposed algorithm

关键词： Heuristic algorithms Simulation Decentralized control consensus algorithm Graph theory Time-domain analysis Dynamical systems

来源：评论

学校读者我要写书评

暂无评论

P-CFT: A Privacy-preserving and Crash Fault Tolerant consensus algorithm for Permissioned Blockchains

P-CFT: A Privacy-preserving and Crash Fault Tolerant Consens...

引用

IEEE International Conference on Hot Information-Centric Networking (HotICN)

作者： Wanxin Li Collin Meese Mark Nejad Hao Guo University of Delaware U.S.A. School of Software Northwestern Polytechnical University China

ISBN: (纸本)9781665405508

consensus algorithms play a critical role in blockchains and directly impact their performance. During consensus processing, nodes need to validate and order the pending transactions into a new block, which requires verifying the application-specific data encapsulated within a transaction. This exposes the underlying data to the consensus nodes, presenting privacy concerns. Existing consensus algorithms focus on realizing application security and performance goals, but lack privacy-by-design properties or are resource-heavy and intended for securing permissionless blockchain networks. In this paper, we propose P-CFT, a zero-knowledge and crash fault tolerant consensus algorithm for permissioned blockchains. The proposed consensus algorithm provides inherent data privacy directly to the consensus layer, while still providing guarantees of crash fault tolerance. We conduct experiments using the Hyperledger Ursa cryptographic library, and the results show promise for integrating P-CFT into existing permissioned blockchain systems requiring privacy-preserving and crash fault tolerant features.

关键词： Fault tolerance Data privacy Protocols Distributed ledger Fault tolerant systems consensus algorithm Computer crashes

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：