Blockchain Based Consensus Algorithm and Trustworthy Evaluation of Authenticated Subgraph Queries

Over the past era,subgraph mining from a large collection of graph database is a crucial problem.In addition,scalability is another big problem due to insufficient storage.There are several security challenges associated with subgraph mining in today’s on-demand system.To address this downside,our proposed work introduces a Blockchain-based Consensus algorithm for Authenticated query search in the Large-Scale Dynamic Graphs(BCCA-LSDG).The two-fold process is handled in the proposed BCCA-LSDG:graph indexing and authenticated query search(query processing).A blockchain-based reputation system is meant to maintain the trust blockchain and cloud server of the proposed architecture.To resolve the issues and provide safe big data transmission,the proposed technique also combines blockchain with a consensus algorithm architecture.Security of the big data is ensured by dividing the BC network into distinct networks,each with a restricted number of allowed entities,data kept in the cloud gate server,and data analysis in the blockchain.The consensus algorithm is crucial for maintaining the speed,performance and security of the blockchain.Then Dual Similarity based MapReduce helps in mapping and reducing the relevant subgraphs with the use of optimal feature sets.Finally,the graph index refinement process is undertaken to improve the query results.Concerning query error,fuzzy logic is used to refine the index of the graph dynamically.The proposed technique outperforms advanced methodologies in both blockchain and non-blockchain systems,and the combination of blockchain and subgraph provides a secure communication platform,according to the findings.

Improved PBFT Consensus Algorithm Based on Node Role Division

The PBFT (Practical Byzantine Fault Tolerance, PBFT) consensus algorithm, which addressed the issue of malicious nodes sending error messages to disrupt the system operation in distributed systems, was challenging to support massive network nodes, the common participation over all nodes in the consensus mechanism would lead to increased communication complexity, and the arbitrary selection of master nodes would also lead to inefficient consensus. This paper offered a PBFT consensus method (Role Division-based Practical Byzantine Fault Tolerance, RD-PBFT) to address the above problems based on node role division. First, the nodes in the system voted with each other to divide the high reputation group and low reputation group, and determined the starting reputation value of the nodes. Then, the mobile node in the group was divided into roles according to the high reputation value, and a total of three roles were divided into consensus node, backup node, and supervisory node to reduce the number of nodes involved in the consensus process and reduced the complexity of communication. In addition, an adaptive method was used to select the master nodes in the consensus process, and an integer value was introduced to ensure the unpredictability and equality of the master node selection. Experimentally, it was verified that the algorithm has lower communication complexity and better decentralization characteristics compared with the PBFT consensus algorithm, which improved the efficiency of consensus.

Distributed consensus algorithm for networked Euler-Lagrange systems with self-delays and uncertainties

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.

A Review: Consensus Algorithms on Blockchain

Blockchain is a distributed public ledger that keeps track of all transactions that have ever taken place in the system. As a distributed ledger, a consensus mechanism is required to ensure all the transaction functions properly. In order to reach a consensus, it is critical to emphasize the importance of performance and efficiency. The use of the right consensus algorithm will significantly improve the efficiency of a blockchain application. This paper reviewed several types of consensus algorithms used in blockchain and discusses the idea of a new consensus algorithm that can improve the performance of consortium blockchain.

A Novel GLS Consensus Algorithm for Alliance Chain in Edge Computing Environment

Edge computing devices are widely deployed.An important issue that arises is in that these devices suffer from security attacks.To deal with it,we turn to the blockchain technologies.The note in the alliance chain need rules to limit write permissions.Alliance chain can provide security management functions,using these functions to meet the management between the members,certification,authorization,monitoring and auditing.This article mainly analyzes some requirements realization which applies to the alliance chain,and introduces a new consensus algorithm,generalized Legendre sequence(GLS)consensus algorithm,for alliance chain.GLS algorithms inherit the recognition and verification efficiency of binary sequence ciphers in computer communication and can solve a large number of nodes verification of key distribution issues.In the alliance chain,GLS consensus algorithm can complete node address hiding,automatic task sorting,task automatic grouping,task node scope confirmation,task address binding and stamp timestamp.Moreover,the GLS consensus algorithm increases the difficulty of network malicious attack.

Consensus algorithm for medical data storage and sharing based on master–slave multi-chain of alliance chain

The safe storage and sharing of medical data have promoted the development of the public medical field.At the same time,blockchain technology guarantees the safe storage and sharing of medical data.However,the consensus algorithm in the current medical blockchain cannot meet the requirements of low delay and high throughput in the large-scale network,and the identity of the primary node is exposed and vulnerable to attack.Therefore,this paper proposes an efficient consensus algorithm for medical data storage and sharing based on a master–slave multi-chain of alliance chain(ECA_MDSS).Firstly,institutional nodes in the healthcare alliance chain are clustered according to geographical location and medical system structure to form a multi-zones network.The system adopts master–slave multi-chain architecture to ensure security,and each zone processes transactions in parallel to improve consensus efficiency.Secondly,the aggregation signature is used to improve the practical Byzantine fault-tolerant(PBFT)consensus to reduce the communication interaction of consensus in each zone.Finally,an efficient ring signature is used to ensure the anonymity and privacy of the primary node in each zone and to prevent adaptive attacks.Meanwhile,a trust model is introduced to evaluate the trust degree of the node to reduce the evil done by malicious nodes.The experimental results show that ECA_MDSS can effectively reduce communication overhead and consensus delay,improve transaction throughput,and enhance system scalability.

Raft Consensus Algorithm Based on Credit Model in Consortium Blockchain

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).

Imp Raft:a consensus algorithm based on Raft and storage compression consensus for IoT scenario

In order to meet various challenges in the Internet of things(IoT),such as identity authentication,privacy preservation of distributed data and network security,the integration of blockchain and IoT became a new trend in recent years.As the key supporting technology of blockchain,the consensus algorithm is a hotspot of distributed system research.At present,the research direction of the consensus algorithm is mainly focused on improving throughput and reducing delay.However,when blockchain is applied to IoT scenario,the storage capacity of lightweight IoT devices is limited,and the normal operations of blockchain system cannot be guaranteed.To solve this problem,an improved version of Raft(Imp Raft)based on Raft and the storage compression consensus(SCC)algorithm is proposed,where initialization process and compression process are added into the flow of Raft.Moreover,the data validation process aims to ensure that blockchain data cannot be tampered with.It is obtained from experiments and analysis that the new proposed algorithm can effectively reduce the size of the blockchain and the storage burden of lightweight IoT devices.

Hierarchical distributed control for decentralized battery energy storage system based on consensus algorithm with pinning node

A decentralized battery energy storage system(DBESS)is used for stabilizing power fluctuation in DC microgrids.Different state of charge(SoC)among various battery energy storage units(BESU)during operation will reduce batteries’service life.A hierarchical distributed control method is proposed in this paper for SoC balancing and power control according to dispatching center requirement in DBESS.A consensus algorithm with pinning node is employed to allocate power among BESUs in the secondary control whereas in the primary control,the local controller of BESU adjusts output power according to the reference power from secondary control.Part of BESUs are selected to be pinning node for accepting command from dispatching center while other BESUs as following nodes which exchange output power and SoC information with the adjacent nodes through communication network.After calculating reference power of each BESU by adopting consensus algorithm,the power sharing in DBESS is achieved according to their respective SoC of BESUs.Meanwhile,the total output power of DBESS follows the varying requirements of dispatching center.The stability of DBESS is also improved because of having no center controller.The feasibility of the proposed control strategy is validated by simulation results.

A consensus time synchronization protocol in wireless sensor network

Time synchronization is one of the base techniques in wireless sensor networks(WSNs).This paper proposes a novel time synchronization protocol which is a robust consensusbased algorithm in the existence of transmission delay and packet loss.It compensates for transmission delay and packet loss firstly,and then,estimates clock skew and clock offset in two steps.Simulation and experiment results show that the proposed protocol can keep synchronization error below 2μs in the grid network of 10 nodes or the random network of 90 nodes.Moreover,the synchronization accuracy in the proposed protocol can keep constant when the WSN works up to a month.

Enhancing IoT Data Security with Lightweight Blockchain and Okamoto Uchiyama Homomorphic Encryption

Blockchain technology has garnered significant attention from global organizations and researchers due to its potential as a solution for centralized system challenges.Concurrently,the Internet of Things(IoT)has revolutionized the Fourth Industrial Revolution by enabling interconnected devices to offer innovative services,ultimately enhancing human lives.This paper presents a new approach utilizing lightweight blockchain technology,effectively reducing the computational burden typically associated with conventional blockchain systems.By integrating this lightweight blockchain with IoT systems,substantial reductions in implementation time and computational complexity can be achieved.Moreover,the paper proposes the utilization of the Okamoto Uchiyama encryption algorithm,renowned for its homomorphic characteristics,to reinforce the privacy and security of IoT-generated data.The integration of homomorphic encryption and blockchain technology establishes a secure and decentralized platformfor storing and analyzing sensitive data of the supply chain data.This platformfacilitates the development of some business models and empowers decentralized applications to perform computations on encrypted data while maintaining data privacy.The results validate the robust security of the proposed system,comparable to standard blockchain implementations,leveraging the distinctive homomorphic attributes of the Okamoto Uchiyama algorithm and the lightweight blockchain paradigm.

LMI Consensus Condition for Discrete-time Multi-agent Systems

This paper examines a consensus problem in multiagent discrete-time systems, where each agent can exchange information only from its neighbor agents. A decentralized protocol is designed for each agent to steer all agents to the same vector. The design condition is expressed in the form of a linear matrix inequality. Finally, a simulation example is presented and a comparison is made to demonstrate the effectiveness of the developed methodology.

Distributed Cooperative Control Algorithm for Multi-UAV Mission Rendezvous

Multiple unmanned aerial vehicles(UAVs)cooperative operation is the main form for UAVs fighting in battlefield,and multi-UAV mission rendezvous is the premise of cooperative reconnaissance and attack missions.We propose a rendezvous control strategy,which divides the rendezvous process into two parts:The loose formation rendezvous and the close formation rendezvous.In the first stage,UAVs are supposed to reach the specific target locations simultaneously and form a loose formation.A distributed control strategy based on first-order consensus algorithm is presented to achieve this goal.Then the second stage is designed based on the second-order consensus algorithm to complete the transition from the loose formation to the close formation.This process needs the speeds and heading angles of UAVs to reach an agreement.Besides,control algorithms with a virtual leader are proposed,by which the formation states can reach a specific value.Finally,simulation results show that the control algorithms are capable of realizing the mission rendezvous of multi-UAV and the consistence of UAVs′final states,which verify the effectiveness and feasibility of the designed control strategy.

Three-dimensional(3D)parametric measurements of individual gravels in the Gobi region using point cloud technique

Gobi spans a large area of China,surpassing the combined expanse of mobile dunes and semi-fixed dunes.Its presence significantly influences the movement of sand and dust.However,the complex origins and diverse materials constituting the Gobi result in notable differences in saltation processes across various Gobi surfaces.It is challenging to describe these processes according to a uniform morphology.Therefore,it becomes imperative to articulate surface characteristics through parameters such as the three-dimensional(3D)size and shape of gravel.Collecting morphology information for Gobi gravels is essential for studying its genesis and sand saltation.To enhance the efficiency and information yield of gravel parameter measurements,this study conducted field experiments in the Gobi region across Dunhuang City,Guazhou County,and Yumen City(administrated by Jiuquan City),Gansu Province,China in March 2023.A research framework and methodology for measuring 3D parameters of gravel using point cloud were developed,alongside improved calculation formulas for 3D parameters including gravel grain size,volume,flatness,roundness,sphericity,and equivalent grain size.Leveraging multi-view geometry technology for 3D reconstruction allowed for establishing an optimal data acquisition scheme characterized by high point cloud reconstruction efficiency and clear quality.Additionally,the proposed methodology incorporated point cloud clustering,segmentation,and filtering techniques to isolate individual gravel point clouds.Advanced point cloud algorithms,including the Oriented Bounding Box(OBB),point cloud slicing method,and point cloud triangulation,were then deployed to calculate the 3D parameters of individual gravels.These systematic processes allow precise and detailed characterization of individual gravels.For gravel grain size and volume,the correlation coefficients between point cloud and manual measurements all exceeded 0.9000,confirming the feasibility of the proposed methodology for measuring 3D parameters of individual gravels.The proposed workflow yields accurate calculations of relevant parameters for Gobi gravels,providing essential data support for subsequent studies on Gobi environments.

Consensus control for heterogeneous uncertain multi-agent systems with hybrid nonlinear dynamics via iterative learning algorithm

In this study,We propose a compensated distributed adaptive learning algorithm for heterogeneous multi-agent systems with repetitive motion,where the leader's dynamics are unknown,and the controlled system's parameters are uncertain.The multiagent systems are considered a kind of hybrid order nonlinear systems,which relaxes the strict requirement that all agents are of the same order in some existing work.For theoretical analyses,we design a composite energy function with virtual gain parameters to reduce the restriction that the controller gain depends on global information.Considering the stability of the controller,we introduce a smooth continuous function to improve the piecewise controller to avoid possible chattering.Theoretical analyses prove the convergence of the presented algorithm,and simulation experiments verify the effectiveness of the algorithm.

Microcontroller Design Based on Dynamic Heterogeneous Redundancy Architecture

Redundancy control can effectively enhance the stability and robustness of a system.Based on the conventional redundancy control switchover and majority arbitration strategy,this paper introduces the concept of heterogeneity and dynamics,constructs a dynamic heterogeneous redundancy-based microcontroller architecture DHR-MCU,and designs a fixed-leader distributed consensus algorithm that satisfies the program running state control of this architecture.The theoretical analysis and actual measurement of the prototype system prove that this architecture has good anti-attack and self-recovery capabilities under normal functions and performances and meets the general robust features in terms of safety and security.

Vertical Federated Learning Based on Consortium Blockchain for Data Sharing in Mobile Edge Computing

The data in Mobile Edge Computing(MEC)contains tremendousmarket value,and data sharing canmaximize the usefulness of the data.However,certain data is quite sensitive,and sharing it directly may violate privacy.Vertical Federated Learning(VFL)is a secure distributed machine learning framework that completes joint model training by passing encryptedmodel parameters rather than raw data,so there is no data privacy leakage during the training process.Therefore,the VFL can build a bridge between data demander and owner to realize data sharing while protecting data privacy.Typically,the VFL requires a third party for key distribution and decryption of training results.In this article,we employ the consortium blockchain instead of the traditional third party and design a VFL architecture based on the consortium blockchain for data sharing in MEC.More specifically,we propose a V-Raft consensus algorithm based on Verifiable Random Functions(VRFs),which is a variant of the Raft.The VRaft is able to elect leader quickly and stably to assist data demander and owner to complete data sharing by VFL.Moreover,we apply secret sharing todistribute the private key to avoid the situationwhere the training result cannot be decrypted if the leader crashes.Finally,we analyzed the performance of the V-Raft and carried out simulation experiments,and the results show that compared with Raft,the V-Raft has higher efficiency and better scalability.

Model of decentralized cross-chain energy trading for power systems

With the development of the energy Internet, more distributed generators are connected to the power grid, resulting in numerous heterogeneous energy networks. However, different energy networks cannot perform efficient energy trading in the centralized management mode, this deeply affecting the complementary ability of heterogeneous energy, resulting in the islanded energy phenomenon. In this model, the same energy on the chain is traded within the chain, and the heterogeneous energy on different chains is traded across chains. To trade energy between heterogeneous energy networks more efficiently, the blockchain-based cross-chain model is proposed based on the existing infrastructure. Heterogeneous energy nodes are assigned to different energy sub-chains and cross-chain energy transactions are performed through a relay-chain, which utilizes the improved Boneh–Lynn–Shacham signature scheme consensus algorithm based on the proof-of-stake and practical Byzantine fault tolerance. The experimental simulations on energy trading efficiency, throughput, and security, show its superiority over existing systems. Further, the simulation results provide a reference for the application of cross-chain technology in energy interconnection.

Can blockchain link the future?

Recently,decentralization has been extensively explored by researchers.Blockchain,as a representation of decentralized technology,has attracted attention with its unique characteristics,such as irrevocability and security.Consequently,herein,we introduce cutting-edge blockchain technologies from four directions:blockchain system,consensus algorithms,smart contract,and scalability.Subsequently,we analyze the current lack of consensus mechanism,fault tolerance,and block capacity of the blockchain,and the integration of blockchain into 5G/6G mobile communication.Furthermore,we discuss the possible applications of blockchain in intellectual property protection,the Internet of Things,digital twins,standardization,and epidemic prevention and control.Finally,explore the impacts and solutions of blockchain on human society beyond technology.

Constrained cooperative control design for distributed morphing wing systems

An efficient design method is proposed for the cooperative control problem of morphing wing systems with distributed structures and bounded control inputs. The multi-agent model of the distributed morphing wing system is established. The cooperative controllers with saturation constraints are presented. By introducing the concepts in consensus algorithms, the cooperative information links in the controllers are described by graphs, and the corresponding Laplacian matrix is defined. The design conditions of the cooperative controllers are proposed, in the form of linear matrix inequalities. For the case of undirected information links, the controller design conditions are simplified as algebraic inequalities, which highly reduce the computation cost. The designed controllers are implemented on a distributed morphing wing platform, and experiments are carried out. Simulation and experiment results show that the controllers can make all the actuating units in the morphing wing system cooperatively achieve the desired positions, which demonstrates the effectiveness of the proposed theory.