Centralized wireless communication resource dynamic allocation method and application

Abstract

The invention discloses a centralized wireless communication resource dynamic allocation method. The method comprises the following steps: creating a topological structure chart which stores complete information of a current network topological structure by a connected graph data structure; creating a communication task request queue according to the communication requirement of each communication node of the communication network; creating a request node according to the communication request and inserting the request node into a communication task request queue by taking the priority as a judgment standard; and the request nodes are sequentially taken out, a minimum spanning tree is created by taking the topological structure diagram as a connected diagram, communication paths from the request nodes to the target node are acquired on the basis of the minimum spanning tree, and proper resources are selected and allocated to the task request. The utilization rate of network resources can be improved while the requirements of communication tasks can be met.

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] Wireless communication resource dynamic allocation technology mainly includes the selection of wireless bearers and the management of scheduling resources. Wireless bearers mainly consider the QoS requirements of wireless bearers, such as channel quality information, cache status, interference conditions, etc.; dynamic resource allocation needs to consider information such as the restrictions on available resource blocks and resource sets related to inter-cell interference coordination. The purpose is to improve the utilization of system resources, expand the capacity of the communication system, improve system reliability, ensure communication performance, etc. Therefore, the various technologies for dynamic allocation of wireless communication resources are to maximize the utilization of wireless communication resources and achieve the unity of reliability and effectiveness when meeting the different needs of various services.

[0003] However, 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, it is difficult for the management center to balance the needs of communication tasks and improve 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 view of 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 rate of network resources while meeting the needs of communication tasks.

[0005] To achieve the above-mentioned purpose, according to the 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 structure in a connectivity diagram data structure, wherein the complete information includes the on-off status, communication means and resource quantity between any two communication nodes; creating a communication task request queue according to the communication requirements of each communication node of the wireless communication network, assigning an initial priority to each of the communication task requests, 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 the priority as the judgment standard; traversing from the starting position of the communication task request queue, taking out the request nodes in turn 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.

[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 the average resource expenditure S of a single task request in historical experience, 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 step of sequentially taking out the request 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, and B k Represents the communication bandwidth of the kth resource; uses the communication cost to weight 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 a greedy algorithm at each node of the path to allocate communication resources for the current task request.

[0009] According to the second aspect of the present invention, there is also provided a centralized wireless communication resource dynamic allocation device, which includes: a topology diagram creation module, which is used to create 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 on-off status, communication means and resource quantity between any two communication nodes; a task request queue creation module, which is used to create a communication task request queue according to the communication requirements of each communication node in the wireless communication network, and assign an initial priority to each of the communication task requests, regularly 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, which 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; a communication path generation module, which 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 with 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.

[0010] In one embodiment of the present invention, the request node insertion module is also 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 used to: take 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 used 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, and B kRepresents the communication bandwidth of the kth resource; uses the communication cost to weight 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 a 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 producer-consumer-based dynamic allocation model, 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 in which multiple communication means are available, multiple communication resources are optional, and multiple communication tasks are in parallel, centralized resource allocation decisions are executed in a management center. Under the premise of taking into account the priority of communication tasks, the needs of communication tasks can be met to the maximum extent, the complexity of the dynamic resource allocation problem is greatly reduced, and the utilization rate of network resources and the adaptability of the system in a complex and dynamically changing environment are improved. BRIEF DESCRIPTION OF THE DRAWINGS

[0017] In order to more clearly illustrate the technical solutions in the embodiments of the present application, the drawings required for use in the embodiments will be briefly introduced below. 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 paying 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 topological structure connectivity and data structure of a wireless communication network 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 diagram of the structure of a centralized wireless communication resource dynamic allocation device provided in an embodiment of the present application;

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

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

[0024] In order to make the purpose, technical solutions and advantages of the present invention more clearly understood, the present invention is further described in detail below in conjunction with the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are only used to explain 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 can be combined with each other as long as they do not conflict with each other.

[0025] The terms "first", "second", "third", etc. in the specification and claims of this application and the above-mentioned drawings are used to distinguish different objects, rather than to describe a specific order. In addition, the terms "including" and "having" and any variations thereof are intended to cover non-exclusive inclusions. For example, a process, method, system, product or device that includes a series of steps or units is not limited to the listed steps or units, but optionally includes steps or units that are not listed, or optionally includes other steps or units inherent to these processes, methods, products or devices.

[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 connected graph data structure, and the complete information includes the on-off status, communication means and resource quantity between any two communication nodes; step S2, creating a communication task request queue according to the communication needs of each communication node in the wireless communication network, and assigning an initial priority to each of the communication task requests, 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 according to the received communication request and inserting it into the communication task request queue based on the priority as the judgment standard; step S4, traversing from the starting position of the communication task request queue, taking out the request nodes in turn and creating a minimum spanning tree with the topology diagram as the connected 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.

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

[0028] exist Figure 2 In the , the connection graph node table records the communication status between the current physical node and the adjacent physical nodes, and the communication resource table records all the 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 communication resources of the node by category, and the communication resources include but are not limited to shortwave communication, ultra-shortwave communication, satellite communication and data link communication. All communication resources are listed by category, and the detailed information of the communication resources is recorded, including the frequency, bandwidth, usage status and task number of the occupant.

[0029] In step S2, combining Figure 3 As shown, the wireless communication task request queue is created based on the producer-consumer model. The wireless communication task request queue is used to record the resource request and allocation response process of wireless network communication. Each resource request is abstracted into a node of a communication task request data structure. The wireless communication task request queue is composed 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 that 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, the communication resources are tight, and the consumer process blocks the buffer, waiting for the current communication task to end and release the 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 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 the minimum spanning tree, and selecting the optimal resource 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 the consumer process takes a node from the communication task request queue, the current network topology is used as the connectivity graph, and the communication cost is used as the weight of the edge of the connectivity graph. Based on this, the minimum spanning tree of the connectivity graph is generated using the Kruskal algorithm. Specifically, for example, the communication cost between two communication nodes is defined as the reciprocal of the sum of the bandwidths of the available communication resources between the two communication nodes. For the convenience of calculation, this reciprocal is multiplied by a larger integer, such as 1000, and the communication cost between communication node i and communication node j can be recorded as:

[0036]

[0037] Where K represents the maximum value of the available communication resources between communication node i and communication node j, and 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, 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 where multiple communication means are available, multiple communication resources are optional, and multiple communication tasks are 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] Among them, the topology diagram creation module 201 is used to create a topology diagram of the wireless communication network, and the topology diagram stores the complete information of the current network topology structure in a connected graph data structure, and the complete information includes the on-off status, communication means and resource quantity between any two communication nodes. The task request queue creation module 202 is used to create a communication task request queue according to the communication needs of each communication node in the wireless communication network, and assign an initial priority to each communication task request, regularly 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. The request node insertion module 203 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 204 is used to traverse from the starting position of the communication task request queue, take out the request node in turn, and create a minimum spanning tree with the topology diagram as the connected graph, 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.

[0042] Further, the request node insertion module 203 is further used to: take 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: 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 used 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, and B k Represents the communication bandwidth of the kth resource; uses the communication cost to weight 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 a 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 device 20 disclosed in the second embodiment of the present invention is as described in the first embodiment, so it will not be described in detail here. Optionally, each module in the second embodiment and the above-mentioned other operations or functions 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, and for the sake of brevity, they are not repeated here.

[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 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, and the program 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 the present application is not limited by the described order of actions, because according to the present 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 the present application.

[0048] In the above embodiments, the description of each embodiment has its own emphasis. 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 the present application, it should be understood that the disclosed devices can be implemented in other ways. For example, the device embodiments described above are only schematic, such as the division of the units, which is only a logical function division. There may be other division methods in actual implementation, 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 interfaces, and the indirect coupling or communication connection of devices or units can be electrical or other forms.

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

[0051] In addition, each functional unit in each embodiment of the present application may be integrated into one processing unit, or each unit may exist physically separately, or two or more units may be integrated into one unit. The above-mentioned integrated unit may be implemented in the form of hardware or in the form of 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 to enable a computer device (which can be a personal computer, server or network device, etc.) to perform all or part of the steps of the method described in each embodiment of the present application. The aforementioned memory includes: U disk, read-only memory (ROM), random access memory (RAM), mobile hard disk, disk or optical disk and other media that can store program code.

[0053] A person skilled in the art may understand that all or part of the steps in the various methods of the above embodiments may be completed by entering a program to instruct the relevant hardware. The program may be stored in a computer-readable memory, and the memory 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 the scope of the present disclosure cannot be limited thereto. 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 here, those skilled in the art will easily think of the implementation scheme of the present disclosure. This application is intended to cover any modification, 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 technical field not recorded in the present disclosure. The description and examples are 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 may be arbitrarily combined. 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 only 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 protection scope of the present invention.

Claims

1. A centralized wireless communication resource dynamic allocation method, characterized in that: include: 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 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 the priority as the judgment standard; 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 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, characterized in that: 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.

3. The centralized wireless communication resource dynamic allocation method according to claim 1, characterized in that: Taking the wireless communication task request queue as a buffer, assuming that the maximum load of the actual communication network is P, and based on the average resource expenditure S of a single task request in historical experience, 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.

4. The centralized wireless communication resource dynamic allocation method according to claim 1, characterized in that: The method of sequentially taking out the request nodes and creating a minimum spanning tree using the topology diagram as a connected diagram includes: The communication cost between two communication nodes is defined as: Where K represents the maximum value of the available communication resources between communication node i and communication node j, and B k represents the communication bandwidth of the kth 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, 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; A task request queue creation module is used 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, regularly 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, 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 with 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 also used for: 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.

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 for: Taking the wireless communication task request queue as a buffer, assuming that the maximum load of the actual communication network is P, and based on the average resource expenditure S of a single task request in historical experience, 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.

8. The centralized wireless communication resource dynamic allocation device according to claim 5, characterized in that: The communication path generation module is also used for: The communication cost between two communication nodes is defined as: Where K represents the maximum value of the available communication resources between communication node i and communication node j, and B k represents the communication bandwidth of the kth 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, and the processor being configured to execute the computer program to implement the steps of the centralized wireless communication resource dynamic allocation method as claimed in 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 as claimed in any one of claims 1 to 4.

Images