A method of spectrum allocation to guard against electromagnetic interference

Abstract

The present application relates to a kind of spectrum allocation methods for preventing electromagnetic interference, the spectrum allocation method includes: step one, according to the interference correlation between radio frequency devices obtains undirected graph, and undirected graph is converted into directed graph to build total directed graph matrix;Step two, according to current directed graph determines the target node to be allocated and target spectrum resource, resource allocation is carried out in combination with current directed graph definition, total directed graph definition and round definition;Step three, when a round ends, update current directed graph and total directed graph and carry out next round, until all nodes are allocated or there is no remaining resource to allocate as stop.The present application considers the fairness of algorithm, preferentially allocate spectrum resource to weaker device, while, introduce polling and constraint condition, make spectrum resource not be inclined on single device, so as to guarantee the fairness of spectrum allocation.

Description

Technical Field

[0001] This invention relates to the field of electromagnetic interference technology, and in particular to a spectrum allocation method for preventing electromagnetic interference. Background Technology

[0002] With the increasing prevalence and complexity of radio frequency (RF) devices, electromagnetic radiation and sensitivity issues have become increasingly serious, and electromagnetic interference (EMI) has become more prominent. Substandard equipment can generate EMI, causing other devices to malfunction, or even creating safety hazards. Solving these problems is crucial for ensuring the operation of wireless communication and electronic devices in modern society. The imbalance between spectrum resource supply and demand is also a significant challenge. Spectrum resources are a key element of wireless communication, such as mobile communication, broadcasting, and satellite communication. However, spectrum resources are finite; therefore, how to efficiently utilize spectrum resources has become an important issue that needs to be addressed.

[0003] It should be noted that the information disclosed in the background section above is only used to enhance the understanding of the background of this disclosure, and therefore may include information that does not constitute prior art known to those skilled in the art. Summary of the Invention

[0004] The purpose of this invention is to overcome the shortcomings of the prior art and provide a spectrum allocation method to prevent electromagnetic interference. This method solves the problems of electromagnetic radiation, sensitivity and electromagnetic interference brought about by the popularization and complexity of radio frequency devices, as well as the problem of spectrum resource shortage caused by the imbalance between supply and demand.

[0005] The objective of this invention is achieved through the following technical solution: a spectrum allocation method for preventing electromagnetic interference, the spectrum allocation method comprising:

[0006] Step 1: Obtain an undirected graph based on the interference correlation between radio frequency devices, and convert the undirected graph into a directed graph to construct the total directed graph matrix;

[0007] Step 2: Determine the target nodes and target spectrum resources to be allocated based on the current directed graph, and allocate resources by combining the current directed graph definition, the overall directed graph definition, and the round definition;

[0008] Step 3: When a round ends, update the current directed graph and the total directed graph and proceed to the next round until all nodes are allocated or there are no remaining resources to allocate.

[0009] Step one specifically includes the following:

[0010] The interference margin of each transmitting and receiving device pair is pre-calculated using electromagnetic compatibility prediction methods to determine whether electromagnetic interference exists between the transmitting and receiving device pairs, thus obtaining the interference correlation matrix. The devices are transformed into nodes in an undirected graph, and the interference relationships between devices are transformed into connection relationships between nodes. Furthermore, the interference correlation matrix is ​​transformed into an undirected graph, thus converting the spectrum allocation problem into a graph vertex coloring problem. Where C... ij For the launching equipment T i With receiving device R j Electromagnetic interference margin between them;

[0011] Based on the property that the performance of a node in an undirected graph is directly proportional to its available spectrum resources and inversely proportional to its connectivity, the performance evaluation function for node i is defined as follows: Where n represents the number of devices, m represents the amount of spectrum resources, and S ik This indicates whether node i has access to spectrum resource k. If it does, then S... ik =1, otherwise S ik =0; L represents the total number of available spectrum resources for node i. ij Indicate whether there is an interference relationship between node i and node j. If there is, L ij =1, if it does not exist then L ij =0; This represents the total connectivity of node i. Therefore, the more available spectrum resources a node has and the fewer connections it has, the larger its performance function value will be.

[0012] The corresponding node performance evaluation matrix is ​​obtained. The larger the defined node performance function value, the stronger the node performance. Based on this, a directed graph of nodes is generated, and the direction between nodes in the directed graph is set from the node with strong performance to the node with weak performance. When the number of available resources and the number of connections of a node are the same, the direction of the edge is specified randomly or according to additional rules.

[0013] Step two specifically includes the following:

[0014] The node to which all edges in the directed graph point is selected as the target node. Based on the node performance definition, the device corresponding to this node is the node with the worst performance in the entire directed graph, that is, the node most susceptible to interference.

[0015] Select the spectrum resource that generates the least interference from all available spectrum resources of the target node as the resource to be allocated, so as to reduce the impact of electromagnetic interference. Allocate the selected resource to be allocated to the target node and remove the allocated resource from the resource pool of the target node and the interfering node, thus completing this allocation.

[0016] The current directed graph definition includes: a directed graph for judgment and allocation before the allocation list is reset, used for allocation in the current round; the total directed graph definition includes: a directed graph referenced by the current directed graph after each round of allocation is completed; the round definition includes: a round ends when all nodes with unallocated resources at the beginning of each round are allocated at most one resource, and there are no unallocated target nodes in the current directed graph.

[0017] Step three specifically includes the following:

[0018] A round ends when there are no unallocated target nodes in the current directed graph. At this point, the target node for this round is removed from the current directed graph, and nodes without available allocated resources and isolated nodes without interference relationships with other nodes are removed from the overall directed graph. The current directed graph and the overall directed graph are then updated. During the graph update, the performance evaluation function for node i is modified using the label variable f and constraint variable h. If the node was the target node in the previous allocation process, then f = 1; otherwise, f = 0. By introducing the constraint variable h, the node's performance value increases due to the completion of the allocation, thus reducing the likelihood that it will be selected as the target node again.

[0019] The present invention has the following advantages: a spectrum allocation method for preventing electromagnetic interference, which, considering the fairness of the algorithm, prioritizes the allocation of spectrum resources to devices with weaker performance. At the same time, it introduces polling and constraint conditions to prevent spectrum resources from being skewed to a single device, thereby ensuring the fairness of spectrum allocation. Attached Figure Description

[0020] Figure 1 This is a schematic diagram of the process of the present invention;

[0021] Figure 2 This is a diagram illustrating the results of resource allocation. Detailed Implementation

[0022] To make the objectives, technical solutions, and advantages of the embodiments of this application clearer, the technical solutions of the embodiments of this application will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only a part of the embodiments of this application, and not all of the embodiments. The components of the embodiments of this application described and shown in the accompanying drawings can generally be arranged and designed in various different configurations. Therefore, the detailed description of the embodiments of this application provided below with reference to the accompanying drawings is not intended to limit the scope of protection of the claimed application, but merely represents selected embodiments of this application. All other embodiments obtained by those skilled in the art based on the embodiments of this application without inventive effort are within the scope of protection of this application. The present invention will be further described below with reference to the accompanying drawings.

[0023] This invention specifically relates to a spectrum allocation method for preventing electromagnetic interference. By transforming the complex topology formed by interference relationships between devices into an undirected connected graph, devices into nodes in the graph, and interference relationships between devices into connection relationships between nodes, the spectrum allocation problem is transformed into a graph vertex coloring problem. This method considers the fairness of resource allocation, follows the principle of prioritizing the allocation of spectrum resources and devices with higher interference levels, that is, prioritizing the allocation of devices in the electromagnetic environment that are most susceptible to interference. At the same time, it considers the spectrum allocation of individual devices, so that spectrum resources are not concentrated on a single device, making the spectrum allocation more equitable.

[0024] like Figure 1 As shown, it specifically includes the following:

[0025] Step 1: Construct a directed graph matrix based on the interference correlation between radio frequency devices.

[0026] When considering electromagnetic interference (EMI) from radio frequency (RF) equipment, the RF transmitting device is considered the interference source, while the receiving device is considered the sensitive device. In space, various coupling mechanisms exist between the transmitting and receiving devices. Electromagnetic compatibility (EMC) prediction methods can be used to pre-calculate the interference margin for each transmitting and receiving pair, thereby determining whether electromagnetic interference exists between the transmitting and receiving devices. The interference correlation matrix is ​​as follows:

[0027]

[0028] Among them, C ij For the launching equipment T i With receiving device R j Electromagnetic interference margin between them.

[0029] By transforming the complex topological matrix formed by interference relationships between devices into an undirected connected graph, converting devices into nodes in the graph, and transforming the interference relationships between devices into the connection relationships between nodes, the spectrum allocation problem is transformed into a graph vertex coloring problem.

[0030] After obtaining the undirected graph, a node performance evaluation matrix is ​​constructed based on the graph. Within the scope of this invention, the performance of a node is directly proportional to its available spectrum resources and inversely proportional to its connectivity. Therefore, the performance evaluation function for node i is initially defined as follows:

[0031]

[0032] Suppose there are a total of n devices and m spectrum resources, where S ik This indicates whether node i has access to spectrum resource k. If it does, then S... ik =1, otherwise S ik =0; L represents the total number of available spectrum resources for node i.ij Indicate whether there is an interference relationship between node i and node j. If there is, L ij =1, if it does not exist then L ij =0; This represents the total connectivity of node i. It can be seen that the more available spectrum resources a node has, and the fewer connections it has, the larger its performance function value.

[0033] Therefore, a corresponding node performance evaluation matrix can be obtained, defining that the larger the node performance function value, the stronger the node performance. Based on this, a directed graph of nodes is generated, stipulating that the links between nodes in the directed graph are directed from nodes with stronger performance to nodes with weaker performance. When the number of available resources and the number of connections of nodes are the same, the direction of the edges is randomly assigned or assigned according to additional rules.

[0034] In summary, this transforms an undirected graph with nodes into a directed graph.

[0035] Step 2: Determine the target nodes and target spectrum resources to be allocated based on the current directed graph and then allocate the resources.

[0036] To prevent excessive skewing of spectrum resources towards a single node and to ensure fairness in spectrum allocation, the following definition is introduced:

[0037] Current directed graph definition: The directed graph used for judgment and allocation before the list to be allocated is reset, and is used for allocation in the current round;

[0038] Definition of a directed graph: The directed graph referenced when the current directed graph is reset after each round of allocation;

[0039] Round definition: A round ends when all unallocated resources at the beginning of each round have been allocated at most one resource, and there are no unallocated target nodes in the current directed graph.

[0040] This allocation method considers the fairness of resource allocation, following the principle of prioritizing the allocation of spectrum resources and devices with higher interference levels. It prioritizes devices in a "weak" state in the electromagnetic environment, i.e., those most susceptible to interference. Reflected in the current directed graph, the node to which all edges point is selected as the target node. According to the node performance definition, this device is the worst-performing node in the entire directed graph, i.e., the most vulnerable to interference. After determining the target node, the allocation method further considers the impact of interference, selecting the spectrum resources that generate the least interference from all available spectrum resources of the target node as the resources to be allocated, minimizing the impact of electromagnetic interference on the system. In one allocation, the selected resources to be allocated are assigned to the target node, and the allocated resources are removed from the resource pools of the target node and interfering nodes, thus completing the allocation.

[0041] Step 3: Update the current directed graph and the total directed graph.

[0042] A round ends when there are no unallocated target nodes in the current directed graph. When a round ends, we remove the target node from the current directed graph, remove nodes without available allocation resources and isolated nodes without interference relationships with other nodes from the overall directed graph, and update both the current and overall directed graphs. To ensure fairness in resource allocation, the formula in step 1 is modified. When updating the directed graph, the label variable f and constraint variable h (h>0) are:

[0043]

[0044] If the node was the target node in the previous allocation process, then f = 1; otherwise, f = 0. The introduction of the constraint variable h increases the node's performance value due to the completion of the allocation, thus reducing the likelihood that it will be selected as the target node again.

[0045] Follow the steps above until all nodes have been allocated or no resources remain to be allocated.

[0046] This invention simulates a graph coloring algorithm and a spectrum allocation method considering fairness. To simulate a realistic environment, three platforms were established: Platform A, Platform B, and Platform C, each with 3 devices, for a total of 9 devices. Each device is equipped with 4-8 working spectrum resources, with at least one spectrum resource required for normal operation. The spectrum resources are numbered according to device usage, and the available resources for each device are shown in Table 1. The spectrum allocation results are as follows: Figure 2 As shown, and summarized in Table 1.

[0047] Table 1. Spectrum Allocation Results

[0048] A1(1) 1,3,4,5,10 4,10 A2(2) 1,2,3,4,5,7,8,9 4,2,3,7,8 A3(3) 1,2,4,5,6,7,8,9 1,5,6,9 B1(4) 1,2,4,5 2,5 B2(5) 3,4,6,7,8,9 3,6,8,9 B3(6) 1,2,4,6,7,9 1,4,7 C1(7) 1,2,3,4,5 1,3 C2(8) 2,3,4,5,6,7,8,9 4,6,7,9 C3(9) 1,2,3,4,5,7,8,9 2,5,8

[0049] In this example, the spectrum allocation went through 5 rounds and 28 allocation processes, and each device was ultimately allocated more than one spectrum resource, with no resources concentrated on a single device.

[0050] The above description is merely a preferred embodiment of the present invention. It should be understood that the present invention is not limited to the forms disclosed herein and should not be construed as excluding other embodiments. It can be used in various other combinations, modifications, and environments, and can be altered within the scope of the concept described herein through the above teachings or related technologies or knowledge. Modifications and variations made by those skilled in the art that do not depart from the spirit and scope of the present invention should be within the protection scope of the appended claims.

Claims

1. A spectrum allocation method for preventing electromagnetic interference, characterized in that: The spectrum allocation method includes: Step 1: Obtain an undirected graph based on the interference correlation between radio frequency devices, and convert the undirected graph into a directed graph to construct the total directed graph matrix; Step 2: Determine the target nodes and target spectrum resources to be allocated based on the current directed graph, and allocate resources by combining the current directed graph definition, the overall directed graph definition, and the round definition; Step 3: When a round ends, update the current directed graph and the total directed graph and proceed to the next round until all nodes are allocated or there are no remaining resources to allocate. Step one specifically includes the following: The interference margin of each transmitting and receiving device pair is pre-calculated using electromagnetic compatibility prediction methods to determine whether electromagnetic interference exists between the transmitting and receiving device pairs, thus obtaining the interference correlation matrix. This involves converting devices into nodes in an undirected graph, transforming interference relationships between devices into connectivity relationships between nodes, and further converting the interference correlation matrix into an undirected graph. This transforms the spectrum allocation problem into a graph vertex coloring problem. For launching equipment With receiving equipment Electromagnetic interference margin between them; Based on the property that the performance of a node in an undirected graph is directly proportional to its available spectrum resources and inversely proportional to its connectivity, the performance evaluation function for node i is defined as follows: Where n represents the number of devices and m represents the amount of spectrum resources. This indicates whether node i has access to spectrum resource k. If it does, then... ,otherwise ; This represents the total number of available spectrum resources for node i. This indicates whether there is an interference relationship between node i and node j. If so, If it does not exist, then ; This represents the total connectivity of node i. Therefore, the more available spectrum resources a node has and the fewer connections it has, the larger its performance function value will be. Obtain the corresponding node performance evaluation matrix. The larger the defined node performance function value, the stronger the node performance. Generate a directed graph of nodes based on it, and set the direction of the nodes in the directed graph to be directed from the node with strong performance to the node with weak performance. When the number of available resources and the number of connections of a node are the same, the direction of the edge is specified randomly or according to additional rules. The current directed graph definition includes: a directed graph for judgment and allocation before the allocation list is reset, used for allocation in the current round; the total directed graph definition includes: a directed graph referenced by the current directed graph after each round of allocation is completed; the round definition includes: a round ends when all nodes with unallocated resources at the beginning of each round are allocated at most one resource, and there are no unallocated target nodes in the current directed graph.

2. The spectrum allocation method for preventing electromagnetic interference according to claim 1, characterized in that: Step two specifically includes the following: The node to which all edges in the directed graph point is selected as the target node. Based on the node performance definition, the device corresponding to this node is the node with the worst performance in the entire directed graph, that is, the node most susceptible to interference. Select the spectrum resource that generates the least interference from all available spectrum resources of the target node as the resource to be allocated, so as to reduce the impact of electromagnetic interference. Allocate the selected resource to be allocated to the target node and remove the allocated resource from the resource pool of the target node and the interfering node, thus completing this allocation.

3. The spectrum allocation method for preventing electromagnetic interference according to claim 2, characterized in that: Step three specifically includes the following: A round ends when there are no unallocated target nodes in the current directed graph. At this point, the target node for this round is removed from the current directed graph, and nodes without available allocated resources and isolated nodes without interference relationships with other nodes are removed from the overall directed graph. The current directed graph and the overall directed graph are then updated. During the graph update, the performance evaluation function for node i is modified using the label variable f and constraint variable h. If the node is the target node in the previous allocation process, then f=1; otherwise, f=0. By introducing the constraint variable h, the performance value of the node increases due to the completion of the allocation, thus reducing the probability that it will be selected as the target node again.

Images