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

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

A Distributed Semi-consensus-Based Data-Driven Fault Detection Approach for Dynamic Systems

引用

IEEE TRANSACTIONS ON INDUSTRIAL INFORMATICS 2025年第3期21卷 2234-2243页

作者： Li, Linlin Ding, Steven X. Wang, Chenyang Zhong, Maiying Peng, Kaixiang Univ Sci & Technol Beijing Sch Automat & Elect Engn Key Lab Knowledge Automat Ind Proc Minist Educ Beijing 100083 Peoples R China Univ Duisburg Essen Inst Automat Control & Complex Syst AKS D-47057 Essen Germany Shandong Univ Sci & Technol Coll Elect Engn & Automat Qingdao 266590 Peoples R China

In this article, a distributed semi-consensus-based data-driven fault detection scheme is developed based on the process variables collected by sensor networks to ensure the safety of the large-scale dynamic processes. For our purpose, the distributed data-driven process modeling scheme is developed for dynamic systems first by considering the communication topology of the sensor networks. Then, a distributed Kalman filter-based fault detection approach is developed aiming at achieving optimal detection performance at each sensor node. Specifically, the distributed iterative learning algorithm is implemented to calculate the needed parameter matrices for Kalman filter-based residual generator offline with the aid of average consensus algorithm. It is followed by a distributed fusion of local residual signals to perform online optimal fault detection. To avoid the detection delay caused by the traditional average consensus method, the semi-consensus algorithm is developed for the first time to ensure the timely detection of potential faults. A case study on the multiphase flow facility process is given in the end to demonstrate the proposed method.

关键词： Kalman filters Fault detection Dynamical systems Delays Topology consensus algorithm Training Safety Process modeling Network topology Distributed Kalman filter distributed fault detection (FD) residual generator semi-consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

Three-time-scale control for discharging rate consensus and large-signal stability analysis in AC-bus microgrids

引用

CONTROL ENGINEERING PRACTICE 2025年 159卷

作者： Merchan-Riveros, Maria Camila Albea, Carolina Salas, Franciso Univ Seville Escuela Tecn Super Ingn Dept Syst & Automatic Engn Camino Descubrimientos Seville 41092 Spain

A distributed control scheme for islanded AC-bus microgrids is proposed, based on multi-agent system and singular perturbation theory. The goal is to achieve a balanced State Of Charge (SOC) for each Battery Energy Storage System (BESS) in discharging mode, ensuring stability properties of a large-signal model that considers the primary and secondary control loop dynamics. The power inverters are controlled through a voltage and current loop. Moreover, a droop control and consensus algorithm are proposed to ensure that the SOC of these BESSs are balanced. Furthermore, large-signal stability analysis is assessed for the complete network system by using singular perturbation theory. Indeed, through an appropriate selection of the parameters, the dynamics exhibit three-time-scale separation to fit each control goal (power converter control, droop control and consensus control). Experimental results on an Imperix power test bench validate the proposed control scheme, and verify the reliability and robustness with respect to any connection/disconnection event or communication failure through different scenarios.

关键词： consensus algorithm Singular perturbation analysis Time-scale separation AC-microgrids

来源：评论

学校读者我要写书评

暂无评论

Multirate consensus-Based Distributed Control for Large-Scale Wind Farms

引用

IEEE TRANSACTIONS ON CONTROL SYSTEMS TECHNOLOGY 2025年

作者： Silva, Jean Gonzalez Keijzer, Twan Gallo, Alexander Julian Ferrari, Riccardo van Wingerden, Jan-Willem Delft Univ Technol Delft Ctr Syst & Control NL-2628 CD Delft Netherlands

High penetration of wind energy is pushing wind farms (WFs) to offer grid support capabilities, such as active power tracking. One of the main challenges in active power tracking for WFs is the interaction of wind turbines (WTs) through their wakes. This reduces the available wind in downstream WTs, leading them to saturation, while also affecting structural loading. With the increasing number of WTs in individual WFs, the computational and communication complexity of implementing centralized control architectures grows, posing challenges for real-world applications. In this article, we present a novel distributed control approach for active power tracking for WFs, namely multirate consensus-based distributed control (MCDC). The MCDC is designed to ensure that tracking errors caused by WT saturation are equally compensated throughout the WF, while only requiring local information exchanges between WTs. Furthermore, the proposed controller ensures that WT aerodynamic loading is balanced across the WF in a distributed manner. Finally, the overall power reference is distributed via a leader-follower consensus algorithm, resulting in a fully distributed approach. Our control approach facilitates the WF modularity and sparsity, which reduces the costs associated with control design and its applicability. Throughout this article, we demonstrate the effectiveness of the proposed MCDC through high-fidelity simulations, presenting performance comparable to the centralized control.

关键词： Decentralized control Aerodynamics Loading Control systems Wind turbines Force Data models consensus algorithm Wind farms Power distribution Active power control average consensus distributed control integral control thrust balance wake effects wind farm (WF) control

来源：评论

学校读者我要写书评

暂无评论

High-order consensus graph learning for incomplete multi-view clustering

引用

Applied Intelligence 2025年第6期55卷 1-25页

作者： Guo, Wei Che, Hangjun Leung, Man-Fai College of Electronic and Information Engineering Southwest University Chongqing400715 China Chongqing Key Laboratory of Nonlinear Circuits and Intelligent Information Processing Chongqing400715 China Faculty of Science and Engineering Anglia Ruskin University CambridgeCB1 1PT United Kingdom

Incomplete Multi-View Clustering (IMVC) aims to partition data with missing samples into distinct groups. However, most IMVC methods rarely consider the high-order neighborhood information of samples, which represents complex underlying interactions, and often neglect the weights of different views. To address these issues, we propose a High-order consensus Graph Learning (HoCGL) model. Specifically, we integrate a reconstruction term to recover the incomplete multi-view data. High-order proximity matrices are constructed, and the self-representation similarity matrices and multiple high-order proximity matrices are learned mutually, allowing the similarity matrices to incorporate complex high-order information. Finally, the consensus graph representation is derived from the similarity matrices through a self-weighted strategy. An efficient algorithm is designed to solve the proposed model. The excellent clustering performance of the proposed model is validated by comparing it with eight state-of-the-art models across nine datasets. © The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2025.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

A consensus Blockchain-Based Credit Risk Evaluation and Credit Data Storage Using Novel Deep Learning Approach

引用

COMPUTATIONAL ECONOMICS 2025年 1-34页

作者： Amarnadh, Vadipina Rao, Moparthi Nageswara Anurag Univ Sch Engn Hyderabad India Amrita Vishwa Vidyapeetham Amrita Sch Comp Amaravati Campus Amaravati 522503 Andhra Pradesh India

In the present era, Credit Risk Evaluation (CRE) holds extreme technical significance and real-world use in banking sectors. Accurate and efficient credit risk assessment models are instantly essential because of the problems where data processing consumes more time to build and a huge number of data mining stages. In the field of CRE and data storage, blockchain technology along with deep learning models have been widely suggested for ensuring the privacy and security to the customer's credit data. However, the traditional approaches are not very interpretable. To this concern, this research introduces a Multi-layer Residual coordinate Boosted Sooty tern Attention Network (MRBSAN) with consensus-based blockchain technology for secure storage of evaluated customer's credit data in the banking sector. The introduced approach includes effective preprocessing of data, optimal selection of features by enhancing with pheromone concentration, evaluation of credit risk and secure storage of credit data by utilizing focal loss to achieve a remarkable output. The findings demonstrate that the proposed approach effectively assesses the customer's credit risk and stores the credit data securely. The proposed model has an average accuracy of 97.2%, precision of 98.6%, recall of 98.6%, and an F1-score of 98% using three datasets. These results surpass the performance of existing approaches.

关键词： Blockchain consensus algorithm Credit risk evaluation Deep learning Trust value Banking sector

来源：评论

学校读者我要写书评

暂无评论

A survey on scalable consensus algorithms for blockchain technology

Cyber Security and Applications

引用

Cyber Security and Applications 2025年 3卷

作者： Jain, Ankit Kumar Gupta, Nishant Gupta, Brij B. National Institute of Technology Kurukshetra India Department of Computer Science and Information Engineering Asia University Taiwan Taichung 413 China Symbiosis Centre for Information Technology (SCIT) Symbiosis International University Pune India Center for Interdisciplinary Research University of Petroleum and Energy Studies (UPES) Dehradun India

The process of reaching an agreement on a value within a distributed network, known as a consensus problem, is a defining feature of blockchain. This consensus problem can be seen in various applications like load balancing, transaction validation in blockchain, and distributed computing. In recent years, many researchers have provided solutions to this problem. Hence we have presented a survey in which we delved into blockchain consensus algorithms and conducted a comparative analysis of all the consensus algorithms to provide information about each protocol's advantages and drawbacks. This survey starts with the standard proof-of-work consensus protocol applied in bitcoin cryptocurrency and its limitations on the ground of the following parameters: throughput (transactions per second), latency, forks, fault tolerance, double spending attacks, and power consumption. The rest of the consensus algorithms in this paper have been systematically covered to address the limitations of proof-of-work. This paper also covered Raft and PBFT consensus algorithms suitable for permissioned networks. Although the PBFT consensus protocol has a high throughput and a low latency, it has limited node scalability. The PBFT has a low byzantine fault tolerant rate. This paper also covers PoEWAL for blockchain-based IoT applications and WBFT, which prevents corrupt nodes from taking part in consensus. A comparative analysis of the consensus algorithms provides an explicit knowledge of the present research, which also offers guidance for future study. © 2024

关键词： Blockchain technology Byzantine faults consensus algorithm Latency Throughput

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：