89 results about "Communication complexity" patented technology

The invention relates to the technical field of underwater robot cooperative control, and provides an elastic consistency control method and system of a multi-underwater robot system. The elastic consistency control method for the multi-AUV system comprises the following steps: discretizing and linearizing the multi-AUV system, introducing a performance index to describe the influence of communication topology on the dynamic behavior of the system, and calculating the elastic consistency of the multi-AUV system on the basis of a centralized optimal control method of a local decoupling system and a robust stability theory. And designing an elastic consistency controller and obtaining controller gain by solving a local algebraic Riccati equation so as to realize consistency control of multiple AUV system states. According to a sparse mode matrix spectrum of a distributed controller, a system stability condition is given, and efficient cooperation and stable operation of a multi-AUV system in a complex underwater environment are ensured. According to the method, the calculation and communication complexity is remarkably reduced, the method is suitable for a multi-AUV cooperative working environment, and a new technical solution is provided for cooperative control of the underwater unmanned system.

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 present disclosure discloses a blockchain consensus method and a blockchain replica apparatus, and provides a cBFT protocol with a plurality of different voting thresholds, which may reduce a communication complexity of the protocol, reduce a consensus agreement time, improve a throughput of a consensus system, and simultaneously reduce sensitivity of the protocol to a timer.

The invention discloses a supply chain traceability-oriented block chain hybrid consensus optimization method, which comprises the steps of calculating a comprehensive score of a supply chain participation node by constructing a node multi-index comprehensive scoring model, and screening candidate center nodes of each group according to a scoring result; grouping the network nodes by combining the geographic positions and the comprehensive scores of the nodes, and selecting leader nodes and supervision nodes in the groups according to the comprehensive scores of the nodes to form a multi-group consensus architecture; in the consensus process, the center nodes of each group adopt a PBFT consensus protocol to carry out inter-group consensus, and data synchronization is realized by introducing a Raft consensus protocol of a supervision node in each group; meanwhile, a Brotli data compression technology is also introduced, the network bandwidth is optimized through data compression, the data transmission quantity is reduced, and the consensus efficiency is improved. The method has remarkable advantages in the aspects of improving the expandability of an existing alliance chain consensus mechanism, reducing the communication complexity, improving the consensus efficiency and the like, and is particularly suitable for supply chain traceability and other scenes.

The invention discloses a multi-type resource participation power grid frequency modulation method based on a consistency algorithm, and the method comprises the steps: firstly constructing an improved frequency response model fusing distributed optical storage equipment, hydrogen storage and energy storage equipment and a DC flexible load, identifying system parameters, solving a multi-resource comprehensive adjustment coefficient, constructing a directed graph model, employing a grouping consistency algorithm, and obtaining a multi-type resource participation power grid frequency modulation model; the optimal adjustment coefficient of each resource is solved through distributed optimization of an augmented Lagrange function and a consistency index, and primary frequency modulation of a multi-type resource collaborative response system is driven. According to the multi-type resource participation power grid frequency modulation method based on the consistency algorithm, by driving a multi-type resource collaborative response system to perform primary frequency modulation, collaborative regulation and control of light storage, hydrogen storage and flexible load are realized, economy and operation constraints are considered through distributed optimization, and communication complexity is reduced through a clustering iteration mechanism; and the frequency stability of the high-proportion new energy power grid is obviously improved.

The invention provides a symmetric private information retrieval method and device, a medium, a program product and a system. According to the method, the limitation that the number D of databases of an information source is equal to 1 is broken through, and the retrieval frequency Q of an information sink is equal to D or 1lt; qlt; according to the method, information retrieval is realized under D, an inadvertent key distribution and post-processing method is not increased according to the number D of the databases and the retrieval times Q, that is, one inadvertent key distribution is matched with one post-processing method to help an information sink to complete Q times of information retrieval from the D databases, and collapse processing also improves the security in data transmission. Therefore, the problems that the communication complexity between the information source and the information sink is increased and the retrieval efficiency is influenced due to the careless key distribution of the symmetric private information retrieval method in the existing scheme are solved.

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 multi-IP motion controller, industrial equipment and a control method, and relates to the technical field of virtual controllers. A plurality of virtual controls; a multi-IP binding module; an IP mapping module; wherein the virtual controller receives a data packet to generate a control instruction, and sends the control instruction to the corresponding execution terminal through the physical network interface, so as to control the operation of the execution terminal. According to the multi-IP motion controller provided by the invention, the independent IP address is allocated to each internal virtual controller and bound to the same physical network interface, and accurate data addressing and distribution based on the target IP address are realized in combination with an IP mapping mechanism, so that the problems of resource coupling and communication mixing of a traditional single IP architecture are effectively solved, the system integration and use process is simplified, and the system reliability is improved. And a high-performance, high-reliability and flexible solution is provided for complex multi-station cooperative control.

The invention provides a multi-party privacy set intersection method and system in an unbalanced scene, and the method comprises the steps: taking an input party with a minimum set as a central participant, taking the set as an anchor point, and embedding elements into a hash table through a hash function, each participant respectively runs a batch member condition random number generation protocol under a balance scene constructed based on a batch oblivious pseudo-random function and an oblivious key value pair storage protocol or a batch member condition random number generation protocol under a non-balance scene constructed based on the batch oblivious pseudo-random function and a fully homomorphic encryption technology; the member relationship of the elements is converted into a feature value equivalence relationship, and the central participant and other parameter parties jointly operate a joint privacy equivalence test protocol, so that the central participant obtains a corresponding feature vector, and multi-party privacy set intersection is realized. According to the method, the communication complexity can break through the linear boundary of a large set size, and any collusion attack can be resisted.

The invention discloses a privacy protection Transform reasoning method based on function secret sharing, which is characterized in that homomorphic encryption is adopted to encrypt an input token sequence, nonlinear operation is processed through a secure multi-party computing protocol, a distributed interval function key is generated by using function secret sharing, and secure comparison and dynamic token pruning are realized. The privacy protection reasoning specifically comprises the steps of an initialization stage, an input encryption stage, a cooperative calculation stage, a safety pruning stage, a result recovery stage and the like. Compared with the prior art, the method has the advantages that the online communication complexity of security comparison is reduced to a constant level from a quadratic level through a function secret sharing technology, the communication bottleneck problem of token pruning in the prior art is effectively solved, and the security comparison efficiency is improved on the premise of protecting client input data and server model parameter privacy. The reasoning efficiency of the Transform model in the privacy sensitive scene is remarkably improved, the method is particularly suitable for the scene where Transform model reasoning needs to be carried out on sensitive data and the privacy requirement is high, and the application prospect is good.

The invention discloses a block chain consensus method and system based on dynamic Byzantine consensus, which are applied to a distributed system on a block chain, and the method comprises the following steps: in a preparation stage, after a leader node receives a proposal, proposing a new block, and broadcasting a preparation message; after the replica node receives the preparation message and successfully verifies the validity of the block in the preparation message, the replica node sends preparation information of a local signature to the leader node; in the pre-commitment stage, the leader node broadcasts a pre-commitment message; when the replica node belongs to the previous system configuration and does not belong to the current system configuration, the replica node leaves the distributed system after receiving the pre-commitment message and submitting all blocks of the previous period; in the decision stage, the leader node broadcasts a decision message; and when the replica node belongs to the current system configuration, submitting the block according to a preset submitting mode. According to the method, the performance of the system cannot be reduced when the member joining / leaving instruction is processed, and the linear communication complexity is met.

The utility model discloses an AFCI upgrading architecture. The AFCI upgrading architecture comprises a master control DSP, an ARM and an AFCI controller, the ARM is in communication connection with the master control DSP and the AFCI controller, and the ARM is suitable for directly sending an upgrade program package to the AFCI controller when the AFCI controller is upgraded. The method has the beneficial effects that compared with a traditional mode, the communication complexity of the AFCI upgrading architecture can be reduced; the communication content is limited to the upgrading information, so that the complexity of communication between systems can be reduced, potential communication errors and conflicts are reduced, the stability and reliability of the whole system are improved, and upgrading management is facilitated.

The invention discloses a hybrid protocol-based efficient hierarchical parallel Byzantine consensus method, which comprises the following steps of: constructing network nodes into a plurality of consensus groups capable of processing transactions in parallel and a verification group responsible for sequencing and confirming global transactions of a system, and introducing a self-adaptive hybrid consensus protocol mechanism into each consensus group, dynamically switching between a two-stage protocol and a three-stage protocol according to a network state; an efficient protocol switching and state fallback algorithm under parallel fragmentation is designed, when a protocol is switched from a two-stage to a three-stage, the safety fallback and data consistency of a consensus state can be ensured, and the robustness of system operation is ensured; each consensus group submits the transaction batch subjected to intra-group consensus preliminary processing to a verification group; the verification group globally sorts and verifies the transaction batches from all the consensus groups, and blocks are finally generated in sequence; and the block is broadcasted and distributed to all consensus groups, and each consensus group performs final verification and state submission on the block to complete a round of complete global consensus. According to the method, the problems of high communication complexity and insufficient expansibility are solved, and the consensus process parallelism and the overall operation efficiency are improved under Byzantine fault tolerance.

The present invention proposes an improved and optimized PBFT consensus method and system applied to a consortium blockchain. Aiming at the application scenario of the supply chain blockchain, the present invention divides all nodes into four groups: an arbitration group, a consensus group, a candidate group, and a Byzantine group. The nodes in the arbitration group are promoted from the primary nodes in the consensus group. By introducing arbitration nodes to process the applications of newly joined and exited nodes, the consortium blockchain system can be made dynamic. At the same time, the arbitration nodes are periodically served by multiple primary nodes, enabling the system to be better decentralized and ensuring the security of the system. Before the consensus starts, some nodes are selected from the candidate group to enter the consensus group to participate in the consensus, which can effectively solve the problem of high communication complexity caused by a large number of nodes. At the same time, a consensus coefficient is introduced to handle Byzantine nodes. In addition, for the exited nodes, the node information is not directly deleted, in order to save the configuration time for the exited nodes to rejoin the blockchain system.

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 the field of satellite communication technology, and particularly to a satellite hopping beam method based on federated learning, including: obtaining the local model gradients of each satellite; performing quality estimation on the local model gradients of each satellite, and asynchronously federating and aggregating multiple gradients that meet the preset quality compliance conditions to obtain new global model gradients; calculating the similarity between the local model gradient of each satellite and the new global model gradient, and determining that the new global model is in a preset convergence state when the similarity is greater than a preset threshold. Thereby, the problems of high user data security risk and excessive system synchronous communication complexity in the existing hopping beam technology are solved, realizing the reduction of the system synchronous communication complexity, the improvement of the computing efficiency, and the ensuring of the effective utilization and long-term stable operation of satellite communication system resources while protecting user data security.

The invention belongs to the technical field of network communication, and discloses a multi-party cooperative vehicle-road communication security guarantee system and method based on a block chain. The method comprises the following steps: adding a mine card, an RSU and a control center into a block chain network, matching the mine card with a sensor, generating an identity certificate containing public key hash and the like by using an ECC, generating an initial weight according to historical operation data, and selecting a high-weight mine card to endow the network with consensus qualification. And after the operation is completed, collecting physical data, generating workload proof through zero-knowledge proof and hash, and calculating weight distribution communication authority. Grouping is carried out according to geographic areas, RSUs are used as leaders, the RSUs with high weights are preferentially submitted to blocks, and lightweight PBF variants are verified; if the smart contract monitors abnormity, triggering verification, and adjusting the weight according to the communication task; the problem that the identity of physical equipment is difficult to verify in a traditional scheme is solved, the communication safety is improved, the communication complexity is reduced, the method adapts to frequent moving scenes of mine cards, and the consensus efficiency is improved.

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.

The invention discloses a construction method and application of a PST-PBFT consensus algorithm model, and aims to solve the problems of random selection of a main node, too high communication complexity, interference of a bad node and the like in an existing PBFT consensus algorithm. The method comprises the following steps: firstly, constructing a node reputation value contour matrix, a consensus completion rate based on nodes, a time interval, a communication completion rate, a disability rate and other indexes; secondly, dividing nodes into a high-reliability group, a common group and a low-reliability group according to the matrix; then determining a main node and a consensus node in a pre-preparation stage, and realizing inter-group and intra-group consensus; and finally, in the consistency protocol process, different communication modes are selected according to the unified coloring value of the nodes, so that the communication time delay and complexity are reduced. The model is applied to a block chain system, and stability and reliability of block chain communication are remarkably improved by optimizing a PBFT consistency protocol.

The invention discloses a safe three-party computing method and system supporting a complex nonlinear function, and relates to the field of safe multi-party computing. According to the method, part of data is calculated in advance in the offline stage, so that the online operation speed in multi-party copy secret sharing is increased, the online communication traffic is reduced, and the query response time of a user is optimized. Moreover, the sigmoid function is approximately expressed by adopting a Fourier series expansion technology, so that a gradient explosion phenomenon caused in an approximate interval boundary region is avoided, and better communication efficiency is realized at the same time. Secondly, based on linear conversion characteristics of sigmoid and a tanh function, obtaining a safe three-party calculation method capable of being reused to the tanh function; finally, an ordinary differential equation is constructed to replace a conventional approximation algorithm, a softmax safe three-party calculation method is provided, and higher accuracy and lower communication complexity are achieved.

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.

The embodiment of the invention provides a communication method and device, equipment, a storage medium and a program product, and relates to the technical field of automatic driving. The method comprises the following steps: detecting socket messages in a target queue; wherein the socket message is a socket message of a client or a socket message of a server; if it is detected that the socket message exists, determining a message processing type corresponding to the socket message; and distributing a corresponding processing thread for each socket message according to the message processing type, and communicating with the socket message according to a communication channel established by the processing thread. The method is used for achieving the effects of reducing communication complexity and improving communication efficiency.

The invention discloses an underwater wireless optical communication method and system, and the method comprises the steps: controlling a second transmitting module in a second communication terminal to generate a second initial optical signal through employing a link guide beacon sequence, and adjusting the position and direction of a first communication terminal according to the initial optical signal, so as to enable the first communication terminal to enter a communication coverage range of each other; establishing a half-duplex communication link for the two terminals according to a handshake protocol; transmitting data from a first communication data interface to a second communication terminal through the first communication terminal by using a first optical signal, and outputting the data to external equipment from a second communication data interface of the second communication terminal; transmitting the data from the second communication data interface to the first communication terminal through the second communication terminal by using a second optical signal, and outputting the data from the first communication data interface to the external equipment; the first communication terminal monitors and adjusts the relative poses of the two terminals according to the second optical signal, so that the two terminals are located in the communication coverage range of each other, the communication complexity is reduced, and the measurement precision is improved.