Resource allocation method, device and control equipment

Abstract

The present disclosure provides a resource allocation method, apparatus, and control device. The method includes: obtaining network topology information, the network topology information including location information of nodes in the network and information about routes connecting nodes in the network; using an edge coloring algorithm to color all routes in the network into a plurality of colors, wherein routes colored the same color are not connected; allocating resources to each route to be transmitted based on the color of the route in the network and the route of information to be transmitted, wherein routes of the same color are allowed to be allocated resources of different beams in the same time slot; determining whether beams used by routes allocated to the same time slot conflict based on the location information of nodes in the network; and reallocating a time slot for at least one route with a conflict in the time slot in response to a conflict in beams used by routes allocated to the same time slot.

Description

Technical Field

[0001] The present disclosure relates to the field of communication technology, and in particular to a resource allocation method, apparatus, and control device. Background Art

[0002] With the development of antenna technology, smart antennas such as phased array antennas have gradually been used in directional ad hoc networks.

[0003] In a directed ad hoc network, space-time resources are allocated by planning and designing a time slot allocation table for spatial division multiple access (SDMA). This table defines multiple pairs of abstract nodes for SDMA communications within each time slot, with different pairs of abstract nodes using different beam resources. However, the abstract nodes in the table do not correspond to specific network nodes. Ultimately, these abstract nodes must be mapped to specific network nodes so that network members can determine their working time slots and communication partners, achieving SDMA access. Because the table defines the time slots and beam allocations for abstract nodes, it does not account for potential conflicts between beams used by actual network nodes. This can lead to communication interference and reduced communication efficiency and capacity. Summary of the Invention

[0004] The embodiments of the present disclosure provide a resource allocation method, apparatus, and control device that can avoid communication interference and improve communication efficiency and capacity. The technical solution is as follows:

[0005] At least one embodiment of the present disclosure provides a resource allocation method, the method comprising:

[0006] Acquiring network topology information, wherein the network topology information includes location information of nodes in the network and information of routes connecting nodes in the network;

[0007] An edge coloring algorithm is used to color all routes in the network into a plurality of colors, wherein routes colored with the same color are not connected;

[0008] Allocating resources to each route to be transmitted based on the color of the routes in the network and the routes of the information to be transmitted, wherein routes of the same color are allowed to be allocated resources of different beams in the same time slot;

[0009] determining, based on location information of nodes in the network, whether beams used by routes assigned to the same time slot conflict;

[0010] In response to a conflict between beams used by routes allocated to the same time slot, a time slot is reallocated for at least one of the conflicting routes.

[0011] Optionally, the edge coloring algorithm is used to color all routes in the network into several colors, including:

[0012] Select nodes in the network in descending order of importance;

[0013] When selecting a first node in the network, taking a first route associated with the first node and routes not connected to the first route from the set of routes, and coloring the first route and the routes not connected to the first route into a first color;

[0014] Other routes associated with the first node and routes not connected to the other routes are sequentially taken from the remaining routes in the route set until no route associated with the first node exists in the route set, and the other routes and routes not connected to the other routes are dyed in other colors.

[0015] Optionally, allocating resources to each route for information to be transmitted in sequence based on the color of the route in the network and the route of the information to be transmitted includes:

[0016] Sort the routes of various colors, with the routes of the same color arranged in one row, and the routes of different colors arranged in different rows according to the order of coloring;

[0017] Select the routes in each row in turn until all the routes in all rows have been selected;

[0018] When selecting a route in the i-th row, one route in the i-th row is selected each time until all routes in the i-th row are selected;

[0019] When selecting a route AB between node A and node B, determine whether to allocate time slots for the route AB when transmitting from node A to node B in the following manner: query the first set of nodes A and the second set of nodes B in the i-1th row of the route, wherein the first set of nodes A refers to the set of nodes that transmit information with node A in the route to which resources have been allocated in the previous time slot, and the second set of nodes B refers to the set of nodes that still need to transmit information with node B; if the first set of nodes A contains elements in the second set of nodes B, allocate m consecutive time slots for the route AB when transmitting from node A to node B.

[0020] Optionally, allocating m consecutive time slots for transmission from the node A to the node B for the route AB includes:

[0021] Selecting n elements in the second set of nodes B contained in the first set of nodes A as receiving nodes for information to be sent by node A, and allocating m consecutive time slots to a route between node A and the receiving nodes;

[0022] If the first set of node A contains fewer than n elements from the second set of node B, other nodes from the first set of node A are randomly selected to serve as receiving nodes for information to be sent by node A, and m consecutive time slots are allocated to the route between node A and the receiving nodes.

[0023] Optionally, allocating resources to each route to be transmitted based on the color of the route in the network and the route of the information to be transmitted in sequence further includes:

[0024] If the first set of node A does not contain the elements in the second set of node B, determine whether route AB affects the communication of other nodes when transmitted from node A to node B; if not, allocate m consecutive time slots to route AB when transmitted from node A to node B; if so, allocate m consecutive time slots to route AB after the m consecutive time slots allocated when transmitted from node A to node B.

[0025] Optionally, determining, based on the location information of the nodes in the network, whether beams used by routes allocated to the same time slot conflict, includes:

[0026] Calculate the beam coverage of each route assigned to the same time slot;

[0027] Determining whether there are nodes on other routes among the routes within the beam coverage of the routes;

[0028] If there are nodes on other routes among the routes, there is a conflict; if there are no nodes on other routes among the routes, there is no conflict.

[0029] Optionally, in response to a conflict between beams used by routes allocated to the same time slot, reallocating a time slot for at least one of the conflicting routes comprises:

[0030] Determine the R and T values ​​of two nodes on the conflicting first conflicting route, where the R value indicates whether the node is within the beam coverage of other routes in the same time slot, and the T value indicates whether there are other nodes within the beam coverage when the node is used as the transmitting node;

[0031] determining whether a time slot is allocated to the first conflicting route based on R and T values ​​of two nodes of the first conflicting route;

[0032] When the time slot is not allocated to the first conflicting route, a time slot is allocated to the first conflicting route in a time slot subsequent to the time slot.

[0033] At least one embodiment of the present disclosure provides a resource allocation device, the device comprising:

[0034] an acquisition module, configured to acquire network topology information, wherein the network topology information includes location information of nodes in the network and information of routes connecting nodes in the network;

[0035] a coloring module, configured to color all routes in the network into a plurality of colors using an edge coloring algorithm, wherein routes colored with the same color are not connected;

[0036] an allocation module, configured to allocate resources to each route to be transmitted based on the color of the route in the network and the route of the information to be transmitted, wherein routes of the same color are allowed to be allocated resources of different beams in the same time slot;

[0037] a conflict detection module, configured to determine, based on location information of nodes in the network, whether beams used by routes allocated to the same time slot conflict;

[0038] The allocation module is further configured to reallocate a time slot for at least one of the conflicting routes in response to a conflict between beams used by the routes allocated to the same time slot.

[0039] At least one embodiment of the present disclosure provides a control device, including a processor and a memory, wherein the memory stores at least one program code, and the program code is loaded and executed by the processor to implement the resource allocation method as described above.

[0040] At least one embodiment of the present disclosure provides a computer-readable storage medium, wherein the computer-readable storage medium stores at least one program code, and the program code is loaded and executed by a processor to implement the resource allocation method as described in any of the preceding items.

[0041] The technical solutions provided by the embodiments of the present disclosure have the following beneficial effects:

[0042] In the disclosed embodiments, conflict-free space-time resource allocation is achieved by combining edge coloring, time slot allocation, and collision detection, completing space-time resource allocation for directional ad hoc networks based on edge coloring theory. Because time slot allocation is performed using actual network nodes and beam collisions are considered, communication interference is avoided, improving communication efficiency and capacity. BRIEF DESCRIPTION OF THE DRAWINGS

[0043] In order to more clearly illustrate the technical solutions in the embodiments of the present disclosure, the following briefly introduces the drawings required for use in the description of the embodiments. Obviously, the drawings described below are only some embodiments of the present disclosure. For ordinary technicians in this field, other drawings can be obtained based on these drawings without any creative work.

[0044] Figure 1 is a flow chart of a resource allocation method provided by an embodiment of the present disclosure;

[0045] Figure 2 is a flow chart of a resource allocation method provided by an embodiment of the present disclosure;

[0046] Figure 3 This is a line conflict diagram provided by an embodiment of the present disclosure;

[0047] Figure 4 is a flow chart of a method for reallocating time slots provided by an embodiment of the present disclosure;

[0048] Figure 5 is a structural diagram of a resource allocation device provided by an embodiment of the present disclosure;

[0049] Figure 6 This is a structural block diagram of a control device provided by an embodiment of the present disclosure. DETAILED DESCRIPTION

[0050] In order to make the objectives, technical solutions and advantages of the present disclosure more clear, the embodiments of the present disclosure will be further described in detail below with reference to the accompanying drawings.

[0051] Unless otherwise defined, the technical or scientific terms used herein shall have the usual meanings understood by persons of ordinary skill in the field to which the present disclosure belongs. The words “first”, “second”, “third” and similar terms used in the patent application specification and claims of the present disclosure do not indicate any order, quantity or importance, but are only used to distinguish different components. Similarly, words such as “one” or “a” do not indicate a quantity limitation, but rather indicate the presence of at least one. Words such as “include” or “comprising” and similar terms mean that the elements or objects appearing before “include” or “comprising” cover the elements or objects listed after “include” or “comprising” and their equivalents, and do not exclude other elements or objects.

[0052] Figure 1 This is a flow chart of a resource allocation method provided by an embodiment of the present disclosure. Figure 1 , the method comprising:

[0053] 101: Acquire network topology information, where the network topology information includes location information of nodes in the network and information of routes connecting nodes in the network.

[0054] The methods provided in the embodiments of the present disclosure can be executed by a control device in a network (e.g., a network management device in the network). After joining the network, nodes in the network communicate with each other and report information about themselves and their neighbors to the control device. The control device then forms a network topology based on the information reported by each node. The control device obtains this topology information from a locally stored topology. Of course, in other implementations, network topology information can also be obtained from other devices.

[0055] The information about the routes between nodes in a network can be represented by a two-dimensional network connectivity matrix. The matrix's elements represent the connectivity between nodes based on their row and column positions. For example, the jth element in the i-th row indicates that nodes i and j are connected. The location information of nodes in a network primarily represents the node's current location.

[0056] 102: Using an edge coloring algorithm to color all routes in the network into a plurality of colors, wherein routes colored with the same color are not connected.

[0057] Routes colored the same color indicate that they can communicate in parallel at the same time.

[0058] Disconnected routes mean that two routes do not share the same nodes. For example, routes AB and AC are connected, but routes AB and CD are not connected. A, B, C, and D are four nodes.

[0059] 103: Allocate resources to each route of information to be transmitted in turn based on the color of the route in the network and the route of information to be transmitted, wherein routes of the same color are allowed to be allocated resources of different beams in the same time slot.

[0060] The resource allocation method provided by the present disclosure is performed when there is information to be allocated on the network. Therefore, when allocating information, the control device can first calculate the route that the information to be transmitted needs to pass through, that is, the route of the information to be transmitted. Then, resources are allocated based on the route of the information to be transmitted.

[0061] During allocation, each time slot can be assigned multiple routes. The maximum number of routes is the number of information that the network can transmit simultaneously, n. Routes assigned to the same time slot use different beams for parallel transmission.

[0062] 104: Determine, based on the location information of the nodes in the network, whether beams used by routes allocated to the same time slot conflict.

[0063] As mentioned earlier, when multiple routes are assigned to the same time slot, different beams are used to send information. However, during transmission, if there are other nodes within the beam coverage that also need to transmit messages, a conflict will occur. At this time, the time slot needs to be reallocated to avoid the conflict.

[0064] 105: In response to a conflict between beams used by routes allocated to the same time slot, reallocate a time slot for at least one of the conflicting routes.

[0065] Conflicts are avoided by isolating conflicting routes by reallocating time slots.

[0066] In the disclosed embodiments, conflict-free space-time resource allocation is achieved by combining edge coloring, time slot allocation, and collision detection, completing space-time resource allocation for directional ad hoc networks based on edge coloring theory. Because time slot allocation is performed using actual network nodes and beam collisions are considered, communication interference is avoided, improving communication efficiency and capacity.

[0067] Figure 2 This is a flow chart of a resource allocation method provided by an embodiment of the present disclosure. Figure 2 , the method comprising:

[0068] 201: Acquire network topology information, where the network topology information includes location information of nodes in the network and information of routes connecting nodes in the network.

[0069] The methods provided in the embodiments of the present disclosure can be executed by a control device in a network. After joining the network, nodes in the network communicate with each other and report information about themselves and their neighbors to the control device. The control device then forms a network topology based on the information reported by each node. The control device obtains this topology information from a locally stored topology. Of course, in other implementations, network topology information can also be obtained from other devices.

[0070] The information about the routes between nodes in a network can be represented by a two-dimensional network connectivity matrix. The matrix's elements represent the connectivity between nodes based on their row and column positions. For example, the jth element in the i-th row indicates that nodes i and j are connected. The location information of nodes in a network primarily represents the node's current location.

[0071] For example, the network topology information in the present disclosure may be updated periodically. For example, at the beginning of each time frame, the control device forms a network topology based on information sent by each node in the previous time frame and obtains the latest network topology information.

[0072] 202: Select nodes in the network in descending order of importance.

[0073] The importance of a node is also the priority of the node. The importance of a node can be carried in the topology information of the aforementioned network or can be independent information.

[0074] 203: When selecting a first node in the network, extract a first route associated with the first node and routes not connected to the first route from the set of routes, and color the first route and the routes not connected to the first route in a first color.

[0075] Here, the first route associated with the first node refers to a route with one endpoint being the first node, such as route AB associated with node A. A route disconnected from the first route refers to a route that does not share the same endpoint as the first route, such as route CD disconnected from route AB.

[0076] 204: Sequentially extract other routes associated with the first node and routes not connected to the other routes from the remaining routes in the route set until there are no routes associated with the first node in the route set, and color the other routes and routes not connected to the other routes in other colors.

[0077] Here, the order in which the routes associated with the first node are selected can be random. For example, if the first node A is associated with three routes AB, AC, and AD, the order in which the three routes are selected in steps 203 and 204 can be random, or can be selected in descending order based on the importance of the nodes in the routes other than the first node. For example, if the importance of nodes B, C, and D is ranked from high to low, the order in which the routes are selected can be AB, AC, and AD.

[0078] After selecting route AB and the routes that are not connected to AB, these routes are dyed with the same color and removed from the set. That is, each route will only be selected once and will only be dyed with one color.

[0079] The following describes steps 201 to 204 with reference to an example:

[0080] The network topology is represented by a graph G(V,E), where V is a node and E is a route. G(V,E) represents a connected graph consisting of V and E. Let A be a list of all nodes in the graph G(V,E), B be the set of all routes in G(V,E), and the set Among them E ij is the route between node i and node j, For all with E ij There are no connected routes. The coloring steps are as follows:

[0081] a. Arrange all nodes of the graph G(V,E) in descending order of importance to form a list A = [V1, V2, ... V M ]; form all edges into B = ∪ i,j∈V E ij ;gather

[0082] b. Select V from A i ;

[0083] c. Select an edge E in B i,j , search for all the matches in B with E i,j There are no connected edges;

[0084] d. Connect these edges to E i,j join in and deleted from B;

[0085] e. For each of the remaining items in B and V i For the associated edges, perform operations c) to d);

[0086] f. Repeat steps b) to e) for the remaining nodes in A until B is empty.

[0087] After the above dyeing process, each set All edges in are assigned the same color. Using the set C formed by the algorithm, a coloring table can be formed as shown in Table 1. The same row in the table represents routes assigned the same color, which means that the corresponding links can be assigned to the same time slot during the communication scheduling process.

[0088] Table 1

[0089]

[0090] 205: Allocate resources to each route of information to be transmitted in sequence based on the color of the route in the network and the route of information to be transmitted.

[0091] Exemplarily, step 205 includes: sorting routes of various colors, arranging routes of the same color in a row, and arranging routes of different colors in different rows according to the order of coloring;

[0092] Select the routes in each row in turn until all the routes in all rows have been selected;

[0093] When selecting a route in the i-th row, one route in the i-th row is selected each time until all routes in the i-th row are selected;

[0094] When selecting a route AB between node A and node B, whether to allocate a time slot for the route AB when transmitting from node A to node B is determined as follows:

[0095] Query the first set of nodes A and the second set of nodes B in the route in the (i-1)th row. The first set of nodes A refers to the set of nodes that have already transmitted information with node A in the route to which resources have been allocated in the previous time slot, and the second set of nodes B refers to the set of nodes that still need to transmit information with node B. If the first set of nodes A contains elements in the second set of nodes B, allocate m consecutive time slots for transmission from node A to node B on route AB. m is a positive integer that can be set based on the amount of data to be transmitted, such as 1.

[0096] The i-th row of routes, namely, the routes corresponding to the i-th color, can first determine the first set and the second set after the end of the previous time slot when allocating the time slot for the i-th row of routes.

[0097] It is worth noting that, if it is the first route, the query is the first set of nodes A and the second set of nodes B at the time of initialization.

[0098] For example, Table 2 below provides an example of a first set and a second set, as shown in Table 2. Each node corresponds to two sets, the first set and the second set. For example, at initialization, the first set of node 1 is {1} and the second set is {2, 3, ... n}, and the first set of node 2 is {2} and the second set is {1, 3, ... n}. As time slot allocation continues, the first set and the second set continue to change. For example, at time slot 1, the first set of node 1 at initialization is {1}, and the second set of node 2 is {1, 3, ... n}. The first set of node 1 contains element 1 from the second set of node 2. At this time, time slot 1 can be allocated to the route from node 1 to node 2. At the same time, the first set of node 1 at time slot 1 becomes {1, 2}, and the second set becomes {3, ... n}.

[0099] Table 2

[0100]

[0101]

[0102] In the above-mentioned process of allocating time slots, the route of allocating time slots is not directional, and conflict detection will be performed subsequently to determine whether the allocated time slots can meet the transmission in two directions.

[0103] Table 3

[0104]

[0105] The time slot allocation is performed according to the method in Table 2, and the time slot allocation table is obtained as shown in Table 3.

[0106] The method of allocating m consecutive time slots for transmission from the node A to the node B for the route AB includes:

[0107] Selecting n elements in the second set of nodes B contained in the first set of nodes A as receiving nodes for information to be sent by node A, and allocating m consecutive time slots to a route between node A and the receiving nodes;

[0108] If the first set of node A contains fewer than n elements from the second set of node B, other nodes from the first set of node A are randomly selected to serve as receiving nodes for information to be sent by node A, and m consecutive time slots are allocated to the route between node A and the receiving nodes.

[0109] Here, a time slot supports up to n messages being transmitted in parallel. Therefore, routes assigned to the same time slot will be assigned different beams. The specific allocation method is not limited in this disclosure. If n or more messages are sent for elements in the second set of node B contained in the first set of node A, then n of these elements are selected. If n or more messages are not sent, then other nodes are selected for redundancy.

[0110] Optionally, step 205 may further include:

[0111] If the first set of node A does not contain any elements from the second set of node B, determine whether route AB, when transmitting from node A to node B, will affect the communication of other nodes. If not, assign m consecutive time slots to route AB when transmitting from node A to node B. If so, assign m consecutive time slots to route AB after the m consecutive time slots assigned when transmitting from node A to node B. In other words, if the transmission of other nodes is affected, delay the transmission of route AB by m time slots.

[0112] The allocation is performed in the above manner until the second set of each node is empty.

[0113] 206: Calculate the beam coverage of each route allocated to the same time slot.

[0114] like Figure 3As shown in the figure, A is the transmitting node, B is the receiving node, node (x, y) is the interfered node, and α is the half-beamwidth. Due to platform shaking, alignment errors, and other factors, node B will not be completely centered within A's transmitting beam, but may be offset to the left or right. In the figure, AC and AD are the extreme beam positions to the left and right of B, respectively. The beam coverage area formed by AC and AD for route A->B.

[0115] 207: Determine whether there are nodes on other routes among the routes within the beam coverage of the routes.

[0116] If there are nodes on other routes among the routes, there is a conflict, and step 208 is executed; if there are no nodes on other routes among the routes, there is no conflict.

[0117] like Figure 3 As shown, let the slope of AB be Then the linear equation of AC is as follows:

[0118]

[0119] Where (x', y') represents the coordinates of a point on the AB line.

[0120] The linear equation of AD is as shown in formula (2):

[0121]

[0122] Where (x", y") represents the coordinates of a point on the AD line.

[0123] There will be a conflict when the node is within 2 times the beam angle, that is, there will be a conflict when the coordinates (x, y) of the node satisfy formula (3):

[0124]

[0125] 208: In response to a conflict between beams used by routes allocated to the same time slot, reallocate a time slot for at least one of the conflicting routes.

[0126] Exemplarily, step 208 includes:

[0127] Determine the R and T values ​​of the two nodes of the conflicting first conflicting route, where the R value indicates whether the node is within the beam coverage of other routes in the same time slot, and the T value indicates whether there are other nodes (nodes other than nodes A and B) within the beam coverage when the node is used as the transmitting node;

[0128] determining whether a time slot is allocated to the first conflicting route based on R and T values ​​of two nodes of the first conflicting route;

[0129] When the time slot is not allocated to the first conflicting route, a time slot is allocated to the first conflicting route in a time slot subsequent to the time slot.

[0130] When assigning time slots to routes, it is assumed that bidirectional transmission on that route can be carried out in that time slot. For example, if time slot 1 is assigned to route AB, both A->B and B->A transmissions can be carried out in that time slot by default.

[0131] However, during conflict detection, if there is a conflict in one direction, the transmission in that direction will be postponed, that is, the time slot will be reallocated for that direction. If there is a conflict in both directions, the transmission in both directions will be postponed, that is, the time slot will be reallocated.

[0132] According to step 207, conflict judgment is performed. If there is a conflict in node communication in the current time slot, the conflicting node is reallocated to the next delayed time slot to ensure that the conflicting nodes are staggered in the time slot, thereby eliminating the communication conflict of the paired nodes. Figure 4 The process is illustrated by example:

[0133] Assume that there is a conflict between the lines of node A and node B. Then:

[0134] First, through steps 281 to 284, the conflict situation between nodes A and B is determined, and the values ​​RA, TA, RB, and TB are determined, that is, specifically, which direction has the conflict. Then, through steps 285 to 286, based on the above values, it is determined whether the time slot allocation is allocated to which direction of transmission, or whether both directions need to reallocate time slots.

[0135] For example, RA=1 means that node A is not within the beam coverage of other routes in the same time slot, RA=0 means that node A is within the beam coverage of other routes in the same time slot, TA=1 means that there is no node within the beam coverage when node A is a sending node, TA=0 means that there is a node within the beam coverage when node A is a sending node, RB=1 means that node B is not within the beam coverage of other routes in the same time slot, RB=0 means that node B is within the beam coverage of other routes in the same time slot, TB=1 means that there is no node within the beam coverage when node B is a sending node, TB=0 means that there is a node within the beam coverage when node B is a sending node.

[0136] For example, when TA = 1, RA = 0, TB = 0, and RB = 1, this indicates that if node B is the transmitting node, there will be interference, but if node A is the transmitting node, there will be no interference. In this case, the node is assigned to A's transmitting timeslot, that is, assigned to the A->B direction. When TA = 0, RA = 1, TB = 1, and RB = 0, the node is assigned to B's transmitting timeslot.

[0137] When time slots are allocated to only one direction, time slots for the other direction need to be reallocated later.

[0138] During subsequent allocation, if it is detected that there is no conflict, that is, TA=1, RA=1, TB=1, and RB=1, the time slot is allocated to the other direction. For example, if a time slot has been allocated to the A->B direction, then the time slot is allocated to the B->A direction, or if a time slot has been allocated to the B->A direction, then the time slot is allocated to the A->B direction.

[0139] In response to there being no conflict between beams used by a certain route and other routes in the same time slot, the time slot is allocated to transmission in both directions of the route.

[0140] Figure 5 This is a schematic diagram of the structure of a resource allocation device provided by an embodiment of the present disclosure. Figure 5 The device includes: an acquisition module 301, a coloring module 302, an allocation module 303 and a conflict detection module 304.

[0141] The acquisition module 301 is configured to acquire network topology information, wherein the network topology information includes location information of nodes in the network and information about routes connecting nodes in the network;

[0142] a coloring module 302 for coloring all routes in the network into a plurality of colors using an edge coloring algorithm, wherein routes colored with the same color are not connected;

[0143] an allocation module 303, configured to allocate resources to each route to be transmitted based on the color of the route in the network and the route of the information to be transmitted, wherein routes of the same color are allowed to be allocated resources of different beams in the same time slot;

[0144] a conflict detection module 304 for determining, based on location information of nodes in the network, whether beams used by routes allocated to the same time slot conflict;

[0145] The allocation module 303 is further configured to reallocate a time slot for at least one of the conflicting routes in response to a conflict between beams used by the routes allocated to the same time slot.

[0146] Optionally, the coloring module 302 is configured to sequentially select nodes in the network according to their importance from high to low; when selecting a first node in the network, extract a first route associated with the first node and routes not connected to the first route from the set of routes, and color the first route and routes not connected to the first route in a first color; sequentially extract other routes associated with the first node and routes not connected to the other routes from the remaining routes in the set of routes, until no route associated with the first node exists in the set of routes, and color the other routes and routes not connected to the other routes in other colors.

[0147] Optionally, the allocation module 303 is used to sort routes of various colors, with routes of the same color arranged in a row, and routes of different colors arranged in different rows according to the order of coloring; select routes in each row in turn until all routes in all rows have been selected; when selecting a route in the i-th row, select one route in the i-th row each time until all routes in the i-th row have been selected; when selecting route AB between node A and node B, determine whether to allocate time slots for route AB when transmitting from node A to node B in the following manner: query the first set of nodes A and the second set of nodes B in the i-1-th row route, wherein the first set of nodes A refers to the set of nodes that transmit information with node A in the route to which resources have been allocated in the previous time slot, and the second set of nodes B refers to the set of nodes that still need to transmit information with node B; if the first set of nodes A contains elements in the second set of nodes B, allocate m consecutive time slots for route AB when transmitting from node A to node B.

[0148] Optionally, the allocation module 303 is used to select n elements in the second set of node B contained in the first set of node A as receiving nodes for the information to be sent by node A, and allocate m consecutive time slots to the route between node A and the receiving node; if the number of elements in the second set of node B contained in the first set of node A is less than n, then other nodes in the first set of node A are randomly selected as supplementary receiving nodes for the information to be sent by node A, and allocate m consecutive time slots to the route between node A and the receiving node.

[0149] Optionally, the allocation module 303 is further used to determine whether the route AB affects the communication of other nodes when it is transmitted from the node A to the node B if the first set of the node A does not contain the elements in the second set of the node B; if not, allocate m consecutive time slots to the route AB when it is transmitted from the node A to the node B; if there is an impact, allocate m consecutive time slots to the route AB after the m consecutive time slots are allocated when it is transmitted from the node A to the node B.

[0150] Optionally, the conflict detection module 304 is used to calculate the beam coverage of each route assigned to the same time slot; determine whether there are nodes on other routes among the routes within the beam coverage of the routes; if there are nodes on other routes among the routes, there is a conflict; if there are no nodes on other routes among the routes, there is no conflict.

[0151] Optionally, the allocation module 303 is also used to determine the R and T values ​​of two nodes of the first conflicting route in which there is a conflict, wherein the R value indicates whether the node is within the beam coverage of other routes in the same time slot, and the T value indicates whether there are other nodes within the beam coverage when the node is used as a sending node; based on the R and T values ​​of the two nodes of the first conflicting route, determine whether the time slot is allocated to the first conflicting route; when the time slot is not allocated to the first conflicting route, allocate a time slot to the first conflicting route in the time slot after the time slot.

[0152] It should be noted that the resource allocation apparatus provided in the above embodiments uses the division of the functional modules described above as an example only. In actual applications, the functional allocation can be performed by different functional modules as needed, i.e., the internal structure of the device can be divided into different functional modules to perform all or part of the functions described above. Furthermore, the resource allocation apparatus provided in the above embodiments and the resource allocation method embodiment are based on the same concept. The specific implementation process is detailed in the method embodiment and will not be repeated here.

[0153] Figure 6 4 is a block diagram of a control device provided by an embodiment of the present disclosure. Generally, the control device includes: a processor 401 and a memory 402.

[0154] Processor 401 may include one or more processing cores, such as a quad-core processor or an octal-core processor. Processor 401 may be implemented using at least one of the following hardware forms: a DSP (Digital Signal Processing), an FPGA (Field-Programmable Gate Array), or a PLA (Programmable Logic Array). Processor 401 may also include a main processor and a coprocessor. The main processor is a processor for processing data in the awake state, also known as a CPU (Central Processing Unit); the coprocessor is a low-power processor for processing data in the standby state.

[0155] The memory 402 may include one or more computer-readable storage media, which may be non-transitory. The memory 402 may also include high-speed random access memory and non-volatile memory, such as one or more disk storage devices and flash memory storage devices. In some embodiments, the non-transitory computer-readable storage medium in the memory 402 is used to store at least one instruction, which is used to be executed by the processor 401 to implement the resource allocation method performed by the control device provided in the method embodiment of the present application.

[0156] Those skilled in the art will understand that all or part of the steps to implement the above embodiments may be accomplished by hardware, or by a program to instruct the relevant hardware, and the program may be stored in a computer-readable storage medium, which may be a read-only memory, a disk, or an optical disk, etc.

[0157] The above description is merely an optional embodiment of the present disclosure and is not intended to limit the present disclosure. Any modifications, equivalent replacements, improvements, etc. made within the spirit and principles of the present disclosure shall be included in the scope of protection of the present disclosure.

Claims

1. A resource allocation method, characterized in that: The method comprises: Acquiring network topology information, wherein the network topology information includes location information of nodes in the network and information of routes connecting nodes in the network; An edge coloring algorithm is used to color all routes in the network into a plurality of colors, wherein routes colored with the same color are not connected; Allocating resources to each route to be transmitted based on the color of the routes in the network and the routes of the information to be transmitted, wherein routes of the same color are allowed to be allocated resources of different beams in the same time slot; determining, based on location information of nodes in the network, whether beams used by routes assigned to the same time slot conflict; In response to a conflict between beams used by routes assigned to the same time slot, reallocating a time slot for at least one of the conflicting routes; The determining, based on the location information of the nodes in the network, whether beams used by routes allocated to the same time slot conflict, includes: Calculate the beam coverage of each route assigned to the same time slot; Determining whether there are nodes on other routes among the routes within the beam coverage of the routes; If there are nodes on other routes among the routes, there is a conflict; if there are no nodes on other routes among the routes, there is no conflict.

2. The method according to claim 1, characterized in that The edge coloring algorithm is used to color all routes in the network into several colors, including: Select nodes in the network in descending order of importance; When selecting a first node in the network, taking a first route associated with the first node and routes not connected to the first route from the set of routes, and coloring the first route and the routes not connected to the first route into a first color; Other routes associated with the first node and routes not connected to the other routes are sequentially taken from the remaining routes in the route set until no route associated with the first node exists in the route set, and the other routes and routes not connected to the other routes are dyed in other colors.

3. The method according to claim 1, characterized in that Allocating resources to each route of information to be transmitted in sequence based on the color of the route in the network and the route of information to be transmitted includes: Sort the routes of various colors, with the routes of the same color arranged in one row, and the routes of different colors arranged in different rows according to the order of coloring; Select the routes in each row in turn until all the routes in all rows have been selected; When selecting a route in the i-th row, one route in the i-th row is selected each time until all routes in the i-th row are selected; When selecting a route AB between node A and node B, determine whether to allocate time slots for the route AB when transmitting from node A to node B in the following manner: query the first set of nodes A and the second set of nodes B in the i-1th row of the route, wherein the first set of nodes A refers to the set of nodes that transmit information with node A in the route to which resources have been allocated in the previous time slot, and the second set of nodes B refers to the set of nodes that still need to transmit information with node B; if the first set of nodes A contains elements in the second set of nodes B, allocate m consecutive time slots for the route AB when transmitting from node A to node B.

4. The method according to claim 3, characterized in that The allocating m consecutive time slots for the route AB according to the transmission from the node A to the node B includes: Selecting n elements in the second set of nodes B contained in the first set of nodes A as receiving nodes for information to be sent by node A, and allocating m consecutive time slots to a route between node A and the receiving nodes; If the first set of node A contains fewer than n elements from the second set of node B, other nodes from the first set of node A are randomly selected to serve as receiving nodes for information to be sent by node A, and m consecutive time slots are allocated to the route between node A and the receiving nodes.

5. The method according to claim 3, characterized in that The allocating resources to each route to be transmitted based on the color of the route in the network and the route of the information to be transmitted in sequence further includes: If the first set of node A does not contain the elements in the second set of node B, determine whether route AB affects the communication of other nodes when transmitted from node A to node B; if not, allocate m consecutive time slots to route AB when transmitted from node A to node B; if so, allocate m consecutive time slots to route AB after the m consecutive time slots allocated when transmitted from node A to node B.

6. The method according to any one of claims 1 to 5, characterized in that In response to a conflict between beams used by routes allocated to the same time slot, reallocating a time slot for at least one of the conflicting routes comprises: Determine the R and T values ​​of two nodes on the conflicting first conflicting route, where the R value indicates whether the node is within the beam coverage of other routes in the same time slot, and the T value indicates whether there are other nodes within the beam coverage when the node is used as the transmitting node; determining whether a time slot is allocated to the first conflicting route based on R and T values ​​of two nodes of the first conflicting route; When the time slot is not allocated to the first conflicting route, a time slot is allocated to the first conflicting route in a time slot subsequent to the time slot.

7. A resource allocation device, characterized in that: The device comprises: an acquisition module, configured to acquire network topology information, wherein the network topology information includes location information of nodes in the network and information of routes connecting nodes in the network; a coloring module, configured to color all routes in the network into a plurality of colors using an edge coloring algorithm, wherein routes colored with the same color are not connected; an allocation module, configured to allocate resources to each route to be transmitted based on the color of the route in the network and the route of the information to be transmitted, wherein routes of the same color are allowed to be allocated resources of different beams in the same time slot; a conflict detection module, configured to determine, based on location information of nodes in the network, whether beams used by routes allocated to the same time slot conflict; The allocation module is further configured to reallocate a time slot for at least one conflicting route in response to a conflict between beams used by routes allocated to the same time slot; The conflict detection module is used to calculate the beam coverage of each route assigned to the same time slot; determine whether there are nodes on other routes among the routes within the beam coverage of the routes; if there are nodes on other routes among the routes, there is a conflict; if there are no nodes on other routes among the routes, there is no conflict.

8. A control device, characterized in that: The control device includes a processor and a memory, wherein the memory stores at least one program code, and the program code is loaded and executed by the processor to implement the resource allocation method according to any one of claims 1 to 6.

9. A computer-readable storage medium, characterized in that At least one program code is stored in the computer-readable storage medium, and the program code is loaded and executed by a processor to implement the resource allocation method according to any one of claims 1 to 6.

Images