A dynamic resource scheduling method, device and equipment of a wireless communication network and a storage medium

Abstract

The application discloses a dynamic resource scheduling method and device of a wireless communication network, equipment and a storage medium, relates to the technical field of wireless communication, and comprises the following steps: constructing a basic time-frequency resource scheduling unit based on the number of frequency channels and the number of time slots of the wireless communication network; distributing each target time-frequency scheduling unit to the basic time-frequency resource scheduling unit according to the number of unit demands determined based on the number of nodes and the service sending frequency of the nodes to obtain a distribution result; determining the number of target time-frequency scheduling units occupied by the current basic time-frequency resource scheduling unit based on the resource demand degree of the nodes determined based on the distribution result, setting the node with the largest resource demand degree in each neighbor resource demand degree as a new current node, and jumping back to the step of determining the resource demand degree; and determining a time-frequency scheduling distribution strategy based on preset network operation indexes and network scene demands, so as to adjust the number of target time-frequency scheduling units occupied by each node and improve the efficiency of dynamic resource scheduling.

Description

Technical Field

[0001] This invention relates to the field of wireless communication technology, and in particular to a method, apparatus, device, and storage medium for dynamic resource scheduling in wireless communication networks. Background Technology

[0002] Currently, with the advancement of 5G / 6G technologies, wireless communication networks need to support massive heterogeneous services, such as high-reliability low-latency communication (URLLC) for autonomous driving, high-deterministic transmission for the Industrial Internet of Things, and ubiquitous connectivity for smart homes. These services have significantly different QoS (Quality of Service) requirements in terms of bandwidth, latency, reliability, and energy efficiency, and the service load fluctuates dynamically with time and space (such as the load difference between densely populated and sparsely populated areas in vehicle-to-everything (V2X) networks, and data surges caused by sudden events in sensor networks). Traditional static resource allocation (such as fixed spectrum allocation and preset time slot allocation) cannot adapt to this dynamism, easily leading to resource waste or congestion.

[0003] The dynamism of wireless communication networks manifests in three aspects: 1) Topology dynamism: Node movement (e.g., high-speed vehicle movement in vehicular networks) and node joining / leaving (e.g., sensor node failure) lead to frequent changes in network topology; 2) Link dynamism: Wireless channels are affected by shadowing fading, multipath interference, and co-channel interference, causing real-time fluctuations in link quality (throughput, latency); 3) Service dynamism: Different services (e.g., video streams, control commands, monitoring data) exhibit significant differences in traffic characteristics (burst / stable, latency-sensitive / tolerant), and their load changes dynamically over time (e.g., a surge in video transmission demand during peak hours). These dynamisms cause the resource supply and demand relationship to change constantly, rendering static allocation strategies ineffective due to their inability to respond in real time. Therefore, a dynamic resource allocation mechanism is urgently needed to achieve "on-demand scheduling" of resources.

[0004] However, in wireless communication networks, the contradiction between resource scarcity and multi-objective optimization is the core challenge of dynamic on-demand resource scheduling. The essence of this contradiction is that limited resources (spectrum, energy, time, etc.) cannot simultaneously satisfy multiple mutually coupled or even conflicting optimization objectives in the network (such as throughput, latency, fairness, energy efficiency, etc.), and the dynamic nature of the network (topology, links, service changes) further amplifies the complexity of this contradiction. Existing dynamic resource allocation methods mainly employ the following five categories to address this problem: Methods based on optimization theory, where centralized optimization can achieve global optimum and good multi-objective coordination, but it has high overhead and is unsuitable for large-scale or highly dynamic networks; distributed optimization is robust and suitable for large-scale networks, but it is prone to getting trapped in local optima and relies on information interaction between nodes; Methods based on game theory, non-cooperative game theory is fully distributed and simple to implement, but its global performance and fairness are poor; cooperative game theory can improve global performance and fairness, but it has high communication overhead and weak alliance stability; Methods based on machine learning and reinforcement learning, especially reinforcement learning, can adapt to dynamic scenarios and balance multiple objectives, but it suffers from high training difficulty and poor generalization ability; Cross-layer optimization methods have a global perspective and outperform single-layer optimization, but their design is complex and their compatibility is poor; Heuristic and metaheuristic algorithms can handle high-dimensional, strongly constrained problems and are flexible in engineering implementation, but they are prone to getting trapped in local optima and have poor real-time performance. These methods each have their own focus and are currently developing towards integration, lightweighting, and intelligence.

[0005] As can be seen from the above, how to improve the efficiency of dynamic resource scheduling in wireless communication networks is an urgent problem to be solved. Summary of the Invention

[0006] In view of this, the purpose of this invention is to provide a method, apparatus, device, and storage medium for dynamic resource scheduling in wireless communication networks, which can improve the efficiency of dynamic resource scheduling in wireless communication networks. The specific solution is as follows:

[0007] In a first aspect, this application provides a dynamic resource scheduling method for wireless communication networks, comprising:

[0008] A matrix-form basic time-frequency resource scheduling unit is constructed based on the number of frequency channels and time slots in the wireless communication network. The number of units required is determined based on the number of nodes in the wireless communication network and the service transmission frequency corresponding to each node. Then, according to the principle of maximizing distribution and based on the number of units required, each target time-frequency scheduling unit is allocated to each of the basic time-frequency resource scheduling units to obtain the allocation result. The target time-frequency scheduling unit is a pre-configured minimum time-frequency scheduling unit.

[0009] Based on the allocation result, the current resource demand of the current node and the neighbor resource demand of the neighbor nodes are determined. Then, a preset relay resource scheduling algorithm is used to determine the number of target time-frequency scheduling units occupied by the corresponding current basic time-frequency resource scheduling unit based on the current resource demand and the neighbor resource demand. The neighbor node with the largest resource demand value among the neighbor resource demand values ​​is set as the new current node. Then, the process jumps back to the step of determining the current resource demand of the current node and the neighbor resource demand of the neighbor nodes based on the allocation result until all target time-frequency scheduling units are allocated.

[0010] Based on preset network operation indicators and network scenario requirements, a time-frequency scheduling allocation strategy is determined, and the target time-frequency scheduling unit number occupied by each node in the wireless communication network is adjusted using the time-frequency scheduling allocation strategy and preset adjustment coefficients.

[0011] Optionally, the basic time-frequency resource scheduling unit, which constructs a matrix based on the number of frequency channels and time slots in the wireless communication network, includes:

[0012] The number of frequency channels corresponding to the frequency channels in the wireless communication network is counted, the channel bandwidth corresponding to each frequency channel is determined, and then the number of time slots corresponding to each frequency channel is determined.

[0013] Based on the number of frequency channels, the number of time slots, and each of the frequency channels, a matrix-form basic time-frequency resource scheduling unit is constructed to obtain a two-dimensional matrix-form basic time-frequency resource scheduling unit.

[0014] In this unit, the columns represent frequency channels, which are used to characterize the number of frequency channels that the wireless communication network supports for transmission and reception; the rows represent time slots, which are used to characterize the number of time slots that the frequency channels in the wireless communication network support for data transmission; and each matrix element in the basic time-frequency resource scheduling unit corresponds to a target time-frequency scheduling unit.

[0015] Optionally, the step of determining the required number of units based on the number of nodes in the wireless communication network and the service transmission frequency corresponding to each node, and then allocating each target time-frequency scheduling unit to each of the basic time-frequency resource scheduling units according to the principle of maximizing distribution and based on the required number of units, to obtain the allocation result, includes:

[0016] The number of nodes and the broadcast period of the wireless communication network are configured using configuration rules to obtain the number of nodes and the broadcast period corresponding to the wireless communication network. The service transmission frequency corresponding to each node is determined based on the broadcast period. The services corresponding to the service transmission frequency include broadcast services, MAC layer control frame broadcast services, and routing broadcast frame control services.

[0017] Determine the time slot occupancy time corresponding to each time slot, and count the total number of units in each target time-frequency scheduling unit in the basic time-frequency resource scheduling unit, so as to determine the number of units required for the current node based on the service transmission frequency, the time slot occupancy time and the total number of units;

[0018] Based on the preset time delay jitter control requirements, the principle of maximizing dispersion is determined, and the coordinate set corresponding to the number of target time-frequency scheduling units required by the unit is determined using preset coordinate constraints; the coordinate set includes the Euclidean distance between any two target time-frequency scheduling units and the distance set, distance mean and distance variance determined based on each Euclidean distance;

[0019] By utilizing the principle of maximizing dispersion and based on the number of units required and the coordinate set, each target time-frequency scheduling unit is allocated to the corresponding basic time-frequency resource scheduling unit of the current node, and the corresponding allocation result is obtained.

[0020] Optionally, the step of determining the current resource demand of the current node and the neighbor resource demand of neighboring nodes based on the allocation result, and then using a preset relay resource scheduling algorithm and based on the current resource demand and the neighbor resource demand to determine the target number of time-frequency scheduling units occupied by the corresponding current basic time-frequency resource scheduling unit, includes:

[0021] Priorities are determined based on business requirements, and the historical data transmission volume, historical data reception volume, and buffer pool queue length of the current node are determined. The current resource demand is then determined based on the number of units required for the current node, the priority, the allocation result, the historical data transmission volume, the historical data reception volume, and the buffer pool queue length. The current node is the node currently receiving communication control frames in the wireless communication network.

[0022] The neighbor nodes of the current node are determined by using a preset neighbor node selection rule, so as to determine the neighbor resource demand degree corresponding to each neighbor node. The current node is set as the current relay initiator, so as to call the current relay initiator to use a preset relay resource scheduling algorithm, and determine the number of current target time-frequency scheduling units occupied by the corresponding current basic time-frequency resource scheduling unit based on the current resource demand degree and the neighbor resource demand degree.

[0023] Optionally, the step of setting the neighbor node corresponding to the largest resource demand among all the neighbor resource demand degrees as the new current node, and then jumping back to the step of determining the current resource demand degree of the current node and the neighbor resource demand degree of the neighbor nodes based on the allocation result, until all target time-frequency scheduling units are allocated, includes:

[0024] The remaining target time-frequency scheduling unit number is determined based on the total number of units and the current target time-frequency scheduling unit number, and the neighbor node to be processed is determined based on the target time-frequency scheduling unit number, corresponding to the resource demand degree with the largest value among the neighbor resource demand degrees.

[0025] The current relay initiator sends service frames in the wireless communication network using the target time-frequency scheduling units occupied by the current basic time-frequency resource scheduling unit; the service frame includes the target time-frequency scheduling unit occupied by the current basic time-frequency resource scheduling unit and the node number corresponding to the neighbor node to be processed.

[0026] Set the neighbor node to be processed corresponding to the node number as the new current relay initiator, and jump back to the step of determining the current resource requirement of the current node and the neighbor resource requirement of the neighbor node based on the allocation result, until all target time-frequency scheduling units are allocated.

[0027] Optionally, the step of determining a time-frequency scheduling allocation strategy based on preset network operation indicators and network scenario requirements, and adjusting the target number of time-frequency scheduling units occupied by each node in the wireless communication network using the time-frequency scheduling allocation strategy and preset adjustment coefficients, includes:

[0028] The initial time-frequency scheduling allocation strategy is adjusted based on preset network operation indicators to obtain the target time-frequency scheduling allocation strategy, and the network scenario requirements corresponding to the wireless communication network are determined.

[0029] If the network scenario requirement meets the preset fairness condition, then the network scenario requirement is set as a fairness requirement, and the first adjustment coefficient corresponding to the fairness requirement is increased using the target time-frequency scheduling allocation strategy, so as to adjust the number of target time-frequency scheduling units occupied by each node in the wireless communication network based on the first adjustment coefficient; wherein, the preset fairness condition is that the average waiting delay corresponding to each node in the wireless communication network is equal.

[0030] Optionally, the step of determining a time-frequency scheduling allocation strategy based on preset network operation indicators and network scenario requirements, and adjusting the target number of time-frequency scheduling units occupied by each node in the wireless communication network using the time-frequency scheduling allocation strategy and preset adjustment coefficients, includes:

[0031] The initial time-frequency scheduling allocation strategy is adjusted based on preset network operation indicators to obtain the target time-frequency scheduling allocation strategy, and the network scenario requirements corresponding to the wireless communication network are determined.

[0032] If the network scenario requirement meets the preset efficiency condition, then the network scenario requirement is set as an efficiency requirement, and the second adjustment coefficient corresponding to the efficiency requirement is increased using the target time-frequency scheduling allocation strategy. The number of target time-frequency scheduling units occupied by each node in the wireless communication network is adjusted based on the second adjustment coefficient, the number of target time-frequency scheduling units occupied, and the resource requirement. The preset efficiency condition is that the utilization rate of the basic time-frequency resource scheduling units of the wireless communication network is greater than the preset resource utilization rate threshold.

[0033] Secondly, this application provides a dynamic resource scheduling device for a wireless communication network, comprising:

[0034] The allocation result determination module is used to construct a matrix-form basic time-frequency resource scheduling unit based on the number of frequency channels and time slots of the wireless communication network, determine the number of units required based on the number of nodes in the wireless communication network and the service transmission frequency corresponding to each node, and then allocate each target time-frequency scheduling unit to each of the basic time-frequency resource scheduling units according to the principle of maximizing distribution and based on the number of units required, to obtain the allocation result;

[0035] The resource demand determination module is used to determine the current resource demand of the current node and the neighbor resource demand of neighboring nodes based on the allocation result. Then, it uses a preset relay resource scheduling algorithm and determines the number of target time-frequency scheduling units occupied by the corresponding current basic time-frequency resource scheduling unit based on the current resource demand and the neighbor resource demand. The neighboring node with the largest resource demand value among the neighboring resource demand values ​​is set as the new current node. Then, it jumps back to the step of determining the current resource demand of the current node and the neighbor resource demand of neighboring nodes based on the allocation result until all target time-frequency scheduling units are allocated.

[0036] The time-frequency scheduling unit number determination module is used to determine the time-frequency scheduling allocation strategy based on preset network operation indicators and network scenario requirements, so as to adjust the target time-frequency scheduling unit number occupied by each node in the wireless communication network using the time-frequency scheduling allocation strategy and preset adjustment coefficient.

[0037] Thirdly, this application provides an electronic device, comprising:

[0038] Memory, used to store computer programs;

[0039] A processor is used to execute the computer program to implement the aforementioned dynamic resource scheduling method for wireless communication networks.

[0040] Fourthly, this application provides a computer-readable storage medium for storing a computer program, wherein the computer program, when executed by a processor, implements the aforementioned dynamic resource scheduling method for a wireless communication network.

[0041] As can be seen from the above, before performing dynamic resource scheduling in the wireless communication network, this application needs to construct a matrix of basic time-frequency resource scheduling units based on the number of frequency channels and time slots in the wireless communication network. The number of units required is determined based on the number of nodes in the wireless communication network and the service transmission frequency corresponding to each node. Then, according to the principle of maximizing distribution and based on the number of units required, each target time-frequency scheduling unit is allocated to each basic time-frequency resource scheduling unit to obtain the allocation result. Based on the allocation result, the current resource requirement of the current node and the neighbor resource requirement of neighboring nodes are determined. Then, using a preset relay resource scheduling algorithm and based on the current resource requirement and neighbor resource requirement, the number of target time-frequency scheduling units occupied by the corresponding current basic time-frequency resource scheduling unit is determined. The neighboring node with the largest resource requirement among all neighboring nodes is set as the new current node. Then, the process jumps back to the step of determining the current resource requirement of the current node and the neighbor resource requirement of neighboring nodes based on the allocation result until all target time-frequency scheduling units are allocated. Based on preset network operation indicators and network scenario requirements, a time-frequency scheduling allocation strategy is determined to adjust the number of target time-frequency scheduling units occupied by each node in the wireless communication network using the time-frequency scheduling allocation strategy and preset adjustment coefficients.

[0042] Therefore, this application first needs to construct a matrix of basic time-frequency resource scheduling units based on the number of frequency channels and time slots in the wireless communication network. The number of units required is determined based on the number of nodes in the wireless communication network and the service transmission frequency corresponding to each node. Then, according to the principle of maximizing distribution and based on the number of units required, each target time-frequency scheduling unit is allocated to each basic time-frequency resource scheduling unit to obtain the allocation result. Secondly, based on the allocation result, the current resource requirement of the current node and the neighbor resource requirement of neighboring nodes are determined. Then, using a preset relay resource scheduling algorithm and based on the current resource requirement and neighbor resource requirement, the number of target time-frequency scheduling units occupied by the corresponding current basic time-frequency resource scheduling unit is determined. The neighboring node with the largest resource requirement among all neighboring nodes is set as the new current node. Then, the process jumps back to the step of determining the current resource requirement of the current node and the neighbor resource requirement of neighboring nodes based on the allocation result until all target time-frequency scheduling units are allocated. Finally, a time-frequency scheduling allocation strategy is determined based on preset network operation indicators and network scenario requirements, so as to adjust the number of target time-frequency scheduling units occupied by each node in the wireless communication network using the time-frequency scheduling allocation strategy and preset adjustment coefficients. This improves the efficiency of dynamic resource scheduling in wireless communication networks, thereby enhancing the user experience. Attached Figure Description

[0043] To more clearly illustrate the technical solutions in the embodiments of the present invention or the prior art, the drawings used in the description of the embodiments or the prior art will be briefly introduced below. Obviously, the drawings described below are only embodiments of the present invention. For those skilled in the art, other drawings can be obtained based on the provided drawings without creative effort.

[0044] Figure 1 This is a flowchart of a dynamic resource scheduling method for a wireless communication network disclosed in this application;

[0045] Figure 2 This is a schematic diagram of dynamic resource scheduling in a wireless communication network as disclosed in this application;

[0046] Figure 3 This is a schematic diagram of the structure of a basic time-frequency resource scheduling unit and a pre-allocated minimum time-frequency scheduling unit disclosed in this application;

[0047] Figure 4 This is a schematic diagram of the overall framework of a distributed dynamic resource scheduling algorithm disclosed in this application;

[0048] Figure 5 This is a schematic diagram of a distributed dynamic relay scheduling algorithm for user services disclosed in this application;

[0049] Figure 6 This is a simulation diagram of the average waiting latency using a distributed dynamic resource scheduling algorithm based on fairness, as disclosed in this application.

[0050] Figure 7 This is a simulation diagram of time-frequency resource utilization based on a distributed dynamic resource scheduling algorithm and high efficiency disclosed in this application;

[0051] Figure 8 This is a schematic diagram of the structure of a dynamic resource scheduling device for a wireless communication network disclosed in this application;

[0052] Figure 9 This is a structural diagram of an electronic device disclosed in this application. Detailed Implementation

[0053] The technical solutions of the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of the present invention, and not all embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of the present invention.

[0054] Currently, with the advancement of 5G / 6G technologies, wireless communication networks need to support massive heterogeneous services, such as low-latency and high-reliability communication for autonomous driving, high-deterministic transmission for the Industrial Internet of Things, and ubiquitous connectivity for smart homes. However, traditional static resource allocation cannot adapt to the aforementioned dynamic nature, easily leading to resource waste or congestion. Therefore, this application provides a dynamic resource scheduling method for wireless communication networks, which can improve the efficiency of dynamic resource scheduling in wireless communication networks.

[0055] See Figure 1 As shown in the figure, an embodiment of the present invention discloses a dynamic resource scheduling method for a wireless communication network, including:

[0056] Step S11: Construct a matrix-form basic time-frequency resource scheduling unit based on the number of frequency channels and time slots in the wireless communication network. Determine the number of units required based on the number of nodes in the wireless communication network and the service transmission frequency corresponding to each node. Then, according to the principle of maximizing distribution and based on the number of units required, allocate each target time-frequency scheduling unit to each of the basic time-frequency resource scheduling units to obtain the allocation result.

[0057] In this embodiment, the technical problem to be solved is to address the challenge of balancing "efficiency, fairness, and robustness" in dynamic, distributed scenarios with limited resources in wireless communication networks. Since it is difficult to find the global optimal solution for multi-objective optimization in real time in a resource-scarce dynamic networking environment, this embodiment can construct a flexible and robust basic time-frequency resource scheduling unit based on the actual network scenario. Specifically, it first avoids signaling loss due to channel contention in distributed scheduling by controlling service pre-allocation, ensuring robustness. Then, it improves the utilization rate of time-frequency resources in a dynamic wireless communication environment through dynamic relay allocation of data services. Furthermore, to avoid falling into local optima, it adjusts algorithm coefficients in real time to meet the requirements and preferences for "efficiency, fairness, and robustness" in the actual scenario.

[0058] In this embodiment, a schematic diagram of dynamic resource scheduling in a wireless communication network is shown below. Figure 2 The implementation includes four steps: First, constructing a basic time-frequency resource scheduling unit; second, using a pre-allocation algorithm to allocate control service resources; third, real-time sensing and using a distributed "dynamic relay" algorithm to schedule user service resources; and fourth, dynamically adjusting the balance between network fairness and efficiency. Specifically, this embodiment first constructs a flexible and configurable basic time-frequency resource scheduling unit based on the number of available frequency channels and the number of divisible time slots; second, based on the periodic control service characteristics of wireless networks, it ensures the stability of distributed network decision-making by pre-allocating control service time-frequency resources; then, by real-time sensing of resource supply and demand and target priority changes, it uses a distributed "dynamic relay" method to dynamically schedule user services on demand to maximize resource utilization; finally, based on the needs of the network scenario, it adjusts the balance between network efficiency and fairness through algorithm coefficients.

[0059] In one specific implementation, if the number of frequency channels in a given wireless communication system is... Each channel occupies a bandwidth of Each channel can be divided into Each time slot, therefore the node The One basic time-frequency resource scheduling unit It can be represented as:

[0060] ;

[0061] in, A matrix whose elements are either 0 or 1, and whose size is... .matrix The columns represent frequency channels, indicating the maximum supported frequency channel by the system. Each channel transmits and receives data; the rows represent time slots, indicating which channels currently support... Data is transmitted in one time slot. If This is the smallest time-frequency scheduling unit; a value of 1 represents the [number]th [unit]. Each time-frequency resource basic scheduling unit, channel time slots The node occupy. along with It makes dynamic adjustments to adapt to the dynamic changes of the entire network.

[0062] Specifically, constructing a matrix-form basic time-frequency resource scheduling unit based on the number of frequency channels and time slots in a wireless communication network can include: counting the number of frequency channels corresponding to the frequency channels in the wireless communication network, determining the channel bandwidth corresponding to each frequency channel, and then determining the number of time slots corresponding to each frequency channel; constructing a matrix-form basic time-frequency resource scheduling unit based on the number of frequency channels, the number of time slots, and each frequency channel, resulting in a two-dimensional matrix-form basic time-frequency resource scheduling unit; wherein, the columns in the basic time-frequency resource scheduling unit represent frequency channels, used to characterize the number of frequency channels supported for transmission and reception in the wireless communication network; the rows in the basic time-frequency resource scheduling unit represent time slots, used to characterize the number of time slots supported for data transmission in the wireless communication network; each matrix element in the basic time-frequency resource scheduling unit corresponds to a target time-frequency scheduling unit.

[0063] Furthermore, this application embodiment employs a pre-allocation algorithm to control the allocation of service resources, thereby ensuring the robustness of the distributed algorithm. Specifically, the pre-allocation method allows for on-demand allocation through any designated node in the network. In the initial stage, the designated node can allocate resources based on the number of nodes in the network. The minimum time-frequency scheduling unit is allocated based on the periodic control service transmission frequency of each node, where the number of nodes... and broadcast cycle The value can be pre-configured through the network, or a specified node can obtain it from the network entry information of other nodes.

[0064] Among them, nodes Control frequency of demand-driven service transmission Represents a node The number of times it needs to be sent per unit time is The control services include broadcast services, MAC (Media Access Control Address) layer broadcast control frames, and routed broadcast frames. Furthermore, the minimum number of hourly frequency scheduling units for each basic time-frequency resource scheduling unit is... The time occupied by each time slot is Therefore, each basic time-frequency resource scheduling unit needs to provide nodes with... Pre-allocated minimum hourly frequency scheduling unit number for:

[0065] ;

[0066] in, This is the floor symbol.

[0067] It is worth mentioning that, in order to reduce latency jitter in control services, the embodiments of this application will... The pre-allocated minimum time-frequency scheduling units are distributed in a dispersed manner within the basic time-frequency resource scheduling units, and the structural diagrams of the basic time-frequency resource scheduling units and the pre-allocated minimum time-frequency scheduling units are shown in the figure below. Figure 3 As shown: The basic time-frequency resource scheduling unit is composed of the following components in a given wireless communication system: Each frequency channel and each channel It consists of time slots, thus forming The smallest time-frequency resource scheduling unit. In the initial phase, the cluster head node determines the number of nodes in the network based on the number of nodes. The minimum time-frequency scheduling unit is allocated based on the periodic control service transmission frequency of each node, and the number of allocated units is determined by the control service period and the size of the minimum time-frequency resource scheduling unit. Furthermore, to reduce latency jitter in the control service, the pre-allocated minimum time-frequency scheduling units in this embodiment are distributed as dispersedly as possible within the basic time-frequency resource scheduling units. for The set of coordinates of a pre-allocated minimum hourly frequency scheduling unit, namely:

[0068] ;

[0069] ;

[0070] in, Euclidean distance between any two coordinates in the equation for:

[0071] ;

[0072] The set of distances between any two coordinates in the set is :

[0073] ;

[0074] Distance set mean for:

[0075] ;

[0076] Distance variance :

[0077] ;

[0078] also, The coordinate set of a pre-allocated minimum hourly frequency scheduling unit The following conditions must be met:

[0079] ;

[0080] .

[0081] Specifically, the required number of units is determined based on the number of nodes in the wireless communication network and the service transmission frequency corresponding to each node. Then, according to the principle of maximizing distribution and based on the number of unit requirements, each target time-frequency scheduling unit is allocated to each basic time-frequency resource scheduling unit to obtain the allocation result. This allocation result may include: configuring the number of nodes and the broadcast period of the wireless communication network using configuration rules to obtain the number of nodes and the broadcast period corresponding to the wireless communication network, and determining the service transmission frequency corresponding to each node based on the broadcast period; the services corresponding to the service transmission frequency include broadcast services, MAC layer control frame broadcast services, and routing broadcast frame control services; determining the time slot occupancy time corresponding to each time slot, and statistically analyzing the basic time-frequency resources. The total number of target time-frequency scheduling units in the scheduling unit is determined based on the service transmission frequency, time slot occupancy time, and total number of units, thus defining the unit requirement corresponding to the current node. A maximization distribution principle is determined based on preset delay jitter control requirements, and preset coordinate constraints are used to determine the coordinate set corresponding to the number of target time-frequency scheduling units required for the unit requirement. The coordinate set includes the Euclidean distance between any two target time-frequency scheduling units, as well as the distance set, mean distance, and variance determined based on each Euclidean distance. Using the maximization distribution principle and based on the unit requirement and coordinate set, each target time-frequency scheduling unit is allocated to the corresponding basic time-frequency resource scheduling units of the current node, resulting in the allocation result.

[0082] Step S12: Based on the allocation result, determine the current resource demand of the current node and the neighbor resource demand of the neighboring nodes. Then, using a preset relay resource scheduling algorithm, determine the number of target time-frequency scheduling units occupied by the corresponding current basic time-frequency resource scheduling unit based on the current resource demand and the neighbor resource demand. Set the neighboring node with the largest resource demand value among the neighboring resource demand values ​​as the new current node. Then, jump back to the step of determining the current resource demand of the current node and the neighbor resource demand of the neighboring nodes based on the allocation result until all target time-frequency scheduling units are allocated.

[0083] In this embodiment, during the real-time resource perception process, nodes in the wireless communication network need to periodically propagate changes in resource supply and demand and target priority to their next-hop neighbor nodes in real time. The resource supply and demand are combined with the target priority to determine the node resource demand degree. Furthermore, the resource demand needs to be uniformly quantified based on the historical data transmission and reception volume of the network nodes, the length of the buffer pool queue, and the priority of the buffered data. In other words, all nodes in the wireless communication network need to periodically obtain the resource demand of their neighboring nodes in order to achieve real-time perception.

[0084] Based on this, this application proposes a distributed dynamic relay resource scheduling algorithm with low complexity and fair resource allocation, based on the acquired real-time sensing results. The overall framework diagram of the distributed dynamic resource scheduling algorithm in the wireless communication network is shown below. Figure 4 As shown, for scenarios with dynamic changes in different networks (topology, links, services), the aforementioned distributed dynamic resource scheduling algorithm can dynamically adapt resources to different scenarios to meet the requirements of network robustness, fairness, and efficiency in different network scenarios. Specifically, nodes in the network can sense changes in resource supply and demand and target priorities of neighboring nodes in real time, integrating inherent demand information (preferences for fairness and efficiency), time-frequency resource information (number of channels, number of time slots), and service information (type, rate). Then, based on the integrated information, time-frequency resource scheduling for control services is performed through pre-allocation to ensure the fairness and robustness of control services. Next, time-frequency resource scheduling for user services is performed through a distributed dynamic relay method to ensure the fairness and efficiency of user services. Finally, the average waiting latency and time-frequency resource utilization indicators fed back from the network are fed back to the decision algorithm, thereby dynamically adjusting the balance of network robustness, fairness, and efficiency.

[0085] It is worth mentioning that the above algorithm sets the node number of each pre-allocated basic time-frequency resource scheduling unit as the relay initiator, and then the relay initiator decides in a distributed manner the minimum number of hourly frequency scheduling units occupied by the current basic time-frequency resource scheduling unit and decides the next relayer from the neighboring nodes. Specifically, based on the allocation results, the current resource demand of the current node and the neighbor resource demand of neighboring nodes are determined. Then, a preset relay resource scheduling algorithm is used to determine the target number of time-frequency scheduling units occupied by the corresponding current basic time-frequency resource scheduling unit based on the current resource demand and the neighbor resource demand. This can include: determining the priority based on service requirements, and determining the historical data transmission volume, historical data reception volume, and buffer pool queue length of the current node, so as to determine the current resource demand based on the unit demand quantity, priority, allocation results, historical data transmission volume, historical data reception volume, and buffer pool queue length of the current node; the current node is the node currently receiving communication control frames in the wireless communication network; the preset neighbor node selection rules are used to determine each neighbor node of the current node, to determine the neighbor resource demand corresponding to each neighbor node, and the current node is set as the current relay initiator, so as to call the current relay initiator to use the preset relay resource scheduling algorithm, and determine the current target number of time-frequency scheduling units occupied by the corresponding current basic time-frequency resource scheduling unit based on the current resource demand and the neighbor resource demand.

[0086] Furthermore, since the pre-allocated basic time-frequency resource scheduling unit includes all network nodes... Therefore, all nodes in the network can obtain at least one opportunity to access the channel in each basic time and frequency resource scheduling unit. While taking fairness into account, the utilization rate of time and frequency resources is further improved by using a dynamic relay method to allocate time and frequency resources to the nodes that most urgently need resources to send.

[0087] In one specific implementation, assume the node The resource requirement degree corresponding to the next-hop neighbor node is Among them, the resource demand degree corresponding to non-neighbor nodes is 0, and the minimum remaining time-frequency scheduling unit of the current basic time-frequency resource scheduling unit is Then the node The minimum number of hourly frequency scheduling units that can be used for:

[0088] ;

[0089] relay The next sender for:

[0090] ;

[0091] It is worth mentioning that, Figure 5 The following is a schematic diagram of the user service distributed dynamic relay scheduling algorithm in the distributed dynamic resource scheduling algorithm of the wireless communication network in this application embodiment: First, in the initial stage, this application embodiment can send and receive control frames according to the pre-allocated basic time-frequency resource scheduling units and obtain the resource demand degree of neighboring nodes; then, this application embodiment needs to set the node number of the currently pre-allocated basic time-frequency resource scheduling unit as the relay initiator, wherein the relay initiator is used to decide the minimum number of time-frequency scheduling units occupied this time and the next sender of the relay.

[0092] In one specific implementation, the main process of the distributed dynamic relay algorithm is as follows: In the initial stage, control frames are sent and received according to the pre-allocated basic time-frequency resource scheduling unit, and the resource demand of neighboring nodes is obtained. Then, set the node number of the currently pre-allocated basic time-frequency resource scheduling unit as the relay initiator. The relay initiator decides the minimum number of time-frequency scheduling units required for this operation. and relay The next sender Subsequently, the node Occupy The minimum number of time-frequency scheduling units is used for service transmission. The service frame carries information including the minimum number of time-frequency scheduling units the current node still needs to occupy and the relay information. The next sender Finally, the next sender Repeat the above steps until the current basic time-frequency resource scheduling unit ends.

[0093] Specifically, the process involves setting the neighbor node with the highest resource demand among all neighbor nodes as the new current node, and then returning to the step of determining the current resource demand of the current node and the neighbor node's neighbor resource demand based on the allocation results, until all target time-frequency scheduling units are allocated. This may include: determining the remaining number of target time-frequency scheduling units based on the total number of units and the current number of target time-frequency scheduling units, and determining the pending neighbor node corresponding to the highest resource demand among all neighbor nodes based on the number of target time-frequency scheduling units; calling the current relay initiator to send service frames in the wireless communication network using the number of target time-frequency scheduling units occupied by the current basic time-frequency resource scheduling unit; the service frame includes the number of target time-frequency scheduling units occupied by the current basic time-frequency resource scheduling unit and the node number corresponding to the pending neighbor node; setting the pending neighbor node corresponding to the node number as the new current relay initiator, and returning to the step of determining the current resource demand of the current node and the neighbor node's neighbor resource demand based on the allocation results, until all target time-frequency scheduling units are allocated.

[0094] Step S13: Determine the time-frequency scheduling allocation strategy based on preset network operation indicators and network scenario requirements, so as to adjust the target time-frequency scheduling unit occupied by each node in the wireless communication network using the time-frequency scheduling allocation strategy and preset adjustment coefficient.

[0095] In this embodiment, the balance between network fairness and efficiency needs to be dynamically adjusted through algorithm coefficients. Network fairness refers to the equal opportunity for each node in the network to obtain time-frequency resources, which is measured by the average latency of the service. Figure 6 The simulation diagram shows the average waiting time using a distributed dynamic resource scheduling algorithm based on fairness. The network-wide latency obtained after convergence when the coefficients are 0.2, 0.4, 0.6, and 0.8 are respectively 1.5ms, 2.6ms, 3.8ms, and 4.9ms. This demonstrates that by adjusting the coefficients... The value can be adjusted for fairness. The closer the value is to 0, the more the network tends to adapt to fair scenarios.

[0096] Specifically, determining a time-frequency scheduling allocation strategy based on preset network operation indicators and network scenario requirements, and then adjusting the target time-frequency scheduling unit number occupied by each node in the wireless communication network using the time-frequency scheduling allocation strategy and preset adjustment coefficients, can include: adjusting the initial time-frequency scheduling allocation strategy based on preset network operation indicators to obtain the target time-frequency scheduling allocation strategy, and determining the network scenario requirements corresponding to the wireless communication network; if the network scenario requirements meet preset fairness conditions, then setting the network scenario requirements as fairness requirements, and increasing the first adjustment coefficient to be processed corresponding to the fairness requirements using the target time-frequency scheduling allocation strategy, so as to adjust the target time-frequency scheduling unit number occupied by each node in the wireless communication network based on the first adjustment coefficient to be processed; wherein, the preset fairness condition is that the average waiting delay corresponding to each node in the wireless communication network is equal.

[0097] Furthermore, efficiency refers to the network's ability to maximize the use of time-frequency resources, which is measured by time-frequency resource utilization rate. Figure 7 This is a simulation diagram of the distributed dynamic resource scheduling algorithm and its efficient time-frequency resource utilization: [Diagram showing the algorithm's performance in time-frequency resource utilization] The network-wide time-frequency resource utilization rates obtained when the coefficients were 0.2, 0.4, 0.6, and 0.8 were 20%, 35%, 55%, and 70%, respectively. This demonstrates that by adjusting the coefficients... The value can be adjusted efficiently. The closer the value is to 1, the more the network is suited to high-efficiency scenarios.

[0098] Specifically, determining a time-frequency scheduling allocation strategy based on preset network operation indicators and network scenario requirements, and then adjusting the target time-frequency scheduling unit number occupied by each node in the wireless communication network using the time-frequency scheduling allocation strategy and preset adjustment coefficients, can include: adjusting the initial time-frequency scheduling allocation strategy based on preset network operation indicators to obtain the target time-frequency scheduling allocation strategy, and determining the network scenario requirements corresponding to the wireless communication network; if the network scenario requirements meet preset efficiency conditions, then setting the network scenario requirements as efficiency requirements, and increasing the second adjustment coefficient corresponding to the efficiency requirements using the target time-frequency scheduling allocation strategy, and adjusting the target time-frequency scheduling unit number occupied by each node in the wireless communication network based on the second adjustment coefficient, the number of target time-frequency scheduling units occupied, and the resource requirement; the preset efficiency condition is that the utilization rate of the basic time-frequency resource scheduling units of the wireless communication network is greater than a preset resource utilization threshold.

[0099] In this embodiment, the relay nodes in the "dynamic relay" algorithm can be adjusted. The minimum number of hourly frequency scheduling units that can be used To achieve a balance between fairness and efficiency, the more minimum hourly frequency scheduling units a relay node occupies each time, the better it is for improving the utilization rate of time-frequency resources; conversely, the fewer minimum hourly frequency scheduling units a relay node occupies each time, the more opportunities other nodes have to acquire time-frequency resources, thus improving fairness. In one specific implementation, dynamically adjusted relay nodes... The minimum number of hourly frequency scheduling units that can be used The formula for determining it is as follows:

[0100] ;

[0101] in, Adjustment coefficients for fairness and efficiency, The closer a value is to 1, the more the network is suited for high-efficiency scenarios. The closer the value is to 0, the more the network tends to adapt to fair scenarios.

[0102] As can be seen from the above, the embodiments of this application first need to construct a matrix-form basic time-frequency resource scheduling unit based on the number of frequency channels and time slots of the wireless communication network. The number of units required is determined based on the number of nodes in the wireless communication network and the service transmission frequency corresponding to each node. Then, according to the principle of maximizing distribution and based on the number of units required, each target time-frequency scheduling unit is allocated to each basic time-frequency resource scheduling unit to obtain the allocation result. Next, based on the allocation result, the current resource requirement of the current node and the neighbor resource requirement of neighboring nodes are determined. Then, using a preset relay resource scheduling algorithm and based on the current resource requirement and neighbor resource requirement, the number of target time-frequency scheduling units occupied by the corresponding current basic time-frequency resource scheduling unit is determined. The neighboring node with the largest resource requirement among all neighboring nodes is set as the new current node. Then, the process jumps back to the step of determining the current resource requirement of the current node and the neighbor resource requirement of neighboring nodes based on the allocation result until all target time-frequency scheduling units are allocated. Finally, a time-frequency scheduling allocation strategy is determined based on preset network operation indicators and network scenario requirements, so as to adjust the number of target time-frequency scheduling units occupied by each node in the wireless communication network using the time-frequency scheduling allocation strategy and preset adjustment coefficients. This improves the efficiency of dynamic resource scheduling in wireless communication networks, thereby enhancing the user experience.

[0103] Accordingly, see Figure 8 As shown, this application also provides a dynamic resource scheduling device for a wireless communication network, comprising:

[0104] The allocation result determination module 11 is used to construct a matrix-form basic time-frequency resource scheduling unit based on the number of frequency channels and time slots of the wireless communication network, determine the number of units required based on the number of nodes in the wireless communication network and the service transmission frequency corresponding to each node, and then allocate each target time-frequency scheduling unit to each of the basic time-frequency resource scheduling units according to the principle of maximizing dispersion and based on the number of units required, so as to obtain the allocation result.

[0105] The resource demand determination module 12 is used to determine the current resource demand of the current node and the neighbor resource demand of the neighbor nodes based on the allocation result. Then, it uses a preset relay resource scheduling algorithm and determines the number of target time-frequency scheduling units occupied by the corresponding current basic time-frequency resource scheduling unit based on the current resource demand and the neighbor resource demand. The neighbor node with the largest resource demand value among the neighbor resource demand values ​​is set as the new current node. Then, it jumps back to the step of determining the current resource demand of the current node and the neighbor resource demand of the neighbor nodes based on the allocation result until all target time-frequency scheduling units are allocated.

[0106] The time-frequency scheduling unit number determination module 13 is used to determine the time-frequency scheduling allocation strategy based on preset network operation indicators and network scenario requirements, so as to adjust the target time-frequency scheduling unit number occupied by each node in the wireless communication network using the time-frequency scheduling allocation strategy and preset adjustment coefficient.

[0107] In some specific embodiments, the allocation result determination module 11 may specifically include:

[0108] The channel bandwidth determination unit is used to count the number of frequency channels corresponding to the frequency channels in the wireless communication network, determine the channel bandwidth corresponding to each frequency channel, and then determine the number of time slots corresponding to each frequency channel.

[0109] A resource scheduling unit construction unit is used to construct a matrix-form basic time-frequency resource scheduling unit based on the number of frequency channels, the number of time slots, and each of the frequency channels, resulting in a two-dimensional matrix-form basic time-frequency resource scheduling unit. The columns in the basic time-frequency resource scheduling unit represent frequency channels, indicating that the wireless communication network supports the transmission and reception of the specified number of frequency channels. The rows in the basic time-frequency resource scheduling unit represent time slots, indicating that the frequency channels in the wireless communication network support the transmission of the specified number of time slots. Each matrix element in the basic time-frequency resource scheduling unit corresponds to a target time-frequency scheduling unit.

[0110] In some specific embodiments, the allocation result determination module 11 may specifically include:

[0111] The service transmission frequency determination unit is used to configure the number of nodes and the broadcast period of the wireless communication network using configuration rules, to obtain the number of nodes and the broadcast period corresponding to the wireless communication network, and to determine the service transmission frequency corresponding to each node based on the broadcast period; the services corresponding to the service transmission frequency include broadcast services, MAC layer control frame broadcast services and routing broadcast frame control services.

[0112] The unit requirement quantity determination unit is used to determine the time slot occupancy time corresponding to each of the time slots, and to count the total number of units of each target time-frequency scheduling unit in the basic time-frequency resource scheduling unit, so as to determine the unit requirement quantity corresponding to the current node based on the service transmission frequency, the time slot occupancy time and the total number of units;

[0113] The coordinate set determination unit is used to determine the maximization dispersion principle based on the preset time delay jitter control requirements, and to determine the coordinate set corresponding to the number of target time-frequency scheduling units required by the unit using preset coordinate constraints; the coordinate set includes the Euclidean distance between any two target time-frequency scheduling units and the distance set, distance mean and distance variance determined based on each Euclidean distance;

[0114] The allocation result determines the sub-unit, which is used to allocate each target time-frequency scheduling unit to the corresponding basic time-frequency resource scheduling unit of the current node based on the principle of maximizing dispersion and the number of units required and the coordinate set, thereby obtaining the corresponding allocation result.

[0115] In some specific embodiments, the resource demand determination module 12 may specifically include:

[0116] The priority determination unit is used to determine the priority based on business requirements, and to determine the historical data transmission volume, historical data reception volume, and buffer pool queue length of the current node, so as to determine the current resource demand based on the unit demand quantity corresponding to the current node, the priority, the allocation result, the historical data transmission volume, the historical data reception volume, and the buffer pool queue length; the current node is the node currently receiving communication control frames in the wireless communication network;

[0117] The time-frequency scheduling unit is used to determine each neighbor node of the current node using a preset neighbor node selection rule, to determine the neighbor resource demand degree corresponding to each neighbor node, and to set the current node as the current relay initiator, so as to call the current relay initiator to use a preset relay resource scheduling algorithm, and to determine the current target time-frequency scheduling unit occupied by the corresponding current basic time-frequency resource scheduling unit based on the current resource demand degree and the neighbor resource demand degree.

[0118] In some specific embodiments, the resource demand determination module 12 may specifically include:

[0119] The remaining time-frequency scheduling unit is used to determine the remaining target time-frequency scheduling unit number based on the total number of units and the current target time-frequency scheduling unit number, and to determine the neighbor node to be processed corresponding to the resource demand degree with the largest value among the neighbor resource demand degrees based on the target time-frequency scheduling unit number;

[0120] The service frame sending unit is used to call the current relay initiator to send service frames in the wireless communication network using the number of target time-frequency scheduling units occupied by the current basic time-frequency resource scheduling unit; the service frame includes the number of target time-frequency scheduling units occupied by the current basic time-frequency resource scheduling unit and the node number corresponding to the neighbor node to be processed.

[0121] The step jump unit is used to set the unprocessed neighbor node corresponding to the node number as the new current relay initiator, and jump back to the step of determining the current resource requirement of the current node and the neighbor resource requirement of the neighbor node based on the allocation result, until all target time-frequency scheduling units are allocated.

[0122] In some specific embodiments, the time-frequency scheduling unit number determination module 13 may specifically include:

[0123] The time-frequency scheduling allocation strategy jump unit is used to adjust the initial time-frequency scheduling allocation strategy based on preset network operation indicators, obtain the target time-frequency scheduling allocation strategy, and determine the network scenario requirements corresponding to the wireless communication network.

[0124] The adjustment coefficient determination unit is used to set the network scenario requirement as a fairness requirement if the network scenario requirement meets the preset fairness condition, and to increase the first adjustment coefficient to be processed corresponding to the fairness requirement using the target time-frequency scheduling allocation strategy, so as to adjust the number of target time-frequency scheduling units occupied by each node in the wireless communication network based on the first adjustment coefficient to be processed; wherein, the preset fairness condition is that the average waiting delay corresponding to each node in the wireless communication network is equal.

[0125] In some specific embodiments, the time-frequency scheduling unit number determination module 13 may specifically include:

[0126] The network scenario requirement determination unit is used to adjust the initial time-frequency scheduling allocation strategy based on preset network operation indicators to obtain the target time-frequency scheduling allocation strategy and determine the network scenario requirements corresponding to the wireless communication network.

[0127] The coefficient adjustment unit is used to set the network scenario requirement as an efficiency requirement if the network scenario requirement meets a preset efficiency condition, and to increase the second adjustment coefficient corresponding to the efficiency requirement using the target time-frequency scheduling allocation strategy, so as to adjust the number of target time-frequency scheduling units occupied by each node in the wireless communication network based on the second adjustment coefficient, the number of target time-frequency scheduling units occupied, and the resource requirement; the preset efficiency condition is that the utilization rate of the basic time-frequency resource scheduling units of the wireless communication network is greater than a preset resource utilization rate threshold.

[0128] Furthermore, embodiments of this application also disclose an electronic device, Figure 9This is a structural diagram of an electronic device 20 according to an exemplary embodiment. The content of the diagram should not be construed as limiting the scope of this application. The electronic device 20 may specifically include: at least one processor 21, at least one memory 22, a power supply 23, a communication interface 24, an input / output interface 25, and a communication bus 26. The memory 22 stores a computer program, which is loaded and executed by the processor 21 to implement the relevant steps in the dynamic resource scheduling method for wireless communication networks disclosed in any of the foregoing embodiments. Furthermore, the electronic device 20 in this embodiment may specifically be an electronic computer.

[0129] In this embodiment, the power supply 23 is used to provide operating voltage for each hardware device on the electronic device 20; the communication interface 24 can create a data transmission channel between the electronic device 20 and external devices, and the communication protocol it follows can be any communication protocol applicable to the technical solution of this application, and is not specifically limited here; the input / output interface 25 is used to acquire external input data or output data to the outside world, and its specific interface type can be selected according to specific application needs, and is not specifically limited here.

[0130] In addition, the memory 22, as a carrier for resource storage, can be a read-only memory, random access memory, disk or optical disk, etc. The resources stored thereon can include operating system 221, computer program 222, etc., and the storage method can be temporary storage or permanent storage.

[0131] The operating system 221 is used to manage and control the various hardware devices on the electronic device 20 and the computer program 222, which may be Windows Server, Netware, Unix, Linux, etc. In addition to including a computer program capable of performing the dynamic resource scheduling method of the wireless communication network executed by the electronic device 20 as disclosed in any of the foregoing embodiments, the computer program 222 may further include a computer program capable of performing other specific tasks.

[0132] Furthermore, this application also discloses a computer-readable storage medium for storing a computer program; wherein, when the computer program is executed by a processor, it implements the aforementioned dynamic resource scheduling method for a wireless communication network. Specific steps of this method can be found in the corresponding content disclosed in the foregoing embodiments, and will not be repeated here.

[0133] The various embodiments in this specification are described in a progressive manner, with each embodiment focusing on its differences from other embodiments. Similar or identical parts between embodiments can be referred to interchangeably. For the apparatus disclosed in the embodiments, since it corresponds to the method disclosed in the embodiments, the description is relatively simple; relevant parts can be referred to in the method section.

[0134] Those skilled in the art will further recognize that the units and algorithm steps of the various examples described in conjunction with the embodiments disclosed herein can be implemented in electronic hardware, computer software, or a combination of both. To clearly illustrate the interchangeability of hardware and software, the components and steps of the various examples have been generally described in terms of functionality in the foregoing description. Whether these functions are implemented in hardware or software depends on the specific application and design constraints of the technical solution. Those skilled in the art can use different methods to implement the described functions for each specific application, but such implementation should not be considered beyond the scope of this application.

[0135] The steps of the methods or algorithms described in conjunction with the embodiments disclosed herein can be implemented directly by hardware, a software module executed by a processor, or a combination of both. The software module can be located in random access memory (RAM), main memory, read-only memory (ROM), electrically programmable ROM, electrically erasable programmable ROM, registers, hard disk, removable disk, CD-ROM, or any other form of storage medium known in the art.

[0136] Finally, it should be noted that in this document, relational terms such as "first" and "second" are used only to distinguish one entity or operation from another, and do not necessarily require or imply any such actual relationship or order between these entities or operations. Furthermore, the terms "comprising," "including," or any other variations thereof are intended to cover non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements includes not only those elements but also other elements not expressly listed, or elements inherent to such a process, method, article, or apparatus. Without further limitations, an element defined by the phrase "comprising one..." does not exclude the presence of other identical elements in the process, method, article, or apparatus that includes said element.

[0137] The technical solutions provided in this application have been described in detail above. Specific examples have been used to illustrate the principles and implementation methods of this application. The descriptions of the above embodiments are only for the purpose of helping to understand the methods and core ideas of this application. At the same time, for those skilled in the art, there will be changes in the specific implementation methods and application scope based on the ideas of this application. Therefore, the content of this specification should not be construed as a limitation of this application.

Claims

1. A dynamic resource scheduling method for a wireless communication network, characterized in that, include: A matrix-form basic time-frequency resource scheduling unit is constructed based on the number of frequency channels and time slots in the wireless communication network. The number of units required is determined based on the number of nodes in the wireless communication network and the service transmission frequency corresponding to each node. Then, according to the principle of maximizing distribution and based on the number of units required, each target time-frequency scheduling unit is allocated to each of the basic time-frequency resource scheduling units to obtain the allocation result. The target time-frequency scheduling unit is a pre-configured minimum hourly frequency scheduling unit; Based on the allocation result, the current resource demand of the current node and the neighbor resource demand of the neighbor nodes are determined. Then, a preset relay resource scheduling algorithm is used to determine the number of target time-frequency scheduling units occupied by the corresponding current basic time-frequency resource scheduling unit based on the current resource demand and the neighbor resource demand. The neighbor node with the largest resource demand value among the neighbor resource demand values ​​is set as the new current node. Then, the process jumps back to the step of determining the current resource demand of the current node and the neighbor resource demand of the neighbor nodes based on the allocation result until all target time-frequency scheduling units are allocated. The time-frequency scheduling allocation strategy is determined based on preset network operation indicators and network scenario requirements, so as to adjust the target time-frequency scheduling unit occupied by each node in the wireless communication network using the time-frequency scheduling allocation strategy and preset adjustment coefficient. The process of determining the required number of units based on the number of nodes in the wireless communication network and the service transmission frequency corresponding to each node, and then allocating each target time-frequency scheduling unit to each of the basic time-frequency resource scheduling units according to the principle of maximizing distribution and based on the required number of units, to obtain the allocation result, includes: configuring the number of nodes and the broadcast period of the wireless communication network using configuration rules to obtain the number of nodes and the broadcast period corresponding to the wireless communication network, and determining the service transmission frequency corresponding to each node based on the broadcast period; the services corresponding to the service transmission frequency include broadcast services, MAC layer control frame broadcast services, and routing broadcast frame control services; determining the time slot occupancy time corresponding to each time slot, and calculating the basic time-frequency resource scheduling... The total number of target time-frequency scheduling units in the degree unit is determined based on the service transmission frequency, the time slot occupancy time, and the total number of units, to determine the unit demand number corresponding to the current node. A maximization distribution principle is determined based on preset delay jitter control requirements, and a set of coordinates corresponding to the target time-frequency scheduling units of the unit demand number is determined using preset coordinate constraints. The coordinate set includes the Euclidean distance between any two target time-frequency scheduling units, a set of distances determined based on each Euclidean distance, the mean distance, and the variance of the distance. Using the maximization distribution principle and based on the unit demand number and the coordinate set, each target time-frequency scheduling unit is allocated to the corresponding basic time-frequency resource scheduling units of the current node to obtain the corresponding allocation result.

2. The dynamic resource scheduling method for a wireless communication network according to claim 1, characterized in that, The basic time-frequency resource scheduling unit, constructed in matrix form based on the number of frequency channels and time slots in the wireless communication network, includes: The number of frequency channels corresponding to the frequency channels in the wireless communication network is counted, the channel bandwidth corresponding to each frequency channel is determined, and then the number of time slots corresponding to each frequency channel is determined. Based on the number of frequency channels, the number of time slots, and each of the frequency channels, a matrix-form basic time-frequency resource scheduling unit is constructed to obtain a two-dimensional matrix-form basic time-frequency resource scheduling unit. In this unit, the columns represent frequency channels, which are used to characterize the number of frequency channels that the wireless communication network supports for transmission and reception; the rows represent time slots, which are used to characterize the number of time slots that the frequency channels in the wireless communication network support for data transmission; and each matrix element in the basic time-frequency resource scheduling unit corresponds to a target time-frequency scheduling unit.

3. The dynamic resource scheduling method for a wireless communication network according to claim 1, characterized in that, The process of determining the current resource demand of the current node and the neighboring resource demand of neighboring nodes based on the allocation result, and then using a preset relay resource scheduling algorithm and based on the current resource demand and the neighboring resource demand to determine the target number of time-frequency scheduling units occupied by the corresponding current basic time-frequency resource scheduling unit, includes: Priorities are determined based on business requirements, and the historical data transmission volume, historical data reception volume, and buffer pool queue length of the current node are determined. The current resource demand is then determined based on the number of units required for the current node, the priority, the allocation result, the historical data transmission volume, the historical data reception volume, and the buffer pool queue length. The current node is the node currently receiving communication control frames in the wireless communication network. The neighbor nodes of the current node are determined by using a preset neighbor node selection rule, so as to determine the neighbor resource demand degree corresponding to each neighbor node. The current node is set as the current relay initiator, so as to call the current relay initiator to use a preset relay resource scheduling algorithm, and determine the number of current target time-frequency scheduling units occupied by the corresponding current basic time-frequency resource scheduling unit based on the current resource demand degree and the neighbor resource demand degree.

4. The dynamic resource scheduling method for a wireless communication network according to claim 3, characterized in that, The step of setting the neighbor node corresponding to the largest resource demand among all the neighbor resource demand degrees as the new current node, and then jumping back to the step of determining the current resource demand degree of the current node and the neighbor resource demand degrees of the neighbor nodes based on the allocation result, until all target time-frequency scheduling units are allocated, includes: The remaining target time-frequency scheduling unit number is determined based on the total number of units and the current target time-frequency scheduling unit number, and the neighbor node to be processed is determined based on the target time-frequency scheduling unit number, corresponding to the resource demand degree with the largest value among the neighbor resource demand degrees. The current relay initiator sends service frames in the wireless communication network using the target time-frequency scheduling units occupied by the current basic time-frequency resource scheduling unit; the service frame includes the target time-frequency scheduling unit occupied by the current basic time-frequency resource scheduling unit and the node number corresponding to the neighbor node to be processed. Set the neighbor node to be processed corresponding to the node number as the new current relay initiator, and jump back to the step of determining the current resource requirement of the current node and the neighbor resource requirement of the neighbor node based on the allocation result, until all target time-frequency scheduling units are allocated.

5. The dynamic resource scheduling method for a wireless communication network according to claim 1, characterized in that, The step of determining a time-frequency scheduling allocation strategy based on preset network operation indicators and network scenario requirements, and adjusting the target number of time-frequency scheduling units occupied by each node in the wireless communication network using the time-frequency scheduling allocation strategy and preset adjustment coefficients, includes: The initial time-frequency scheduling allocation strategy is adjusted based on preset network operation indicators to obtain the target time-frequency scheduling allocation strategy, and the network scenario requirements corresponding to the wireless communication network are determined. If the network scenario requirement meets the preset fairness condition, then the network scenario requirement is set as a fairness requirement, and the first adjustment coefficient corresponding to the fairness requirement is increased using the target time-frequency scheduling allocation strategy, so as to adjust the number of target time-frequency scheduling units occupied by each node in the wireless communication network based on the first adjustment coefficient; wherein, the preset fairness condition is that the average waiting delay corresponding to each node in the wireless communication network is equal.

6. The dynamic resource scheduling method for a wireless communication network according to claim 1, characterized in that, The step of determining a time-frequency scheduling allocation strategy based on preset network operation indicators and network scenario requirements, and adjusting the target number of time-frequency scheduling units occupied by each node in the wireless communication network using the time-frequency scheduling allocation strategy and preset adjustment coefficients, includes: The initial time-frequency scheduling allocation strategy is adjusted based on preset network operation indicators to obtain the target time-frequency scheduling allocation strategy, and the network scenario requirements corresponding to the wireless communication network are determined. If the network scenario requirement meets the preset efficiency condition, then the network scenario requirement is set as an efficiency requirement, and the second adjustment coefficient corresponding to the efficiency requirement is increased using the target time-frequency scheduling allocation strategy. The number of target time-frequency scheduling units occupied by each node in the wireless communication network is adjusted based on the second adjustment coefficient, the number of target time-frequency scheduling units occupied, and the resource requirement. The preset efficiency condition is that the utilization rate of the basic time-frequency resource scheduling units of the wireless communication network is greater than the preset resource utilization rate threshold.

7. A dynamic resource scheduling device for a wireless communication network, characterized in that, include: The allocation result determination module is used to construct a matrix-form basic time-frequency resource scheduling unit based on the number of frequency channels and time slots of the wireless communication network, determine the number of units required based on the number of nodes in the wireless communication network and the service transmission frequency corresponding to each node, and then allocate each target time-frequency scheduling unit to each of the basic time-frequency resource scheduling units according to the principle of maximizing distribution and based on the number of units required, to obtain the allocation result; The resource demand determination module is used to determine the current resource demand of the current node and the neighbor resource demand of neighboring nodes based on the allocation result. Then, it uses a preset relay resource scheduling algorithm and determines the number of target time-frequency scheduling units occupied by the corresponding current basic time-frequency resource scheduling unit based on the current resource demand and the neighbor resource demand. The neighboring node with the largest resource demand value among the neighboring resource demand values ​​is set as the new current node. Then, it jumps back to the step of determining the current resource demand of the current node and the neighbor resource demand of neighboring nodes based on the allocation result until all target time-frequency scheduling units are allocated. The time-frequency scheduling unit number determination module is used to determine the time-frequency scheduling allocation strategy based on preset network operation indicators and network scenario requirements, so as to adjust the target time-frequency scheduling unit number occupied by each node in the wireless communication network using the time-frequency scheduling allocation strategy and preset adjustment coefficient. Specifically, the allocation result determination module is used to: configure the number of nodes and the broadcast period of the wireless communication network using configuration rules to obtain the number of nodes and the broadcast period corresponding to the wireless communication network, and determine the service transmission frequency corresponding to each node based on the broadcast period; the services corresponding to the service transmission frequency include broadcast services, MAC layer control frame broadcast services, and routing broadcast frame control services; determine the time slot occupancy time corresponding to each time slot, and count the total number of units in each target time slot scheduling unit in the basic time slot scheduling unit, so as to determine the unit demand quantity corresponding to the current node based on the service transmission frequency, the time slot occupancy time, and the total number of units; Based on the preset delay jitter control requirements, a maximization distribution principle is determined, and a set of coordinates corresponding to the number of target time-frequency scheduling units required by the unit is determined using preset coordinate constraints. The set of coordinates includes the Euclidean distance between any two target time-frequency scheduling units and a set of distances, the mean distance, and the variance of distances determined based on each Euclidean distance. Using the maximization distribution principle and based on the number of unit requirements and the set of coordinates, each target time-frequency scheduling unit is allocated to the corresponding basic time-frequency resource scheduling units of the current node to obtain the corresponding allocation result.

8. An electronic device, characterized in that, include: Memory, used to store computer programs; A processor is configured to execute the computer program to implement the dynamic resource scheduling method for a wireless communication network as described in any one of claims 1 to 6.

9. A computer-readable storage medium, characterized in that, Used to store a computer program, wherein the computer program, when executed by a processor, implements the dynamic resource scheduling method for a wireless communication network as described in any one of claims 1 to 6.

Images