15 results about "Communication complexity" patented technology

The present application relates to the technical field of unmanned aerial vehicle swarm technology and blockchain technology, and particularly relates to a chain BFT consensus method for unmanned aerial vehicle ad hoc network. The present application selects a plurality of unmanned aerial vehicles for network authentication, constructs an unmanned aerial vehicle ad hoc network, constructs an ad hoc network topology structure, selects consensus nodes based on flight requirements, constructs a consensus network topology structure, assembles a consensus network based on a chain BFT protocol, divides the consensus nodes into a plurality of chain nodes and a plurality of backup chain nodes, optimizes the consensus network using a PSO algorithm to determine the chain sequence of each chain node in the consensus network, transmits information according to the chain sequence, and updates the topology structure in the consensus network based on a sudden situation to redetermine the chain sequence of each chain node. The present application guarantees the timing of information transmission, effectively determines the optimal chain sequence quickly and accurately, effectively guarantees the data transmission efficiency, effectively reduces the communication complexity, and effectively improves the consensus efficiency of the unmanned aerial vehicle group in the consensus network.

This invention discloses a privacy-preserving method for federated learning based on adaptive quantization and sparse secret sharing: the server generates a globally random seed and broadcasts it to the clients. Each client locally generates a sparse neighbor set and negotiates a shared key, reducing communication complexity to logarithmic levels. After training gradients, the clients adaptively quantize to an integer ring, using their private seed and shared key to generate private masks and pairwise masks, which are then superimposed and uploaded. Simultaneously, the seed and key are split into secret shares and distributed to neighbors. The server directly sums these to obtain a preliminary aggregation result. After the window expires, it requests secret fragments to reconstruct the private seed and shared key, eliminating private masks and pairwise mask remnants caused by disconnected clients. After dequantization, the global model is updated. This invention reduces communication and computational overhead, eliminates the need for homomorphic encryption, has strong anti-disconnection capabilities, supports large-scale IoT devices, and achieves efficient and robust federated learning aggregation while ensuring information-theoretic security.

This invention relates to the field of computer technology and discloses an in-band interrupt system, method, electronic device, and storage medium. By having the host end enter an interrupt waiting mode after completing a task in high-speed read / write mode, the slave end takes over the data read / write channel and sends an in-band interrupt command to the host end. Upon receiving an in-band interrupt command from any slave end, the host end does not need to exit the current high-speed read / write mode but directly responds to the in-band interrupt command. Based on the target slave end represented by the in-band interrupt command, the host end retrieves the data to be read from the target slave end in high-speed read / write mode. By inserting an interrupt waiting mode after the task is completed in high-speed read / write mode, the host end can directly respond to the in-band interrupt command sent by the slave end in high-speed read / write mode, avoiding the communication complexity caused by "exit-processing-re-entering" and improving communication efficiency.

This application proposes a cross-platform data control method and system. The method includes: acquiring initial battery data of each battery pack from a pre-connected target BMS device based on a preset communication method; processing the initial battery data based on a preset data processing method to obtain target battery data; verifying the target battery data based on a preset multi-layer verification method; displaying the verified target battery data through a user interface; and detecting user control commands in real time through the user interface, executing corresponding operations based on the user control commands, and returning operation results. The method provided in this application effectively solves the defects of unstable communication, unreliable data parsing, and high complexity in existing cross-platform communication. It effectively improves the stability and reliability of cross-platform BMS data communication and reduces the complexity of cross-platform communication.

The application relates to an expandable distributed privacy protection FFT method and system based on secret sharing and MAC tags, which comprises the following steps: input original data is divided into multiple data shares by adopting a three-party replication secret sharing technology, a corresponding MAC tag is generated for each data share, and the secret sharing is performed to each participant cluster; each computing node in each participant cluster performs one-dimensional fast Fourier transform on each row of the held data share to obtain an intermediate matrix; a rotation factor is multiplied with the intermediate matrix to obtain a rotation matrix; each computing node divides the rotation matrix into multiple section shares in the column direction, and sends each section share to a corresponding group leader according to the serial number of the section share; the computing node calculates the fast Fourier transform in the column direction to obtain an output matrix, and a principal verifies the output matrix; while resisting malicious attacks, the communication complexity is reduced from O(M) to O(M / N), the MAC verification overhead is reduced to less than 8% of the total time consumption, and the expandability of the system is greatly improved.

This invention discloses a signature-based method and apparatus for reliable cross-consensus broadcasting in a communication system. The method includes: a leader node sending a cross message to all nodes in a second node group; the second node group, upon receiving the cross message, generating an incoming message after verifying the historical cross-consensus message set, and sending it to the leader node; the leader node, upon receiving a first number of incoming messages, processing the incoming messages, generating a capture message, and sending it to all nodes in the second node group; the second node group, after waiting for a trigger condition to be met, processing the historical cross-consensus message set and sending a response message to the leader node; the leader node, upon receiving a second number of response messages, sending an acknowledgment message to all nodes in the second node group; and the second node group, upon receiving an acknowledgment message, performing cross-consensus broadcasting and delivery of the cross-consensus message. This invention enables reliable cross-consensus broadcasting with low communication complexity and high efficiency.

This invention proposes a reputation-based hierarchical PBFT consensus method for V2G scenarios, aiming to solve the problem of high communication complexity in traditional PBFT as the node scale increases. This invention constructs a two-layer consensus structure: bottom-layer nodes perform initial intra-group confirmation of consensus requests, while top-layer nodes participate in cross-group consensus. Regarding node selection, top-layer nodes are selected within a group based on their reputation values ​​to participate in cross-group consensus, while other nodes only participate in intra-group consensus. Simultaneously, among top-layer nodes, both node reputation values ​​and the average reputation value of the group are comprehensively considered, combined with a verifiable random function to select a global master node, improving the fairness and randomness of master node election. Furthermore, this invention introduces a reputation evaluation mechanism, constraining malicious or low-performance nodes by comprehensively considering factors such as node performance, historical transaction processing power, and user evaluations. Through the synergistic effect of the hierarchical structure and the reputation mechanism, the number of inter-node communications is reduced, improving consensus efficiency.

This invention seeks protection for a consensus method for vehicle-to-everything (V2X) networks based on a two-layer blockchain, belonging to the field of V2X security technology. It includes: S1, constructing a two-layer architecture of a bottom-layer sharded chain and a top-layer main chain; S2, selecting vehicle nodes participating in the sharded chain consensus through a multi-dimensional consensus node election algorithm; S3, determining the sharded chain consensus master node using a hidden master node election mechanism; S4, completing consensus within the sharded chains using a practical Byzantine fault-tolerant algorithm; S5, the main chain adopts a directed acyclic graph consensus mechanism and introduces a dynamic verification quantity calculation model. The advantages of this invention are: (1) The multi-dimensional election algorithm selects high-quality nodes, improving consensus stability and security; (2) The layered architecture divides the V2X network into parallel consensus domains, with the bottom layer handling local consensus in parallel to reduce communication complexity, and the top layer coordinating cross-shard transactions to improve scalability; (3) The dynamic verification quantity calculation model adaptively adjusts the verification quantity according to network load, significantly improving system throughput.

This invention discloses a distributed data-driven consensus control method and system for multiple underwater robots, relating to the field of underwater unmanned system control technology. Based on a discretized state-space model of the multi-underwater robot system and a distributed optimal performance index function with communication topology coupling, a communication subgraph containing the maximum degree node is selected and a temporary fully connected learning structure is constructed. The two core gain matrices of the controller are iteratively solved using a recursive least squares method. Based on the discretized state-space model and the two core gain matrices, a distributed data-driven consensus controller is designed using a subgraph collaborative learning strategy iterative method and robust stability margin theory. According to the eigenvalue range of the controller gain and the dynamic update rule of the stability margin, the conditions for global stability and asymptotically consistent state of the multi-underwater robot system are obtained. This reduces computational and communication complexity and improves the robustness and collaborative control accuracy of the system in complex underwater environments.

The present application relates to information security, distributed computing technology field, more particularly, to a kind of based on directed acyclic graph's byzantine reliable broadcast method.By using the structure of directed acyclic graph, a new method for completing byzantine reliable broadcast is proposed, assuming that m message needs to complete reliable broadcast, the communication complexity of the protocol is O (mn|M|+kmn), and the communication round number only needs 3 rounds in average sense.By the present application, the communication round number of reliable broadcast protocol can be reduced and the communication complexity is reduced, so as to improve the efficiency of reliable broadcast.The current optimal reliable broadcast protocol is 4 rounds of communication, and the present application is 3 rounds of communication;In the case of single message reliable broadcast, the communication complexity of the current optimal reliable broadcast protocol is O (n|M|+kn+n 2 logn), and the present application is O (n|M|+kn).

The application relates to the technical field of multi-agent system cooperative control, in particular to a multi-robot system predetermined time tracking control method based on a double-layer communication, which comprises the following steps: a double-layer communication framework containing a leader planning layer and a follower execution layer is constructed; a distributed virtual controller and an actual controller are designed for the leader planning layer, a parameter self-adaptive updating mechanism is constructed, a leader layer predetermined time consistency control scheme is formed; a distributed virtual controller and an actual controller are designed for the follower execution layer, a parameter self-adaptive updating mechanism is constructed, a follower layer cooperative tracking control scheme is formed; the stability of a double-layer closed-loop system is analyzed based on Lyapunov stability theory, a time sequence cooperation mechanism is constructed, and each agent is driven to realize stable and consistent tracking within a predetermined time. The application effectively reduces the system communication complexity in a multi-leader scene, overcomes model parameter uncertainty, and realizes the convergence of global tracking error within a preset time.

This invention relates to the field of cooperative control technology for multi-agent systems, specifically a predetermined-time tracking control method for multi-robot systems based on two-layer communication. The method includes: constructing a two-layer communication framework comprising a leader planning layer and a follower execution layer; designing distributed virtual controllers and actual controllers for the leader planning layer, and constructing a parameter adaptive update mechanism to form a consistent control scheme for the leader layer within the predetermined time; designing distributed virtual controllers and actual controllers for the follower execution layer, and constructing a parameter adaptive update mechanism to form a cooperative tracking control scheme for the follower layer; analyzing the stability of the two-layer closed-loop system based on Lyapunov stability theory, and constructing a temporal cooperative mechanism to drive each agent to achieve stable and consistent tracking within the predetermined time. This invention effectively reduces the system communication complexity in multi-leader scenarios, overcomes model parameter uncertainty, and achieves convergence of global tracking error within a preset time.

The application provides a multi-cloud AI model integrity and specification consistency self-auditing method and system, which comprises the following steps: a key generation center performs consistency verification on AI model files and specification metadata uploaded by a user, generates a specification hash value and stores the specification hash value to a block chain, and initializes system parameters and generates a user public and private key; the user divides the files into blocks and stores the blocks to multiple cloud nodes; in each round of auditing, a random secret leader election algorithm based on a verifiable random function is used to select nodes that meet safety conditions to form an audit committee; members of the audit committee generate an aggregated proof through a linear interaction protocol, and the communication complexity is reduced to; based on the aggregated proof and the specification hash value, integrity and specification consistency double verification is performed, and the results of the verification are recorded to the block chain. The application solves the technical problem that the existing cloud data auditing method cannot simultaneously consider a decentralized self-auditing architecture, auditing efficiency optimization and specification consistency verification.