A centralized wireless communication resource dynamic allocation method and application

Abstract

This application discloses a centralized wireless communication resource dynamic allocation method, including: creating a topology structure diagram that stores complete information about the current network topology using a connectivity graph data structure; creating a communication task request queue based on the communication needs of each communication node in the communication network; creating a request node based on the communication request and inserting it into the communication task request queue as a judgment criterion; sequentially extracting the request node and creating a minimum spanning tree using the topology structure diagram as the connectivity graph; obtaining the communication path from the request node to the target node based on the minimum spanning tree, and selecting appropriate resources to allocate to the task request. This method can simultaneously meet the needs of communication tasks while improving the utilization rate of network resources.

Description

Technical Field

[0001] The present application relates to the field of wireless communication technology, and more specifically, to a centralized wireless communication resource dynamic allocation method, a centralized wireless communication resource dynamic allocation device, an electronic device, and a computer-readable storage medium. Background Art

[0002] Dynamic wireless communication resource allocation technology primarily involves radio bearer selection and resource scheduling management. Radio bearer selection primarily considers the QoS requirements of the radio bearer, such as channel quality, buffer status, and interference. Dynamic resource allocation also considers information such as available resource blocks and resource pool constraints related to inter-cell interference coordination. The goal is to improve system resource utilization, expand communication system capacity, enhance system reliability, and ensure communication performance. Therefore, various technologies for dynamic wireless communication resource allocation are designed to maximize wireless communication resource utilization while meeting the diverse needs of various services, achieving a balance between reliability and efficiency.

[0003] However, in the current complex wireless communication network environment where multiple communication means are available, multiple communication resources are optional, and multiple communication tasks are carried out in parallel, it is difficult for the management center to balance the needs of meeting communication tasks and improving the utilization of network resources when executing centralized resource allocation decisions, resulting in poor adaptability of the system in complex and dynamically changing environments. Summary of the Invention

[0004] In response to at least one defect or improvement need in the prior art, the present invention provides a centralized wireless communication resource dynamic allocation method and application, aiming to improve the utilization of network resources while meeting the needs of communication tasks.

[0005] To achieve the above objectives, according to a first aspect of the present invention, a centralized wireless communication resource dynamic allocation method is provided, comprising: creating a topology diagram of a wireless communication network, wherein the topology diagram stores complete information of the current network topology in a connectivity diagram data structure, wherein the complete information includes the connectivity status, communication means, and resource quantity between any two communication nodes; creating a communication task request queue based on the communication requirements of each communication node in the wireless communication network, assigning an initial priority to each communication task request, periodically traversing the communication task request queue, and updating the priority of the communication nodes in the communication task request queue based on the waiting time; creating a communication request node based on the received communication request and inserting it into the communication task request queue based on the priority as the judgment standard; traversing the communication task request queue from the starting position, extracting the request nodes in turn and creating a minimum spanning tree using the topology diagram as the connectivity diagram, obtaining a communication path from the request node to the target node based on the minimum spanning tree, and selecting appropriate resources from each network node in the communication path to allocate to the task request.

[0006] In one embodiment of the present invention, when a task request node encounters a resource conflict, the priority of the node is increased and the node is reinserted into the communication request queue to wait for the next round of communication request queue traversal and resource allocation.

[0007] In one embodiment of the present invention, the wireless communication task request queue is used as a buffer, assuming that the maximum load of the actual communication network is P, and based on historical experience of the average resource expenditure S of a single task request, the maximum length N of the wireless communication task request queue is determined as: Among them, when the length of the wireless communication task request queue decreases and approaches 0, the actual communication demand of the network is small, and the producer process blocks the buffer, waiting for the arrival of new communication tasks; when the wireless communication task request queue increases and approaches N, the actual communication service of the network is busy, and the consumer process blocks the buffer, waiting for the current communication task to end and release resources.

[0008] In one embodiment of the present invention, the sequentially extracting the requesting nodes and creating a minimum spanning tree using the topology graph as a connectivity graph includes defining the communication cost between two communication nodes as: Where K represents the maximum value of the available communication resources between communication node i and communication node j, B k Represents the communication bandwidth of the kth resource; uses the communication cost to assign weights to the network topology connectivity graph, and uses the Kruskal algorithm to generate a minimum spanning tree of the connectivity graph, finds the path connecting the communication start and end addresses on the minimum spanning tree, and uses the greedy algorithm at each node of the path to allocate communication resources for the current task request.

[0009] According to a second aspect of the present invention, a centralized wireless communication resource dynamic allocation device is provided, comprising: a topology graph creation module for creating a topology graph of a wireless communication network, wherein the topology graph stores complete information of the current network topology in a connectivity graph data structure, wherein the complete information includes the connectivity status, communication means, and resource quantity between any two communication nodes; a task request queue creation module for creating a communication task request queue based on the communication requirements of each communication node in the wireless communication network, assigning an initial priority to each communication task request, periodically traversing the communication task request queue, and updating the priorities of communication nodes in the communication task request queue based on waiting time; a request node insertion module for creating a communication request node based on a received communication request and inserting it into the communication task request queue based on priority; and a communication path generation module for traversing the communication task request queue from a starting position, sequentially extracting the request nodes, and creating a minimum spanning tree using the topology graph as a connectivity graph, obtaining a communication path from the request node to the target node based on the minimum spanning tree, and selecting appropriate resources from each network node in the communication path to allocate to the task request.

[0010] In one embodiment of the present invention, the request node insertion module is further used to: when a task request node encounters a resource conflict, increase the priority of the node and reinsert it into the communication request queue to wait for the next round of communication request queue traversal and resource allocation.

[0011] In one embodiment of the present invention, the task request queue creation module is further configured to: use the wireless communication task request queue as a buffer, assume that the maximum load of the actual communication network is P, and determine the maximum length N of the wireless communication task request queue based on the average resource expenditure S of a single task request in historical experience as follows: Among them, when the length of the wireless communication task request queue decreases and approaches 0, the actual communication demand of the network is small, and the producer process blocks the buffer, waiting for the arrival of new communication tasks; when the wireless communication task request queue increases and approaches N, the actual communication service of the network is busy, and the consumer process blocks the buffer, waiting for the current communication task to end and release resources.

[0012] In one embodiment of the present invention, the communication path generation module is further configured to define the communication cost between two communication nodes as: Where K represents the maximum value of the available communication resources between communication node i and communication node j, B kRepresents the communication bandwidth of the kth resource; uses the communication cost to assign weights to the network topology connectivity graph, and uses the Kruskal algorithm to generate a minimum spanning tree of the connectivity graph, finds the path connecting the communication start and end addresses on the minimum spanning tree, and uses the greedy algorithm at each node of the path to allocate communication resources for the current task request.

[0013] On the other hand, an embodiment of the present invention further proposes an electronic device, comprising: a memory and one or more processors connected to the memory, the memory storing a computer program, and the processor being used to execute the computer program to implement the steps of the centralized wireless communication resource dynamic allocation method as described in any one of the above embodiments.

[0014] On the other hand, an embodiment of the present invention further proposes a computer-readable storage medium, which stores computer-executable instructions, and the computer-executable instructions are used to execute the steps of the centralized wireless communication resource dynamic allocation method as described in any one of the above embodiments.

[0015] In general, the above technical solutions conceived by the present invention can achieve the following beneficial effects compared with the prior art:

[0016] The centralized wireless communication resource dynamic allocation method provided by the present invention adopts a dynamic allocation model based on producer-consumer, constructs a network topology connectivity graph and a wireless communication request task queue, generates a single-task resource allocation strategy through a minimum spanning tree algorithm, and constructs a global network communication request resource management solution under the dynamic conflict handling mechanism of the producer-consumer model. In a complex wireless communication network environment with multiple communication means available, multiple communication resources optional, and multiple communication tasks running in parallel, centralized resource allocation decisions are executed in a management center. It can maximize the satisfaction of communication task needs while taking into account the priority of communication tasks, greatly reduce the complexity of the resource dynamic allocation problem, and improve the utilization rate of network resources and the adaptability of the system in a complex and dynamically changing environment. BRIEF DESCRIPTION OF THE DRAWINGS

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

[0018] Figure 1 A flowchart of a centralized wireless communication resource dynamic allocation method provided in an embodiment of the present application;

[0019] Figure 2A schematic diagram of the wireless communication network topology connectivity and data structure provided in an embodiment of the present application;

[0020] Figure 3 A schematic diagram of a producer-consumer model of a wireless communication task request queue provided in an embodiment of the present application;

[0021] Figure 4 A schematic structural diagram of a centralized wireless communication resource dynamic allocation device provided in an embodiment of the present application;

[0022] Figure 5 A schematic structural diagram of an electronic device provided by an embodiment of the present invention;

[0023] Figure 6 A schematic structural diagram of a computer-readable storage medium provided in an embodiment of the present invention. DETAILED DESCRIPTION

[0024] In order to make the objectives, technical solutions and advantages of the present invention more clearly understood, the present invention is further described in detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely for the purpose of explaining the present invention and are not intended to limit the present invention. In addition, the technical features involved in the various embodiments of the present invention described below may be combined with each other as long as they do not conflict with each other.

[0025] The terms "first," "second," "third," and the like in the specification and claims of this application and the accompanying drawings are used to distinguish between different objects, not to describe a particular order. Furthermore, the terms "including," "having," and any variations thereof, are intended to cover non-exclusive inclusions. For example, a process, method, system, product, or apparatus comprising a series of steps or elements is not limited to the listed steps or elements, but may optionally include steps or elements not listed, or may optionally include other steps or elements inherent to the process, method, product, or apparatus.

[0026] like Figure 1As shown, the first embodiment of the present invention proposes a centralized wireless communication resource dynamic allocation method, including: step S1, creating a topology diagram of a wireless communication network, wherein the topology diagram stores complete information of the current network topology structure in a connectivity diagram data structure, wherein the complete information includes the connectivity status, communication means, and resource quantity between any two communication nodes; step S2, creating a communication task request queue based on the communication needs of each communication node in the wireless communication network, assigning an initial priority to each communication task request, regularly traversing the communication task request queue, and updating the priority of the communication node in the communication task request queue based on the waiting time; step S3, creating a communication request node based on the received communication request and inserting it into the communication task request queue based on the priority as a judgment standard; step S4, traversing the communication task request queue from the starting position, extracting the request node in sequence, and creating a minimum spanning tree with the topology diagram as the connectivity diagram, obtaining a communication path from the request node to the target node based on the minimum spanning tree, and selecting appropriate resources from each network node in the communication path to allocate to the task request.

[0027] Combine Figure 2 As shown, in step S1, the topology diagram of the wireless communication network is composed of an undirected connected graph consisting of abstract data of real physical network nodes. This topology diagram is used to record complete information about the current network topology, including the connectivity between any two physical nodes and the available communication resources between the nodes, including the communication means and resource quantity. The nodes of the connectivity diagram are abstract data representations of the actual physical communication network nodes.

[0028] exist Figure 2 In the Node Table, the connection graph records the communication status between the current physical node and its neighboring physical nodes, and the Communication Resource Table records all communication resources of the current physical node. Specifically, the Connection Node Table stores the addresses of physical nodes that can communicate with the current network node. The Communication Resource Table stores the node's communication resources by category, including but not limited to shortwave, ultra-shortwave, satellite, and data link communications. All communication resources are listed by category, recording detailed information about the resource, including frequency, bandwidth, usage status, and the occupier's task number.

[0029] In step S2, combined Figure 3 As shown, the wireless communication task request queue is created based on the producer-consumer model. It records resource requests and allocation responses for wireless network communications. Each resource request is abstracted into a node in a communication task request data structure. The wireless communication task request queue consists of request nodes, which record the initiation time, priority, and start and end addresses of the communication task request.

[0030] In step S3, the producer process is responsible for receiving communication requests, creating task request nodes, and inserting them into the task request queue according to priority. Furthermore, the producer-consumer model uses the wireless communication task request queue as a buffer. Assuming the maximum load of the actual communication network is P and the average resource expenditure of a single task request is S based on historical experience, the maximum length N of the wireless communication task request queue is:

[0031]

[0032] When the length of the wireless communication task request queue decreases and approaches 0, it means that the actual communication demand of the network is small, and the producer process blocks the buffer, waiting for the arrival of new communication tasks; when the wireless communication task request queue increases and approaches N, it means that the actual communication service of the network is busy and the communication resources are tight. The consumer process blocks the buffer, waiting for the current communication task to end and release resources.

[0033] Furthermore, for example, a resource conflict handling method based on a priority mechanism is established. When a task request node encounters a resource conflict, the priority of the node is increased by 1 and it is reinserted into the communication request queue, waiting for the next round of communication request queue traversal and resource allocation.

[0034] In step S4, the consumer process is responsible for taking out nodes from the queue, creating a minimum spanning tree based on the current network structure topology as the connectivity graph, and obtaining a communication path from the starting point to the end point of the communication request based on this minimum spanning tree, and selecting the optimal resources from the communication resources of each network node on the path to allocate to the task request, forming a solution for the task request, and updating the network topology diagram, removing the occupied communication resources from the network topology diagram, and then taking out the next request node from the communication request queue, and repeating the above resource allocation operation.

[0035] Furthermore, when a consumer process takes a node from the communication task request queue, the Kruskal algorithm is used to generate a minimum spanning tree of the connectivity graph, using the current network topology as the connectivity graph and the communication cost as the edge weight of the connectivity graph. Specifically, for example, the communication cost between two communication nodes is defined as the reciprocal of the sum of the bandwidth of the available communication resources between the two communication nodes. For ease of calculation, this reciprocal is multiplied by a large integer, such as 1000. The communication cost between communication node i and communication node j can be expressed as:

[0036]

[0037] Where K represents the maximum value of the available communication resources between communication node i and communication node j, B k represents the communication bandwidth of the kth resource.

[0038] In this way, after using the above definition of communication cost to weight the network topology connectivity graph, the Kruskal algorithm can be used to generate the minimum spanning tree of the connectivity graph, and then a path connecting the communication start and end addresses can be found on the minimum spanning tree. The greedy algorithm is used at each node of the path to allocate communication resources for the current task request.

[0039] In summary, the centralized wireless communication resource dynamic allocation method proposed in the second embodiment of the present invention adopts a producer-consumer based dynamic allocation model to construct a network topology connectivity graph and a wireless communication request task queue, generates a single task resource allocation strategy through a minimum spanning tree algorithm, and constructs a global network communication request resource management solution under the dynamic conflict handling mechanism of the producer-consumer model. In a complex wireless communication network environment where multiple communication means are available, multiple communication resources are optional, and multiple communication tasks are carried out in parallel, centralized resource allocation decisions are executed in the management center. It can maximize the satisfaction of communication task needs while taking into account the priority of communication tasks, greatly reducing the complexity of the dynamic resource allocation problem, and improving the utilization rate of network resources and the adaptability of the system in a complex and dynamically changing environment.

[0040] In addition, if Figure 4 As shown, the second embodiment of the present invention further proposes a centralized wireless communication resource dynamic allocation device 20, which includes, for example: a topology diagram creation module 201, a task request queue creation module 202, a request node insertion module 203 and a communication path generation module 204.

[0041] The topology graph creation module 201 is used to create a topology graph of the wireless communication network. The topology graph stores complete information about the current network topology in a connectivity graph data structure. This complete information includes the connectivity status, communication methods, and resource availability between any two communication nodes. The task request queue creation module 202 is used to create a communication task request queue based on the communication needs of each communication node in the wireless communication network, assign an initial priority to each communication task request, periodically traverse the communication task request queue, and update the priorities of communication nodes in the communication task request queue based on waiting time. The request node insertion module 203 is used to create communication request nodes based on received communication requests and insert them into the communication task request queue based on priority. The communication path generation module 204 is used to traverse the communication task request queue from the starting position, sequentially extract the request nodes, and create a minimum spanning tree using the topology graph as the connectivity graph. Based on the minimum spanning tree, the module obtains a communication path from the request node to the target node and selects appropriate resources from each network node in the communication path to allocate to the task request.

[0042] Furthermore, the request node insertion module 203 is further configured to use the wireless communication task request queue as a buffer, assume that the maximum load of the actual communication network is P, and determine the maximum length N of the wireless communication task request queue based on the average resource expenditure S of a single task request in historical experience as follows: Among them, when the length of the wireless communication task request queue decreases and approaches 0, the actual communication demand of the network is small, and the producer process blocks the buffer, waiting for the arrival of new communication tasks; when the wireless communication task request queue increases and approaches N, the actual communication service of the network is busy, and the consumer process blocks the buffer, waiting for the current communication task to end and release resources.

[0043] Furthermore, the communication path generation module 204 is further configured to define the communication cost between two communication nodes as: Where K represents the maximum value of the available communication resources between communication node i and communication node j, B k Represents the communication bandwidth of the kth resource; uses the communication cost to assign weights to the network topology connectivity graph, and uses the Kruskal algorithm to generate a minimum spanning tree of the connectivity graph, finds the path connecting the communication start and end addresses on the minimum spanning tree, and uses the greedy algorithm at each node of the path to allocate communication resources for the current task request.

[0044] The centralized wireless communication resource dynamic allocation method implemented by the centralized wireless communication resource dynamic allocation apparatus 20 disclosed in the second embodiment of the present invention is as described in the first embodiment above, and therefore will not be described in detail here. Optionally, the various modules and other operations or functions described above in the second embodiment are respectively for implementing the method described in the first embodiment, and the beneficial effects of this embodiment are the same as those of the first embodiment above, and for the sake of brevity, they will not be described here in detail.

[0045] like Figure 5 As shown, the third embodiment of the present invention further proposes an electronic device 30, for example, including: at least one processing unit 31, and at least one storage unit 32, wherein the storage unit 32 stores a computer program, and when the computer program is executed by the processing unit, the processing unit 31 executes the method as described in the first embodiment, and the beneficial effects of the electronic device 30 provided by this embodiment are the same as the beneficial effects of the centralized wireless communication resource dynamic allocation method provided by the first embodiment.

[0046] like Figure 6 As shown, the fourth embodiment of the present invention further provides a computer-readable storage medium 40, on which a computer program is stored, which implements the steps of the above method when executed by a processor, and the beneficial effects of the computer-readable storage medium 40 provided by this embodiment are the same as the beneficial effects of the centralized wireless communication resource dynamic allocation method provided by the first embodiment.

[0047] It should be noted that for the aforementioned method embodiments, for the sake of simplicity, they are all expressed as a series of action combinations, but those skilled in the art should be aware that this application is not limited by the order of the actions described, because according to this application, certain steps can be performed in other orders or simultaneously. Secondly, those skilled in the art should also be aware that the embodiments described in the specification are all preferred embodiments, and the actions and modules involved are not necessarily required by this application.

[0048] In the above embodiments, the description of each embodiment has its own focus. For parts that are not described in detail in a certain embodiment, reference can be made to the relevant descriptions of other embodiments.

[0049] In the several embodiments provided in this application, it should be understood that the disclosed devices can be implemented in other ways. For example, the device embodiments described above are merely schematic. For example, the division of the units is merely a logical function division. In actual implementation, there may be other division methods, such as multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed. Another point is that the mutual coupling or direct coupling or communication connection shown or discussed can be through some service interface, and the indirect coupling or communication connection of the device or unit can be electrical or other forms.

[0050] The units described as separate components may or may not be physically separate, and the components shown as units may or may not be physical units, that is, they may be located in one place or distributed across multiple network units. Some or all of these units may be selected to achieve the purpose of this embodiment according to actual needs.

[0051] In addition, the functional units in the various embodiments of the present application may be integrated into a single processing unit, or each unit may exist physically separately, or two or more units may be integrated into a single unit. The aforementioned integrated units may be implemented in the form of hardware or software functional units.

[0052] If the integrated unit is implemented in the form of a software functional unit and sold or used as an independent product, it can be stored in a computer-readable memory. Based on this understanding, the technical solution of the present application is essentially or the part that contributes to the prior art or all or part of the technical solution can be embodied in the form of a software product, and the computer software product is stored in a memory, including a number of instructions for enabling a computer device (which can be a personal computer, server or network device, etc.) to execute all or part of the steps of the method described in each embodiment of the present application. The aforementioned memory includes: various media that can store program codes, such as a USB flash drive, a read-only memory (ROM), a random access memory (RAM), a mobile hard disk, a magnetic disk or an optical disk.

[0053] Those skilled in the art will appreciate that all or part of the steps in the various methods of the above embodiments can be completed by instructing related hardware through a program, and the program can be stored in a computer-readable memory, which may include: a flash drive, a read-only memory (ROM), a random access memory (RAM), a magnetic disk or an optical disk, etc.

[0054] The above is only an exemplary embodiment of the present disclosure and cannot be used to limit the scope of the present disclosure. That is, any equivalent changes and modifications made according to the teachings of the present disclosure are still within the scope of the present disclosure. After considering the specification and practicing the disclosure herein, those skilled in the art will easily think of the implementation scheme of the present disclosure. This application is intended to cover any variation, use or adaptation of the present disclosure, which follows the general principles of the present disclosure and includes common knowledge or customary technical means in the art that are not recorded in the present disclosure. The description and examples are to be regarded as exemplary only, and the scope and spirit of the present disclosure are defined by the claims.

[0055] The technical features of the above embodiments can be combined arbitrarily. To make the description concise, not all possible combinations of the technical features in the above embodiments are described. However, as long as there is no contradiction in the combination of these technical features, they should be considered to be within the scope of this specification.

[0056] It will be easily understood by those skilled in the art that the above description is merely a preferred embodiment of the present invention and is not intended to limit the present invention. Any modifications, equivalent substitutions, and improvements made within the spirit and principles of the present invention should be included in the scope of protection of the present invention.

Claims

1. A centralized wireless communication resource dynamic allocation method, characterized in that: include: Creating a topology diagram of the wireless communication network, wherein the topology diagram stores complete information of the current network topology in a connectivity graph data structure, the complete information including the connectivity status, communication means, and resource quantity between any two communication nodes; Creating a communication task request queue according to the communication needs of each communication node in the wireless communication network, assigning an initial priority to each communication task request, regularly traversing the communication task request queue, and updating the priority of the communication node in the communication task request queue based on the waiting time; Creating a communication request node according to the received communication request and inserting it into the communication task request queue based on priority; Traverse from the starting position of the communication task request queue, take out the request nodes in turn and create a minimum spanning tree with the topology structure diagram as the connectivity diagram, obtain the communication path from the request node to the target node based on the minimum spanning tree, and select appropriate resources from each network node in the communication path to allocate to the task request.

2. The centralized wireless communication resource dynamic allocation method according to claim 1, wherein: When a communication request node encounters a resource conflict, the priority of the node is increased and the node is reinserted into the communication task request queue to wait for the next round of communication task request queue traversal and resource allocation.

3. The centralized wireless communication resource dynamic allocation method according to claim 1, wherein: Taking the communication task request queue as the buffer, assuming the maximum load of the actual communication network is , based on historical experience, the average resource expenditure of a single task request , determine the maximum length of the communication task request queue for: ; Among them, when the length of the communication task request queue decreases and approaches 0, the actual communication demand of the network is small, and the producer process blocks the buffer and waits for the arrival of new communication tasks; when the communication task request queue increases and approaches , then the actual network communication business is busy, and the consumer process blocks the buffer, waiting for the current communication task to end and release resources.

4. The centralized wireless communication resource dynamic allocation method according to claim 1, wherein: The step of sequentially extracting the request nodes and creating a minimum spanning tree using the topology diagram as a connectivity diagram includes: The communication cost between two communication nodes is defined as: ;in, Represents a communication node Communication nodes The maximum value of the available communication resources between Indicates the The communication bandwidth of each resource; The communication cost is used to assign weights to the network topology connectivity graph, and the Kruskal algorithm is used to generate a minimum spanning tree of the connectivity graph. A path connecting the communication start and end addresses is found on the minimum spanning tree, and a greedy algorithm is used at each node of the path to allocate communication resources for the current task request.

5. A centralized wireless communication resource dynamic allocation device, characterized in that: include: A topology diagram creation module is used to create a topology diagram of a wireless communication network. The topology diagram stores complete information about the current network topology in a connectivity diagram data structure. The complete information includes the connectivity status, communication means, and resource quantity between any two communication nodes. a task request queue creation module, configured to create a communication task request queue according to the communication requirements of each communication node in the wireless communication network, assign an initial priority to each communication task request, periodically traverse the communication task request queue, and update the priority of the communication node in the communication task request queue based on the waiting time; A request node insertion module is used to create a communication request node according to the received communication request and insert it into the communication task request queue based on the priority as the judgment standard; The communication path generation module is used to traverse from the starting position of the communication task request queue, take out the request nodes in turn and create a minimum spanning tree based on the topology diagram as the connectivity diagram, obtain the communication path from the request node to the target node based on the minimum spanning tree, and select appropriate resources from each network node in the communication path to allocate to the task request.

6. The centralized wireless communication resource dynamic allocation device according to claim 5, characterized in that: The request node insertion module is further used for: When a communication request node encounters a resource conflict, the priority of the node is increased and the node is reinserted into the communication task request queue to wait for the next round of communication task request queue traversal and resource allocation.

7. The centralized wireless communication resource dynamic allocation device according to claim 5, characterized in that: The task request queue creation module is also used to: Taking the communication task request queue as the buffer, assuming the maximum load of the actual communication network is , based on historical experience, the average resource expenditure of a single task request , determine the maximum length of the communication task request queue for: ; Among them, when the length of the communication task request queue decreases and approaches 0, the actual communication demand of the network is small, and the producer process blocks the buffer and waits for the arrival of new communication tasks; when the communication task request queue increases and approaches , then the actual network communication business is busy, and the consumer process blocks the buffer, waiting for the current communication task to end and release resources.

8. The centralized wireless communication resource dynamic allocation device according to claim 5, characterized in that: The communication path generation module is further configured to: The communication cost between two communication nodes is defined as: ;in, Represents a communication node Communication nodes The maximum value of the available communication resources between Indicates the The communication bandwidth of each resource; The communication cost is used to assign weights to the network topology connectivity graph, and the Kruskal algorithm is used to generate a minimum spanning tree of the connectivity graph. A path connecting the communication start and end addresses is found on the minimum spanning tree, and a greedy algorithm is used at each node of the path to allocate communication resources for the current task request.

9. An electronic device, characterized in that: include: A memory and one or more processors connected to the memory, the memory storing a computer program, the processor being configured to execute the computer program to implement the steps of the centralized wireless communication resource dynamic allocation method according to any one of claims 1 to 4.

10. A computer-readable storage medium, characterized in that The computer-readable storage medium stores computer-executable instructions, and the computer-executable instructions are used to execute the steps of the centralized wireless communication resource dynamic allocation method according to any one of claims 1 to 4.

Images