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

Blockchain Technology and Information Security (ICBCTIS), International Conference on

作者： Kedi Niu Zhongyuan Yao Xueming Si School of Cyberspace Security Zhongyuan University of Technology Zhengzhou China

ISBN: (数字)9798331528324

ISBN: (纸本)9798331528331

Blockchain, as a decentralized distributed ledger technology, offers secure data exchange and reliable identity authentication for Internet of Things (IoT) devices, introducing new ideas for IoT development. Practical Byzantine Fault Tolerance (PBFT) is a widely used consensus algorithm that is well-suited for the IoT environment due to its low computing power requirements. However, the vast number of devices in the IoT presents a challenge. PBFT necessitates inter-node communication, which leads to decreased scalability as the number of devices grows. To overcome these IoT limitations, this paper proposes an improved PBFT algorithm based on reputation value. Nodes are evaluated and assigned levels according to their reputation values, with higher level nodes being chosen to engage in the consensus process, thereby minimizing the risk of malicious nodes participating. The primary node is unpredictably chosen from high-reputation nodes using random numbers. This approach also simplifies the consensus algorithm process and reduces communication complexity. Experimental findings indicate that the reputation value-based improved PBFT algorithm can diminish communication overhead and consensus delay.

关键词： Fault tolerance Distributed ledger Scalability Heuristic algorithms Fault tolerant systems Information security consensus algorithm Blockchains Delays Internet of Things

来源：评论

学校读者我要写书评

暂无评论

ENET: Efficient Blockchain consensus algorithm Based on Evil Node Elimination Tree

ENET: Efficient Blockchain Consensus Algorithm Based on Evil...

引用

IEEE International Conference on Automation, Electronics and Electrical Engineering (AUTEEE)

作者： Hang Yin Wentao Wang Yongwang Cao Hongwei Zhao Jilin University College of Computer Science and Technology Changchun China

ISBN: (数字)9781665471978

ISBN: (纸本)9781665471985

Blockchain consensus algorithms are generally used to ensure data consistency in the blockchain. The current blockchain consensus algorithm has some problems, such as high computing resource consumption, slow block generation speed and difficulty in dealing with malicious node and failure node, which lead to the uncertainty of authenticity of new blocks and trading transaction delay. In view of these problems, we firstly turn the question into solving the problems of electing the one node to keep ledger while ensuring the correctness of ledger information and then synchronize the distributed ledger among most nodes. we propose a consensus algorithm named ENET (Evil Node Elimination Tree) using single chain blockchain structure, with integrating Boyer-Moore majority vote algorithm ensuring the correctness of all new generated blocks. A bottom-up promotion approach to election was adopted to gradually eliminate evil nodes, meanwhile the structure of elimination tree of evil nodes is being constructed. In addition, the distributed synchronization mechanism of top-down update is adopted to recursively update the distributed ledger of all nodes. Theoretical derivation and computer multithreading simulation results show that the communication complexity of this algorithm is at a linear level, and the fault tolerance ratio is 1/4 at the lowest and 3/4 at the highest. The transaction duration is significantly shortened while the double payment problem is eliminated in the system.

关键词： Fault tolerance Uncertainty Distributed ledger Voting Simulation Fault tolerant systems consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

An Efficient consensus algorithm for Blockchain-Based Federated Learning

An Efficient Consensus Algorithm for Blockchain-Based Federa...

引用

International Symposium on Advanced Computing and Communication (ISACC)

作者： Kausthav Pratim Kalita Debojit Boro Dhruba Kumar Bhattacharyya Computer Science & Engineering Assam Don Bosco University Guwahati India Computer Science & Engineering Tezpur University Tezpur India

Machine learning techniques have proved to be an inevitable tool for data analysis and prediction in various domains. Federated learning has enhanced it by allowing localized training of datasets where the owners need not share their data. The participating parties only need to share their locally trained model weights and biases to accomplish a federated learning task. This sharing mechanism can become significantly secure and tamper-proof on a blockchain network. In this paper, we have proposed a consensus algorithm to ensure efficient and economical utilization of blockchain to perform federated learning activities. The proposed model is tested in a simulated test bed to present a practical implementation of our algorithm and to reflect upon its efficiency.

关键词： Training Federated learning Computational modeling consensus algorithm Organizations Data models Blockchains

来源：评论

学校读者我要写书评

暂无评论

Byzantine fault-tolerant consensus algorithm based on local temporary consensus and global confirmation

Byzantine fault-tolerant consensus algorithm based on local ...

引用

International Conference on Communications, Information System and Computer Engineering (CISCE)

作者： Pu Wang School of Computer and Artificial Intelligence Zhengzhou University Zhengzhou China

ISBN: (数字)9798350353174

ISBN: (纸本)9798350353181

Aiming at the Byzantine fault-tolerant consensus algorithm when the number of nodes is too large, there are problems such as a large amount of data exchange, slow consensus speed, and security degradation caused by proxy nodes, based on threshold signatures, a new Byzantine fault-tolerant consensus algorithm based on local temporary consensus and global confirmation is proposed. Nodes divide into different zones based on their geographical location, the algorithm conducts temporary consensus among zones in parallel, and all nodes participate in global confirmation together, reducing the amount of network data exchange during the consensus process while improving consensus speed and security.

关键词： Degradation Fault tolerance Fault tolerant systems consensus algorithm Computer security Information systems

来源：评论

学校读者我要写书评

暂无评论

D-PoA: A consensus algorithm for Medical Data SharingBased on Dynamic Scoring

D-PoA: A Consensus Algorithm for Medical Data SharingBased o...

引用

IEEE International Conference on Web Services (ICWS)

作者： Gang Wang GuoWu Li Zheng Ma Xi'an University of Finance and Economics Xi'an

ISBN: (数字)9798350368550

ISBN: (纸本)9798350368567

As an effective tool to ensure data security, blockchain has attracted extensive attention in medical data sharing. The core of blockchain is consensus algorithm, among them, proof of authority (PoA) is a consensus algorithm widely used in Permissioned chain, which has the characteristics of high efficiency and strong scalability. However, it also has some problems such as unknown credibility of authoritative nodes and poor enthusiasm of nodes. So this paper proposed an improved dynamic scoring-based PoA algorithm (D-PoA). Firstly, the dynamic scoring mechanism is introduced to screen the authoritative nodes, so as to improve the credibility and enthusiasm of the authoritative nodes; Then the consistency process is optimized to improve the work efficiency of the system. Experiments show that D-PoA algorithm has some advantages over PoA algorithm in consensus reliability, transaction delay and throughput.

关键词： Web services Heuristic algorithms Scalability Data security consensus algorithm Throughput Delays Blockchains Reliability

来源：评论

学校读者我要写书评

暂无评论

Hybrid Incremental Cost consensus algorithm for Smart Grid Distributed Energy Management under Packet Loss Environment

Hybrid Incremental Cost Consensus Algorithm for Smart Grid D...

引用

Annual Conference of the IEEE Industrial Electronics Society

作者： Yuan Zhang Mo-Yuen Chow Department of Electrical and Computer Engineering North Carolina State University

ISBN: (纸本)9781479940318

With the development of smart grid technology, the future power system will become a complex cyber-physical system. The control and management of this system will impose new challenges to the current Supervisory Control and Data Acquisition system such as scalability in its computational and communications effort, and robustness to single point of failure. Decentralized cooperative control is promising to control and manage such a system in a more efficient and robust way. consensus based algorithms have been proposed by researchers to deal with various power system applications in a distributed manner. Because of the sensitivity to communications imperfections, the performance of the consensus based algorithms degrade when the communication packet loss happens in practical applications. In this paper, a Hybrid Incremental Cost consensus (Hybrid ICC) algorithm is proposed. Different from other consensus based algorithms, the Hybrid ICC algorithm is robust against communications imperfections by integrating gossip algorithm and consensus algorithm together. Several case studies are presented to illustrate the performance of the proposed Hybrid ICC algorithm and demonstrate the scalability and robustness under packet loss scenarios.

关键词： consensus algorithm Distributed control Economic dispatch Energy management Gossip algorithm Packet loss Smart grid

来源：评论

学校读者我要写书评

暂无评论

Optimization of PBFT consensus algorithm in Piecewise Blockchain

Optimization of PBFT Consensus Algorithm in Piecewise Blockc...

引用

Big Data, Artificial Intelligence and Risk Management (ICBAR), International Conference on

作者： Guannan Sun Kaiqi Xu Jiayi Wu Xinjie Wang Zuxin Liu Qufu Normal University China

The consensus mechanism, as the foundation and core of blockchain technology, fundamentally determines the security, availability, etc. of the whole blockchain system. In this paper, an improved algorithm of PBFT based on network partitioning is proposed. Firstly, the nodes are divided into network slices, and the Raft mechanism is used for consensus within each slice, while each slice elects leaders to form a committee, and the PBFT mechanism is used for consensus within the committee. Supervisory nodes and sorting nodes are also introduced to improve the security of the algorithm.

关键词： consensus algorithm Big Data Partitioning algorithms consensus protocol Security Risk management Artificial intelligence

来源：评论

学校读者我要写书评

暂无评论

Research on application analysis of production-education integration path based on consensus algorithm 22

Research on application analysis of production-education int...

引用

Proceedings of the 2022 5th International Conference on E-Business, Information Management and Computer Science

作者： Fashuang Huang Yuan Fu Wuhan Business University China

ISBN: (纸本)9781450397827

Consistency means that in a multi-structure agent network, each agent interacts and interacts with certain information according to certain control rules, and finally all agents in the network reach agreement on certain key information or states. In this paper, by analyzing the information network and weight of each subject unit under the mode of integration of industry and education, and researching and analyzing common distributed structures and mathematical models, on this basis, a path of industry-university integration based on consensus algorithm is established, and given The corresponding evaluation indicators are given, and a new way of thinking is provided for the research of relevant personnel.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

On Linear Convergence of PI consensus algorithm under the Restricted Secant Inequality

On Linear Convergence of PI Consensus Algorithm under the Re...

引用

Indian Control Conference (ICC)

作者： Kushal Chakrabarti Mayank Baranwal Division of Data & Decision Sciences Tata Consultancy Services Research Mumbai India Faculty of Systems & Control Engineering Indian Institute of Technology Bombay

ISBN: (数字)9798331517212

ISBN: (纸本)9798331517229

This paper considers solving distributed optimization problems in peer-to-peer multi-agent networks. The network is synchronous and connected. By using the proportional-integral (PI) control strategy, various algorithms with fixed stepsize have been developed. Two notable among them are the PI algorithm and the PI consensus algorithm. Although the PI algorithm has provable linear or exponential convergence without the standard requirement of (strong) convexity, a similar guarantee for the PI consensus algorithm is unavailable. In this paper, using Lyapunov theory, we guarantee exponential convergence of the PI consensus algorithm for global cost functions that satisfy the restricted secant inequality, with rate-matching discretization, without requiring convexity. To accelerate the PI consensus algorithm, we incorporate local pre-conditioning in the form of constant positive definite matrices and numerically validate its efficiency compared to the prominent distributed convex optimization algorithms. Unlike classical pre-conditioning, where only the gradients are multiplied by a pre-conditioner, the proposed pre-conditioning modifies both the gradients and the consensus terms, thereby controlling the effect of the communication graph on the algorithm.

关键词： Logistic regression Accelerated aging consensus algorithm Cost function Convex functions Peer-to-peer computing Linear matrix inequalities Standards Convergence Lyapunov methods

来源：评论

学校读者我要写书评

暂无评论

On Linear Convergence of PI consensus algorithm under the Restricted Secant Inequality

arXiv

引用

arXiv 2023年

作者： Chakrabarti, Kushal Baranwal, Mayank Division of Data & Decision Sciences Tata Consultancy Services Research Mumbai400607 India Faculty of Systems & Control Engineering Indian Institute of Technology India

This paper considers solving distributed optimization problems in peer-to-peer multi-agent networks. The network is synchronous and connected. By using the proportional-integral (PI) control strategy, various algorithms with fixed stepsize have been developed. Two notable among them are the PI algorithm and the PI consensus algorithm. Although the PI algorithm has provable linear or exponential convergence without the standard requirement of (strong) convexity, a similar guarantee for the PI consensus algorithm is unavailable. In this paper, using Lyapunov theory, we guarantee exponential convergence of the PI consensus algorithm for global cost functions that satisfy the restricted secant inequality, with rate-matching discretization, without requiring convexity. To accelerate the PI consensus algorithm, we incorporate local preconditioning in the form of constant positive definite matrices and numerically validate its efficiency compared to the prominent distributed convex optimization algorithms. Unlike classical pre-conditioning, where only the gradients are multiplied by a pre-conditioner, the proposed pre-conditioning modifies both the gradients and the consensus terms, thereby controlling the effect of the communication graph on the algorithm. Copyright © 2023, The Authors. All rights reserved.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：