Aiming at the challenges of low throughput,excessive consensus latency and high communication complexity in the Practical Byzantine Fault Tolerance(PBFT)algorithm in blockchain networks,its application in identity ver...Aiming at the challenges of low throughput,excessive consensus latency and high communication complexity in the Practical Byzantine Fault Tolerance(PBFT)algorithm in blockchain networks,its application in identity verification for distributed networking of a drone cluster is limited.Therefore,a lightweight blockchainbased identity authentication model for UAV swarms is designed,and a Credit-score and Grouping-mechanism Practical Byzantine Fault Tolerance(CG-PBFT)algorithm is proposed.CG-PBFT introduces a reputation score evaluation mechanism,classifies the reputation levels of nodes in the network,and optimizes the consensus process based on grouping consensus and BLS aggregate signature technology.Experimental results demonstrate that under identical experimental conditions,compared with the PBFT algorithm,CG-PBFT achieves a 250%increase in average throughput,a 70%reduction in average latency,and simultaneous enhancement in security,thus making it more suitable for UAV swarm networks.展开更多
Raft is a foundational consensus protocol for distributed systems,architected to ensure state machine replication and data consistency across machine clusters.However,traditional Raft faces significant performance bot...Raft is a foundational consensus protocol for distributed systems,architected to ensure state machine replication and data consistency across machine clusters.However,traditional Raft faces significant performance bottlenecks,particularly regarding suboptimal election efficiency and substantial consensus latency in large-scale deployments.To address these challenges,this study presents MH-Raft,an enhanced consensus variant designed for high efficiency and minimal latency.We propose a hierarchical node management and election framework to optimize network coordination.Specifically,a leader election methodology leveraging the multi-objective evolutionary algorithm based on decomposition(MOEA/D)is formulated to minimize election latency by evaluating multi-dimensional node attributes.To further refine the proposed hierarchical architecture,a rigorous tightness definition is devised for optimal mediator node selection,which is integrated into a hybrid clustering algorithm that adaptively partitions the network and optimizes the mapping between mediator nodes and follower nodes.Quantitative evaluations via comprehensive experiments demonstrate that MH-Raft significantly reduces overall election latency and lowers consensus latency by 14.87%–34.45%,while enhancing average throughput by 30.43%compared to the conventional Raft implementation.展开更多
The inclination of wooden columns is a key indicator for evaluating the structural safety of traditional timber buildings in China.However,accurate measurement is challenging because these columns typically exhibit na...The inclination of wooden columns is a key indicator for evaluating the structural safety of traditional timber buildings in China.However,accurate measurement is challenging because these columns typically exhibit natural tapering,with diameters decreasing from the base to the top,and surface irregularities such as artificial cuts,cracks,and knots.Both the intrinsic geometric characteristics and surface defects reduce the precision of coordinate acquisition and the reliability of inclination estimation.To overcome these limitations,this study proposes a novel inclination measurement method for wooden columns in traditional timber buildings based on multi-section measurement and spatial line fitting.An adaptive random sample consensus algorithm is employed to effectively remove outliers induced by surface damage and measurement noise.Subsequently,principal component analysis is used to fit a three-dimensional spatial line through the center points of multiple cross-sections,enabling accurate computation of the inclination angle while accounting for structural imperfections.Moreover,the effects of damage defects,the number of measuring points,the measurement range,and the number of selected cross-sections on measurement accuracy are systematically investigated through statistical analysis,and corresponding recommended values for engineering practice are provided.The proposed method offers an efficient and reliable solution for inclination measurement,supporting the inspection and structural safety assessment of traditional timber columns.展开更多
Consensus mechanisms are fundamental to blockchain systems,ensuring that distributed nodes agree on the validity of transactions and data.However,performance bottlenecks,particularly those related to throughput,latenc...Consensus mechanisms are fundamental to blockchain systems,ensuring that distributed nodes agree on the validity of transactions and data.However,performance bottlenecks,particularly those related to throughput,latency,and node selection,have increasingly constrained the scalability of modern blockchain deployments.To address these issues,this paper proposes NI-HotStuff,a reputation-driven committee-based BFT consensus framework built upon the HotStuff protocol.A CatBoost-based reputation model is introduced to learn and evaluate historical behavioral features of nodes,enabling quantitative reputation scoring.A hardware-aware bidding mechanism is further incorporated to dynamically compute each node’s bid value and integrate it with its reputation score,thereby prioritizing stable and high-performance nodes for consensus participation.Moreover,a committee mechanism is established in which a set of committee nodes were selected from the candidate pool,and only committee members participate in the consensus process,reducing redundant communication and mitigating the performance drag caused by weak nodes.On top of that,a leader-selection strategy based on reputation values and inter-view time intervals is designed to prevent low-reputation or potentially malicious nodes from frequently becoming leaders.Experimental results demonstrate that NI-HotStuff significantly outperforms traditional PBFT and HotStuff in terms of communication overhead,consensus latency,and system throughput,with particularly notable improvements in small-and medium-scale node environments.展开更多
As one of the underlying technologies of the blockchain,the consensus algorithm plays a vital role in ensuring security and efficiency.As a consensus algorithm for the private blockchain,Raft has better performance th...As one of the underlying technologies of the blockchain,the consensus algorithm plays a vital role in ensuring security and efficiency.As a consensus algorithm for the private blockchain,Raft has better performance than the rest of the consensus algorithms,and it does not cause problems such as the concentrated hashing power,resource waste and fork.However,Raft can only be used in a non-byzantine environment with a small network size.In order to enable Raft to be used in a large-scale network with a certain number of byzantine nodes,this paper combines Raft and credit model to propose a Raft blockchain consensus algorithm based on credit model CRaft.In the node credit evaluation phase,RBF-based support vector machine is used as the anomaly detection method,and the node credit evaluation model is constructed.Then the Trust Nodes List(TNL)mechanism is introduced to make the consensus phase in a creditable network environment.Finally,the common node is synchronized to the consensus node to update the blockchain of the entire network.Experiments show that CRaft has better throughput and lower latency than the commonly used consortium blockchain consensus algorithm PBFT(Practical Byzantine Fault Tolerance).展开更多
A distributed coordinated consensus problem for multiple networked Euler-Lagrange systems is studied.The communication between agents is subject to time delays,unknown parameters and nonlinear inputs,but only with the...A distributed coordinated consensus problem for multiple networked Euler-Lagrange systems is studied.The communication between agents is subject to time delays,unknown parameters and nonlinear inputs,but only with their states available for measurement.When the communication topology of the system is connected,an adaptive control algorithm with selfdelays and uncertainties is suggested to guarantee global full-state synchro-nization that the difference between the agent's positions and ve-locities asymptotically converges to zero.Moreover,the distributed sliding-mode law is given for chaotic systems with nonlinear inputs to compensate for the effects of nonlinearity.Finally,simulation results show the effectiveness of the proposed control algorithm.展开更多
Dear Editor,This letter studies a real-world issue in leader-follower multi-agent systems(MASs)named open topology,which permits the variations of agent set and network connections.Specially,a novel transition process...Dear Editor,This letter studies a real-world issue in leader-follower multi-agent systems(MASs)named open topology,which permits the variations of agent set and network connections.Specially,a novel transition process is developed to explain how the involved variation of network scale affects the dynamic behavior of the MASs.From a resource limited perspective,the distributed saturated impulsive control is then designed,under which some sufficient criteria are integrated into local quasi-consensus performance.We also provide a combined optimization algorithm for all agents to make the estimated domain of initial errors closer to the real one,thereby resulting in less conservativeness.Finally,a numerical example validates our results.展开更多
The economic dispatch problem(EDP) of microgrids operating in both grid-connected and isolated modes within an energy internet framework is addressed in this paper. The multi-agent leader-following consensus algorithm...The economic dispatch problem(EDP) of microgrids operating in both grid-connected and isolated modes within an energy internet framework is addressed in this paper. The multi-agent leader-following consensus algorithm is employed to address the EDP of microgrids in grid-connected mode, while the push-pull algorithm with a fixed step size is introduced for the isolated mode. The proposed algorithm of isolated mode is proven to converge to the optimum when the interaction digraph of microgrids is strongly connected. A unified algorithmic framework is proposed to handle the two modes of operation of microgrids simultaneously, enabling our algorithm to achieve optimal power allocation and maintain the balance between power supply and demand in any mode and any mode switching. Due to the push-pull structure of the algorithm and the use of fixed step size,the proposed algorithm can better handle the case of unbalanced graphs, and the convergence speed is improved. It is documented that when the transmission topology is strongly connected and there is bi-directional communication between the energy router and its neighbors, the proposed algorithm in composite mode achieves economic dispatch even with arbitrary mode switching.Finally, we demonstrate the effectiveness and superiority of our algorithm through numerical simulations.展开更多
钢拱桥的线形监测是桥梁健康监测系统的重要组成部分。运用三维激光扫描技术,融合随机抽样一致(random sample consensus,RANSAC)算法对传统的具有噪声的基于密度的聚类方法(density-based spatial clustering of applications with noi...钢拱桥的线形监测是桥梁健康监测系统的重要组成部分。运用三维激光扫描技术,融合随机抽样一致(random sample consensus,RANSAC)算法对传统的具有噪声的基于密度的聚类方法(density-based spatial clustering of applications with noise,DBSCAN)算法进行改进,对钢拱桥拱肋线形进行提取。三维激光点云数据具有全面性和细节体现的优势,能够完整地呈现桥梁结构的形状和变形信息,融合RANSAC的改进DBSCAN算法根据钢拱桥结构特征对聚类结果进行约束,能够很好地实现删除离散点及桥面、横撑、横联和腹杆部分的点云这一目的。根据融合RANSAC的改进DBSCAN算法提取出的点云进行关键点拟合,与人工提取结果进行对比,拱肋关键点提取误差均在毫米级,最大误差为9.2 mm,最小误差为0.1 mm,此提取方法能够更加准确有效地完成钢拱桥线形提取,使线形提取精度达到毫米级,大大降低了人力成本和时间成本,对钢拱桥的复杂结构有更好的鲁棒性,能很好地适应实际生产需求。展开更多
在复杂梨园环境中,传统视觉导航方法容易受到光照变化、杂草遮挡等因素的干扰。针对此问题,本文提出了一种基于改进YOLO v8模型的梨园导航线提取方法。该方法在YOLO v8模型中集成了多尺度大核注意力(Multi-scale large kernel attention...在复杂梨园环境中,传统视觉导航方法容易受到光照变化、杂草遮挡等因素的干扰。针对此问题,本文提出了一种基于改进YOLO v8模型的梨园导航线提取方法。该方法在YOLO v8模型中集成了多尺度大核注意力(Multi-scale large kernel attention,MLKA)模块以增强对树干特征的感知。设计了多帧特征点融合机制,通过记录并利用连续5帧图像中检测到的特征点,有效弥补了单帧图像特征点不足的问题。此外,引入随机抽样一致性(Random sample consensus,RANSAC)算法,分别对左右两侧树行的特征点进行降噪处理,并使用最小二乘法进行树行线拟合。通过计算左右两侧树行线的角平分线生成果园导航线。实验结果表明:改进模型在复杂的果园环境中,树干检测的精确率(Precision)达到89.8%,召回率(Recall)达到79.9%,平均精度均值(mean average precision,mAP50-95)达到了55.1%。结合多帧特征点融合与RANSAC降噪生成的导航线与手动标注的参考导航线之间的角度偏差均值为1.17°,位置偏差均值为20.40像素,均方根偏差均值为0.27。本文方法为梨园环境中的视觉导航提供了一种低成本、高适应性的技术方案。展开更多
基金supported by the following projects:Fund for technical areas of infrastructure strengthening plan projects under Grant 2023-JCJQ-JJ-0772.
摘要Aiming at the challenges of low throughput,excessive consensus latency and high communication complexity in the Practical Byzantine Fault Tolerance(PBFT)algorithm in blockchain networks,its application in identity verification for distributed networking of a drone cluster is limited.Therefore,a lightweight blockchainbased identity authentication model for UAV swarms is designed,and a Credit-score and Grouping-mechanism Practical Byzantine Fault Tolerance(CG-PBFT)algorithm is proposed.CG-PBFT introduces a reputation score evaluation mechanism,classifies the reputation levels of nodes in the network,and optimizes the consensus process based on grouping consensus and BLS aggregate signature technology.Experimental results demonstrate that under identical experimental conditions,compared with the PBFT algorithm,CG-PBFT achieves a 250%increase in average throughput,a 70%reduction in average latency,and simultaneous enhancement in security,thus making it more suitable for UAV swarm networks.
基金supported by the Fundamental and Interdisciplinary Disciplines Breakthrough Plan of the Ministry of Education of China(No.JYB2025XDXM413)the Flexible Introduction of Leading Talents under the 2023 Kunlun Talents HighEnd Innovation and Entrepreneurship Talents Project of Qinghai Province(No.QHKLYC-GDCXCY-2023-320)+2 种基金the Qinghai University Research Ability Enhancement Project(No.2025KTSA01)the“Unveiling the Leader”Science and Technology R&D Projects(No.2022ZXJ03C06)the National Natural Science Foundation of China(No.62076082)
摘要Raft is a foundational consensus protocol for distributed systems,architected to ensure state machine replication and data consistency across machine clusters.However,traditional Raft faces significant performance bottlenecks,particularly regarding suboptimal election efficiency and substantial consensus latency in large-scale deployments.To address these challenges,this study presents MH-Raft,an enhanced consensus variant designed for high efficiency and minimal latency.We propose a hierarchical node management and election framework to optimize network coordination.Specifically,a leader election methodology leveraging the multi-objective evolutionary algorithm based on decomposition(MOEA/D)is formulated to minimize election latency by evaluating multi-dimensional node attributes.To further refine the proposed hierarchical architecture,a rigorous tightness definition is devised for optimal mediator node selection,which is integrated into a hybrid clustering algorithm that adaptively partitions the network and optimizes the mapping between mediator nodes and follower nodes.Quantitative evaluations via comprehensive experiments demonstrate that MH-Raft significantly reduces overall election latency and lowers consensus latency by 14.87%–34.45%,while enhancing average throughput by 30.43%compared to the conventional Raft implementation.
基金supported by Funding statement as follows:TheGuiding(Key)Project Funding for Social Development in Fujian Province(2021J011063)Fujian Education and Research Project for Young and Middle-aged Teachers(Science and Technology category)(JAT220227)Science and Technology Project of Fujian University of Technology(GY-Z220226).
摘要The inclination of wooden columns is a key indicator for evaluating the structural safety of traditional timber buildings in China.However,accurate measurement is challenging because these columns typically exhibit natural tapering,with diameters decreasing from the base to the top,and surface irregularities such as artificial cuts,cracks,and knots.Both the intrinsic geometric characteristics and surface defects reduce the precision of coordinate acquisition and the reliability of inclination estimation.To overcome these limitations,this study proposes a novel inclination measurement method for wooden columns in traditional timber buildings based on multi-section measurement and spatial line fitting.An adaptive random sample consensus algorithm is employed to effectively remove outliers induced by surface damage and measurement noise.Subsequently,principal component analysis is used to fit a three-dimensional spatial line through the center points of multiple cross-sections,enabling accurate computation of the inclination angle while accounting for structural imperfections.Moreover,the effects of damage defects,the number of measuring points,the measurement range,and the number of selected cross-sections on measurement accuracy are systematically investigated through statistical analysis,and corresponding recommended values for engineering practice are provided.The proposed method offers an efficient and reliable solution for inclination measurement,supporting the inspection and structural safety assessment of traditional timber columns.
摘要Consensus mechanisms are fundamental to blockchain systems,ensuring that distributed nodes agree on the validity of transactions and data.However,performance bottlenecks,particularly those related to throughput,latency,and node selection,have increasingly constrained the scalability of modern blockchain deployments.To address these issues,this paper proposes NI-HotStuff,a reputation-driven committee-based BFT consensus framework built upon the HotStuff protocol.A CatBoost-based reputation model is introduced to learn and evaluate historical behavioral features of nodes,enabling quantitative reputation scoring.A hardware-aware bidding mechanism is further incorporated to dynamically compute each node’s bid value and integrate it with its reputation score,thereby prioritizing stable and high-performance nodes for consensus participation.Moreover,a committee mechanism is established in which a set of committee nodes were selected from the candidate pool,and only committee members participate in the consensus process,reducing redundant communication and mitigating the performance drag caused by weak nodes.On top of that,a leader-selection strategy based on reputation values and inter-view time intervals is designed to prevent low-reputation or potentially malicious nodes from frequently becoming leaders.Experimental results demonstrate that NI-HotStuff significantly outperforms traditional PBFT and HotStuff in terms of communication overhead,consensus latency,and system throughput,with particularly notable improvements in small-and medium-scale node environments.
基金Supported by the National Natural Science Foundation of China(61672297)。
摘要As one of the underlying technologies of the blockchain,the consensus algorithm plays a vital role in ensuring security and efficiency.As a consensus algorithm for the private blockchain,Raft has better performance than the rest of the consensus algorithms,and it does not cause problems such as the concentrated hashing power,resource waste and fork.However,Raft can only be used in a non-byzantine environment with a small network size.In order to enable Raft to be used in a large-scale network with a certain number of byzantine nodes,this paper combines Raft and credit model to propose a Raft blockchain consensus algorithm based on credit model CRaft.In the node credit evaluation phase,RBF-based support vector machine is used as the anomaly detection method,and the node credit evaluation model is constructed.Then the Trust Nodes List(TNL)mechanism is introduced to make the consensus phase in a creditable network environment.Finally,the common node is synchronized to the consensus node to update the blockchain of the entire network.Experiments show that CRaft has better throughput and lower latency than the commonly used consortium blockchain consensus algorithm PBFT(Practical Byzantine Fault Tolerance).
基金supported by the National Natural Sciences Foundation of China(60974146)
摘要A distributed coordinated consensus problem for multiple networked Euler-Lagrange systems is studied.The communication between agents is subject to time delays,unknown parameters and nonlinear inputs,but only with their states available for measurement.When the communication topology of the system is connected,an adaptive control algorithm with selfdelays and uncertainties is suggested to guarantee global full-state synchro-nization that the difference between the agent's positions and ve-locities asymptotically converges to zero.Moreover,the distributed sliding-mode law is given for chaotic systems with nonlinear inputs to compensate for the effects of nonlinearity.Finally,simulation results show the effectiveness of the proposed control algorithm.
基金supported by the Natural Science Foundation of Jiangsu Province(BK20240009)the National Natural Science Foundation of China(62373105,62373262)Jiangsu Provincial Scientific Research Center of Applied Mathematics(BK20233002).
摘要Dear Editor,This letter studies a real-world issue in leader-follower multi-agent systems(MASs)named open topology,which permits the variations of agent set and network connections.Specially,a novel transition process is developed to explain how the involved variation of network scale affects the dynamic behavior of the MASs.From a resource limited perspective,the distributed saturated impulsive control is then designed,under which some sufficient criteria are integrated into local quasi-consensus performance.We also provide a combined optimization algorithm for all agents to make the estimated domain of initial errors closer to the real one,thereby resulting in less conservativeness.Finally,a numerical example validates our results.
基金supported by the National Natural Science Foundation of China(62103203)
摘要The economic dispatch problem(EDP) of microgrids operating in both grid-connected and isolated modes within an energy internet framework is addressed in this paper. The multi-agent leader-following consensus algorithm is employed to address the EDP of microgrids in grid-connected mode, while the push-pull algorithm with a fixed step size is introduced for the isolated mode. The proposed algorithm of isolated mode is proven to converge to the optimum when the interaction digraph of microgrids is strongly connected. A unified algorithmic framework is proposed to handle the two modes of operation of microgrids simultaneously, enabling our algorithm to achieve optimal power allocation and maintain the balance between power supply and demand in any mode and any mode switching. Due to the push-pull structure of the algorithm and the use of fixed step size,the proposed algorithm can better handle the case of unbalanced graphs, and the convergence speed is improved. It is documented that when the transmission topology is strongly connected and there is bi-directional communication between the energy router and its neighbors, the proposed algorithm in composite mode achieves economic dispatch even with arbitrary mode switching.Finally, we demonstrate the effectiveness and superiority of our algorithm through numerical simulations.
摘要在复杂梨园环境中,传统视觉导航方法容易受到光照变化、杂草遮挡等因素的干扰。针对此问题,本文提出了一种基于改进YOLO v8模型的梨园导航线提取方法。该方法在YOLO v8模型中集成了多尺度大核注意力(Multi-scale large kernel attention,MLKA)模块以增强对树干特征的感知。设计了多帧特征点融合机制,通过记录并利用连续5帧图像中检测到的特征点,有效弥补了单帧图像特征点不足的问题。此外,引入随机抽样一致性(Random sample consensus,RANSAC)算法,分别对左右两侧树行的特征点进行降噪处理,并使用最小二乘法进行树行线拟合。通过计算左右两侧树行线的角平分线生成果园导航线。实验结果表明:改进模型在复杂的果园环境中,树干检测的精确率(Precision)达到89.8%,召回率(Recall)达到79.9%,平均精度均值(mean average precision,mAP50-95)达到了55.1%。结合多帧特征点融合与RANSAC降噪生成的导航线与手动标注的参考导航线之间的角度偏差均值为1.17°,位置偏差均值为20.40像素,均方根偏差均值为0.27。本文方法为梨园环境中的视觉导航提供了一种低成本、高适应性的技术方案。