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

On the Influence of Noise in Randomized consensus algorithms

IEEE CONTROL SYSTEMS LETTERS 2021年第3期5卷 1025-1030页

作者： Vizuete, Renato Frasca, Paolo Panteley, Elena Univ Paris Saclay CNRS Cent Supelec Lab Signaux & Syst F-91190 Gif Sur Yvette France Univ Grenoble Alpes CNRS INRIA Grenoble INPGIPSA Lab F-38000 Grenoble France

In this letter, we study the influence of additive noise in randomized consensus algorithms. Assuming that the update matrices are symmetric, we derive a closed form expression for the mean square error induced by the noise, together with upper and lower bounds that are simpler to evaluate. Motivated by the study of Open Multi-Agent Systems, we concentrate on Randomly Induced Discretized Laplacians, a family of update matrices that are generated by sampling subgraphs of a large undirected graph. For these matrices, we express the bounds by using the eigenvalues of the Laplacian matrix of the underlying graph or the graph's average effective resistance, thereby proving their tightness. Finally, we derive expressions for the bounds on some examples of graphs and numerically evaluate them.

关键词： consensus algorithm random graph average effective resistance open systems

来源：评论

学校读者我要写书评

暂无评论

Computable Convergence Rate Bound for Ratio consensus algorithms

引用

IEEE CONTROL SYSTEMS LETTERS 2022年 6卷 3307-3312页

作者： Gerencser, Balazs Alfred Renyi Inst Math Dept Probabil & Stat H-1053 Budapest Hungary Eotvos Lorand Univ Dept Probabil & Stat H-1117 Budapest Hungary

The objective of this letter is to establish a computable upper bound for the almost sure convergence rate for a class of ratio consensus algorithms defined via column-stochastic matrices. Our result extends the works of Iutzeler et al. from 2013 on similar bounds that have been obtained in a more restrictive setup with limited conclusions. The present paper complements results by Gerencser and Gerencser from 2022, identifying the exact almost sure convergence rate of a wide class of ratio consensus algorithms in terms of a spectral gap, which is, however, not computable in general. The upper bound provided in this letter will be compared to the actual rate of almost sure convergence experimentally on a range of modulated random geometric graphs with random local interactions.

关键词： Convergence consensus algorithm Upper bound Protocols Technological innovation Directed graphs Tensors Agents-based systems randomized algorithms stochastic systems

来源：评论

学校读者我要写书评

暂无评论

Zero-determinant Strategy for the algorithm optimize of Blockchain PoW consensus 36

Zero-determinant Strategy for the Algorithm optimize of Bloc...

引用

第36届中国控制会议

作者： Yang Zhen Miao Yue Chen Zhong-yu Tang Chang-bing Chen Xin College of Mathematics Physics & Information EngineeringZhejiang Normal University

ISBN: (纸本)9781538629185

The Proof of Work(Po W) consensus algorithm guarantees the safety and dependability of Blockchain systems. Miners can achieve a consensus through the Po W algorithm during the mining process, that is mutual attacking. However, when the miners attack each other, all miners earn less. In this paper, we established a model that mining between two miners is an iterative game, and proposed a subclass of ZD strategy(a pining strategy) to alleviate miners’ dilemma, a miner can control another miner’s payoff and increase the social revenue through a pinning strategy. Numerical simulation results verify the effectiveness of the proposed strategy. In summary, this work leads to the better understanding and analysis of the Po W algorithm via the game theory, rendering it possible to design a more rational consensus algorithm in the future.

关键词： Blockchain consensus algorithm PoW Iterative game ZD strategy

来源：评论

学校读者我要写书评

暂无评论

Data Integrity Attack on consensus-based Load Shedding algorithm for Power Systems 43

Data Integrity Attack on Consensus-based Load Shedding Algor...

引用

43rd Annual Conference of the IEEE-Industrial-Electronics-Society (IECON)

作者： Duan, Jie Chow, Mo-Yuen North Carolina State Univ Dept Elect & Comp Engn Raleigh NC 27695 USA

ISBN: (纸本)9781538611272

The paper presents a novel data integrity attack on consensus-based load shedding algorithm. In particular, we show that by sending out elaborately falsified information during the consensus iterations, attackers could manipulate the system operating point to achieve selfish goals, e.g. loads remain being served under contingencies while shedding other loads. More importantly, still maintain the system stability. This data integrity attack has three major features: 1) no additional information about system topology or other devices are required to launch the attack;2) the attacking effect is accumulative which enables attackers to complete the attacks in either single or multiple iterations;3) attackers could fulfill their goal using the local agent alone, no other agents need to be compromised during the attack. By revealing such potential risks, this paper conveys the message that besides the efforts of designing novel consensus-based applications, it is equally important to protect distributed smart grid applications from possible malicious cyber-attacks. The potential impact of the data integrity attacks is illustrated on simulation examples.

关键词： consensus algorithm distributed control load shedding cyber attacks

来源：评论

学校读者我要写书评

暂无评论

A consensus-based Filtering algorithm with State Constraints 36

A Consensus-based Filtering Algorithm with State Constraints

引用

第36届中国控制会议

作者： Yajing Ma Song Guo Shuyi Lin Yunze Cai Department of Automation Shanghai Jiao Tong Universityand Key Laboratory of System Control and Information ProcessingMinistry of Education of China Shanghai Academy of Spaceflight Technology

ISBN: (纸本)9781538629185

This paper proposes a consensus-based filtering algorithm to solve a nonlinear information fusion problem in multi-agent system that the state vector of the target is *** method is based on the Kalman-consensus filtering algorithm,Extended Kalman filter and null space *** on target tracking prove the feasibility of the algorithm in dealing with state estimation of nonlinear systems under linear and nonlinear *** is demonstrated that a significant increase in the tracking precision can be expected via the proposed method compared with traditional Kalman-consensus filter.

关键词： State Estimation Constrained Filtering consensus algorithm Kalman Filter Multi-agent System

来源：评论

学校读者我要写书评

暂无评论

consensus algorithms based on collusion resistant publicly verifiable random number seeds

引用

COMPUTER STANDARDS & INTERFACES 2024年 90卷

作者： Wang, Ping Cao, Longhuai Hu, Yong Sun, Zhiwei Shenzhen Univ Coll Elect & Informat Engn Shenzhen 518060 Peoples R China Guangdong Key Lab Intelligent Informat Proc Shenzhen Peoples R China Shenzhen Polytech Sch Artificial Intelligence Shenzhen 518055 Peoples R China

Publicly verifiable random number seeds are widely used in distributed systems and applications, especially in consensus algorithms. The purpose was to distribute the tasks and benefits among the participants fairly. A secure and efficient consensus algorithm is the foundation and guarantee of blockchain. We have been working on more concise, fair, and secure blockchain consensus algorithms. In this paper, we propose a new, more concise, efficient, and publicly verifiable random number seed generation scheme based on the existing secret sharing scheme and one-way function. We combined it with two blockchain consensus algorithms to improve the security and efficiency of the original scheme.

关键词： Publicly verifiable random number seeds Blockchain consensus algorithm Secret sharing

来源：评论

学校读者我要写书评

暂无评论

Key Characteristics to Create Optimized Blockchain consensus algorithms 20th

Key Characteristics to Create Optimized Blockchain Consensus...

引用

20th IFIP WG 6.11 Conference on e-Business, e-Services, and e-Society (I3E)

作者： Leo, J. Hattingh, M. J. Univ Pretoria Private Bag X20 ZA-0028 Pretoria South Africa

ISBN: (纸本)9783030854461;9783030854478

Blockchain is a fairly new technology and still in its infancy. As a result, many research papers are creating optimized consensus algorithms. Therefore, a need for key characteristics to create optimized blockchain consensus algorithms has been identified. This research paper presents the results of a systematic literature on identifying the main blockchain consensus algorithms and their associated advantages and disadvantages. Papers from four different databases were retrieved and after exclusion criteria were applied, 44 papers were ultimately included in the review. Results indicated that the five main consensus algorithms were Proof-of-Work (PoW), Proof-of-Stake (PoS), Practical Byzantine Fault Tolerance (PBFT), and Delegated Proof-of-Stake. The results further indicated that efficiency was the main advantage of the PoS, PBFT, PoA and hybrid consensus algorithms. The main disadvantage was "energy wastage" and was attributed to the PoW algorithm. Security concerns were the main disadvantage of the PoS algorithm. These findings were used to present key characteristics that future researchers can have in mind when creating optimized blockchain consensus algorithms.

关键词： Blockchain consensus algorithm Proof-of-Work (PoW) Proof-of-Stake (PoS)

来源：评论

学校读者我要写书评

暂无评论

Blockchain and consensus algorithms in Internet of Things 13

Blockchain and Consensus Algorithms in Internet of Things

引用

13th International Symposium on Electronics and Telecommunications (ISETC)

作者： Zoican, Sorin Vochin, Marius Zoican, Roxana Galatchi, Dan Politehn Univ Telecommun Dept Bucharest Romania

ISBN: (纸本)9781538659250

this paper focuses on the performance evaluation of consensus algorithms used in a blockchain system for Internet of Things (IoT). In such systems the time necessary to achieve consensus should be small. Three most used consensus algorithms (modified proof of work, practical byzantine fault tolerance and binary consensus) are evaluated in different situations - type of motes, number of nodes participating in consensus algorithm and radio propagation model. An integrated solution is proposed to adapt an IoT node to different consensus algorithm. The simulations in Contiki IoT operating system show good performance (time to achieve consensus less than seconds)

关键词： consensus algorithm Internet of Things blockchain

来源：评论

学校读者我要写书评

暂无评论

Describing and verifying malicious fault-tolerant consensus algorithms using PlusCAL and C languages 29

Describing and verifying malicious fault-tolerant consensus ...

引用

29th Pacific Rim International Symposium on Dependable Computing

作者： Ono, Aoi Tsuchiya, Tatsuhiro Osaka Univ Suita Osaka Japan

Designing distributed algorithms is challenging owing to asynchrony and faults. In this study, we formally describe two malicious fault-tolerant consensus algorithms using two languages, PlusCAL and C, and perform mod... 详细信息

ISBN: (纸本)9798331540746;9798331540753

关键词： consensus algorithm malicious fault model checking PlusCAL TLC CBMC

来源：评论

学校读者我要写书评

暂无评论

Distributed Formation Control of Autonomous Underwater Vehicles Based on Flocking and consensus algorithms 10th

Distributed Formation Control of Autonomous Underwater Vehic...

引用

10th International Conference on Intelligent Robotics and Applications (ICIRA

作者： Pan, Wuwei Jiang, Dapeng Pang, Yongjie Qi, Yuda Luo, Daichao Harbin Engn Univ Sci & Technol Underwater Vehicle Lab Harbin 150001 Peoples R China

ISBN: (纸本)9783319652894;9783319652887

In this paper, a distributed formation controller of autonomous underwater vehicles is presented. An artificial potential field is proposed based on the Lennard-Jones potential. A weight function is designed to make the potential smoothly die off at the boundaries. A control algorithm is proposed according to the three rules of Reynolds: flock centering, collision avoidance and velocity matching. A single-step target tracking method is proposed to translate the desired acceleration, produced by the potential force, to the desired velocity and heading for the AUV. To make the algorithm distributed, each AUV holds a copy of the virtual leader and calculates the guidance information individually. A consensus algorithm is proposed to make the mismatches convert to zeros. A fold line and a curve line path following of the fleet are simulated, with random initial positions of the AUVs. Under the formation control algorithms proposed, the AUVs are uniformly distributed and form a lattice-like formation. We increase the number of AUVs, and the algorithm serves well, which shows good availability and flexibility.

关键词： Autonomous underwater vehicle Distributed control Formation control Flocking algorithm consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：