CN-122002559-A - Dynamic resource scheduling method, device, equipment and storage medium of wireless communication network

CN122002559ACN 122002559 ACN122002559 ACN 122002559ACN-122002559-A

Abstract

The application discloses a dynamic resource scheduling method, a device, equipment and a storage medium of a wireless communication network, which relate to the technical field of wireless communication and comprise the steps of 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 by utilizing the unit demand number determined based on the number of nodes and the service transmission frequency of the nodes to obtain a distribution result, determining the target time-frequency scheduling unit number occupied by the current basic time-frequency resource scheduling unit by utilizing the resource demand level of the nodes determined based on the distribution result, setting the node with the largest value in each neighbor resource demand level as a new current node, and re-jumping to the step of determining the resource demand level, and determining a time-frequency scheduling distribution strategy based on a preset network operation index and network scene demand to adjust the target time-frequency scheduling unit number occupied by each node, thereby improving the efficiency of dynamic resource scheduling.

Inventors

ZHAO HAITAO
GU FANGLIN
WEI JIBO
LIU JIE
HUANG SHENGCHUN
XIONG JUN
WANG HAIJUN

Assignees

中国人民解放军国防科技大学

Dates

Publication Date: 20260508
Application Date: 20260409

Claims (10)

1. A method for dynamic resource scheduling in a wireless communication network, comprising: Constructing a basic time-frequency resource scheduling unit in a matrix form based on the number of frequency channels and the number of time slots of a wireless communication network, determining the number of unit demands based on the number of nodes in the wireless communication network and the service transmission frequency corresponding to each node, and then distributing each target time-frequency scheduling unit into each basic time-frequency resource scheduling unit according to a maximized dispersion principle and based on the number of unit demands to obtain a distribution result; determining the current resource demand of the current node and the neighbor resource demand of the neighbor node based on the allocation result, then determining the number of target time-frequency scheduling units occupied by the corresponding current basic time-frequency scheduling units based on the current resource demand and the neighbor resource demand by using a preset relay resource scheduling algorithm, setting the neighbor node corresponding to the resource demand with the largest value in the neighbor resource demand as a new current node, and then re-jumping to the step of determining the current resource demand of the current node and the neighbor resource demand of the neighbor node based on the allocation result until all the target time-frequency scheduling units are allocated; And determining a time-frequency scheduling allocation strategy based on a preset network operation index and network scene requirements, and adjusting the target time-frequency scheduling unit number occupied by each node in the wireless communication network by using the time-frequency scheduling allocation strategy and a preset adjustment coefficient.
2. The method for dynamic resource scheduling of a wireless communication network according to claim 1, wherein the constructing a base time-frequency resource scheduling unit in a matrix form based on the number of frequency channels and the number of time slots of the wireless communication network comprises: Counting the number of frequency channels corresponding to frequency channels in a 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 basic time-frequency resource scheduling unit in a matrix form based on the number of the frequency channels, the number of the time slots and each frequency channel to obtain a basic time-frequency resource scheduling unit in a two-dimensional matrix form; The system comprises a base time-frequency resource scheduling unit, a target time-frequency scheduling unit, a base time-frequency resource scheduling unit and a matrix element, wherein a column in the base time-frequency resource scheduling unit represents a frequency channel and is used for representing the receiving and transmitting of a plurality of frequency channels of the frequency channel supported by the wireless communication network, a row in the base time-frequency resource scheduling unit represents a time slot and is used for representing the frequency channel supported by the time slot in the wireless communication network to transmit data, and each matrix element in the base time-frequency resource scheduling unit corresponds to the target time-frequency scheduling unit.
3. The method for dynamic resource scheduling in a wireless communication network according to any one of claims 1 to 2, wherein the determining the number of unit demands based on the number of nodes in the wireless communication network and the traffic transmission frequency corresponding to each node, and then allocating each target time-frequency scheduling unit to each base time-frequency resource scheduling unit according to a maximum dispersion principle and based on the number of unit demands, to obtain an allocation result, includes: Configuring the number of nodes and the broadcasting period of the wireless communication network by utilizing a configuration rule to obtain the number of nodes and the broadcasting period corresponding to the wireless communication network, and determining the service sending frequency corresponding to each node based on the broadcasting period, wherein the service corresponding to the service sending frequency comprises a broadcasting service, a MAC layer control frame broadcasting service and a route broadcasting frame control service; Determining the time slot occupation time corresponding to each time slot, and counting the total number of units of each target time-frequency scheduling unit in the basic time-frequency resource scheduling units so as to determine the unit demand number corresponding to the current node based on the service transmission frequency, the time slot occupation time and the total number of units; Determining a maximum dispersion principle based on a preset time delay jitter control requirement, and determining coordinate sets corresponding to the target time-frequency scheduling units of the unit requirement number by utilizing a preset coordinate constraint condition, wherein the coordinate sets comprise Euclidean distances between any two target time-frequency scheduling units, and distance sets, distance average values and distance variances determined based on the Euclidean distances; And distributing each target time-frequency scheduling unit to each basic time-frequency resource scheduling unit corresponding to the current node by utilizing the maximized dispersion principle and based on the unit demand quantity and the coordinate set, and obtaining a corresponding distribution result.
4. The method for dynamic resource scheduling in a wireless communication network according to claim 3, wherein the determining, based on the allocation result, a current resource demand of a current node and a neighbor resource demand of a neighbor node, and then determining, using a preset relay resource scheduling algorithm and based on the current resource demand and the neighbor resource demand, a target number of time-frequency scheduling units occupied by a corresponding current base time-frequency scheduling unit, includes: Determining a priority based on service requirements, and determining a historical transmission data amount, a historical reception data amount and a buffer pool queue length of a current node to determine a current resource demand based on a unit demand amount corresponding to the current node, the priority, the allocation result, the historical transmission data amount, the historical reception data amount and the buffer pool queue length; determining each neighbor node of a current node by using a preset neighbor node selection rule to determine the neighbor resource demand degree corresponding to each neighbor node, setting the current node as a current relay initiator to call the current relay initiator to utilize a preset relay resource scheduling algorithm, and determining the number of current target time-frequency scheduling units occupied by the corresponding current basic time-frequency resource scheduling units based on the current resource demand degree and the neighbor resource demand degree.
5. The method for dynamic resource scheduling in a wireless communication network according to claim 4, wherein the step of setting the neighbor node corresponding to the resource demand with the largest value among the neighbor resource demands as a new current node, and then re-jumping to the step of determining the current resource demand of the current node and the neighbor resource demand of the neighbor node based on the allocation result until all the target time-frequency scheduling units are allocated, comprises: Determining the number of remaining target time-frequency scheduling units based on the total number of units and the number of current target time-frequency scheduling units, and determining to-be-processed neighbor nodes corresponding to the resource demand with the largest value in the neighbor resource demand based on the number of target time-frequency scheduling units; Invoking a current relay initiator to send a service frame in the wireless communication network through the number of target time-frequency scheduling units occupied by the current basic time-frequency resource scheduling unit, wherein the service frame comprises node numbers corresponding to the neighbor nodes to be processed in the number of target time-frequency scheduling units occupied by the current basic time-frequency resource scheduling unit; Setting the neighbor node to be processed corresponding to the node number as a new current relay initiator, and re-jumping to the step of determining the current resource demand of the current node and the neighbor resource demand of the neighbor node based on the allocation result until all target time-frequency scheduling units are allocated.
6. The method for dynamic resource scheduling in a wireless communication network according to claim 1, wherein determining a time-frequency scheduling allocation policy based on a preset network operation index and a network scenario requirement, so as to adjust a target number of time-frequency scheduling units occupied by each node in the wireless communication network by using the time-frequency scheduling allocation policy and a preset adjustment coefficient, comprises: Adjusting an initial time-frequency scheduling allocation strategy based on a preset network operation index to obtain a target time-frequency scheduling allocation strategy, and determining network scene requirements corresponding to the wireless communication network; If the network scene demand meets a preset fairness condition, setting the network scene demand as fairness demand, and increasing a first to-be-processed adjustment coefficient corresponding to the fairness demand by utilizing 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 to-be-processed adjustment coefficient, wherein the preset fairness condition is equal average waiting time delay corresponding to each node in the wireless communication network.
7. The method for dynamic resource scheduling in a wireless communication network according to claim 1, wherein determining a time-frequency scheduling allocation policy based on a preset network operation index and a network scenario requirement, so as to adjust a target number of time-frequency scheduling units occupied by each node in the wireless communication network by using the time-frequency scheduling allocation policy and a preset adjustment coefficient, comprises: Adjusting an initial time-frequency scheduling allocation strategy based on a preset network operation index to obtain a target time-frequency scheduling allocation strategy, and determining network scene requirements corresponding to the wireless communication network; If the network scene demand meets a preset high-efficiency condition, setting the network scene demand as a high-efficiency demand, and increasing a second to-be-processed adjustment coefficient corresponding to the high-efficiency demand by utilizing 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 second to-be-processed adjustment coefficient, the occupied target time-frequency scheduling unit number and the resource demand, wherein the preset high-efficiency condition is that the utilization rate of a basic time-frequency resource scheduling unit of the wireless communication network is larger than a preset resource utilization rate threshold.
8. A dynamic resource scheduling apparatus for a wireless communication network, comprising: The allocation result determining module is used for constructing basic time-frequency resource scheduling units in a matrix form based on the number of frequency channels and the number of time slots of the wireless communication network, determining the number of unit demands 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 basic time-frequency resource scheduling unit according to the maximum dispersion principle and based on the number of unit demands to obtain an allocation result; The resource demand degree determining module is used for determining the current resource demand degree of the current node and the neighbor resource demand degree of the neighbor node based on the allocation result, then determining the number of target time-frequency scheduling units occupied by the corresponding current basic time-frequency scheduling units based on the current resource demand degree and the neighbor resource demand degree by utilizing a preset relay resource scheduling algorithm, setting the neighbor node corresponding to the resource demand degree with the largest value in the neighbor resource demand degrees as a new current node, and then re-jumping to the step of determining the current resource demand degree of the current node and the neighbor resource demand degree of the neighbor node based on the allocation result until all the target time-frequency scheduling units are allocated; and the time-frequency scheduling unit number determining module is used for determining a time-frequency scheduling allocation strategy based on a preset network operation index and network scene requirements so as to adjust the target time-frequency scheduling unit number occupied by each node in the wireless communication network by utilizing the time-frequency scheduling allocation strategy and a preset adjustment coefficient.
9. An electronic device, comprising: A memory for storing a computer program; a processor for executing the computer program to implement the dynamic resource scheduling method of a wireless communication network according to any of claims 1 to 7.
10. A computer readable storage medium for storing a computer program, wherein the computer program when executed by a processor implements the dynamic resource scheduling method of a wireless communication network according to any one of claims 1 to 7.

Description

Dynamic resource scheduling method, device, equipment and storage medium of wireless communication network Technical Field The present invention relates to the field of wireless communications technologies, and in particular, to a method, an apparatus, a device, and a storage medium for scheduling dynamic resources in a wireless communications network. Background Currently, with the advancement of 5G/6G technology, a wireless communication network needs to support massive heterogeneous services, such as low-latency high-reliability communication (URLLC) of automatic driving, high-certainty transmission of industrial internet of things, ubiquitous connection of smart home, and the like. The service has obvious difference on QoS (quality of service) requirements of bandwidth, time delay, reliability, energy efficiency and the like, and the service load dynamically fluctuates along with time and space (such as load difference of a dense area and a sparse area of vehicles in the Internet of vehicles and data flood peak caused by emergency in a sensor network), so that the traditional static resource allocation (such as fixed frequency spectrum division and preset time slot allocation) cannot adapt to the dynamic property, and resource waste or congestion is easily caused. The dynamic performance of the wireless communication network is characterized in three layers, namely 1) topology dynamic performance, namely node movement (such as high-speed movement of vehicles on the Internet), network topology frequent change caused by node joining/exiting (such as sensor node fault), 2) link dynamic performance, namely wireless channel is influenced by shadow fading, multipath interference and common-frequency interference, link quality (throughput and time delay) fluctuates in real time, and 3) service dynamic performance, namely traffic characteristics (burst/stable and time delay sensitive/tolerant) of different services (such as video stream, control command and monitoring data) are greatly different, and load dynamic change (such as video transmission demand surge in peak time) is carried out along with time. The dynamic property causes the supply and demand relation of the resources to change at any time, the static allocation strategy is invalid because of the failure of real-time response, and a dynamic resource allocation mechanism is needed to realize the 'on-demand scheduling' of the resources. But in wireless communication networks, the contradiction of resource scarcity and multi-objective optimization is a core challenge for dynamic resource on-demand scheduling. The nature of this conflict is that the limited resources (spectrum, energy, time, etc.) cannot meet the optimization objectives (e.g., throughput, latency, fairness, energy efficiency, etc.) of multiple mutual coupling and even collisions in the network at the same time, and the dynamics of the network (topology, links, traffic variations) further amplifies the complexity of this conflict. The existing dynamic resource allocation method mainly adopts five methods based on an optimization theory, wherein centralized optimization can achieve global optimization and multi-objective coordination, but has high cost, is not suitable for a large-scale or high-dynamic network, distributed optimization has strong robustness and is suitable for the large-scale network, but is easy to sink into local optimization and rely on information interaction among nodes, non-cooperative game is completely distributed and is easy to achieve, global performance and fairness are poor, cooperative game can improve global performance and fairness, communication cost is high and alliance stability is weak, machine learning and reinforcement learning based methods, particularly reinforcement learning can adapt to dynamic scenes and balance multiple objectives, but has the problems of high training difficulty and poor generalization capability, cross-layer optimization methods have global view angles, have performance superior to single-layer optimization, are complex in design and poor in compatibility, heuristic and meta-heuristic algorithms can handle high-dimension and strong constraint problems, but is easy to sink into local optimization, and has poor real-time performance. These methods each have a emphasis and are currently being developed toward fusion, weight reduction and intelligence. From the above, how to improve the efficiency of dynamic resource scheduling in a wireless communication network in the dynamic resource scheduling process of the wireless communication network is a problem to be solved. Disclosure of Invention In view of the above, an object of the present invention is to provide a dynamic resource scheduling method, apparatus, device, and storage medium for a wireless communication network, which can improve the efficiency of dynamic resource scheduling in the wireless communication network in the dynamic resource scheduling process of the wireles