66 results about "Election algorithm" patented technology

A home network system and method for providing cooperative work services. The home network system has a plurality of devices connected to a network, a negotiator module connected to the devices for determining cooperative work service roles of the devices by applying device descriptions collected from the devices to a predetermined election algorithm so that the cooperative work service can be performed in consideration of a function of a corresponding device, and a coordinator module for directly performing a control command transmitted from a control device according to the cooperative work service roles determined by the negotiator module.

The invention discloses an energy-carried cooperative CR-NOMA cooperative mode and a relay selection algorithm based on CR-NOMA, comprising: when relay assists two users for information transmission, if the main user is able to decode correctly, then, using all the collected energy to assist the cognitive user to transmit information at the next time slot; otherwise, using the NOMA to continue forwarding the information of the two users; for the multi-relay, proposing the relay selection strategy of the two stages, or solving the set of the correctly decoded relays first; then enabling that the energy remaining and the channel gain from the second jumped relay to the main user are maximized; and solving the closed solution to the interruption probability of the two users and the expression of the throughput. With the invention, while the performances of the main user are ensured, the performances of the sub-user can be increased further so that when the main user reaches the full gain, the cognitive user reaches three-order gain. The energy efficiency of the system is also raised.

The invention discloses a locomotive control method and a locomotive control system, and the method comprises the following steps: a ground control center generates and sends an ATP message which contains protective point distance data, road speed restriction data, advanced road selection data and an emergence command; a locomotive-mounted control device receives the ATP message and determines whether the emergence command is valid, and controls the locomotive to stop if valid, determines the validness of the advanced road selection data if invalid; if the advanced road selection data is valid, the locomotive-mounted control device selects a driving path by using the advanced road selection data to implement the path selection algorithm, and generates first speed data according to the selected driving path and the protective point distance data; if the advanced road selection data is invalid, the locomotive-mounted control device generates the first speed data according to the current driving path and the protective point distance data; the first speed data is compared with the predefined road speed restriction data, and the smaller speed data is taken as the current driving speed data, and then the invention controls the locomotive according to the driving speed data. The method and the system of the invention can control the safe and intelligent driving of the locomotive.

The invention relates to the technical field of consensus algorithms, and provides a blockchain-based node reputation consensus method, which comprises: step 100, obtaining a behavior record table; step 200, carrying out reputation value evaluation on the nodes in the behavior record table; step 300, calculating the reputation growth rate of the node according to the change of the reputation valueof the node; step 400, carrying out authority management according to the reputation values and the reputation growth rates of the nodes, wherein the nodes with the election authority can participatein random dynamic election of the consensus node set, and consensus master nodes are elected according to a master node election algorithm; step 500, receiving, by the consensus main node, the request sent by the client, then broadcasts the request and the signature to the consensus node together to start a consensus process; step 600, sending, by the node to be quitted, a quitting request to theconsensus master node, or sending, by the to-be-added node, an adding request message to all the consensus nodes and the main node. According to the invention, the credibility of the nodes of the whole network can be detected and evaluated.

A unitary control module having adjustable input and output mapping functionality, including methods of configuring such devices for use in different applications, are disclosed. The unitary control module can include a unit type selector such as a DIP-switch that can be used by an installer to configure the control module to emulate a particular type of controller. The control module can be configured to run a selection algorithm for configuring the mapping of the input terminals and output terminals for the device based on the controller type selected. In use, the control module may run different control algorithms for controlling the system components based on the controller type selected.

The invention discloses an MEC server selection algorithm based on fairness, and belongs to the field of mobile communication. The algorithm comprises the steps of establishing a system model among users, channels and MEC servers; randomly selecting the users to be connected with the MEC servers by an initial system; sending calculation tasks in time t by the selected users, and matching the MEC servers for the users according to communication cost; uploading the calculation tasks by the users, and calculating the throughput of each user; sorting the throughput of all users in a descending mode, selecting former N users with the low throughput, and calculating the communication cost of the users; and for the users with the low throughput, selecting the MEC serves by the users for next time calculation. The algorithm has the advantages that the influences of delay and energy consumption on selection of the users to the MEC servers are taken into combined consideration, and a communication model is introduced into the system; and when the users are in different application scenes, different weight parameters are selected, the communication cost is controlled, and the algorithm has better scene adaptability.

The method includes following steps: (1) plug-in package of peer-to-peer interlinkage multipoint video conferencing is activated from instant message software, and people taking part in meeting is selected; (2) coordinator of peer-to-peer body is elected among participators by using distributivity election algorithm to coordinate organizing of video conferencing and treating/controlling video/audio data; (3) using distributed Hash table and region clustering algorithm obtains list of forwarding candidates; (4) using algorithm based on hail-fellow list to construct list of forwarding candidates; (5) coordinator inserts coordinators obtained from (3) and (4) into multiple multicast trees in application layer; one multicast trees in application layer is in charge of distributing one route of video/audio coding stream. The invention makes multicast network in application layer consistent with IP layer covered network, possessing features of small time delay, large bandwidth, improving transmission quality of video/audio.

The invention discloses an optimization method based on a Gossip communication protocol and a Raft election algorithm. The method comprises: 1, globally defining; 2, defining the number of PING messages which are fixedly transmitted by a node per second; 3, changing the number of PING messages which are fixedly transmitted by the node per second, and receiving a selection mode of the node; 4, if a main node has a fault, by a node in a Redis cluster, judging that the main node is in a suspected offline state; 5, changing the number and a selection mode of Gossip messages in a Gossip unit; 6, by the node in the Redis cluster, judging that the main node is in an offline state; 7, by a secondary node, invoking a voting request to all nodes in the Redis cluster; 8, changing the voting mode; 9, ensuring that the secondary node is elected to be the main node; and 10, ensuring that the Redis cluster is successfully recovered. According to the optimization method based on the Gossip communication protocol and the Raft election algorithm, on the basis of not influencing throughput and time delay of the Redis cluster, the recovery time of the Redis cluster is shortened, and reliability and stability of the Redis cluster are improved.

The invention discloses an optimal path selection algorithm based on machine learning under SDN. The method comprises steps of building SDN platform, SIMULATING REALITY NETWORK ENVIRONMENT, acquiringdiscrete real-time network state data; carrying out classification according to different QoS index requirements of different services in network transmission; obtaining a plurality of indexes, arranging experimental data to obtain a sample data set, screening an optimal path from the sample data set by using a heuristic algorithm according to consideration standards of different services on eachindex, labeling the optimal path corresponding to each group of data, and finally training the data set by using a machine learning algorithm to obtain a classifier, thereby achieving the purpose of rapid dynamic routing. The result of the method is basically the same as the optimization result of the heuristic algorithm, and the calculation time of the model is far shorter than that of the heuristic algorithm, so that the necessary condition of rapid decision making in actual network operation is met. Compared with a particle swarm algorithm, the extreme learning machine algorithm has the advantages that the cpu operation time required by calculation is greatly shortened, and the real network deployment requirement can be completely met.

The invention discloses an on-chip scratch-pad memory (SPM) management method facing a multitasking embedded system. The on-chip scratch-pad memory management method comprises the steps as follows: pre-analyzing a program code segment; tracking a program to obtain an internal storage instruction accessing sequence of the program, so as to acquire the accessing times of an internal storage code block and Cache miss information, and accounting and recording a space-time conflict set of the internal storage code block under access of the Cache; selecting an algorithm as required to obtain an optimized SPM distribution scheme; generating a code distribution dispersion loading file, newly mapping and distributing the program code segment, and newly compiling codes to obtain an optimal execution result. Via comprehensive consideration of accessing frequency, cache miss frequency, intertask and intra-task conflict, the required optimal distribution is obtained, the utilization rate of the SPM is maximized, and finally under the premise of ensuring the real-time performance of the program, an optimal execution time scheme or an optimal energy conservation scheme is obtained.

The invention discloses a measuring point selection method in analog circuit fault diagnosis. The method includes the steps that firstly, in a preset tolerance range, fault analog simulation is conducted on a circuit, so that measured data of measuring points of faults are obtained; then, the measuring points are selected through a measuring point selection algorithm based on heuristic mode graph searching, root nodes are initialized firstly and serve as target nodes, all the measuring points in a measuring point set are adopted as successor nodes to expand the target node, simulation data of one measuring point corresponding to each successor node are screened according to data identification, fuzzy groups are divided according to screened address data, the probability of occurrence of the fuzzy groups is obtained, information entropy of each successor node is calculated, the node with the smallest information entropy is selected as the optimal node and deleted from the measuring point set, and the optimal node serves as a target node and is expanded continuously until the information entropy is zero or the measuring point set is empty. According to the method, the measuring points can be preferably selected, so that an optimal measuring point selection scheme is obtained, and fault diagnosis is achieved through fewer measuring points.

The invention discloses a cluster election design method. In the election process, when a node processor initiates an election, the other nodes receive an election request and then judge the size of an initiator p_id of the a_id, if the a_id is smaller than the p_id, the node processor initiates the election again, if the a_id is larger than the p_id, the nodes reply the ack, and the nodes show to agree that the node processor is used as the leader node. When more than half of the nodes reply the ack, the node processor becomes the new leader. If the election is initiated for more than 5 seconds, the half of nodes still do not reply the ack, and a new leader is not generated, the node processor initiates the election again until the new leader is generated. According to the election algorithm based on the cluster nodes, the leader election among the cluster nodes is achieved, after the leader fails, the new election is initiated again, the high available service of a cluster can be ensured, and the continuous working capability of the cluster is improved.

The invention provides a forwarding history-based asynchronous rooting algorithm, which belongs to technical field of wireless networks and routing. The routing algorithm comprises the following threeparts: (1) a relay selection algorithm; (2) a packet transmission algorithm; and (3) a routing information updating algorithm. The relay selection algorithm is executed when a node is ready for sending packets or serves as a relay node which receives messages, and the relay selection algorithm selects a better next hop relay for the packets. The packet transmission algorithm is executed when twonodes obtain a communication opportunity, and is used for transmitting the packets. The routing information updating algorithm is executed after the node receives feedback information and is used forupdating a routing information list. The asynchronous rooting algorithm completely solves the routing problems in a wireless self-organization network from an asynchronous point, makes a routing decision intelligently by using history information forwarded in packets, uses part of better nodes as relay nodes carrying the packets, improves the reliability and the validity of the information transfer in a limited network, and greatly reduces the information loss rate and unnecessary information retransmissions.

The invention provides an encrypted currency multi-channel payment method based on a smart contract. Encrypted currency multi-channel payment is realized through a beacon election algorithm, a routingpath search algorithm, a price allocation algorithm and an intelligent contract D-HTLC. The method specifically comprises the steps of constructing a beacon election module, constructing a routing path search module, constructing a price allocation module and constructing an intelligent contract D-HTLC module. According to the method, a multi-channel payment mechanism of the cryptocurrency is realized, the overload problem and the privacy problem of single-channel payment are solved, the efficiency and the safety of cryptocurrency payment are ensured, and the method not only has good universality and practical value, but also is suitable for all payment in a block chain Layer 2 network.

The invention discloses improved single loop redundancy backup implementation based on a rapid spanning tree protocol (RSTP). The idea based on loop backup is adopted to thoroughly rewrite the election algorithm and the self-healing algorithm of a root network device of the RSTP. Election of the root network device is limited between switches at two ends after link up of the last ringed network cable, and a group ring port after loop forming is only switched between plugging state and transmitting state, sends RSTP bridge protocol data unit (BPDU) messages only when having connection change and never sends the RSTP BPDU messages after the network is stabilized. Therefore, self-healing time of a looped network can be greatly reduced, and reliability of the network is improved.

The invention provides a self-networking method and a self-networking system. The self-networking system comprises at least one wireless access point AP deployed in the same local area network.The self-networking method comprises steps that based on an election algorithm, a main AP is selected from various AP of the same local area network; the main AP is communicated and connected with an integrated service management platform ISM, and is used to acquire the configuration information of the various AP from the ISM; the main AP is used to configure the various AP according to the configurationinformation of the various AP to establish a wireless network constituted by the various AP. By adopting the self-networking system, efficiency is high, labor resource consumption is less, and the networking of the wireless network can be carried out automatically, and therefore the wireless network having high management precision can be provided for users, and user experience can be improved.

An energy optimizing secure routing method provides a secure routing protocol based on low consumption cluster head election algorithm, directed towards solving the security threatening problem faced by cluster-based routing protocol and the problem that cluster head election algorithm consumes too much energy. The protocol adopts mutual cooperation to obtain the total of the nodes participating election currently in the cluster election process, and can correctly calculate the threshold value of the currently-produced cluster nodes, which allows the probability of producing optimal cluster number to be largest and the allows the network energy consumption to be optimal. The invention adopts a preset shared key pair distribution method and raises the security of routing effectively. At the same time of optimizing energy, the new protocol raises the security of routing and prolongs network lifetime.

The invention discloses an election algorithm of a space information network space layer controller. The election algorithm comprises the following steps of firstly, checking the self state of a satellite node, and publishing the load degree value, and the hop information with other satellites; comprehensively considering the load degree and hop, selecting the nodes which have low load degree and more single hop and binary hops, and determining the controller; publishing the satellite information of each area controller, notifying the node satellite of each controller, and then entering the next cycle; putting the number of the node satellite of the controller in the previous cycle into a plurality of buffer areas; adding the satellite connected with the node satellite of the controller into the buffer area of the controller satellite. The election algorithm has the advantage that the whole space information network is divided into a space layer, a nearby space layer and a ground layer, so as to minimize the transmission of the controller between layers.

The invention relates to a clustering-based multi-priority MAC protocol formulating method in a vehicle-mounted ad hoc network. According to the protocol, a cluster head election algorithm based on mobile perception and a multi-priority access channel mechanism are adopted, on the premise that safety information priority access is guaranteed, the number of concurrent access channel nodes is reduced, the channel throughput is increased, and the service life of a cluster head is prolonged; Meanwhile, the invention provides a method for reserving a service channel without competition, so that a cluster head reserves the channel for active nodes in the cluster, channel conflicts are avoided, and the collision probability is reduced. Through the above technology, in the vehicle-mounted ad hoc network with the network topology structure changed frequently, the average time delay of the security information is reduced, the throughput of the service channel is increased, and the adaptability to different traffic conditions is better.

The invention discloses a wireless sensor network clustering method based on initiative avoidance of hotspots and NLOS. The wireless sensor network clustering method comprises the following steps that firstly, a network is initialized, secondly, middleware of an upper computer builds a WSN environmental model, thirdly, the middleware of the upper computer analyzes analog information, and fourthly, cluster heads change in an operating period. According to the wireless sensor network clustering method, by means of regulation and control performed by the middleware of the upper computer connected to a base station, the overall life cycle of the WSN is improved and prolonged, and overall expandability and controllability of the network can be enhanced; as nodes in areas which can lead to cavities are bypassed, durability of the covering radius of the network is enhanced, and the hotspot effect is avoided. Besides, the nodes can be added or moved or abandoned randomly, and compared with traditional algorithms, the wireless sensor network clustering method achieves that the expandability is greatly enhanced. As for the wireless sensor network clustering method, most of the traditional algorithms belong to passive cluster head self-election algorithms. In addition, the wireless sensor network clustering method reduces loads of a routing list, simplifies the routing list, and prolongs the overall service life of the network.

The invention relates to a block chain technology. The invention provides node synchronization method, device and equipment of a block chain and a storage medium. The method comprises the steps of selecting a main node from nodes in the same organization based on a preset election algorithm; and performing transaction processing on each to-be-verified transaction in the transaction block through the main node, and performing validity marking on each to-be-verified transaction based on a transaction processing result corresponding to the to-be-verified transaction, generating transaction information corresponding to each to-be-verified transaction, and sending the processed transaction information and the transaction block to the standby node, and enabling the standby node to perform transaction information synchronization based on the verification result of the main node, so that each organized node only needs to verify the transaction block once, the network flow of the block chain isgreatly reduced, the performance of the whole block chain network is improved, and computing resources are saved. The information can be stored in the block chain node. Most computing resources can be used for serving the query request, the query request throughput of the whole block chain network is improved, and the request delay is reduced.

The invention relates to a method and a device for adaptively switching an OpenStack computing node into a control node. The OpenStack comprises a plurality of groups of control node groups and computing node groups, and the method comprises the following steps: S1, dividing the plurality of groups of computing node groups into switchable computing node groups and non-switchable computing node groups, and electing from the switchable computing node groups through an election algorithm to generate computing nodes to-be switched; s2, periodically triggering monitoring at regular time, and if a node fault or an overhigh total load of a control node group is found, thermally migrating the virtual machine on the computing node to-be switched to other computing nodes of the computing node groupwhere the virtual machine is located; and S3, switching the computing nodes to-be switched into the control nodes through an automatic management tool in combination with a container technology, and adding the control nodes into the control node group in the step S2. Compared with the prior art, the method has the advantages of high efficiency and the like.

The invention discloses a distributed audio mixing method for a conference call, which comprises the following steps: first, the terminals participating in the conference are grouped according to a network segment; one terminal is selected in each group as an audio mixing agent, which is in charge of audio mixing processing of the group; secondly, the group in which a conference host terminal is located is as a central group, which is in charge of secondary audio mixing of the mixing results of the groups; finally, when the number of voice channels exceeds the audio mixing capability of the terminal, the terminal sorts each channel of voice according to the energy of a voice signal, and multiple channels of voices are selected for audio mixing processing in an order from large to small. The distributed audio mixing method for a conference call in the invention does not need to deploy a high-performance audio mixing server; the audio mixing agent in each group is automatically generatedby the election algorithm; and normal audio mixing can be performed in the case of a mixing agent failure and overmany audio mixing channels.