Blockchain has been widely used in finance,the Internet of Things(IoT),supply chains,and other scenarios as a revolutionary technology.Consensus protocol plays a vital role in blockchain,which helps all participants t...Blockchain has been widely used in finance,the Internet of Things(IoT),supply chains,and other scenarios as a revolutionary technology.Consensus protocol plays a vital role in blockchain,which helps all participants to maintain the storage state consistently.However,with the improvement of network environment complexity and system scale,blockchain development is limited by the performance,security,and scalability of the consensus protocol.To address this problem,this paper introduces the collaborative filtering mechanism commonly used in the recommendation system into the Practical Byzantine Fault Tolerance(PBFT)and proposes a Byzantine fault-tolerant(BFT)consensus protocol based on collaborative filtering recommendation(CRBFT).Specifically,an improved collaborative filtering recommendation method is designed to use the similarity between a node’s recommendation opinions and those of the recommender as a basis for determining whether to adopt the recommendation opinions.This can amplify the recommendation voice of good nodes,weaken the impact of cunningmalicious nodes on the trust value calculation,andmake the calculated resultsmore accurate.In addition,the nodes are given voting power according to their trust value,and a weight randomelection algorithm is designed and implemented to reduce the risk of attack.The experimental results show that CRBFT can effectively eliminate various malicious nodes and improve the performance of blockchain systems in complex network environments,and the feasibility of CRBFT is also proven by theoretical analysis.展开更多
Fault-tolerance is increasingly significant for large-scale storage systems in which Byzantine failure of storage nodes may happen. Traditional Byzantine Quorum systems that tolerate Byzantine failures by using replic...Fault-tolerance is increasingly significant for large-scale storage systems in which Byzantine failure of storage nodes may happen. Traditional Byzantine Quorum systems that tolerate Byzantine failures by using replication have two main limitations： low space-efficiency and static quorum variables. We propose an Erasure-code Byzantine Fault-tolerance Quorum that can provide high reliability with far lower storage overhead than replication by adopting erasure code as redundancy scheme. Through read/write operations of clients and diagnose operation of supervisor, our Quorum system can detect Byzantine nodes, and dynamically adjust system size and fault threshold. Simulation results show that our method improves performance for the Quorum with relatively small quorums.展开更多
This paper develops a novel Neural Network(NN)-based adaptive nonsingular practical predefined-time controller for the hypersonic morphing aircraft subject to actuator faults. Firstly, a novel Lyapunov criterion of pr...This paper develops a novel Neural Network(NN)-based adaptive nonsingular practical predefined-time controller for the hypersonic morphing aircraft subject to actuator faults. Firstly, a novel Lyapunov criterion of practical predefined-time stability is established. Following the proposed criterion, a tangent function based nonsingular predefined-time sliding manifold and the control strategy are developed. Secondly, the radial basis function NN with a low-complexity adaptation mechanism is incorporated into the controller to tackle the actuator faults and uncertainties. Thirdly, rigorous theoretical proof reveals that the attitude tracking errors can converge to a small region around the origin within a predefined time, while all signals in the closed-loop system remain bounded. Finally, numerical simulation results are presented to verify the effectiveness and improved performance of the proposed control scheme.展开更多
The inefficiency of Consensus protocols is a significant impediment to blockchain and IoT convergence development.To solve the problems like inefficiency and poor dynamics of the Practical Byzantine Fault Tolerance(PB...The inefficiency of Consensus protocols is a significant impediment to blockchain and IoT convergence development.To solve the problems like inefficiency and poor dynamics of the Practical Byzantine Fault Tolerance(PBFT)in IoT scenarios,a hierarchical consensus protocol called DCBFT is proposed.Above all,we propose an improved k-sums algorithm to build a two-level consensus cluster,achieving an hierarchical management for IoT devices.Next,A scalable two-level consensus protocol is proposed,which uses a multi-primary node mechanism to solve the single-point-of-failure problem.In addition,a data synchronization process is introduced to ensure the consistency of block data after view changes.Finally,A dynamic reputation evaluation model is introduced to update the nodes’reputation values and complete the rotation of consensus nodes at the end of each consensus round.The experimental results show that DCBFT has a more robust dynamic and higher consensus efficiency.Moreover,After running for some time,the performance of DCBFT shows some improvement.展开更多
基金supported by the National Natural Science Foundation of China(Grant No.62102449)awarded to W.J.Wang.
文摘Blockchain has been widely used in finance,the Internet of Things(IoT),supply chains,and other scenarios as a revolutionary technology.Consensus protocol plays a vital role in blockchain,which helps all participants to maintain the storage state consistently.However,with the improvement of network environment complexity and system scale,blockchain development is limited by the performance,security,and scalability of the consensus protocol.To address this problem,this paper introduces the collaborative filtering mechanism commonly used in the recommendation system into the Practical Byzantine Fault Tolerance(PBFT)and proposes a Byzantine fault-tolerant(BFT)consensus protocol based on collaborative filtering recommendation(CRBFT).Specifically,an improved collaborative filtering recommendation method is designed to use the similarity between a node’s recommendation opinions and those of the recommender as a basis for determining whether to adopt the recommendation opinions.This can amplify the recommendation voice of good nodes,weaken the impact of cunningmalicious nodes on the trust value calculation,andmake the calculated resultsmore accurate.In addition,the nodes are given voting power according to their trust value,and a weight randomelection algorithm is designed and implemented to reduce the risk of attack.The experimental results show that CRBFT can effectively eliminate various malicious nodes and improve the performance of blockchain systems in complex network environments,and the feasibility of CRBFT is also proven by theoretical analysis.
基金Supported by the National Natural Science Foun-dation of China (60373088)
文摘Fault-tolerance is increasingly significant for large-scale storage systems in which Byzantine failure of storage nodes may happen. Traditional Byzantine Quorum systems that tolerate Byzantine failures by using replication have two main limitations： low space-efficiency and static quorum variables. We propose an Erasure-code Byzantine Fault-tolerance Quorum that can provide high reliability with far lower storage overhead than replication by adopting erasure code as redundancy scheme. Through read/write operations of clients and diagnose operation of supervisor, our Quorum system can detect Byzantine nodes, and dynamically adjust system size and fault threshold. Simulation results show that our method improves performance for the Quorum with relatively small quorums.
基金supported by the National Natural Science Foundation of China (Nos. 52233014, U2241215)。
文摘This paper develops a novel Neural Network(NN)-based adaptive nonsingular practical predefined-time controller for the hypersonic morphing aircraft subject to actuator faults. Firstly, a novel Lyapunov criterion of practical predefined-time stability is established. Following the proposed criterion, a tangent function based nonsingular predefined-time sliding manifold and the control strategy are developed. Secondly, the radial basis function NN with a low-complexity adaptation mechanism is incorporated into the controller to tackle the actuator faults and uncertainties. Thirdly, rigorous theoretical proof reveals that the attitude tracking errors can converge to a small region around the origin within a predefined time, while all signals in the closed-loop system remain bounded. Finally, numerical simulation results are presented to verify the effectiveness and improved performance of the proposed control scheme.
基金supported by the Science and Technology Plan Project of Quanzhou City,Fujian Province of China(2022C020R)the Science and Technology Plan Project of Fujian Province of China(2023H0012)。
文摘The inefficiency of Consensus protocols is a significant impediment to blockchain and IoT convergence development.To solve the problems like inefficiency and poor dynamics of the Practical Byzantine Fault Tolerance(PBFT)in IoT scenarios,a hierarchical consensus protocol called DCBFT is proposed.Above all,we propose an improved k-sums algorithm to build a two-level consensus cluster,achieving an hierarchical management for IoT devices.Next,A scalable two-level consensus protocol is proposed,which uses a multi-primary node mechanism to solve the single-point-of-failure problem.In addition,a data synchronization process is introduced to ensure the consistency of block data after view changes.Finally,A dynamic reputation evaluation model is introduced to update the nodes’reputation values and complete the rotation of consensus nodes at the end of each consensus round.The experimental results show that DCBFT has a more robust dynamic and higher consensus efficiency.Moreover,After running for some time,the performance of DCBFT shows some improvement.
