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

DynaNet: A dynamic BFT consensus framework

JOURNAL OF SYSTEMS ARCHITECTURE 2025年 162卷

作者： Li, Jiarui Zhang, Guoyan Liu, Duan Zhou, Fei Li, Leibo Meng, Weizhi Shandong Univ Qingdao Shandong Peoples R China Shandong Inst Blockchain Jinan Shandong Peoples R China Tech Univ Denmark Lyngby Denmark

In a blockchain system, allowing nodes to change during runtime through consensus protocols is an effective way to enhance the scalability and security of the blockchain. However, some limitations of the traditional membership change methods prevent them from meeting the continuously expanding scale of blockchain networks. The paper proposes a membership change framework based on byzantine fault tolerance (BFT) consensus: DynaNet. Compared to similar membership change methods, DynaNet can make any number of members join and leave the system with just one consensus round and offer tremendous flexibility: it can be integrated with most synchronous BFT consensus protocols, endowing it with membership change capabilities. We showcase its integration with HotStuff: D-HotStuff and prove its safety and liveness. The experiment shows that D-HotStuff performs well in latency and throughput, and its multi-node change mode is more practical.

关键词： consensus algorithm Membership change Dynamic BFT Partially synchronous model

来源：评论

学校读者我要写书评

暂无评论

Differentially Private Average consensus of Multi-Agent Systems via Privacy-Based Dynamic Self-Triggered Mechanism

引用

IEEE TRANSACTIONS ON NETWORK SCIENCE AND ENGINEERING 2024年第5期11卷 4227-4240页

作者： Yang, Yang Qi, Chang Yue, Wenbin Nanjing Univ Posts & Telecommun Coll Automat Nanjing 210023 Peoples R China Nanjing Univ Posts & Telecommun Coll Artificial Intelligence Nanjing 210023 Peoples R China China North Vehicle Res Inst Beijing 100072 Peoples R China

A differentially private average consensus (DPAC) problem for multi-agent systems (MASs) with a dynamic self-triggered mechanism is reported in this paper. With the privacy-based dynamic self-triggered mechanism (PDSTM), a DPAC control algorithm is proposed. An adaptive coupling gain related to privacy measurement errors among agents is introduced in the PDSTM, and the triggered threshold evolves adaptively. The proposed DPAC algorithm enables agents to preserve privacy on initial states of agents from information leakage while enhancing overall network's execution efficiency. The analysis of convergence and accuracy of the algorithm are provided. Moreover, a differential privacy analysis is presented, and the privacy analysis allows agents to flexibly select their own privacy levels. Finally, simulations are conducted to verify the effectiveness of the proposed algorithm.

关键词： Privacy Heuristic algorithms Convergence Measurement errors Differential privacy Couplings consensus algorithm Mean-square average consensus is an element of-differential privacy self-triggered mechanism multi-agent systems

来源：评论

学校读者我要写书评

暂无评论

Differentially Private Bipartite consensus Over Signed Networks With Time-Varying Noises

引用

IEEE TRANSACTIONS ON AUTOMATIC CONTROL 2024年第9期69卷 5788-5803页

作者： Wang, Jimin Ke, Jieming Zhang, Ji-Feng Univ Sci & Technol Beijing Sch Automat & Elect Engn Beijing 100083 Peoples R China Minist Educ Key Lab Knowledge Automat Ind Proc Beijing 100083 Peoples R China Chinese Acad Sci Inst Syst Sci Acad Math & Syst Sci Key Lab Syst & Control Beijing 100190 Peoples R China Univ Chinese Acad Sci Sch Math Sci Beijing 100049 Peoples R China

This article investigates the differentially private bipartite consensus problem over signed networks. To solve this problem, a new algorithm is proposed by adding noises with time-varying variances to the cooperative-competitive interactive information. In order to achieve the privacy protection, the variances of the added noises are allowed to increase, which are substantially different from the existing works. In addition, the variances of the added noises can be either decaying or constant. By using a time-varying step-size based on the stochastic approximation method, we show that the algorithm converges in mean-square and almost-surely even with increasing privacy noises. We further develop a method to design the step-size and the noise parameter, affording the algorithm to achieve the average bipartite consensus with the desired accuracy and the predefined differential privacy level. Moreover, we give the mean-square and almost-sure convergence rates of the algorithm, and the privacy level with different forms of the privacy noises. We also reveal the tradeoff between the accuracy and the privacy, and extend the results to local differential privacy. Finally, a numerical example verifies the theoretical results and demonstrates the algorithm's superiority against existing methods.

关键词： Privacy Convergence Differential privacy consensus algorithm Approximation algorithms Social networking (online) consensus control Convergence rate differential privacy multiagent system signed network stochastic approximation

来源：评论

学校读者我要写书评

暂无评论

Mobile Smart Contracts: Exploring Scalability Challenges and consensus Mechanisms

引用

IEEE ACCESS 2024年 12卷 34265-34288页

作者： Deval, Vipin Dwivedi, Vimal Kumar Dixit, Abhishek Norta, Alex Shah, Syed Attique Sharma, Rahul Draheim, Dirk Tallinn Univ Technol Dept Software Sci EE-12618 Tallinn Estonia KIET Grp Inst Delhi NCR Ghaziabad 201206 India Teesside Univ Sch Comp Engn & Digital Technol Middlesbrough TS1 3BX North Yorkshire England Vardhaman Coll Engn Dept CSE AI & ML Hyderabad 501218 India Tallinn Univ Balt Film Media & Arts Sch EE-10120 Tallinn Estonia Birmingham City Univ Sch Comp & Digital Technol Birmingham B4 7RQ England Tallinn Univ Technol Informat Syst Grp EE-12618 Tallinn Estonia Ajay Kumar Garg Engn Coll Ghaziabad 201009 India

Mobile smart contracts (MSCs) are essential to facilitate quick, safe, and decentralized transactions on mobile blockchain networks. Scalable blockchain solutions facilitate the establishment of a mobile blockchain ecosystem characterized by enhanced resilience and adaptability. This encourages an increase in the number of users and, thus, spreads the adoption of blockchain technology in the mobile domain. With the inception of blockchain technology, a wide range of applications use smart contracts due to their high customizability. However, problems with scalability and resource-intensive consensus procedures prevent their general use. Therefore, this work seeks to identify and analyze these constraints by conducting a systematic survey using Kitchenham's guidelines for available scalable blockchains and consensus methods. Out of a preliminary pool of 2,073 publications, our study, which consists of 25 selected studies, identifies 12 consensus mechanisms and 13 scalable blockchain systems. Our investigation shows that, despite the wide range of techniques, no blockchain solution provides the scalability and lightweight operating requirements to implement smart contracts on mobile devices. This realization draws attention to a significant gap in academic and industry-driven blockchain research that may have implications for creating MSCs. Our findings encourage academics to explore scalable and energy-efficient blockchain technology, targeting creating more approachable smart contracts designed with mobile devices in mind.

关键词： Blockchains Smart contracts consensus protocol Scalability Bitcoin Sharding Reviews Proof of Work Mobile applications Blockchain distributed ledger technology smart contract scalability consensus algorithm proof-of-stake proof-of-work peer-to-peer computing decentralization

来源：评论

学校读者我要写书评

暂无评论

X-RAFT: Improve RAFT consensus to Make Blockchain Better Secure EdgeAI-Human-IoT Data

引用

IEEE TRANSACTIONS ON EMERGING TOPICS IN COMPUTING 2025年第1期13卷 22-33页

作者： Li, Fengqi Wang, Jiaheng Xie, Weilin Tong, Ning Wang, Deguang Dalian Jiaotong Univ Sch software Dalian 116028 Peoples R China Dalian Univ Technol Sch software Dalian 116024 Peoples R China

The proliferation of IoT devices, advancements in edge computing, and innovations in AI technology have created an ideal environment for the birth and growth of Edge AI. With the trend towards the Internet of Everything (IoE), the EdgeAI- Human-IoT architectural framework highlights the necessity for efficient data exchange interconnectivity. Ensuring secure data sharing and efficient data storage are pivotal challenges in achieving seamless data interconnection. Owing to its simplicity, ease of deployment, and consensus-reaching capabilities, the RAFT consensus algorithm, which is commonly used in distributed storage, faces limitations as the IoT scale expands. The computational, communication, and storage capabilities of nodes are constraints, and the security of data remains a concern. To address these complex challenges, we introduce the X-RAFT consensus algorithm, which is tailored for blockchain technology. This algorithm enhances system performance and robustness, mitigates the impact of system load, enhances system sustainability, and increases Byzantine fault tolerance. Through analysis and simulations, our proposed solution has been evidenced to provide reliable security and efficient performance.

关键词： Blockchains Internet of Things Voting Servers Fault tolerant systems Fault tolerance consensus algorithm Computer crashes Throughput Sharding Blockchain EdgeAI- human -IoT internet of things (IoT) RAFT

来源：评论

学校读者我要写书评

暂无评论

Byzantine Fault Tolerant consensus in Open Wireless Networks via an Abstract MAC Layer

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 2025年第3期73卷 1909-1924页

作者： Jing, Guanlin Zou, Yifei Zhang, Zuyuan Yu, Dongxiao Dressler, Falko Cheng, Xiuzhen Shandong Univ Inst Intelligent Comp Qingdao 266200 Peoples R China Shandong Univ Sch Comp Sci & Technol Qingdao 266200 Peoples R China George Washington Univ Sch Engn & Appl Sci Washington DC 20052 USA TU Berlin Sch Elect Engn & Comp Sci D-10587 Berlin Germany

The openness of wireless networks opens the door to Byzantine attacks on the physical channels, making the communications unreliable and resulting in more challenges in achieving consensus among mobile devices. To address this issue, this paper studies the Byzantine-fault-tolerant (BFT) consensus problem based on an unreliable Byzantine communication model. Different from the previous works requiring stable communications between the honest nodes, considering the unreliable communication makes our problem more realistic but also harder. Based on the unreliable communication model, we first implement a BFT abstract MAC (absMAC) layer with a distributed and randomized multi-channel communication algorithm. In the implemented absMAC layer, its acknowledgement and progress operations can be completed within O((kn)/(k-f )log n) and O((k)/(k-f )log n) rounds, respectively. n, f, and k are the numbers of nodes, Byzantine nodes, and channels, respectively. With the implemented absMAC layer, an efficient and elegant BFT consensus algorithm is designed, which can solve the binary consensus problem within O((kn)/(k-f )log n) rounds in expectation. Even though a series of works have discussed how to achieve consensus with a specific absMAC layer provided, to the best of our knowledge, this paper is the first one that implements a BFT absMAC layer.

关键词： Wireless networks Reliability consensus algorithm Protocols Physical layer Jamming Internet of Things Fault tolerant consensus open wireless networks Byzantine-resilience abstract MAC layer

来源：评论

学校读者我要写书评

暂无评论

consensus-Based Distributed Nonlinear Filtering With Kernel Mean Embedding

引用

IEEE TRANSACTIONS ON AEROSPACE AND ELECTRONIC SYSTEMS 2025年第2期61卷 4973-4987页

作者： Guo, Liping Wang, Jimin Zhao, Yanlong Zhang, Ji-Feng Chinese Acad Sci Inst Syst Sci Acad Math & Syst Sci Key Lab Syst & Control Beijing 100190 Peoples R China Univ Sci & Technol Beijing Sch Automat & Elect Engn Beijing Peoples R China Minist Educ Key Lab Knowledge Automat Ind Proc Beijing 100083 Peoples R China Univ Chinese Acad Sci Sch Math Sci Beijing 100049 Peoples R China Zhongyuan Univ Technol Sch Automat & Elect Engn Zhengzhou 450007 Peoples R China

This article proposes a consensus-based distributed nonlinear filter with kernel mean embedding (KME) to fill the gap of kernel-based filters for distributed sensor networks. Specifically, to approximate the posterior distribution, the system state is embedded into a higher dimensional reproducing kernel Hilbert space (RKHS), and then the nonlinear measurement function is linearly represented. As a result, an update rule for the KME of posterior distribution is established in the RKHS. To demonstrate that the proposed distributed filter can achieve centralized estimation accuracy, a centralized filter is first developed by extending the standard Kalman filter in the state space to the RKHS. Then, the proposed distributed filter is proved to be equivalent to the centralized one. Two examples highlight the effectiveness of the developed filters in target tracking scenarios, including a nearly constantly moving target and a turning target, respectively, with range, bearing, and range-rate measurements.

关键词： Filters Kernel Vectors Kalman filters Density functional theory Accuracy Nonlinear filters Estimation Target tracking Posterior probability consensus algorithm distributed sensor network kernel mean embedding (KME) nonlinear filtering posterior approximation

来源：评论

学校读者我要写书评

暂无评论

consensus-Based Distributed Control of Offshore Wind Farms Connected via DR-HVDC

引用

IEEE TRANSACTIONS ON INDUSTRIAL ELECTRONICS 2025年第6期72卷 5936-5947页

作者： Sun, Yuanxiang Kong, Dehao Zhang, Zhenbin Wang, Yongdu Pei, Zhongchen Zhu, Di Heldwein, Marcelo Lobo Tech Univ Munich Chair High Power Converter Syst D-80333 Munich Germany Tech Univ Munich Inst Adv Study D-85748 Garching Germany Shandong Univ Sch Elect Engn Jinan 250061 Peoples R China Dalian Univ Technol Sch Elect Engn Dalian 116024 Peoples R China Northeast Elect Power Univ Sch Elect Engn Jilin 132012 Peoples R China

In offshore wind farms connected via diode-rectifier-based high-voltage dc systems, conventional distributed control strategies of wind turbine (WT) converters suffer from significant coupling between active and reactive power and frequency, leading to large oscillations in WT power and offshore frequency during transients. Upon theoretically analyzing this issue using a small-signal model, this work proposes a novel distributed control strategy to address it. Initially, we propose a specially designed consensus-based global average reactive power observer for each local WT controller, where the consensus algorithm is modified from its basic form to support an adjustable reactive power-sharing ratio. By comparing the observed and actual values of reactive power, a dynamically adjustable virtual impedance control is achieved, completely decoupling active and reactive power control. In addition, global reactive power values are also used in frequency droop control as local references, decoupling reactive power and frequency control while achieving proportional reactive power-sharing. Experimental results confirm that the proposed solution eliminates transient oscillations of reactive power and frequency compared to existing conventional and decoupled control methods.

关键词： consensus algorithm distributed control droop control offshore wind turbine (WT) converter consensus algorithm distributed control droop control offshore wind turbine (WT) converter

来源：评论

学校读者我要写书评

暂无评论

Nicaea: A Byzantine Fault Tolerant consensus Under Unpredictable Message Delivery Failures for Parallel and Distributed Computing

引用

IEEE TRANSACTIONS ON COMPUTERS 2025年第3期74卷 915-928页

作者： Jing, Guanlin Zou, Yifei Xu, Minghui Zhang, Yanqiang Yu, Dongxiao Shan, Zhiguang Cheng, Xiuzhen Ranjan, Rajiv Shandong Univ Inst Intelligent Comp Sch Comp Sci & Technol Qingdao 266237 Peoples R China State Informat Ctr Dept Informatizat & Ind Dev Beijing 100804 Peoples R China Newcastle Univ Sch Comp Newcastle Upon Tyne NE1 7RU England

Byzantine fault-tolerant (BFT) consensus is a critical problem in parallel and distributed computing systems, particularly with potential adversaries. Most prior work on BFT consensus assumes reliable message delivery and tolerates arbitrary failures of up to n3 nodes out of n total nodes. However, many systems face unpredictable message delivery failures. This paper investigates the impact of unpredictable message delivery failures on the BFT consensus problem. We propose Nicaea, a novel protocol enabling consensus among loyal nodes when the number of Byzantine nodes is below a new threshold, given by: (2-rho)(1-rho)2n-2-1 /(2-rho)(1-rho)2n-2+1n, where rho denotes the message failure rate. Theoretical proofs and experimental results validate Nicaea's Byzantine resilience. Our findings reveal a fundamental trade-off: as message delivery instability increases, a system's tolerance to Byzantine failures decreases. The well-known n3 threshold under reliable message delivery is a special case of our generalized threshold when rho = 0. To the best of our knowledge, this work presents the first quantitative characterization of unpredictable message delivery failures' impact on Byzantine fault tolerance in parallel and distributed computing.

关键词： Protocols Reliability Fault tolerant systems Fault tolerance Distributed computing consensus protocol Computational modeling Electronic mail consensus algorithm Computers Byzantine fault-tolerance message delivery failure parallel and distributed computing

来源：评论

学校读者我要写书评

暂无评论

consensus Iterated Posterior Linearization Filter for Distributed State Estimation

引用

IEEE SIGNAL PROCESSING LETTERS 2025年 32卷 561-565页

作者： Garcia-Fernandez, Angel F. Battistelli, Giorgio Univ Liverpool Dept Elect Engn & Elect Liverpool L69 3GJ England Univ Firenze Dipartimento Ingn Informaz DINFO I-50139 Florence Italy

This paper presents the consensus iterated posterior linearisation filter (IPLF) for distributed state estimation. The consensus IPLF algorithm is based on a measurement model described by its conditional mean and covariance given the state, and performs iterated statistical linear regressions of the measurements with respect to the current approximation of the posterior to improve estimation performance. Three variants of the algorithm are presented based on the type of consensus that is used: consensus on information, consensus on measurements, and hybrid consensus on measurements and information. Simulation results show the benefits of the proposed algorithm in distributed state estimation.

关键词： Covariance matrices Approximation algorithms Vectors Kalman filters Signal processing algorithms Sensors consensus algorithm State estimation Current measurement Noise measurement consensus distributed state estimation iterated posterior linearisation nonlinear filtering

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：