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

Distributed Finite-Time Termination for consensus algorithm in Switching Topologies

IEEE TRANSACTIONS ON NETWORK SCIENCE AND ENGINEERING 2023年第1期10卷 489-499页

作者： Saraswat, Govind Khatana, Vivek Patel, Sourav Salapaka, Murti V. Natl Renewable Energy Lab Golden CO 80401 USA Univ Minnesota Dept Elect & Comp Engn Minneapolis MN 55455 USA

In this article, we present a finite-time stopping criterion for consensus algorithms in networks with dynamic communication topology. Prior state of the art has established convergence to the consensus value;however, the asymptotic convergence of these algorithms poses a challenge in practical settings where the response from agents is required in finite time. To this end, we propose a maximum-minimum protocol that propagates the global maximum and minimum values of agent states (while running the consensus algorithm) in the network. This article focuses on establishing that the global maximum and minimum values are strictly monotonic even for a dynamic topology, and they can be used to distributively ascertain the closeness to convergence in finite time. We rigorously show that each node can have access to the global maximum and minimum by running the proposed maximum-minimum protocol to realize a finite-time stopping criterion for the otherwise asymptotic consensus algorithm. The practical utility of the algorithm is illustrated through experiments where each agent is instantiated by a NodeJS *** server.

关键词： Network topology Topology consensus algorithm Heuristic algorithms Switches Convergence Automobiles Distributed consensus multi-agent systems network-based computing systems switching topology

来源：评论

学校读者我要写书评

暂无评论

Delegated Proof of Stake With Downgrade: A Secure and Efficient Blockchain consensus algorithm With Downgrade Mechanism

引用

IEEE ACCESS 2019年 7卷 118541-118555页

作者： Yang, Fan Zhou, Wei Wu, Qingqing Long, Rui Xiong, Neal N. Zhou, Meiqi Zhongnan Univ Econ & Law Sch Informat & Safety Engn Wuhan 430073 Hubei Peoples R China Tianjin Univ Coll Intelligence & Comp Tianjin 300073 Peoples R China

Blockchain technology has a wide range of applications in the fields of finance, credit reporting and intellectual property, etc. As the core of blockchain, consensus algorithm affects the security and performance of blockchain system directly. In the past 10 years, there have been about 30 consensus algorithms such as Proof of Work (PoW), Proof of Stake (PoS), Delegated Proof of Stake (DPoS), Ripple Protocol consensus algorithm (RPCA) and AlgoRand. But their security, stability and operating efficiency still lag far behind our actual needs. This paper introduces the computing power competition of PoW into DPoS to design an improved consensus algorithm named Delegated Proof of Stake with Downgrade (DDPoS). Through the further modification, the impact of both computing resources and stakes on generating blocks is reduced to achieve higher efficiency, fairness, and decentralization in consensus process. Then a downgrade mechanism is proposed to quickly replace the malicious nodes to improve the security. The simulation experiments in blockchain system show that the proposed consensus algorithm is significantly more efficient than PoW and PoS, but slightly lower than DPoS. However, its degree of centralization remains far below that of DPoS. And through the downgrade mechanism, the proposed consensus algorithm can detect and downgrade the malicious nodes timely to ensure the security and good operation of system.

关键词： Blockchain consensus algorithm delegated proof of stake with downgrade downgrade mechanism efficiency fairness decentralization

来源：评论

学校读者我要写书评

暂无评论

A Study of Privacy Preservation in Average consensus algorithm via Deterministic Obfuscation Signals

引用

IEEE TRANSACTIONS ON CONTROL OF NETWORK SYSTEMS 2024年第1期11卷 534-546页

作者： Rezazadeh, Navid Kia, Solmaz S. Univ Calif Irvine Dept Mech & Aerosp Engn Irvine CA 92697 USA

This article is a study on the use of additive obfuscation signals to keep the reference values of the agents in the continuous-time Laplacian average consensus algorithm private from eavesdroppers. Obfuscation signals are perturbations that agents add to their local dynamics and their transmitted-out messages to conceal their private reference values. An eavesdropper is an agent inside or outside the network that has access to some subset of the interagent communication messages, and its knowledge set also includes the network topology. Rather than focusing on using a zero-sum and vanishing additive signal, our work determines the necessary and sufficient conditions that define the set of admissible obfuscation signals that do not perturb the convergence point of the algorithm from the average of the reference values of the agents. Of theoretical interest, our results show that this class includes nonvanishing signals as well. Given this broader class of admissible obfuscation signals, we define a deterministic notion of privacy preservation. In this definition, privacy preservation for an agent means that neither the private reference value nor a finite set of values to which the private reference value of the agent belongs to can be obtained. Then, we evaluate the agents' privacy against eavesdroppers with different knowledge sets.

关键词： Privacy Laplace equations Additives Convergence Perturbation methods Heuristic algorithms Sufficient conditions consensus algorithm network systems privacy preservation

来源：评论

学校读者我要写书评

暂无评论

Context-Aware consensus algorithm for Blockchain-Empowered Federated Learning

引用

IEEE TRANSACTIONS ON CLOUD COMPUTING 2024年第2期12卷 491-503页

作者： Zhao, Yao Qu, Youyang Xiang, Yong Chen, Feifei Gao, Longxiang Deakin Univ Sch Informat Technol Burwood Vic 3125 Australia Qilu Univ Technol Shandong Acad Sci Shandong Comp Sci CtrMinist EducKey Lab Comp Pow Shandong Fundamental Res Ctr Comp SciShandong Pro Jinan 250316 Peoples R China

Supported by cloud computing, Federated Learning (FL) has experienced rapid advancement, as a promising technique to motivate clients to collaboratively train models without sharing local data. To improve the security and fairness of FL implementation, numerous Blockchain-empowered Federated Learning (BFL) frameworks have emerged accordingly. Among them, consensus algorithms play a pivotal role in determining the scalability, security, and consistency of BFL systems. Existing consensus solutions to block producer selection and reward allocation either focus on well-resourced scenarios or accommodate BFL based on clients' contributions to model training. However, these approaches limit consensus efficiency and undermine reward fairness, due to involving intricate consensus processes, disregarding clients' contributions during blockchain consensus, and failing to address lazy client problems (malicious clients plagiarizing local model updates from others to reap rewards). Given the aforementioned challenges, we make the first attempt to design a joint solution for efficient consensus and fair reward allocation in heterogeneous BFL systems with lazy clients. Specifically, we introduce a generalizable BFL workflow that can address lazy client problems well. Based on it, the global contribution of BFL clients is decoupled into five dominant metrics, and the block producer selection problem is formulated as a reward-constraint contribution maximization problem. By addressing this problem, the optimal block producer that maximizes global contribution can be identified to orchestrate consensus processes, and rewards are distributed to clients in proportion to their respective global contributions. To achieve it, we develop a Context-aware Proof-of-Contribution consensus algorithm named CPoC to reach consensus and incentive simultaneously, followed by theoretical analysis of lazy client problems and privacy issues. Empirical results on widely-used datasets demonstrate the ef

关键词： Training Blockchains Delays Computational modeling consensus algorithm Federated learning Cloud computing blockchain federated learning lazy client incentive mechanism

来源：评论

学校读者我要写书评

暂无评论

Proof of Work Is a Stigmergic consensus algorithm Unlocking Its Potential

引用

IEEE ROBOTICS & AUTOMATION MAGAZINE 2022年第2期29卷 21-32页

作者： Gurcan, Onder Univ Paris Saclay CEA List F-91120 Palaiseau France

The proof-of-work (PoW) algorithm has been initially used in Bitcoin and is now one of the mainstream consensus algorithms to create immutable ledgers of transactions. However, it is still not very well understood, and as such, its entire strength remains undervalued. While some researchers classify it as a Nakamoto consensus algorithm, some other researchers do not even consider it as a consensus algorithm. In this article, the objective is to shed light on classifying PoW. To this end, we make a theoretical analysis from a coordination perspective, and then we conclude that PoW is a stigmergic consensus algorithm where the trace left by an action in the blockchain through indirect coordination of agents stimulates a subsequent action and eventually creates a single chain of blocks. In other words, PoW is a form of stigmergic coordination toward emergent behavior of a blockchain system. Based on this identification, we further analyze the fundamental properties of PoW. Finally, we reengineer PoW by improving its missing stigmergic mechanisms, and we provide a discussion.

关键词： Blockchains Bitcoin consensus algorithm Heuristic algorithms Manganese Computational modeling Classification algorithms Behavioral sciences Proof of work

来源：评论

学校读者我要写书评

暂无评论

Multimaster Node Byzantine Fault-Tolerant consensus algorithm Based on Consistent Hash algorithm

引用

COMPUTER 2023年第11期56卷 48-63页

作者： Wu, Guangfu Li, Enning Wei, Taigui JiangXi Univ Sci & Technol Sch Informat Engn Ganzhou 341009 Jiangxi Peoples R China State Key Lab Cryptol Beijing 100000 Peoples R China JiangXi Univ Sci & Technol Ganzhou 341009 Jiangxi Peoples R China JiangXi Univ Sci & Technol Informat & Commun Engn Ganzhou 341009 Jiangxi Peoples R China

We propose a consensus mechanism based on the consistent hash algorithm for multiple master nodes. The consensus mechanism uses a consistent hash algorithm to select consensus group nodes and common nodes and further ... 详细信息

关键词： Fault tolerant systems consensus algorithm consensus protocol Hash functions

来源：评论

学校读者我要写书评

暂无评论

Teegraph: trusted execution environment and directed acyclic graph-based consensus algorithm for IoT blockchains

引用

Science China(Information Sciences) 2022年第3期65卷 269-271页

作者： Xiang FU Huaimin WANG Peichang SHI Xingkong MA Xunhui ZHANG College of Computer National University of Defense Technology

Dear editor,Owing to the recent advancements in the field of Internet of things(Io T), the use of Io T devices has increased in every aspect of human life, such as smart cities, Internet of medical things, and Internet of vehicles [1]. Such devices gather data from the surrounding environment and communicate with each other via the Internet. However, it is difficult for such non-trustable devices to collaborate without a trusted intermediary [2]. According to IBM, blockchains [3,4],

关键词： Blockchain DAG Byzantine fault-tolerant consensus algorithm TEE

来源：评论

学校读者我要写书评

暂无评论

Weighted Byzantine Fault Tolerance consensus algorithm for enhancing consortium blockchain efficiency and security

引用

JOURNAL OF KING SAUD UNIVERSITY-COMPUTER AND INFORMATION SCIENCES 2022年第10期34卷 8370-8379页

作者： Qin, Hongwu Cheng, Yuntao Ma, Xiuqin Li, Fei Abawajy, Jemal Northwest Normal Univ Lanzhou 730070 Peoples R China Deakin Univ Cyber Secur Res & Innovat Ctr Geelong Vic 3220 Australia

In blockchain, the consensus algorithm is a core component that governs the trust among the participants in the blockchain activities. However, the exiting consensus algorithms suffer from performance bottle-neck such as low throughput, high delay, unstable performance, sustainability issues and vulnerability to targeted attacks. In this paper, we propose a new consortium blockchain consensus algorithm, referred to as Weighted Byzantine Fault Tolerance (WBFT) consensus algorithm that improves system throughput and consensus delay. We introduce a dynamic weighting mechanism for consensus nodes, which enhances the security of blockchain system by weakening the influence of malicious nodes and reduces the probability of malicious behavior. We validate the performance of WBFT experimentally and compare it against Practical Byzantine Fault Tolerance (PBFT) and Reputation-Based Byzantine Fault-Tolerance (RBFT) based approaches. The results show that WBFT substantially outperforms PBFT and RBFT in terms of system throughput, consensus delay and security.(c) 2022 The Authors. Published by Elsevier B.V. on behalf of King Saud University. This is an open access article under the CC BY-NC-ND license (http://***/licenses/by-nc-nd/4.0/).

关键词： Blockchain consensus algorithm Consortium Blockchain PBFT Weighted Byzantine Fault Tolerance

来源：评论

学校读者我要写书评

暂无评论

Distributed Beamforming Using a consensus algorithm for Cooperative Relay Networks

引用

IEEE COMMUNICATIONS LETTERS 2011年第4期15卷 368-370页

作者： Choi, Jinho Swansea Univ Sch Engn Swansea SA2 8PP W Glam Wales

For distributed beamforming with multiple relay nodes (RNs), we consider a minimum mean square error (MMSE) criterion with a dual decomposition method and consensus algorithm to decide relay weights for RNs with local communications between RNs. It is shown that the proposed MMSE-based distributed beamforming has a comparable performance to the maximum signal to noise ratio (MSNR) based distributed beamforming at medium to low signal to noise ratio (SNR) or with a smaller number of RNs.

关键词： Cooperative relay networks distributed beamforming consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

A consensus algorithm in CAT(0) space and its application to distributed fusion of phylogenetic trees

引用

JOURNAL OF MATHEMATICAL ANALYSIS AND APPLICATIONS 2018年第2期459卷 1149-1159页

作者： Chen, Sheng Shi, Peng Lim, Cheng-Chew Lu, Zhenyu Nanjing Univ Informat Sci & Technol Sch Informat & Control B DAT CICAEET Nanjing 210044 Jiangsu Peoples R China Univ Adelaide Sch Elect & Elect Engn Adelaide SA 5005 Australia Nanjing Univ Informat Sci & Technol Sch Elect & Informat Engn Nanjing 210044 Jiangsu Peoples R China

Based on convex analysis, a novel consensus algorithm of dynamical points in a CAT(0) space is developed in this paper, in which the associated communication graph uniformly contains a directed spanning tree. The proposed algorithm provides an efficient method of solving consensus problems in a general CAT(0) space, while having certain robustness against weak communication. The application of the new algorithm to the distributed fusion of phylogenetic trees is shown with demonstrative-case simulations, together with a study on the algorithm's robustness and efficiency. (C) 2017 Elsevier Inc. All rights reserved.

关键词： Geometric space consensus algorithm Data fusion Tree-type data

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：