34 results about "Maximal independent set" patented technology

A method allocates resources in an orthogonal frequency-division multiple access (OFDMA) network including a set of base stations (BSs), and a set of mobile stations (MSs) for each BS. Each cell includes a center and edge zone. A node weighted constraint graph is constructed for the network. Maximal independent sets in the graph are searched as sub-channels are allocated to the MSs in edge zones. Remaining bandwidth is allocated to the MSs in the center zones. Power is assigned to the sub-channels so that inter-cell interference is minimized and traffic load is maximized.

This invention discloses a method for scheduling efficient resource of a minisatellite network based on earth observation tasks, and solves the problems that the end-to-end throughput capacity is low and the utilization efficiency of the network resource is low because the network resource is not fully considered during the scheduling process in the earth observation scene of the resource-limited minisatellite network. The method comprises the implementation processes of: according to an initial network topology, determining a node number; at the same time, initializing a network resource scheduling planning time set; according to current network state and resource scheduling conflict restraint, constructing a link scheduling conflict graph by a ground control center; solving a maximal independent set corresponding to the conflict graph to acquire a network conflict-free scheduling link set; by using the link set and a linear programming, solving a resource allocation scheme and a data transmission method capable of mostly optimizing the network efficiency till a time slot is ended. The method improves the resource utilization ratio, increases the returning efficiency of important task data, improves the earth observation network performance of the minisatellite, and is used for scheduling the efficiently transmitted resource of earth observation system data.

The invention discloses a link allocation method for a multi-channel wireless network. The method comprises the following steps of: (1) dividing the wireless network into m sub-networks with the same available channel number m of the multi-channel wireless network; (2) acquiring a network conflict graph G according to a topological graph of the multi-channel wireless network; (3) acquiring the maximum independent set sequence I of the network according to the network conflict graph G acquired in the step (2); and (4) allocating the maximum independent set sequence I acquired in the step (3) into various sub-networks which are divided in the step (1). The link allocation method for the multi-channel wireless network can be used for a single network interface multi-channel condition and a multi-network interface multi-channel condition and is simple in execution process and easy to implement; and so long as the network topology is not changed, the network does not need nodes to negotiate in the working process, channels are allocated for links, and load and delay brought by channel negotiation of the network are reduced.

The invention discloses a centralized link scheduling method for a multi-channel wireless network. The method comprises the following steps of: 1, numbering links in a network topology based on a wireless network topology consisting of n links, recording the number as 1,2, ..., and n and acquiring a corresponding network conflict graph G through the network topology; 2, acquiring a maximum independent set sequence Iseq of the network conflict graph according to the network conflict graph G in the step 1; and 3, acquiring a maximum group sequence Cseq of the network conflict graph according to the network conflict graph G in the step 1, recording number of elements in the maximum group sequence Cseq as m, wherein each element in the sequence corresponds to a maximum group, and numbering the elements according to a sequence from 1 to m to be recorded as Ci, wherein i is more than and equal to 1 and less than or equal to m. The centralized link scheduling method utilizes space diversity to the greatest degree, maximizes links which are transmitted simultaneously, improves the network capacity and is a conflict-free link scheduling method.

The invention discloses a graph theory based multi-cell two-layer network spectrum allocation method. According to the method based on a multi-cell scene in long term evolution (LTE), a macro base station and a family base station coexist and share a platform of a frequency spectrum, a maximum independent set of a graph is obtained by a genetic algorithm, and the frequency spectrum is distributed for macro users to obtain a resource block proportion occupied by the macro users. The macro base stations on different resource blocks and small-scale fading have influence on family users, so that a plurality of interference patterns are established, and a good scheme dynamic allocation frequency spectrum is provided. The method has the advantages that the cross-layer interference and co-layer interference are reduced, the requirement of service quality of the macro users can be met, the total handling capacity of a system is increased, and the compromise between the handling capacity of edge family users and the total handling capacity of the family users is achieved.

The invention discloses an authorization channel switching probability-based maximal independent set frequency spectrum distribution method in cognitive radio, relating to a frequency spectrum allocation method. The method can be used for improving fairness of a cognitive system and solving the problem of no consideration of negative effects of the working state of an authorization channel to system property in a process of periodically allocating frequency spectrum in the traditional graph theory frequency spectrum allocation method. The authorization channel switching probability-based maximal independent set frequency spectrum distribution method comprises the steps of: if frequency spectrum allocation of all subgraphs is not completed, selecting one subgraph which does not complete the allocation, figuring out all maximal independent sets of all subgraphs one by one; simultaneously allocating same frequency spectrums of parallel maximal independent sets; if the subgraphs have un-allocated frequency spectrums, allocating the frequency spectrums for nodes according to the sequence of the allocated expected frequency spectrums and the interference expected frequency spectrums from small to large; and updating node frequency spectrum lists and obtained frequency spectrum mean values of nodes of corresponding independent sets. The method is suitable for frequency spectrum allocation.

A quantum mechanical arithmetic operation method for machine vision, based on quantum dots is performed by a quantum processing processor. The quantum mechanical arithmetic operation method comprises, obtaining a first labeled graph connecting between feature points of the first image and a second labeled graph connecting feature points of the second image, generating a point-to-point combination by matching the feature points of the first image with the feature points the second image, generating a conflict graph by adding the largest point-to-point combination by comparing the point-to-point combinations with the threshold, generating non-constrained binary optimization equation for finding a maximum independent set of conflict graphs, converting the non-constrained binary optimization equation into Ising model of the quantum system, and calculating the Hamiltonian of Ising model based on the quantum dots to obtain solution of the non-constrained binary optimization equation.

A quantum mechanical arithmetic operation method for machine vision, based on orbital qubit is performed by a quantum processing processor. The quantum mechanical arithmetic operation method comprises, obtaining a first labeled graph connecting between feature points of the first image and a second labeled graph connecting feature points of the second image, generating a point-to-point combination by matching the feature points of the first image with the feature points the second image, generating a conflict graph by adding the largest point-to-point combination by comparing the point-to-point combinations with the threshold, generating non-constrained binary optimization equation for finding a maximum independent set of conflict graphs, converting the non-constrained binary optimization equation into Ising model of the quantum system, and calculating the Hamiltonian of Ising model based on an orbital qubit to obtain solution of the non-constrained binary optimization equation.

Example embodiments disclosed herein relate to the determination of maximal independent sets (MISs) of mobile devices. Example embodiments include participating with other mobile devices of a plurality of mobile devices in concurrent distributed determinations of a plurality of MISs of the mobile devices and selecting one of the plurality of MISs.

The invention relates to the field of graph data mining and graph matching, in particular to a method for mining similar frequent graphs in a single graph. The method comprises the steps of calculating a size upper limit of each frequent sub-graph of the single graph according to a given single graph size, given similarity and a given frequent degree; according to the size upper limit of each frequent sub-graph, traversing the single graph, and searching for all sub-graphs of the single graph; for the sub-graphs of the single graph, searching for all similar sub-graphs of the sub-graphs; for the similar sub-graphs of the sub-graphs, performing matching in the single graph, and searching for all matching graphs of the similar sub-graphs; forming matching graph sets by the matching graphs ofall the similar sub-graphs of the sub-graphs, and calculating the quantity of the matching graphs of the maximum independent set in the matching graph sets; and comparing the quantity of the matchinggraphs of the maximum independent set and the frequent degree, and if the quantity of the matching graphs of the maximum independent set is greater than or equal to the frequent degree, outputting the sub-graphs. The invention furthermore relates to an apparatus and a system for mining the similar frequent graphs in the single graph, a device and a medium.

The present invention discloses an extension method for Latin hypercube sampling. An LHS (Latin hypercube sampling) of which a sample size is n is supposed to exist, the extension method aims to obtain a new LHS sampling of which the sampling size is n+m, and meanwhile, the novel sampling contains a maximum number of existing sampling points. According to the method provided by the present invention, a relationship between the LHS sampling points is transformed into a simple undirected acyclic graph, an adjacent matrix is obtained, and a maximum individual set is solved to retain a maximum number of existing sampling points. The method comprises the implementation steps of: calculating distribution of the existing sampling points in a novel sampling structure; calculating a matrix of the sampling points that need to be retained; calculating a matrix of newly added sampling points; and finally, calculating a Latin hypercube sampling matrix after extension. According to the extension method for the Latin hypercube sampling, which is provided by the present invention, the existing sampling points can be deleted as few as possible, so that sampling cost is conserved; and meanwhile, the novel sampling points are generated, so that a sampling sample formed by the novel sampling points and the retained sampling points still meets an LHS structure.

The invention belongs to the technical field of wireless communication, and discloses a non-orthogonal multiple access-based edge computing system control joint optimization method and application. The method comprises: initializing parameters; performing unloading decision and local computing resource allocation optimization according to the feasibility of local execution and the maximum delay limit of task processing; performing access control optimization; sorting all users; using a maximum independent set MWIS method in a graph theory to carry out joint user pairing, subcarrier distribution and sending power control: all feasible user pairs and subcarrier distribution forming a graph, and each node in the graph being a combination of one feasible user pair and one subcarrier; wherein the sending power of each user is distributed according to the maximum time delay requirement; generating a maximum independent set of graphs. According to the invention, as many user tasks as possible are executed, and as much energy consumption as possible is saved for users; the method can be applied to various Internet of Things scenes requiring large capacity and low energy consumption.

The invention discloses an approximate solving method for a maximum independent set on a unit disk graph. The method comprises the following steps: 1, designing an optimal solution solving method fora maximum vertex independent set of an adjacent vertex set induction sub-graph of unit disc vertexes by utilizing a dynamic programming method, and giving an optimal solution for a maximum vertex independent set of a union set induction sub-graph of any two vertex adjacent vertex sets; 2, for a general unit disk graph, firstly calculating a vertex dominating independent set; then independently checking members in the vertex dominated independent set, and judging whether a result can be optimized or not to obtain an intermediate solution; and finally, performing joint inspection on members in the intermediate solution, and judging whether a result can be optimized or not to obtain a final solution. According to the method, the approximate solution with the approximate ratio of 1.5 is obtained according to the calculation time complexity of O (delta 2n3), delta is the vertex maximum degree. Compared with an existing approximate algorithm for solving the problem through the maximum independent set on a unit disc graph, the approximate ratio is increased, and higher efficiency is achieved.

The invention discloses a high bandwidth data transmission method in a wireless ad hoc network. The high bandwidth data transmission method in the wireless ad hoc network comprises: in the process of data transmission in the wireless ad hoc network, a synchronous CSMA/CA(Carrier Sense Multiple Access with Collision Avoidance) protocol is adopted in an MAC sublayer, and in a LLC (Logical Link Control) sublayer, links are scheduled according to a distribution type MIS (Maximal Independent Set) algorithm of a diagram. The high bandwidth data transmission method enables the convergence time of the link scheduling algorithm in the process of data transmission in the wireless ad hoc network to be shorter, and compared with a conventional link layer which merely adopts the CSMA/CA protocol, the bandwidth performance is improved.

The invention discloses a method and device for detecting wormhole attacks on wireless networks and delay-tolerant networks in a three-dimensional space. The method first responds to received wormhole detection requests by nodes in the network to obtain some topological information in the adjacent areas maintained in advance. Calculate the largest independent set in the graph, and then compare the actual size of the largest independent set with the size of these largest independent sets in the predefined network to determine whether there is an illegal subgraph structure in the network; if there is an illegal subgraph structure in the network, It means that there is a wormhole attack in the network. The invention is a lightweight and distributed algorithm, which can not only efficiently identify wormhole attacks, but also facilitates the realization and deployment of wormhole attack detection devices. The present invention does not need any preconditions and assumptions, does not need to know the initial state of the network, global clock synchronization, protection nodes and special hardware devices, and has no false detection rate.

The invention relates to the field of RFID, in particular to a performance evaluation method for an RFID reader anti-collision protocol. Firstly, under the control of a server, an RFID reader sends aspecified signal to detect the collision condition with surrounding readers. Then, the server performs graph theory modeling according to the collision information of all the readers, and calculates amaximum independent set. Meanwhile, all the RFID readers are provided with the same RFID reader anti-collision protocol, and start to execute and record state information at the same time. Finally, the server compares the state information of all the readers with the maximum independent set, and calculates the closeness degree of the state information and the maximum independent set. The RFID reader anti-collision protocol is selected with the optimal performance according to the closeness degree. From the perspectives of simple deployment and rapid evaluation, performance evaluation can be carried out on multiple RFID reader anti-collision protocols according to the graph theory principle and RFID system characteristics, and the protocol with the optimal performance can be selected.

The invention discloses a three dimensional sensor network surface skeleton extraction method. The three dimensional sensor network surface skeleton extraction method includes the steps: every internal node calculates the feature point thereof; a restrictive broadcast mode is used to enable the feature points of the nodes to form a plurality of feature connected components; surface skeleton points are identified; a maximum independent set of the surface skeleton points is constructed; the surface skeleton nodes in the maximum independent set are used to obtain a Voronoi graph; and based on the Voronoi graph, triangularization of the dual graph Delaunay can be obtained so as to obtain a three dimensional sensor network surface skeleton. The surface skeleton point identifying method has no use for depending on a special grid structure and cannot be influenced by network noise, distance round-off error and sparse network, and can obtain a steady surface skeleton.