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

IEEE TRANSACTIONS ON AUTOMATIC CONTROL 2024年第1期69卷 645-650页

作者： Corless, Martin J. Coduti, Leonardo Purdue Univ Sch Aeronaut & Astronaut W Lafayette IN 35758 USA Dynetics Huntsville AL 35806 USA

In this article, we consider a network of agents running a linear or nonlinear consensus algorithm with the following goal: in addition to requiring that the outputs of all agents converge to the same value, we also require that a specified linear function of the agent states remains constant during the evolution of the consensus algorithm. To achieve this goal requires the construction of a matrix of weighting parameters with specific properties. In this article, we present a noniterative centralized algorithm and an iterative decentralized algorithm for determining the weighting parameters. In the decentralized algorithm, the weighting parameters are specified by the agents and each agent only specifies the weighting parameters associated with the agents to which it communicates. The results do not require that the communication graph of the network be bidirectional. The results of this article can also be applied to consensus problems where one wants to achieve consensus to a specified weighting of the initials states of the network.

关键词： Resource management Topology Null space Network topology Behavioral sciences Laplace equations consensus algorithm consensus

来源：评论

学校读者我要写书评

暂无评论

AVERAGE-CASE OPTIMIZATION ANALYSIS FOR DISTRIBUTED consensus algorithmS ON REGULAR GRAPHS

arXiv

引用

arXiv 2024年

作者： Nguyen, Nhat Trung Rogozin, Alexander Gasnikov, Alexander MIPT Russia MIPT Innopolis University Russia Innopolis University IITP MIPT Russia

The consensus problem in distributed computing involves a network of agents aiming to compute the average of their initial vectors through local communication, represented by an undirected graph. This paper focuses on the studying of this problem using an average-case analysis approach, particularly over regular graphs. Traditional algorithms for solving the consensus problem often rely on worst-case performance evaluation scenarios, which may not reflect typical performance in real-world applications. Instead, we apply average-case analysis, focusing on the expected spectral distribution of eigenvalues to obtain a more realistic view of performance. Key contributions include deriving the optimal method for consensus on regular graphs, showing its relation to the Heavy Ball method, analyzing its asymptotic convergence rate, and comparing it to various first-order methods through numerical experiments. Copyright © 2024, The Authors. All rights reserved.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

Distributed Collaborative Control of Reconfigurable Battery Energy Storage Based on consensus algorithms

Distributed Collaborative Control of Reconfigurable Battery ...

引用

IEEE International Conference on Power and Power and Renewable Energy (ICPRE)

作者： Manshang Wang Yiran Xu Jinkun Guo Libo Jiang Tianwen Zheng State Grid Jiangsu Electric Power Co. Ltd. Zhenjiang Power Supply Company Zhenjiang China Sichuan Energy Internet Research Institute Tsinghua University Chengdu Sichuan

ISBN: (数字)9798350377460

ISBN: (纸本)9798350377477

To enhance the high-reliability operation capability of reconfigurable battery energy storage systems, a distributed cooperative control method of reconfigurable battery energy storage based on consensus algorithms is proposed in this paper, which can improve the frequency and power characteristics of the system. Firstly, the mathematical model of virtual synchronous generator(VSG) control, the structure of reconfigurable battery energy storage system, and the parallel VSG distributed architecture are introduced; Secondly, combined with the mathematical model of VSG control, the overall scheme of frequency recovery and power output reasonable distribution of VSG parallel system is designed; Then, according to the structural characteristics of reconfigurable battery energy storage, a battery pack reconfiguration strategy is proposed, which can meet the power output demand through the free combination of battery packs; Finally, a simulation model is built in Matlab/Simulink environment, and the simulation results verify the correctness and effectiveness of the proposed method.

关键词： Renewable energy sources Battery energy storage system Simulation Collaboration consensus algorithm Mathematical models Stability analysis Batteries State of charge Frequency control

来源：评论

学校读者我要写书评

暂无评论

Fixed-Time consensus for Disturbed Fractional- Order Multiagent Systems With Digraphs: An Estimator-Based Continuous Approach

引用

IEEE TRANSACTIONS ON NETWORK SCIENCE AND ENGINEERING 2024年第1期11卷 1176-1187页

作者： Gong, Ping Ahn, Choon Ki Guangdong Univ Foreign Studies Sch Math & Stat Guangzhou 510006 Peoples R China Korea Univ Sch Elect Engn Seoul 136701 South Korea

The aim of this study is to examine the fixed-time consensus problem (including the leaderless consensus problem and tracking problem) of disturbed fractional-order multiagent systems (FOMASs) under general directed graphs (digraphs). In the tracking problem of a disturbed FOMAS, a dynamic leader subjected to nonzero input is considered, where the input is upper-bounded and unknown to other agents. To solve the leaderless consensus problem, a continuous control law using a disturbance estimator is first developed as the fully distributed leaderless consensus algorithm. Then, to solve the tracking problem, a fully distributed tracking algorithm using the disturbance estimator and a leader estimator is further developed, where the leader estimator is designed to estimate the dynamic leader. It should be noted that the developed fully distributed leaderless consensus and tracking algorithms possess chattering avoidance, zero-error fixed-time convergence, and complete disturbance-rejecting properties. In addition, a rigorous stability analysis based on the fixed-time Lyapunov stability theory is conducted, and the upper bounds of the convergence times are estimated explicitly, which are irrelevant to any initial conditions. Finally, numerical simulation results are provided to validate the developed algorithms.

关键词： Convergence consensus algorithm Heuristic algorithms Upper bound Uncertainty Multi-agent systems Integrated circuit modeling Fixed-time consensus fixed-time tracking continuous distributed algorithm fractional-order multiagent system (FOMAS)

来源：评论

学校读者我要写书评

暂无评论

PrestigeBFT: Revolutionizing View Changes in BFT consensus algorithms with Reputation Mechanisms

PrestigeBFT: Revolutionizing View Changes in BFT Consensus A...

引用

International Conference on Data Engineering

作者： Gengrui Zhang Fei Pan Sofia Tijanic Hans-Arno Jacobsen University of Toronto

ISBN: (数字)9798350317152

ISBN: (纸本)9798350317169

Passive view-change protocols are widely employed in BFT algorithms; however, they present the risks of selecting unavailable or slow servers as leaders. To tackle these challenges, we propose PrestigeBFT, a novel BFT consensus algorithm that incorporates an active view-change protocol with reputation mechanisms. PrestigeBFT evaluates a server's reputation based on its past behavior and elects more reputable servers as leaders. Our reputation mechanism incentivizes protocol-abiding behavior while penalizing faulty servers by imposing computational work. PrestigeBFT significantly enhances system availability and efficiency by avoiding unavailable or slow servers being assigned as leaders. Under normal operation, PrestigeBFT achieves $5\times$ higher throughput than the baseline that uses passive view-change protocols. In addition, PrestigeBFT's throughput remains unaffected under benign faults and witnesses only a 24% drop under a variety of Byzantine faults, whereas the baseline throughput drops by 62% and 69%, respectively. In the long run, while the baseline's availability struggles at 37%, PrestigeBFT progressively improves its availability to over 90%.

关键词： Leadership Fault tolerance Protocols Fault tolerant systems consensus algorithm Throughput Data engineering

来源：评论

学校读者我要写书评

暂无评论

A Trust-Based Hierarchical consensus Mechanism for Consortium Blockchain in Smart Grid

引用

Tsinghua Science and Technology 2023年第1期28卷 69-81页

作者： Xingguo Jiang Aidong Sun Yan Sun Hong Luo Mohsen Guizani School of Computer Science(National Pilot Software Engineering School) Beijing University of Posts and TelecommunicationsBeijing 100876China Institute of Food safety and Nutrition Jiangsu Academy of Agricultural SciencesNanjing 210000China Computer Science and Engineering Department Qatar UniversityDoha 2713Qatar

As the smart grid develops rapidly,abundant connected devices offer various trading *** raises higher requirements for secure and effective data *** centralized data management does not meet the above ***,smart grid with conventional consortium blockchain can solve the above ***,in the face of a large number of nodes,existing consensus algorithms often perform poorly in terms of efficiency and *** this paper,we propose a trust-based hierarchical consensus mechanism(THCM)to solve this ***,we design a hierarchical mechanism to improve the efficiency and ***,intra-layer nodes use an improved Raft consensus algorithm and inter-layer nodes use the Byzantine Fault Tolerance ***,we propose a trust evaluation method to improve the election process of ***,we implement a prototype system to evaluate the performance of *** results demonstrate that the consensus efficiency is improved by 19.8%,the throughput is improved by 12.34%,and the storage is reduced by 37.9%.

关键词： consortium blockchain consensus algorithm trust evaluation method smart grid Internet of Things(IoT)

来源：评论

学校读者我要写书评

暂无评论

Multiagent Control in Modular Motor Drives by Means of Deterministic consensus

引用

IEEE TRANSACTIONS ON INDUSTRIAL ELECTRONICS 2023年第2期70卷 1205-1215页

作者： Verkroost, Lynn De Belie, Frederik Sergeant, Peter Vansompel, Hendrik Univ Ghent Dept Electromech Syst & Met Engn Elect Energy Lab B-9000 Ghent Belgium Flanders Make UGent EEDT MP B-3001 Leuven Belgium Flanders Make UGent EEDT DC B-3001 Leuven Belgium

A modular motor drive (MMD) is composed of multiple identical pole drive units (PDUs), which consist of a concentrated stator winding fed by a dedicated power electronic converter module. To exploit the full flexibility and reliability of these MMDs, they are equipped with multiple controllers, operating as synchronized peers, and each driving only a limited set of PDUs. An MMD can hence be considered as a multiagent system, in which all the agents cooperate to deliver a certain torque demand. The goal of this work is to distribute this torque demand among the agents of a modular drive in a completely decentralized way, in order to comply with the flexibility and reliability of the hardware, while still taking into account the present condition of each agent. A deterministic consensus algorithm is used for this purpose, in combination with decentralized proportional integral (PI) current controllers. Communication is only allowed between neighboring agents, to limit the communication load. It is shown in this article that the total torque demand is delivered, under healthy conditions as well as during agent malfunctions and with nonidentical agents. The concept is demonstrated on a modular axial-flux permanent magnet synchronous machine with 15 PDUs that are assigned to five agents.

关键词： Torque Motor drives consensus algorithm Costs Windings Inverters Decentralized control consensus distributed control fault tolerance modular motor drive (MMD) multiagent system

来源：评论

学校读者我要写书评

暂无评论

Real-Time Privacy-Preserving Average consensus and Its Application to Secondary Control for AC Microgrid

引用

IEEE TRANSACTIONS ON INDUSTRIAL INFORMATICS 2024年第7期20卷 9655-9669页

作者： Wang, Ziqiang Wang, Jie La Scala, Massimo Xiong, Linyun Shanghai Jiao Tong Univ Sch Elect Informat & Elect Engn Shanghai 200240 Peoples R China Dept Elect Engn Politecn Bari I-70125 Bari Italy Chongqing Univ Sch Elect Engn Chongqing 400044 Peoples R China

Recent studies of the privacy-preserving consensus guarantee the initial-value privacy but leave real-time running values of consensus states unprotected with respect to external eavesdroppers. In this article, a novel real-time privacy-preserving average consensus algorithm is proposed to fill this gap by utilizing the quasi-resonance (QR) algorithm and the mask function with real-time privacy-preserving property based on the multifrequency (MF) sinusoids. Several kinds of sinusoids are included in the mask function to achieve the privacy preservation of the initial value and real-time values simultaneously, such as nondecaying and exponentially-decaying MF sinusoids. The QR algorithm can achieve the exact consensus because of its high control gain on a specific resonant frequency in MF sinusoids. The designed privacy-preserving average consensus algorithm will not increase the communication pressure since the single signal of the sum of MF sinusoids is transmitted to evade increasing information amount. As an application of the developed consensus algorithm, the privacy-preserving distributed secondary control of the islanded ac microgrid is obtained to achieve active power sharing and frequency restoration.

关键词： Real-time systems consensus algorithm Privacy Multi-agent systems Resonant frequency Network systems Microgrids Multiagent systems multifrequency (MF) sinusoids privacy-preserving consensus quasi-resonance (QR)

来源：评论

学校读者我要写书评

暂无评论

A Comprehensive Examination of consensus algorithms and Their Impact on Blockchain Scalability

A Comprehensive Examination of Consensus Algorithms and Thei...

引用

Innovations in Communications, Electrical and Computer Engineering (ICICEC), International Conference on

作者： M Veera Brahmam Y Laxmi Prasanna V T Ram Pavan Kumar M Kanneboina Ashok K V S S R Murthy S Sindhura Computer Science & Engineering (Data Science) Bapatla Engineering College Bapatla India Computer Science & Engineering (AI&ML) Anurag Engineering College Ananthagiri Suryapet India Computer Science Kakaraparti Bhavanarayana College Vijayawada Andhra Pradesh India School of Engineering Mallareddy University Hyderabad Telangana India Computer Science & Engineering SRKR Engineering College(A) Bhimavaram India Computer Science & Engineering NRI Institute of Technology Agiripalli Vijayawada India

ISBN: (数字)9798350376517

ISBN: (纸本)9798350376524

This paper goes one step ahead into a suggested testbed design with which empirical analysis can be carried out. Deep, extended consensus methods and their relative impact on blockchain scalability are analyzed. Our experimental configuration is based on two mining nodes and a master node, and to be precise, it is a blockchain network consisting of five physical nodes arranged in such a way so as to use Proof of Work (PoW) and Round Robin as separate consensus procedures. Architecture even ensures safe communication through Java-based remote clients running RPC commands with a JSON base. The performance of each consensus algorithm was tested using a series of scalability tests in order to find the transaction throughput and execution times under a different transaction load. According to the results shown, as the transactions are transmitted in bigger quantities, Round Robin outperforms PoW by way of the number of transactions processing and throughput time. In particular, it presented a comparative advantage relative to Proof of Work in terms of efficiency by processing transactions much faster and maintaining higher throughput levels. Overall, these results highlight the significance of properly selecting the consensus algorithm in the quest for blockchain performance optimization, especially under scenarios where fast transaction processing is paramount. In a nutshell, this study will conclude with the trade-off between efficiency and decentralization of blockchains within applications and recommend Round Robin as a feasible solution if speed in transaction matters.

关键词： Technological innovation Scalability consensus algorithm Computer architecture Throughput Proof of Work Blockchains Round robin Optimization

来源：评论

学校读者我要写书评

暂无评论

Proxy-based Open-Zeppelin Mechanism with consensus algorithms for Art Trading System

Proxy-based Open-Zeppelin Mechanism with Consensus Algorithm...

引用

Distributed Systems, Computer Networks and Cybersecurity (ICDSCNC), International Conference on

作者： Wei Na Guangzhou Institute of Science and Technology Guangzhou China

ISBN: (数字)9798350375442

ISBN: (纸本)9798350375459

Blockchain is one of the most revolutionized technologies in worldwide industry to generate a reliable association in multi-party business networks such as the Art Trading (AT) industry. However, art trading system applications with blockchain functions such as consensus algorithms (CA) face an initialization issue and counterfeiting problems. In this paper, to overcome the initialization issue in smart contracts, Proxy-based Open-Zeppelin Mechanism with consensus algorithms for Art Trading (POZM-CA-AT) is used. Then, product authentication with Quick Response (QR) code is used along with proxy contracts to reduce the counterfeiting problems. Initially, frontend and backend stages are developed with java language with various features. Here, the front-end consists of overall information of a consumer including registration, login and other artwork information. While, the artwork management and transaction management such as balance, transfer, withdrawals are done in the back-end. After that, the information is converted into tokens with the help of tokenization and then, blockchain functions such as smart contracts and POZM-CA-AT are implemented to the application to achieve security, privacy and confidentiality. From the analysis, the proposed POZM-CA-AT application executed 100 transactions in 15 sec which is better than existing AT applications.

关键词： Industries Java Privacy Art Smart contracts consensus algorithm Tokenization Blockchains Reliability Counterfeiting

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：