CN112333824A - Uplink resource scheduling method and device - Google Patents
Uplink resource scheduling method and device Download PDFInfo
- Publication number
- CN112333824A CN112333824A CN202011164843.7A CN202011164843A CN112333824A CN 112333824 A CN112333824 A CN 112333824A CN 202011164843 A CN202011164843 A CN 202011164843A CN 112333824 A CN112333824 A CN 112333824A
- Authority
- CN
- China
- Prior art keywords
- resource block
- allocated
- resource
- queue
- slices
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/20—Control channels or signalling for resource management
- H04W72/21—Control channels or signalling for resource management in the uplink direction of a wireless link, i.e. towards the network
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/08—Configuration management of networks or network elements
- H04L41/0893—Assignment of logical groups to network elements
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/50—Allocation or scheduling criteria for wireless resources
- H04W72/53—Allocation or scheduling criteria for wireless resources based on regulatory allocation policies
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses an uplink resource scheduling method and device, which are applied to a base station, wherein the base station comprises a cache queue, a plurality of slices and a resource block queue, and the method comprises the following steps: receiving uplink resource requests sent by a plurality of preset user terminals; judging whether the buffer queue is in an idle state in a preset scheduling period; if the buffer queue is not in the idle state, selecting a resource block to be allocated from the resource block queue and allocating the resource block to a plurality of slices; allocating the allocated resource blocks in each of the slices to each of the user terminals. Therefore, the time delay of uplink resource scheduling is reduced, and the reliability of uplink resource scheduling of high-capacity services is improved.
Description
Technical Field
The present invention relates to the technical field of resource scheduling, and in particular, to a method and an apparatus for uplink resource scheduling.
Background
Radio resources in a mobile communication system are limited, and the radio resources include frequency, time, space, power, code words and other resources, so how to fully utilize the limited radio resources to meet the increasing demand of wireless services is the task that needs to be completed by a radio resource scheduling and allocating mechanism.
There are various definitions of resource scheduling assignment mechanisms, but the following are widely accepted definitions: the scheduler on the base station needs to dynamically control the allocation of the time-frequency resources in real time, and allocate the time-frequency resources to a certain user within a certain time. The scheduling method requires a balance between the QoS (Quality of Service) of the user and the maximization of the system capacity. Three important indexes of the resource scheduling method are the spectrum utilization rate, the user fairness and the user QoS requirement.
5G mobile communication is rapidly developed under the drive of diversified service deployment in different application scenes, 5G slices are classified and managed according to different service requirements of the three application scenes, and by taking measurement and acquisition data as an example, the traditional uplink resource scheduling method cannot meet resource allocation of different services such as low time delay, high reliability, large capacity and the like.
Disclosure of Invention
The invention provides an uplink resource scheduling method and device, and solves the technical problem that the traditional uplink resource scheduling method cannot meet the resource allocation of different services such as low time delay, high reliability, large capacity and the like.
The invention provides an uplink resource scheduling method, which is applied to a base station, wherein the base station comprises a cache queue, a plurality of slices and a resource block queue, and the method comprises the following steps:
receiving uplink resource requests sent by a plurality of preset user terminals;
judging whether the buffer queue is in an idle state in a preset scheduling period;
if the buffer queue is not in the idle state, selecting a resource block to be allocated from the resource block queue and allocating the resource block to a plurality of slices;
allocating the allocated resource blocks in each of the slices to each of the user terminals.
Optionally, the method further comprises:
and if the cache queue is in the idle state, allocating the resource blocks to be allocated to the user terminal.
Optionally, if the buffer queue is not in the idle state, the step of selecting a resource block to be allocated from the resource block queue and allocating the resource block to a plurality of slices includes:
if the buffer queue is not in the idle state, respectively determining the priority sequence of each slice in each resource block to be allocated based on the transmission rate of each resource block to be allocated in a preset resource block queue;
according to the priority sequence, sequentially selecting resource blocks to be distributed from the resource block queue;
judging whether the resource block to be distributed is adjacent to the distributed resource block in the slice;
and if the resource blocks to be distributed are adjacent, distributing the resource blocks to be distributed into the slices, and deleting the resource blocks to be distributed from the resource block queue until the resource block queue is empty, or distributing the resource blocks to be distributed to all the slices.
Optionally, the method further comprises:
if not, reselecting a new resource block to be allocated from the resource block queue in sequence;
and returning to the step of judging whether the resource block to be allocated is adjacent to the allocated resource block in the slice.
Optionally, the step of allocating the allocated resource blocks in each slice to the user terminal according to a preset user priority includes:
dividing the allocated resource blocks in each slice into a plurality of resource block groups according to the number of the user terminals;
calculating the user priority of each user terminal in the resource block group;
and sequentially allocating the resource block group to each user terminal based on the user priority until the resource block group is empty.
The invention also provides an uplink resource scheduling device, which is applied to a base station, wherein the base station comprises a buffer queue, a plurality of slices and a resource block queue, and the device comprises:
an uplink resource request receiving module, configured to receive uplink resource requests sent by multiple preset user terminals;
the state judgment module is used for judging whether the cache queue is in an idle state in a preset scheduling period;
a slice allocation module, configured to select a resource block to be allocated from the resource block queue and allocate the resource block to a plurality of slices if the buffer queue is not in the idle state;
a first resource block allocation module for allocating allocated resource blocks in each of the slices to each of the user terminals.
Optionally, the apparatus further comprises:
and the second resource block allocation module is used for allocating the resource blocks to be allocated to the user terminal if the cache queue is in the idle state.
Optionally, the slice allocation module comprises:
a priority ranking determining submodule, configured to determine, if the buffer queue is not in the idle state, a priority ranking of each slice in each resource block to be allocated based on a transmission rate of each resource block to be allocated in a preset resource block queue;
the resource block to be distributed selection submodule is used for sequentially selecting the resource blocks to be distributed from the resource block queue according to the priority sequence;
the adjacent relation judgment submodule is used for judging whether the resource block to be distributed is adjacent to the distributed resource block in the slice;
and the slice allocation submodule is used for allocating the resource blocks to be allocated to the slices if the resource blocks to be allocated are adjacent, and deleting the resource blocks to be allocated from the resource block queue until the resource block queue is empty, or all the slices are allocated with the resource blocks to be allocated.
Optionally, the apparatus further comprises:
a resource block reselection submodule, configured to reselect a new resource block to be allocated from the resource block queue in sequence if the resource blocks are not adjacent to each other;
and the returning submodule is used for returning to the step of judging whether the resource block to be allocated is adjacent to the allocated resource block in the slice.
Optionally, the first resource block allocation module includes:
a resource block group division submodule, configured to divide the allocated resource blocks in each slice into a plurality of resource block groups according to the number of the user terminals;
a user priority calculating submodule, configured to calculate a user priority of each user terminal in the resource block group;
and the resource block group allocation sub-module is used for sequentially allocating the resource block groups to each user terminal based on the user priority until the resource block groups are empty.
According to the technical scheme, the invention has the following advantages:
receiving uplink resource requests sent by a plurality of preset user terminals through a base station, and judging whether a buffer queue is in an idle state in a preset scheduling period; when the uplink resource scheduling method is not in an idle state, the resource blocks to be allocated are selected from a preset resource block queue and allocated to a plurality of slices, and finally the allocated resource blocks in each slice are allocated to each user terminal, so that the technical problem that the traditional uplink resource scheduling method cannot meet the resource allocation of different services such as low time delay, high reliability, large capacity and the like is solved, the time delay of uplink resource scheduling is reduced, and the reliability of uplink resource scheduling of large-capacity services is improved.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, and it is obvious that the drawings in the following description are only some embodiments of the present invention, and for those skilled in the art, other drawings can be obtained according to these drawings without inventive exercise.
Fig. 1 is a flowchart illustrating steps of a method for scheduling uplink resources according to an embodiment of the present invention;
fig. 2 is a flowchart illustrating steps of a method for scheduling uplink resources according to an alternative embodiment of the present invention;
FIG. 3 is a flowchart illustrating the steps of a resource block allocation process of a resource block queue according to an embodiment of the present invention;
FIG. 4 is a flowchart illustrating the steps of an intra-slice resource block allocation process according to an embodiment of the present invention;
fig. 5 is a block diagram of an uplink resource scheduling apparatus according to an embodiment of the present invention.
Detailed Description
The embodiment of the invention provides an uplink resource scheduling method and device, which are used for solving the technical problem that the traditional uplink resource scheduling method cannot meet the resource allocation of different services such as low time delay, high reliability, large capacity and the like.
There are three application scenarios in 5G, including eMMB (Enhanced Mobile Broadband), urrllc (Ultra Reliable & Low Latency Communication, Low Latency, high reliability Communication) and mtc (Massive Machine Type Communication, Massive internet of things). According to the time constraint, the business of the uRLLC belongs to real-time information, in this scene, the requirement on time delay is very high and often reaches the level of 1ms, such as automatic control of metering acquisition, real-time cooperation robots and other real-time monitoring and real-time early warning data, and if the transmission flow of the data is too long, the value is difficult to be played in the production process. The eMMB mainly shows an increase in network capacity, supports a large amount of data transmission by different devices, and increases the bandwidth also mean an increase in transmission rate. The ultra-large network throughput and the faster rate enable users to obtain better user experience, including applications such as remote wireless measurement and acquisition video monitoring, measurement and Acquisition (AR) and the like. mMTC is a large-scale Internet of things, the equipment of the general Internet of things is very simple, and the quantity of data information to be transmitted is not large.
There are three common scheduling algorithms: a polling algorithm, a maximum carrier-to-interference ratio algorithm and a proportional fairness algorithm.
The polling algorithm is to sequentially allocate resources to different users requesting for scheduling in a circulating manner, and only the fairness among the users is considered in the algorithm, so that the system throughput is lost; the maximum carrier-to-interference ratio algorithm always provides resources for users with the best channels, the algorithm can maximize the system throughput, but the fairness among cell users cannot be guaranteed; the proportional fairness algorithm considers the ratio of the instantaneous rate to the long-term average rate when selecting the users, and simultaneously adjusts different users by using the weight value, so that the aim of simultaneously considering the overall throughput of the system and the fairness of the users is fulfilled, but the QoS information of the service is not considered.
The development of 5G is brought by the explosive increase of data rate and capacity requirements and the differentiation requirements of large scale, high reliability, low time delay and the like. Therefore, in the face of different scenes of a metering and collecting site in 5G and different QoS requirements of services, a targeted multi-priority scheduling method needs to be designed, wireless resources are reasonably distributed and managed for different 5G slices under the condition of limited wireless resources, and the resource utilization rate and the fairness among users are improved as much as possible under the condition that the service requirements of high-priority services in metering and collecting are met.
With the development of communication technology, the 5G era has been entered now, and the process of communication between the user side and the server side is a resource scheduling process, and the uplink scheduling process of the 5G NR (NEW radio) is now:
when a User Equipment (UE) has Uplink data to be transmitted, the data to be transmitted is first put into a Buffer, and then a Physical Uplink Control Channel (PUCCH) is used to submit a Buffer State Report (BSR) to a base station gNB, and an SR (Scheduling Request) is sent to notify the base station gNB that the data needs to be transmitted.
And secondly, an uplink scheduler of the base station gNB receives an uplink scheduling request of the UE, and performs resource allocation on the UE according to a buffer state report of the UE and an uplink channel condition of the UE, wherein the uplink channel condition is obtained by the UE periodically sending an SRS (Sounding Reference Signal) to the base station gNB. The resource allocation result is transmitted to the UE through a PDCCH (Physical Downlink Control Channel) using an UL Grant (UpLink Grant).
The UE transmits data to the base station through a PUSCH (Physical Uplink Shared Channel) using resources allocated to it by the base station gNB.
That is, the uplink scheduler of the base station gNB receives the buffer status report and the uplink channel status of the UE, and then completes dynamic scheduling of the time-frequency resources according to the built-in scheduling algorithm, so as to perform effective allocation of resources for the user and improve the utilization rate of the resources.
In order to make the objects, features and advantages of the present invention more obvious and understandable, the technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings in the embodiments of the present invention, and it is obvious that the embodiments described below are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
Referring to fig. 1, fig. 1 is a flowchart illustrating steps of a method for scheduling uplink resources according to an embodiment of the present invention.
The invention provides an uplink resource scheduling method, which is applied to a base station, wherein the base station comprises a cache queue, a plurality of slices and a resource block queue, and the method comprises the following steps:
in the embodiment of the invention, when the user has uplink data to be sent, the data to be sent needs to be stored in a local cache, and an uplink resource request is sent to the base station through an uplink channel so as to inform the base station that the user terminal needs to send the data.
after receiving an uplink resource request sent by a user terminal, a base station judges whether the buffer queue is in an idle state in a preset scheduling period, wherein the idle state refers to the state capable of meeting the uplink resource request of the user terminal in the preset scheduling period.
103, if the buffer queue is not in the idle state, selecting a resource block to be allocated from the resource block queue and allocating the resource block to a plurality of slices;
when the buffer queue is not in an idle state, it indicates that the uplink resource request of the user terminal cannot be satisfied in the scheduling period, and at this time, the resource block to be allocated may be selected from the preset resource block queue and allocated to a plurality of different slices.
The slice is a networking mode according to needs, an operator can cut out a plurality of virtual end-to-end networks on a unified infrastructure, and each network slice is logically isolated from a wireless access network to a bearer network and then to a core network and is adapted to various types of service applications. However, there are three application scenarios in 5G, which are embb (Enhanced Mobile Broadband), urrllc (Ultra Reliable & Low Latency Communication, Low Latency, high reliability Communication) and mtc (Massive internet of things Communication), so that three slices including embb slice, urrllc slice and mtc slice may be adopted.
Resources allocated by different slices are mutually isolated and independent in a frequency domain and can be flexibly adjusted, so that air interface congestion of one network slice does not influence other network slices. And the high-priority slice can be allocated with spectrum resources with better channel conditions, so that the throughput of the system is improved, and the service guarantee of high-priority services is improved.
And 104, allocating the allocated resource blocks in each slice to each user terminal.
And allocating the allocated resource blocks in each slice to each user terminal so as to meet the uplink scheduling request.
In the embodiment of the invention, a base station receives uplink resource requests sent by a plurality of preset user terminals and judges whether a buffer queue is in an idle state in a preset scheduling period; when the uplink resource scheduling method is not in an idle state, the resource blocks to be allocated are selected from a preset resource block queue and allocated to a plurality of slices, and finally the allocated resource blocks in each slice are allocated to each user terminal, so that the technical problem that the traditional uplink resource scheduling method cannot meet the resource allocation of different services such as low time delay, high reliability, large capacity and the like is solved, the time delay of uplink resource scheduling is reduced, and the reliability of uplink resource scheduling of large-capacity services is improved.
Referring to fig. 2, fig. 2 is a flowchart illustrating steps of a method for scheduling uplink resources according to an embodiment of the present invention.
The invention provides an uplink resource scheduling method, which is applied to a base station, wherein the base station comprises a cache queue, a plurality of slices and a resource block queue, and the method comprises the following steps:
step 201, receiving uplink resource requests sent by a plurality of preset user terminals;
step 202, judging whether the buffer queue is in an idle state in a preset scheduling period;
in the embodiment of the present invention, the specific implementation process of steps 201-202 is similar to that of steps 101-102, and is not described herein again.
optionally, the step 203 may comprise the following sub-steps:
if the buffer queue is not in the idle state, respectively determining the priority sequence of each slice in each resource block to be allocated based on the transmission rate of each resource block to be allocated in a preset resource block queue;
according to the priority sequence, sequentially selecting resource blocks to be distributed from the resource block queue;
judging whether the resource block to be distributed is adjacent to the distributed resource block in the slice;
and if the resource blocks to be distributed are adjacent, distributing the resource blocks to be distributed into the slices, and deleting the resource blocks to be distributed from the resource block queue until the resource block queue is empty, or distributing the resource blocks to be distributed to all the slices.
In one example of the present invention, slices include multiple types, such as eMMB slices, urrllc slices, and mtc slices, where the urrllc slices require low latency and high reliability, need to give priority to allocation resources, and reduce queuing delay; the eMB slice has a lot of service demands of high data volume, the throughput of the whole network can be improved by preferentially distributing resources, but the uRLLC slice does not have too high requirements on time delay; the scheduling priority of the mMTC slice is the lowest, and under most conditions of massive sensors, the uplink data volume is not large and the requirement on time delay is not high.
And performing priority sequencing on each resource block to be distributed in the resource block queue based on the transmission efficiency of each resource block to be distributed, and respectively determining the priority sequencing of each slice in each resource block to be distributed. And then selecting the resource block to be distributed from the resource block queue, judging whether the selected resource block to be distributed is adjacent to the distributed resource block in the slice, if so, directly distributing the resource block to be distributed to the slice, and deleting the resource block to be distributed from the resource block queue. And after deleting the resource block to be allocated, judging whether the resource block queue is empty or not, or whether all slices acquire the resource block to be allocated, and if so, ending the resource scheduling process.
In the priority ordering, the urrllc slice is the highest priority, the eMMB slice is the middle priority, the mtc slice is the lowest priority, and Resource Block (RB) resources are respectively configured according to the priorities.
Further, the step 203 may further include the following sub-steps:
if not, reselecting a new resource block to be allocated from the resource block queue in sequence;
and returning to the step of judging whether the resource block to be allocated is adjacent to the allocated resource block in the slice.
In the embodiment of the invention, if the resource block to be allocated is not adjacent to the allocated resource block, a new resource block is reselected as the resource block to be allocated in sequence, and whether the resource block to be allocated is adjacent to the allocated resource block is judged again until all the resource blocks to be allocated in the resource block queue are allocated or all the required resources are acquired in a slicing mode.
After slice resource scheduling, the uRLLC slice, the eMB slice and the mMTC slice respectively obtain continuous and mutually isolated resources to be allocated, so that the user scheduling in the slices is ensured not to interfere with each other.
Referring to fig. 3, the sub-steps of step 203 may be implemented by the following example:
defining a priority, and determining a priority matrix, namely determining the priority sequence of each slice in a resource block to be allocated; selecting an ith resource block to be allocated from the resource block queue; judging whether the resource block to be distributed is adjacent to the distributed resource block of the nth slice; if so, allocating an ith resource block to be allocated to the nth slice, deleting the resource block to be allocated from the resource block queue, otherwise, making i equal to i +1, and returning to the step of selecting the ith resource block to be allocated from the resource block queue; judging whether the nth slice obtains the required resource, if so, judging whether a resource block queue is empty, if not, making i equal to i +1, and returning to the step of selecting the ith resource block to be distributed from the resource block queue; and if the resource block queue is empty, ending the process, otherwise, making n equal to n +1, and returning to the step of selecting the ith resource block to be allocated from the resource block queue.
And step 204, allocating the allocated resource blocks in each slice to each user terminal.
In one example of the present invention, the step 204 may include the following sub-steps:
dividing the allocated resource blocks in each slice into a plurality of resource block groups according to the number of the user terminals;
calculating the user priority of each user terminal in the resource block group;
and sequentially allocating the resource block group to each user terminal based on the user priority until the resource block group is empty.
In the embodiment of the present invention, the scheduling process in a slice may be understood as a logical cell, and the scheduler performs resource scheduling on the resources obtained through slice resource scheduling on the users belonging to the cell. Aiming at the QoS requirements of different data of a 5G metering acquisition site, in the process of scheduling users in slices, performance indexes needing to be comprehensively considered comprise transmission rate, time delay requirements, packet loss rate, data volume to be transmitted and the like.
The allocated resource blocks may be divided into a plurality of resource block groups according to the number of the user terminals in each slice, for example, if the number of the resource blocks to be allocated obtained in a slice is a, and there are B user terminals in a slice, the obtained number M of the resource blocks is a/B. Calculating the user priority of each user terminal on each resource block group, wherein the user priority is related to the highest packet loss rate tolerated by a user, the maximum waiting time delay of the user, the instantaneous transmission rate and the like; the lower the highest loss rate tolerated, the higher the priority; the smaller the maximum waiting time delay is, the higher the user priority is; the higher the instantaneous transmission rate, the better the channel quality conditions, and the higher the priority. And finally, sequentially distributing the resource block groups for each user terminal according to the determined user priority, and ending the resource distribution process until all the resource block groups are distributed.
It is worth mentioning that when the resource block group is allocated to the user terminal, whether the resource block group in the slice is empty can be judged in real time, if yes, the allocation process is ended; if not, the allocation continues.
Referring to fig. 4, fig. 4 is a flow chart illustrating the steps of an allocation process of resource blocks within a slice according to an embodiment of the present invention.
Grouping the resource blocks to be allocated in each slice, calculating the user priority of each user terminal in the resource block group, allocating the resource block group for each user terminal according to the user priority, judging whether the resource blocks to be allocated in the slices are allocated completely, if not, continuing the allocation, and if so, ending the allocation process.
In a specific implementation, if the buffer queue is in an idle state, it indicates that the resource block to be allocated in the scheduling period can satisfy the uplink resource request of the user terminal, and at this time, the resource block to be allocated can be directly allocated to the user terminal through an uplink channel between the base station and the user terminal.
In the embodiment of the invention, a base station receives uplink resource requests sent by a plurality of preset user terminals and judges whether a buffer queue is in an idle state in a preset scheduling period; when the uplink resource scheduling method is not in an idle state, the resource blocks to be allocated are selected from a preset resource block queue and allocated to a plurality of slices, and finally the allocated resource blocks in each slice are allocated to each user terminal, so that the technical problem that the traditional uplink resource scheduling method cannot meet the resource allocation of different services such as low time delay, high reliability, large capacity and the like is solved, the time delay of uplink resource scheduling is reduced, and the reliability of uplink resource scheduling of large-capacity services is improved.
Referring to fig. 5, fig. 5 is a block diagram illustrating a structure of an uplink resource scheduling apparatus according to an embodiment of the present invention.
The embodiment of the invention provides an uplink resource scheduling device, which is applied to a base station, wherein the base station comprises a buffer queue, a plurality of slices and a resource block queue, and the device comprises:
an uplink resource request receiving module 501, configured to receive uplink resource requests sent by multiple preset user terminals;
a state judgment module 502, configured to judge whether the cache queue is in an idle state in a preset scheduling period;
a slice allocating module 503, configured to select a resource block to be allocated from the resource block queue and allocate the resource block to a plurality of slices if the buffer queue is not in the idle state;
a first resource block allocation module 504, configured to allocate the allocated resource blocks in each of the slices to each of the user terminals.
Optionally, the apparatus further comprises:
and the second resource block allocation module is used for allocating the resource blocks to be allocated to the user terminal if the cache queue is in the idle state.
Optionally, the slice allocation module 503 includes:
a priority ranking determining submodule, configured to determine, if the buffer queue is not in the idle state, a priority ranking of each slice in each resource block to be allocated based on a transmission rate of each resource block to be allocated in a preset resource block queue;
the resource block to be distributed selection submodule is used for sequentially selecting the resource blocks to be distributed from the resource block queue according to the priority sequence;
the adjacent relation judgment submodule is used for judging whether the resource block to be distributed is adjacent to the distributed resource block in the slice;
and the slice allocation submodule is used for allocating the resource blocks to be allocated to the slices if the resource blocks to be allocated are adjacent, and deleting the resource blocks to be allocated from the resource block queue until the resource block queue is empty, or all the slices are allocated with the resource blocks to be allocated.
Optionally, the apparatus further comprises:
a resource block reselection submodule, configured to reselect a new resource block to be allocated from the resource block queue in sequence if the resource blocks are not adjacent to each other;
and the returning submodule is used for returning to the step of judging whether the resource block to be allocated is adjacent to the allocated resource block in the slice.
Optionally, the first resource block allocation module 504 includes:
a resource block group division submodule, configured to divide the allocated resource blocks in each slice into a plurality of resource block groups according to the number of the user terminals;
a user priority calculating submodule, configured to calculate a user priority of each user terminal in the resource block group;
and the resource block group allocation sub-module is used for sequentially allocating the resource block groups to each user terminal based on the user priority until the resource block groups are empty.
It is clear to those skilled in the art that, for convenience and brevity of description, the specific working process of the apparatus described above may refer to the corresponding process in the foregoing method embodiment, and is not described herein again.
In the embodiments provided in the present invention, it should be understood that the disclosed apparatus and method may be implemented in other ways. For example, the above-described apparatus embodiments are merely illustrative, and for example, the division of the units is only one logical division, and other divisions may be realized in practice, for example, a plurality of units or components may be combined or integrated into another system, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection through some interfaces, devices or units, and may be in an electrical, mechanical or other form.
The units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units can be selected according to actual needs to achieve the purpose of the solution of the embodiment.
In addition, functional units in the embodiments of the present invention may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit. The integrated unit can be realized in a form of hardware, and can also be realized in a form of a software functional unit.
The above-mentioned embodiments are only used for illustrating the technical solutions of the present invention, and not for limiting the same; although the present invention has been described in detail with reference to the foregoing embodiments, it will be understood by those of ordinary skill in the art that: the technical solutions described in the foregoing embodiments may still be modified, or some technical features may be equivalently replaced; and such modifications or substitutions do not depart from the spirit and scope of the corresponding technical solutions of the embodiments of the present invention.
Claims (10)
1. An uplink resource scheduling method is applied to a base station, wherein the base station comprises a buffer queue, a plurality of slices and a resource block queue, and the method comprises the following steps:
receiving uplink resource requests sent by a plurality of preset user terminals;
judging whether the buffer queue is in an idle state in a preset scheduling period;
if the buffer queue is not in the idle state, selecting a resource block to be allocated from the resource block queue and allocating the resource block to a plurality of slices;
allocating the allocated resource blocks in each of the slices to each of the user terminals.
2. The method of claim 1, further comprising:
and if the cache queue is in the idle state, allocating the resource blocks to be allocated to the user terminal.
3. The method of claim 1, wherein the step of selecting resource blocks to be allocated from the resource block queue and allocating the resource blocks to the plurality of slices if the buffer queue is not in the idle state comprises:
if the buffer queue is not in the idle state, respectively determining the priority sequence of each slice in each resource block to be allocated based on the transmission rate of each resource block to be allocated in a preset resource block queue;
according to the priority sequence, sequentially selecting resource blocks to be distributed from the resource block queue;
judging whether the resource block to be distributed is adjacent to the distributed resource block in the slice;
and if the resource blocks to be distributed are adjacent, distributing the resource blocks to be distributed into the slices, and deleting the resource blocks to be distributed from the resource block queue until the resource block queue is empty, or distributing the resource blocks to be distributed to all the slices.
4. The method of claim 3, further comprising:
if not, reselecting a new resource block to be allocated from the resource block queue in sequence;
and returning to the step of judging whether the resource block to be allocated is adjacent to the allocated resource block in the slice.
5. The method of claim 1, wherein the step of allocating the allocated resource blocks in each of the slices to the user terminal according to a preset user priority comprises:
dividing the allocated resource blocks in each slice into a plurality of resource block groups according to the number of the user terminals;
calculating the user priority of each user terminal in the resource block group;
and sequentially allocating the resource block group to each user terminal based on the user priority until the resource block group is empty.
6. An uplink resource scheduling apparatus, applied to a base station, where the base station includes a buffer queue, multiple slices, and a resource block queue, and the apparatus includes:
an uplink resource request receiving module, configured to receive uplink resource requests sent by multiple preset user terminals;
the state judgment module is used for judging whether the cache queue is in an idle state in a preset scheduling period;
a slice allocation module, configured to select a resource block to be allocated from the resource block queue and allocate the resource block to a plurality of slices if the buffer queue is not in the idle state;
a first resource block allocation module for allocating allocated resource blocks in each of the slices to each of the user terminals.
7. The apparatus of claim 6, further comprising:
and the second resource block allocation module is used for allocating the resource blocks to be allocated to the user terminal if the cache queue is in the idle state.
8. The apparatus of claim 6, wherein the slice assignment module comprises:
a priority ranking determining submodule, configured to determine, if the buffer queue is not in the idle state, a priority ranking of each slice in each resource block to be allocated based on a transmission rate of each resource block to be allocated in a preset resource block queue;
the resource block to be distributed selection submodule is used for sequentially selecting the resource blocks to be distributed from the resource block queue according to the priority sequence;
the adjacent relation judgment submodule is used for judging whether the resource block to be distributed is adjacent to the distributed resource block in the slice;
and the slice allocation submodule is used for allocating the resource blocks to be allocated to the slices if the resource blocks to be allocated are adjacent, and deleting the resource blocks to be allocated from the resource block queue until the resource block queue is empty, or all the slices are allocated with the resource blocks to be allocated.
9. The apparatus of claim 8, further comprising:
a resource block reselection submodule, configured to reselect a new resource block to be allocated from the resource block queue in sequence if the resource blocks are not adjacent to each other;
and the returning submodule is used for returning to the step of judging whether the resource block to be allocated is adjacent to the allocated resource block in the slice.
10. The apparatus of claim 6, wherein the first resource block allocation module comprises:
a resource block group division submodule, configured to divide the allocated resource blocks in each slice into a plurality of resource block groups according to the number of the user terminals;
a user priority calculating submodule, configured to calculate a user priority of each user terminal in the resource block group;
and the resource block group allocation sub-module is used for sequentially allocating the resource block groups to each user terminal based on the user priority until the resource block groups are empty.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011164843.7A CN112333824A (en) | 2020-10-27 | 2020-10-27 | Uplink resource scheduling method and device |
| CN202110154338.2A CN112738901B (en) | 2020-10-27 | 2021-02-04 | Uplink resource scheduling method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011164843.7A CN112333824A (en) | 2020-10-27 | 2020-10-27 | Uplink resource scheduling method and device |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN112333824A true CN112333824A (en) | 2021-02-05 |
Family
ID=74296078
Family Applications (2)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011164843.7A Pending CN112333824A (en) | 2020-10-27 | 2020-10-27 | Uplink resource scheduling method and device |
| CN202110154338.2A Active CN112738901B (en) | 2020-10-27 | 2021-02-04 | Uplink resource scheduling method and device |
Family Applications After (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110154338.2A Active CN112738901B (en) | 2020-10-27 | 2021-02-04 | Uplink resource scheduling method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (2) | CN112333824A (en) |
Family Cites Families (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP2472981B1 (en) * | 2010-12-30 | 2015-03-25 | MIMOON GmbH | Method and apparatus for combined time and frequency domain scheduling |
| CN106793130A (en) * | 2016-12-20 | 2017-05-31 | 南京邮电大学 | A kind of uplink resource allocating method under H2H and M2M terminal coexistence scenes |
| KR20190131150A (en) * | 2018-05-11 | 2019-11-25 | 엘지전자 주식회사 | Method for using ladn in wireless communication system and appatatus therefor |
| CN111278052B (en) * | 2020-01-20 | 2021-09-14 | 重庆大学 | Industrial field data multi-priority scheduling method based on 5G slice |
-
2020
- 2020-10-27 CN CN202011164843.7A patent/CN112333824A/en active Pending
-
2021
- 2021-02-04 CN CN202110154338.2A patent/CN112738901B/en active Active
Also Published As
| Publication number | Publication date |
|---|---|
| CN112738901B (en) | 2023-03-28 |
| CN112738901A (en) | 2021-04-30 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| KR100816598B1 (en) | Signaling method, system, base station and mobile station | |
| CN111278052B (en) | Industrial field data multi-priority scheduling method based on 5G slice | |
| EP3554124A1 (en) | Information transmission method and radio access network device | |
| CN112543508A (en) | Wireless resource allocation method and network architecture for 5G network slice | |
| CN112637911B (en) | Resource allocation method and system for eMB and urllc in coexistence in 5G system | |
| CN113115370B (en) | Resource block configuration method, device and storage medium | |
| Beshley et al. | QoS‐aware optimal radio resource allocation method for machine‐type communications in 5G LTE and beyond cellular networks | |
| EP3001746A1 (en) | Embms management method, multimedia broadcast multicast service coordination entity and base station | |
| KR102615191B1 (en) | Control devices, control methods and programs | |
| WO2014094310A1 (en) | Resource scheduling method and device | |
| CN109743751B (en) | Resource allocation method and device for wireless access network | |
| US20160278111A1 (en) | Service scheduling method and device | |
| KR20160076163A (en) | Method and apparatus for providing differentiated transmitting services | |
| CN106572497B (en) | Heuristic D2D resource allocation method based on proportional fairness algorithm | |
| CN111314997A (en) | Service type-based access network slice selection method and system | |
| CN112702109B (en) | User equipment access method and device, and user equipment switching method and device | |
| CN112333826B (en) | Service admission method and device | |
| CN117354931A (en) | Resource allocation method, device, equipment and storage medium | |
| CN112738901B (en) | Uplink resource scheduling method and device | |
| CN106060945A (en) | LTE resource scheduling algorithm based on RB feedback | |
| CN105764118B (en) | MOCN cell communication method and device | |
| WO2015085562A1 (en) | System, device and method for coordinating load balance | |
| CN111328144B (en) | Wireless resource allocation method, device, readable storage medium and computer equipment | |
| CN111385900B (en) | Uplink scheduling method and device | |
| KR100960109B1 (en) | Method for assigning resource of united system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20210205 |
|
| WD01 | Invention patent application deemed withdrawn after publication |