44 results about "Communication complexity" patented technology

The invention discloses a distributed urban and rural planning decision support method and system, and relates to the technical field of data analysis, and the method comprises the following steps: S100, drawing a planar graph of a to-be-planned region, dividing the planar graph of the region according to a Morse decomposition method, and constructing a region matrix, S200, calculating the coverage rate of the region matrix, and S300, calculating the coverage rate of the region matrix. And planning the surveying and mapping path. According to the method, planning units and surveying and mapping grids are unified into the same quadrilateral matrix through Morse complex, repeated zoning and edge matching errors are effectively avoided, the edge weight is inversely proportional to the building coverage rate, an unmanned aerial vehicle and a surveying and mapping vehicle automatically and preferentially encrypt a high built-up area, field working hours are saved, the data precision of a core construction area is guaranteed, and the construction efficiency is improved. The regional matrix naturally corresponds to edge nodes, and each node only communicates with an adjacent unit, so that the MST and the local route can be locally solved, the communication complexity is reduced, and the method is suitable for large-scale regional surveying and mapping.

The invention provides an Internet of Vehicles data sharing and storage model based on a double-layer block chain, and aims to solve the problems of low data interaction efficiency, poor expansibility, insufficient security and the like in the traditional Internet of Vehicles. According to the model, road side units are grouped geographically, an optimized Raft protocol is adopted in each group to realize rapid consensus, and an improved PBFT protocol is adopted among the groups to ensure global consistency. Self-adaptive leader election, batch processing and assembly line mechanisms are introduced into the Raft protocol, so that the throughput and response speed of the system are improved; a reputation value-based VRF main node election mechanism and a BLS aggregation signature technology are introduced into the PBFT protocol, so that the communication complexity is reduced, and the system security and fault-tolerant capability are enhanced. According to the method, the fault-tolerant rate and the message complexity of the system are analyzed theoretically, the advantages of the system in the aspects of throughput, time delay and fault-tolerant performance are verified through simulation experiments, and the method is suitable for large-scale and high-concurrency car networking application scenes.

The invention relates to a practical consensus algorithm for file resource sharing, which comprises reputation-driven task allocation: according to reputation values calculated in real time, nodes with high reputation values are preferentially selected by the algorithm to form a core consensus group to execute the most critical consensus task, and the number of nodes participating in core communication is remarkably reduced. And protocol flow optimization: fundamentally reducing the communication complexity to O (n) level by limiting the scale of the core consensus group and reconstructing a message transmission path. And node state dynamic autonomy: the algorithm has real-time evaluation and dynamic adjustment capabilities on node types. The reputation model continuously monitors node behaviors, can automatically perform degradation processing on low-reputation or fault nodes, and can timely discover and safely isolate or delete bad nodes through a specific mechanism without restarting the system. Through test verification, the reliability, safety, higher throughput and lower delay of the consensus algorithm are verified.

The invention discloses a lightweight non-repudiation model fingerprint efficient traceability method, and belongs to the related technical fields of cryptography application, digital content traceability and the like. The method comprises the following specific steps: inputting an original image data set into a computer system; training and learning a lightweight encoder and a decoder, wherein the encoder maps a binary fingerprint and an image to generate a residual error; the residual error is constrained through a Sigmoid function to generate a fingerprint-containing image, and the model is optimized through dual loss; generating metadata of a PIT parameter binding salt value and a commitment value, and embedding the fingerprint into the image; during detection, a decoder is loaded to extract a decoded fingerprint, binaryzation is carried out through a threshold function, and dual verification is realized through fingerprint polynomial comparison and commitment value verification. According to the method, a fingerprint verification mode is converted into polynomial verification through a polynomial equivalent detection technology, the communication complexity is reduced to sub-linear overhead, lightweight efficient verification is realized, and the method is suitable for efficient traceability and authenticity verification of deep forged images.

The invention discloses a distributed particle filtering algorithm based on Gaussian mixture and Gossip fusion, which relates to the technical field of distributed state estimation and comprises the following steps: acquiring local posteriori distribution by a sensor node through local particle filtering, exchanging sufficient statistics of GMM between the node and a randomly selected neighbor node based on a Gossip protocol, and obtaining a distributed state estimation result. Iterative fusion of the GMM is realized through weighted mixed importance sampling; and finally, optimizing a global state estimation result through a posterior correction step. According to the method, only full statistics such as a mixed coefficient, a mean vector and a covariance matrix of a Gaussian mixture model (GMM) are exchanged among nodes, original particle transmission is replaced, the communication overhead is remarkably reduced, and the communication complexity is linearly increased along with the network scale; meanwhile, an adaptive GMM component adjustment, a regularization weighting EM algorithm and an iteration updating strategy of random weight matrix control are adopted, the calculation process is simplified on the premise that the estimation precision is guaranteed, the single-node calculation burden is reduced, and large-scale sensor network deployment with limited adaptive resources is achieved.

The invention discloses a data access method. The method can be applied to an integration platform. When a user wants to access a first application program deployed in an intranet through an extranet, a proxy server deployed in the extranet obtains a data access request, and the data access request is used for requesting to access application data in the first application program. The proxy server packages the data access request to obtain a first message, and the first message is a transport layer message and comprises the data access request. And then, the proxy server sends the first message to a proxy client deployed in an intranet, so that the proxy client parses the first message and then sends the obtained data access request to the first application program. Visibly, through the scheme, the proxy server side and the proxy client side can interact through the transmission layer, the proxy client side does not need to pay attention to an application layer protocol, the communication complexity between the extranet and the intranet is simplified, and therefore the convenience that the extranet accesses the intranet is improved.

The invention provides a communication method and device, communication equipment, a communication system and a storage medium. The method comprises the following steps: sending a first instruction to second equipment; the second equipment is environment Internet of Things equipment, and the first instruction is used for inventory of the second equipment; receiving first information and / or a first identifier sent by the second equipment; the first information is a random number generated by the second equipment, and the first identifier is used for identifying the second equipment; and determining second information based on the first information and / or the first identifier, wherein the second information is used for performing communication authentication between the first equipment and the second equipment. According to the method disclosed by the invention, the communication complexity is greatly reduced, meanwhile, the implementation complexity of the environment Internet of Things equipment is also reduced, the communication time and communication resources are saved, and the communication efficiency is improved.

The invention belongs to the technical field of medical scene consensus, provides a medical alliance block chain grouping consensus method and system based on leader group decision, and aims to solve the practical problems of high communication complexity, power concentration and main node failure of a traditional PBFT in a large-scale node scene. Through hierarchical design of leader group decision, a grouping strategy is adopted to prevent a power concentration phenomenon, and through leader group parallel decision, post quantum security is guaranteed, communication overhead is reduced, consensus efficiency is improved, and the power concentration phenomenon is avoided.

This application relates to an interaction method, apparatus, device, and medium supporting a service-oriented software architecture. The method includes: obtaining a list of SOME / IP services for a vehicle; configuring a corresponding configuration file for each SOME / IP service according to the SOME / IP service list; creating at least one processing cluster based on the configuration file to process message input from the SOME / IP services; and monitoring the activity status of SOME / IP service topics using a pre-defined message middleware; and subscribing to topics published by the SOME / IP services and / or publishing topics subscribed to by the SOME / IP services based on the activity status. Thus, by mapping the vehicle's SOME / IP services to topics, the problem of numerous, separate communication between each SOME / IP service, which makes one-to-many message fusion communication difficult, is solved, simplifying communication complexity and improving convenience.

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.

The invention discloses a fine-grained distributed training method and system based on gradient quantization sparse compression, proposes a dynamic tensor fusion technology, automatically searches an optimal tensor fusion buffer threshold by using a binary search method, merges gradient tensors of a plurality of layers into a larger buffer for transmission, does not need manual adjustment and optimization, and improves the training efficiency. And the optimal balance between the communication delay and the bandwidth utilization rate is realized. A fine-grained pipeline scheduling mechanism for communication decoupling is provided, a gradient synchronization process is decoupled into a sparse communication task in a back propagation stage and a quantitative communication task in a forward propagation stage, fine-grained overlapping with forward and backward calculation tasks is realized, the utilization rate of calculation resources is maximized, and communication delay is completely masked. In the back propagation stage, a fragmentation Top-k sparsification and AlltoAll routing strategy is adopted, transmission of a large number of zero values is avoided, and the communication complexity of back propagation is reduced; in the forward propagation stage, a low-bit sparse quantization and AllGather strategy is adopted, and the bandwidth bottleneck problem caused by the fact that a traditional sparse method becomes dense back in the parameter synchronization stage is solved.

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.

The invention discloses a block consensus method and device, and relates to the technical field of block chains, and the method comprises the steps that a first node obtains an ith block broadcasted by a second node in sequence; the ith block is a new block generated by the second node in the round, and the ith block comprises position information of a plurality of historical blocks and aggregation pointers of the plurality of historical blocks; the plurality of historical blocks are a plurality of (i-1) th blocks in a local chain of the second node; the aggregation pointer is obtained by the second node based on the position certificates of the plurality of historical blocks; and the first node verifies the aggregation pointer, and adds the ith block to the local chain after the verification is passed and the fact that the position certificates of the plurality of historical blocks and the consistency certificates of the plurality of historical blocks are cached locally is confirmed. The communication complexity between global nodes and the global storage complexity are reduced under the condition that the security consensus of the block chain system is ensured.

This invention discloses an online anomaly detection method for time series data based on sensor grouping, comprising: sensor nodes collecting current time series data; uploading the current time series to a cloud server, so that the cloud server generates a correlation coefficient map of the wireless sensor network based on the correlation coefficients between the sensor nodes, and groups multiple sensor nodes based on the correlation coefficient map, and sends the grouping results to the wireless sensor network; using a pre-trained Bayesian network model to perform anomaly screening on its own current time series to obtain a primary detection result; for each grouped node set, performing anomaly screening on its own current time series according to a first preset threshold corresponding to its own node set to obtain a secondary detection result; and determining the detection result of the current time series of each sensor node. This invention can reduce the communication complexity in wireless sensor networks, reduce energy consumption, and improve the accuracy of anomaly detection.

A secure multi-party computing SPDZ protocol implementation method based on a six-tuple comprises the steps that the six-tuple based on a global key is installed in advance by all parties before online interaction computing, and local direct addition computing fragmentation is carried out according to a computing rule or multiplication computing fragmentation is carried out by obtaining the six-tuple during online interaction. According to the method, for most dishonest secure multi-party computation (MPC) protocols of a matrix ring, matrix multiplication and addition are supported, and addition sharing of a secret MAC value can be safely calculated under sub-linear communication complexity through improved vector linear oblivious evaluation (subfield VOLE).

Exemplary embodiments relate to location-based communications. In one method, a terminal device obtains identification information, the identification information being specific to a geographic area of a plurality of geographic areas covered by a non-terrestrial network (NTN). The terminal device then receives a reference signal in the geographic area according to the identification information. Therefore, the communication complexity in the NTN can be reduced.

The application discloses a Byzantine fault-tolerant method and device based on a tree topology network and a storage medium. The Byzantine fault-tolerant method based on the tree topology network comprises the following steps: (1) dividing consensus nodes into independent groups based on a tree topology network structure; (2) introducing a feedback mechanism to supervise and feedback the behavior of the nodes; (3) performing probability analysis on a feedback domain failure probability in the feedback mechanism; and (4) calculating communication complexity. The Byzantine fault-tolerant method based on the tree topology network, the device and the storage medium can improve node scalability and fault-tolerant performance, and reduce network communication complexity.

The invention belongs to the field of intelligent traffic systems and privacy computing, and particularly relates to a privacy protection k-means clustering method and system used in a vehicle scenario, and the method comprises the steps: a system configuration stage: generating and distributing encryption parameters under a shared Paillier public key when the system is initialized; in the report submitting stage, each vehicle encrypts and uploads the semantic feature vector of the report when submitting the report; in the privacy protection clustering stage, the server uses a self-defined distance function and an aggregation strategy to execute k-means clustering on the ciphertext; in the data center disclosure stage, only the decrypted clustering center is displayed during clustering center disclosure, so that further analysis is facilitated, and data of a single vehicle cannot be leaked. According to the method, non-interactive clustering is adopted, the vehicles only upload encryption features at one time, the vehicles do not need to participate in subsequent iteration, and the overall communication complexity is O (n).

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.

The present application belongs to the network communication technical field, disclose a kind of service system stability method and device based on mutual for each other of process, by a registration monitoring daemon mechanism, all process of registration realizes unified method, each other's daemon process between two, while regulating unified monitoring point, so that arbitrary process between process each other communication can also be well carried out process state judgment, so that service system can be detected in time and recovered in time when process hangs due to abnormality, increase the stability of the overall operation of service system.The present application sets up appropriate time period, when process appears abnormality, can be found in time and be recovered in time, and process is judged by exception detection point between process, does not need process to carry out network communication or state response directly between process, reduces communication complexity and design complexity, reduces coupling.

The invention relates to an inter-process communication method and device, computer equipment and a readable storage medium. The method comprises the steps that in response to a calling instruction initiated by a user for a desktop application, a main process and a sub-process corresponding to the main process are created, and the sub-process loads a needed module from a local directory of a client side and loads a proxy object corresponding to a virtual module under the condition that the loading module is the virtual module; the virtual module provides a business service interface for a real module integrated by the main process, and the sub-process captures function information stored in the virtual module loaded by the sub-process through the proxy object and sends the function information to the main process, so that the main process executes corresponding business logic according to the function information. The sub-process realizes transparent calling of the host process function through the virtual module and the proxy object, so that the inter-process communication complexity is reduced, and the inter-process communication efficiency is improved.

The invention discloses a distributed graph neural network training method based on virtual node aggregation, and belongs to the technical field of computers, and the method comprises the following steps: dividing original graph data through distributed graph partitions, screening HALO nodes, dividing subsets according to source partitions, calculating the local connectivity of each HALO node, and establishing a mapping table; creating a virtual node for each subset, constructing a connection relationship, calculating an embedded vector in a weighted aggregation manner, and transmitting the embedded vector of the virtual node to realize O (1)-level cross-partition communication; message passing and parameter updating are completed based on the virtual nodes, and an iterative model is trained to converge; according to the method, the virtual nodes replace the HALO nodes for direct transmission, so that the communication complexity is remarkably reduced, and meanwhile, the training precision is guaranteed; the method is adaptive to various GNN models and training targets, adopts an optimized storage and calculation strategy, is high in resource utilization rate, and is suitable for a distributed training scene of large-scale graph data.

The invention discloses a Byzantine fault-tolerant improved consensus protocol implementation method and system based on layering and pipeline, and the method comprises the following specific steps: S1, a preparation stage PREPARE: a master node generates and broadcasts a new proposal Bv, and after a common node votes and accepts, a group leader collects a signature and aggregates the signature into a partial aggregation signature, and then sends the partial aggregation signature to the master node; s2, pre-submission stage PRECOMMIT: after aggregating a set number of preparation votes, the main node generates and broadcasts a pre-submission message; after the common nodes vote and approve, the group leader collects and partially aggregates signatures again, and then sends the signatures to the main node; s3, COMMIT in a submission stage: after the main node aggregates a set number of pre-submission tickets, broadcasting a final submission message; and the common node submits the block after verification, and jointly triggers the view to be switched to the next main node. Through the aggregation signature technology, the communication complexity is reduced, signature aggregation is changed from original leader aggregation to excitation node primary aggregation and leader secondary aggregation, and the verification process is accelerated.

The application belongs to the technical field of consensus in medical scenarios, and provides a medical alliance blockchain grouping consensus method and system based on leader group decision, aiming at the realistic problems of high communication complexity, power concentration and master node failure of traditional PBFT in large-scale node scenarios, combining a node level grouping model, through hierarchical design of leader group decision, adopting a grouping strategy to prevent power concentration, through parallel decision of the leader group, while ensuring post-quantum security, reducing communication overhead, improving consensus efficiency and avoiding power concentration.

The invention relates to the technical field of quantum, and particularly provides a quantum confidential query method, device and equipment, a medium and a product. In the disclosure, an original generated key is acquired, the original generated key is related to a measurement base of a second user, and the original generated key comprises a plurality of bits; generating a sparse key based on the parity check value corresponding to the original generated key; performing replacement processing on the sparse key to obtain an intermediate key; performing shift processing on the intermediate key to obtain a final key; and querying in database encryption information from the second user by using the final key to obtain target data. The original generated key is obtained through the bit with the random length, so that the first user can obtain the bit number with the random length through one-time query, the communication complexity is reduced, and the efficiency is improved. Moreover, error correction detection is completed on the original generated key by generating the sparse key, errors caused by channel noise are avoided, and thus channel loss can be tolerated. Therefore, the accuracy of quantum confidential query can be improved.

The invention discloses a block alliance consensus method and a related device, and relates to the technical field of block chains, the block alliance consensus method is applied to a block chain network, the block chain network comprises a plurality of committee nodes and a plurality of consensus nodes, the plurality of committee nodes comprise a main node and a plurality of candidate main nodes, according to the method, traditional single-round complex voting is divided into two rounds of verification with high dependency and simplified steps, cross-round consensus linking is carried out in the mode that the consensus state under the chain of the previous block is hashed and then the subsequent block is embedded, the communication complexity between the nodes is remarkably reduced, the expenditure of voting messages of the nodes of the whole network is avoided, and meanwhile, the communication efficiency is improved. Through candidate verification of the candidate master node and rapid consensus state confirmation based on Hash, the efficiency of the consensus process and the system throughput are greatly improved. Therefore, compared with the traditional Byzantine fault-tolerant consensus, the communication complexity is reduced, and the communication efficiency and the calculation efficiency of the system are improved.

The application relates to a power grid data management method and device based on a blockchain database platform and a computer device. When it is necessary to perform node election, initial reputation values of multiple blockchain nodes are obtained; the reputation values are sorted based on the initial reputation values to determine consensus nodes and supervision nodes; the supervision nodes access message copies received by local logs of the consensus nodes and message copies previously received by the supervision nodes from the consensus nodes for comparison; when there are multiple trusted consensus nodes, the highest-scored consensus node is determined as an execution node based on J=b*C*[a*(1 / T)], wherein T is a waiting time corresponding to a random number of the consensus node, C is a reputation value corresponding to the consensus node, b is a reputation value influence factor coefficient, a is a waiting time influence factor coefficient, and J is a score. Under the premise of ensuring overall safety, the communication complexity of the consensus process is reduced, the consensus effectiveness is improved, and the collaborative management of multiple roles under large power grid data is facilitated.

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.