CN110933688B - Resource control method, device, base station and storage medium - Google Patents
Resource control method, device, base station and storage medium Download PDFInfo
- Publication number
- CN110933688B CN110933688B CN201911141489.3A CN201911141489A CN110933688B CN 110933688 B CN110933688 B CN 110933688B CN 201911141489 A CN201911141489 A CN 201911141489A CN 110933688 B CN110933688 B CN 110933688B
- Authority
- CN
- China
- Prior art keywords
- resource
- resources
- fragments
- occupied
- determining
- 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.)
- Active
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W24/00—Supervisory, monitoring or testing arrangements
- H04W24/02—Arrangements for optimising operational condition
-
- 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 application relates to a resource control method, a device, a base station and a storage medium, wherein the base station acquires the distribution characteristics of each resource fragment in a resource pool of a channel; wherein the distribution characteristics include the size of each resource fragment; then, determining occupied resources of the allocated users in the edge area of the resource pool; determining target resource fragments matched with occupied resources in all the resource fragments according to the distribution characteristics; and finally, adjusting the occupied resources of the allocated users to the positions of the target resource fragments, and releasing the occupied resources in the resource pool. By adopting the method, the resource utilization efficiency in the resource pool can be improved.
Description
Technical Field
The present disclosure relates to the field of communications technologies, and in particular, to a resource control method, an apparatus, a base station, and a storage medium.
Background
With the rapid popularization of mobile network broadband and mobile terminal intellectualization, mobile networks have spread throughout every corner in human society, users have further expectations for mobile communication, and demands for application diversity, quality of service, and business experience are increasing. An uplink control channel is needed to send uplink control information in a new generation mobile communication system to meet the functional requirements of uplink transmission resource request, downlink transmission result response, downlink transmission channel state feedback and the like, so that the uplink control channel needs to meet the reliability of cell capacity and complex channel state, and meanwhile, excessive air interface wireless resources cannot be occupied to avoid influencing the overall throughput rate of an uplink service channel.
In the conventional technology, a base station allocates uplink control channel (Physical Uplink Control Channel, abbreviated PUCCH) resources to a user equipment, and releases the allocated resources after completing data exchange with the user equipment.
However, the above method is easy to form a plurality of radio resource fragments, resulting in low radio resource utilization.
Disclosure of Invention
In view of the foregoing, it is desirable to provide a resource control method, apparatus, base station, and storage medium.
A method of resource control, said method comprising:
acquiring the distribution characteristics of each resource fragment in a resource pool of a channel; the distribution characteristics include the size of each resource fragment;
determining occupied resources of allocated users in an edge area of a resource pool;
determining target resource fragments matched with occupied resources in all the resource fragments according to the distribution characteristics;
and adjusting the occupied resources of the allocated users to the positions of the target resource fragments, and releasing the occupied resources in the resource pool.
In one embodiment, the above-mentioned distribution feature further includes a sum of sizes of the resource fragments; determining occupied resources of allocated users in an edge region of a resource pool comprises:
starting from the boundary of the resource pool, acquiring an edge area matched with the sum of the sizes of the resource fragments;
and in the edge area, acquiring an occupied resource set consisting of occupied resources of all allocated users.
In one embodiment, determining the target resource fragment matched with the occupied resource in the resource fragments includes:
sequencing each occupied resource in the occupied resource set according to the distance between each occupied resource and the boundary;
and determining target resource fragments matched with the size of occupied resources in each resource fragment in sequence according to the sequence from the near to the far.
In one embodiment, determining the target resource fragment matched with the occupied resource in the resource fragments includes:
determining whether an alternative resource fragment which is larger than or equal to the occupied resource exists in each resource fragment;
if yes, determining target resource fragments according to the alternative resource fragments.
In one embodiment, the determining the target resource fragmentation according to the candidate resource fragmentation includes:
determining whether the candidate resource fragment is unique;
if yes, determining the alternative resource fragments as target resource fragments;
if not, determining the resource fragment with the smallest size in the candidate resource fragments as the target resource fragment.
In one embodiment, after determining whether the candidate resource fragments greater than or equal to the occupied resource exist in each resource fragment, the method further includes:
if not, scheduling the resources for the allocated users in the idle resources which are farthest from the boundary of the resource pool.
In one embodiment, the scheduling the resources for the allocated users in the idle resources in the resource pool that are farthest from the boundary of the resource pool includes:
marking the allocated users as secondary allocation users;
after matching occupied resources and resource fragments is completed, scheduling resources for secondary allocation users in idle resources which are farthest from the boundary in a resource pool; the completion of matching the occupied resources and the resource fragments characterizes that each resource fragment in the resource pool is filled, or that no resource fragment matched with the occupied resources exists in each resource fragment.
In one embodiment, the edge area is an area adjacent to a traffic channel in a resource pool, and releasing occupied resources in the resource pool includes:
the occupied resources are adjusted to the resource pool of the traffic channel.
A resource control device, said device comprising:
the acquisition module is used for acquiring the distribution characteristics of each resource fragment in the resource pool of the channel; the distribution characteristics comprise the size and the position of each resource fragment;
the determining module is used for determining occupied resources of the allocated users in the edge area of the resource pool;
the matching module is used for determining target resource fragments matched with occupied resources in the resource fragments according to the distribution characteristics;
and the adjusting module is used for adjusting the resources of the allocated users to the positions of the target resource fragments and releasing occupied resources in the resource pool.
A computer device comprising a memory storing a computer program and a processor implementing the steps of the resource control method when the processor executes the computer program.
A computer readable storage medium having stored thereon a computer program which, when executed by a processor, implements the steps of the resource control method described above.
The resource control method, the device, the base station and the storage medium, wherein the base station acquires the distribution characteristics of each resource fragment in a resource pool of a channel; wherein the distribution characteristics include the size of each resource fragment; then, determining occupied resources of the allocated users in the edge area of the resource pool; determining target resource fragments matched with occupied resources in all the resource fragments according to the distribution characteristics; and finally, adjusting the occupied resources of the allocated users to the positions of the target resource fragments, and releasing the occupied resources in the resource pool. The base station acquires the distribution characteristics of the resource fragments, so that the base station can determine target resource fragments matched with occupied resources in the resource fragments according to the distribution characteristics, thereby adjusting the occupied resources to the positions of the target resource fragments, filling the resource fragments in the resource pool, and improving the resource utilization efficiency in the resource pool; further, the base station can release the resources in the resource pool of the channel to other channels by releasing the occupied resources, so as to complete the integration of the wireless resources.
Drawings
FIG. 1 is a diagram of an application environment for a resource control method in one embodiment;
FIG. 2 is a flow diagram of a method of resource control in one embodiment;
FIG. 3 is a flow chart of a method of controlling resources according to another embodiment;
FIG. 4 is a flow chart of a method of controlling resources according to another embodiment;
FIG. 5 is a schematic diagram of resources occupied in one embodiment;
FIG. 6 is a schematic diagram of a target resource fragment in one embodiment;
FIG. 7 is a block diagram of a resource control device in one embodiment;
FIG. 8 is a block diagram illustrating a resource control device in another embodiment;
FIG. 9 is a block diagram illustrating a resource control device in another embodiment;
FIG. 10 is a block diagram illustrating a resource control device in another embodiment;
FIG. 11 is a block diagram illustrating a resource control device according to another embodiment;
fig. 12 is an internal structural diagram of a base station in one embodiment.
Detailed Description
In order to make the objects, technical solutions and advantages of the present application more apparent, the present application will be further described in detail with reference to the accompanying drawings and examples. It should be understood that the specific embodiments described herein are for purposes of illustration only and are not intended to limit the present application.
The resource scheduling method provided by the application can be applied to an application environment shown in fig. 1, and the base station 100 is in communication connection with the terminal equipment 200. The terminal 200 may be, but is not limited to, various personal computers, notebook computers, smart phones, tablet computers, portable wearable devices, and the like. The base station may be, but not limited to, a macro base station, a micro base station, a small base station, or other base station devices, and may be a base station (Base Transceiver Station, BTS) in global mobile communications (Global System of Mobile communication, abbreviated GSM) or code division multiple access (Code Division Multiple Access, abbreviated CDMA), a base station (NodeB, NB) in wideband code division multiple access (Wideband Code Division Multiple Access, abbreviated WCDMA), an evolved base station (Evolutional Node B, eNB or eNodeB) in LTE, or a relay station or access point, or a base station in future 5G network, customer premise equipment (Customer Premise Equipment, CPE), or the like.
In one embodiment, as shown in fig. 2, a resource control method is provided, which is illustrated by taking an example that the method is applied to the base station in fig. 1, and includes:
s101, obtaining the distribution characteristics of each resource fragment in a resource pool of a channel; the distribution characteristics include the size of each resource fragment.
The channel may be an uplink shared channel or an uplink control channel, and the type of the channel is not limited herein.
The resource fragmentation is generated during the process that the resources in the resource pool are continuously allocated and released, for example, the base station allocates the resource a to one user equipment in the resource pool, after the user equipment completes data transmission, the base station releases the resource a and allocates the resource to another user equipment in subsequent scheduling, and the size of the resource required by the other user equipment is smaller than that of the resource a, thereby generating the fragmentation at the resource position. With the continuous scheduling of resources in the resource pool, the increase of resource fragments reduces the resource utilization rate.
The distribution feature may be the size of each resource fragment in the resource pool of the channel, may also include the position of each resource fragment, and may also include the frequency domain bandwidth corresponding to each resource fragment, the time slot size in the time domain, and the like, where the specific type of the distribution feature is not limited herein.
When the base station obtains the distribution characteristics of the resource fragments, the base station can obtain the unscheduled resource position according to the resource scheduling result, then further determine whether the resource of the resource position is a resource fragment, and determine the size and the position of the resource fragment; in addition, the base station may search the resource pool for resource fragments according to the frequency domain sequence or the time domain sequence, and further obtain the distribution characteristics such as the size of the resource fragments, and the method for obtaining the distribution characteristics is not limited herein.
S102, determining occupied resources of the allocated users in the edge area of the resource pool.
The edge area refers to a resource area adjacent to a resource pool of other channels in the resource pool of the channel. The range of the edge area may be an area range that the base station may divide according to a preset size from a boundary of the resource pool; the range of the edge area may be determined according to the number of resource fragments, and the specific range of the edge area is not limited herein.
The allocated users refer to devices for which the current base station has allocated resources, and may be, but not limited to, various personal computers, notebook computers, smart phones, tablet computers, portable wearable devices, and the like.
The allocated user in the edge area may be one user device or a plurality of user devices in the edge area, or may be all user devices in the edge area, which is not limited herein.
When determining the occupied resources of the allocated users, the base station may determine which resources in the edge area are the scheduled resources according to the resource scheduling result, or may search in the edge area to obtain the resources, and the determination manner of the occupied resources is not limited herein.
S103, determining target resource fragments matched with occupied resources in the resource fragments according to the distribution characteristics.
Based on the above steps, the base station can match the resource fragments with occupied resources according to the distribution characteristics, and determine the target resource fragments corresponding to the occupied resources.
Specifically, the base station may acquire occupied resources matched with the size of the resource fragments according to the size sequence of the resource fragments, and determine the resource fragments as target resource fragments of the occupied resources; in addition, the base station may obtain the target resource fragments matching the size of the occupied resources according to the position arrangement order of the occupied resources, and the determination method is not limited herein.
S104, adjusting the occupied resources of the allocated users to the positions of the target resource fragments, and releasing the occupied resources in the resource pool.
After determining the target resource fragments matched with the occupied resources, the base station can adjust the occupied resources of the allocated users to the positions of the target resource fragments so that the target resource fragments can be filled and used; further, the base station releases the occupied resources in the resource pool, so that the occupied resources can be converted into idle resources, and the idle resources can be scheduled again.
Specifically, when the base station releases the occupied resources, the occupied resources may be adjusted to be idle resources, or the occupied resources may be adjusted to be in a resource pool of other channels, which is not limited herein.
Optionally, the edge area is an area adjacent to the service channel in the resource pool, and when the base station releases the occupied resource in the resource pool, the occupied resource can be adjusted to the resource pool of the service channel, so that the available resource in the service channel can be improved, and the cell capacity and the service throughput rate can be improved.
According to the resource control method, the base station acquires the distribution characteristics of each resource fragment in the resource pool of the channel; wherein the distribution characteristics include the size of each resource fragment; then, determining occupied resources of the allocated users in the edge area of the resource pool; determining target resource fragments matched with occupied resources in all the resource fragments according to the distribution characteristics; and finally, adjusting the occupied resources of the allocated users to the positions of the target resource fragments, and releasing the occupied resources in the resource pool. The base station acquires the distribution characteristics of the resource fragments, so that the base station can determine target resource fragments matched with occupied resources in the resource fragments according to the distribution characteristics, thereby adjusting the occupied resources to the positions of the target resource fragments, filling the resource fragments in the resource pool, and improving the resource utilization efficiency in the resource pool; further, the base station can release the resources in the resource pool of the channel to other channels by releasing the occupied resources, so as to complete the integration of the wireless resources.
Fig. 3 is a flowchart of a resource control method in another embodiment, where the embodiment relates to a specific manner in which the base station determines the occupied resources of the allocated users, and on the basis of the above embodiment, as shown in fig. 3, the step S102 includes:
s201, starting from the boundary of the resource pool, acquiring an edge area matched with the sum of the sizes of the resource fragments.
Specifically, when determining the edge region, the base station may determine according to the sum of the sizes of the resource fragments, so that the resource fragments may be filled by occupied resources in the edge region, so that the resource fragments may be filled as much as possible. The base station may determine, starting from the boundary of the resource pool, an area matching the size of the sum as an edge area.
S202, in the edge area, acquiring an occupied resource set composed of occupied resources of all allocated users.
Further, the base station may acquire occupied resources of all allocated users in the edge area. Specifically, the base station may determine whether the resources in the resource pool are scheduled, then determine the resources occupied by the same allocated user as one occupied resource, and acquire the occupied resources of all allocated users according to the above procedure.
In the occupied resource set acquired by the base station, each occupied resource may be ordered according to the distance between the resource and the boundary of the resource pool, or may be ordered according to the size of the occupied resource, which is not limited herein.
According to the resource control method, the base station determines the edge area according to the sum of the sizes of the resource fragments, so that the resource fragments can be filled through occupied resources in the edge area, the resource fragments can be filled as much as possible, and the utilization rate of the resources is effectively improved.
Fig. 4 is a flowchart of a resource control method in another embodiment, where the embodiment relates to a specific manner of determining a target resource fragment by a base station, and on the basis of the above embodiment, as shown in fig. 4, the step S103 includes:
s301, sorting all occupied resources in the occupied resource set according to the distance between all occupied resources and the boundary.
Specifically, the base station may sort the occupied resources in the occupied resource set according to the distance between the occupied resources and the boundary. For example, as shown in fig. 5, the base station may number each occupied resource from the boundary position of the resource pool to obtain an occupied resource set composed of 15 occupied resources shown in fig. 5, where a smaller number indicates that the occupied resource is closer to the boundary; further, the base station may register the size of each occupied resource.
S302, determining target resource fragments matched with the size of occupied resources in all the resource fragments in sequence according to the sequence from the near to the far.
Further, the base station may determine, in sequence from near to far, a target resource fragment matching the size of the occupied resource among the resource fragments according to the distance between each occupied resource and the boundary. Because the boundary of the resource pool is fixed, after determining the target resource fragments corresponding to the occupied resources close to the boundary, the base station can gradually release the occupied resources near the boundary in the process of controlling the resources, thereby completing the adjustment of the boundary of the resource pool, and enabling the resources in the resource pool to be adjusted to the resources of other channels.
Specifically, when determining a target resource fragment occupying resources, the base station may determine whether an alternative resource fragment greater than or equal to the occupied resources exists in each resource fragment; if yes, determining target resource fragments according to the alternative resource fragments.
When determining the target resource fragment according to the candidate resource fragment, the base station may randomly select one resource fragment from the candidate resource fragments to determine the target resource fragment, or may determine the first obtained candidate resource fragment as the target resource fragment, which is not limited herein.
Alternatively, the base station may determine whether the alternative resource shard is unique; if yes, determining the alternative resource fragments as target resource fragments; if not, determining the resource fragment with the smallest size in the candidate resource fragments as the target resource fragment.
According to the resource control method, the base station sequentially determines the target resource fragments matched with the occupied resources in size in each resource fragment according to the distance between each occupied resource and the boundary, and can release the occupied resources near the boundary to finish the adjustment of the boundary of the resource pool, so that the resources in the resource pool can be adjusted to resources of other channels.
In one embodiment, after determining that there are no more than or equal to the candidate resource fragments occupying the resource in each resource fragment, the base station may schedule the resource for the allocated user in the idle resource in the resource pool that is farthest from the boundary of the resource pool.
Specifically, when the occupied resource of the allocated user does not have the alternative resource fragments, the base station may mark the allocated user as a secondary allocation user; after matching the occupied resources and the resource fragments, scheduling resources for secondary allocation users in idle resources which are farthest from the boundary in a resource pool; the completion of matching the occupied resources and the resource fragments characterizes that each resource fragment in the resource pool is filled, or that no resource fragment matched with the occupied resources exists in each resource fragment.
Further, if the secondary allocation users are a plurality of user equipments, the base station may schedule resources for each secondary allocation user in turn according to the distance between the occupied resources corresponding to each secondary allocation user and the resource boundary.
Continuing taking the resource pool in fig. 5 as an example, the base station may sequentially determine target resource fragments corresponding to the occupied resources numbered 1-15, obtain target resource fragments corresponding to occupied resources except the occupied resource number 10, and complete matching of the occupied resources and the resource fragments; then, the base station may respectively correspond each resource fragment to each number, as shown in fig. 6, so that the resource fragments in the resource pool may be filled. Further, the base station can adjust the successfully matched occupied resources to the positions of the corresponding target resource fragments, and release the occupied resources in the resource pool, so that the positions of the original occupied resources are free; then, the base station can adjust the number 10 occupied resources which are not successfully matched to the idle resources which are farthest from the boundary.
According to the resource control method, when the alternative resource fragments matched with the occupied resources do not exist in the resource fragments, the base station schedules the resources for the allocated users in the idle resources with the farthest boundary distance from the resource pool in the resource pool, so that the size of the idle resource area at the boundary of the resource pool is larger, more resources are released, and the resource utilization efficiency is improved.
It should be understood that, although the steps in the flowcharts of fig. 2-4 are shown in order as indicated by the arrows, these steps are not necessarily performed in order as indicated by the arrows. The steps are not strictly limited to the order of execution unless explicitly recited herein, and the steps may be executed in other orders. Moreover, at least some of the steps in fig. 2-4 may include multiple sub-steps or stages that are not necessarily performed at the same time, but may be performed at different times, nor do the order in which the sub-steps or stages are performed necessarily occur sequentially, but may be performed alternately or alternately with at least a portion of the sub-steps or stages of other steps or steps.
In one embodiment, as shown in fig. 7, there is provided a resource control apparatus including: an acquisition module 10, a determination module 20, a matching module 30 and an adjustment module 40, wherein:
an obtaining module 10, configured to obtain a distribution characteristic of each resource fragment in a resource pool of a channel; the distribution characteristics comprise the size and the position of each resource fragment;
a determining module 20, configured to determine occupied resources of allocated users in an edge area of the resource pool;
a matching module 30, configured to determine, according to the distribution characteristics, a target resource fragment that matches the occupied resource from among the resource fragments;
and the adjusting module 40 is configured to adjust the resources of the allocated users to the positions of the target resource fragments, and release occupied resources in the resource pool.
The resource control device provided in the embodiment of the present application may implement the above method embodiment, and its implementation principle and technical effects are similar, and are not described herein again.
In one embodiment, as shown in fig. 8, the distribution feature further includes a sum of sizes of the resource fragments, and the determining module 20 includes:
a first obtaining unit 201, configured to obtain, from a boundary of the resource pool, an edge area that matches a sum of sizes of resource fragments;
the second obtaining unit 202 is configured to obtain, in the edge area, an occupied resource set composed of occupied resources of all allocated users.
In one embodiment, as shown in fig. 9, on the basis of the above embodiment, the matching module 30 includes:
a sorting unit 301, configured to sort each occupied resource in the occupied resource set according to the distance between each occupied resource and the boundary;
a matching unit 302, configured to sequentially determine, according to the order from the near to the far, a target resource fragment matching the size of the occupied resource from among the resource fragments.
In one embodiment, as shown in fig. 10, on the basis of the above embodiment, the matching module 30 includes:
a first determining unit 303, configured to determine whether there is an alternative resource fragment greater than or equal to the occupied resource in each resource fragment;
the second determining unit 304 is configured to determine a target resource fragment according to the candidate resource fragment when there is a candidate resource fragment greater than or equal to the occupied resource.
In one embodiment, based on the above embodiment, the second determining unit 304 is specifically configured to:
determining whether the candidate resource fragment is unique; if yes, determining the alternative resource fragments as target resource fragments; if not, determining the resource fragment with the smallest size in the candidate resource fragments as the target resource fragment.
In an embodiment, as shown in fig. 11, on the basis of the foregoing embodiment, the apparatus further includes a scheduling module 50, configured to schedule, when there is no alternative resource fragment greater than or equal to the occupied resource, the resource for the allocated user in the free resource in the resource pool that is farthest from the boundary of the resource pool.
In one embodiment, the scheduling module 50 is specifically configured to mark the allocated users as secondary allocation users based on the above embodiments; after matching occupied resources and resource fragments is completed, scheduling resources for secondary allocation users in idle resources which are farthest from the boundary in a resource pool; the completion of matching the occupied resources and the resource fragments characterizes that each resource fragment in the resource pool is filled, or that no resource fragment matched with the occupied resources exists in each resource fragment.
In one embodiment, the adjusting module 50 is specifically configured to adjust the occupied resources to the resource pool of the traffic channel based on the above embodiment.
For specific limitations of the resource control device, reference may be made to the above limitation of the resource control method, and the detailed description thereof will be omitted. The respective modules in the above-described resource control apparatus may be implemented in whole or in part by software, hardware, and combinations thereof. The above modules may be embedded in hardware or may be independent of a processor in the computer device, or may be stored in software in a memory in the computer device, so that the processor may call and execute operations corresponding to the above modules.
In one embodiment, a base station is provided, the internal structure of which may be as shown in fig. 12. The base station apparatus includes a processor, a memory, a network interface, and a database connected by a system bus. Wherein the processor of the base station device is configured to provide computing and control capabilities. The memory of the base station device includes a nonvolatile storage medium and an internal memory. The non-volatile storage medium stores an operating system, computer programs, and a database. The internal memory provides an environment for the operation of the operating system and computer programs in the non-volatile storage media. The database of the base station device is used for storing resource scheduling data. The network interface of the base station device is used for communicating with an external terminal through a network connection. The computer program is executed by a processor to implement a resource scheduling method.
It will be appreciated by those skilled in the art that the structure shown in fig. 12 is merely a block diagram of a portion of the structure associated with the present application and is not limiting of the base station apparatus to which the present application is applied, and that a particular base station apparatus may include more or fewer components than shown, or may combine certain components, or have a different arrangement of components.
In one embodiment, a base station is provided, comprising a memory and a processor, the memory having stored therein a computer program, the processor, when executing the computer program, performing the steps of:
acquiring the distribution characteristics of each resource fragment in a resource pool of a channel; the distribution characteristics include the size of each resource fragment;
determining occupied resources of allocated users in an edge area of a resource pool;
determining target resource fragments matched with occupied resources in all the resource fragments according to the distribution characteristics;
and adjusting the occupied resources of the allocated users to the positions of the target resource fragments, and releasing the occupied resources in the resource pool.
In one embodiment, the processor when executing the computer program further performs the steps of: starting from the boundary of the resource pool, acquiring an edge area matched with the sum of the sizes of the resource fragments; and in the edge area, acquiring an occupied resource set consisting of occupied resources of all allocated users.
In one embodiment, the processor when executing the computer program further performs the steps of: sequencing each occupied resource in the occupied resource set according to the distance between each occupied resource and the boundary; and determining target resource fragments matched with the size of occupied resources in each resource fragment in sequence according to the sequence from the near to the far.
In one embodiment, the processor when executing the computer program further performs the steps of: determining whether an alternative resource fragment which is larger than or equal to the occupied resource exists in each resource fragment; if yes, determining target resource fragments according to the alternative resource fragments.
In one embodiment, the processor when executing the computer program further performs the steps of: determining whether the candidate resource fragment is unique; if yes, determining the alternative resource fragments as target resource fragments; if not, determining the resource fragment with the smallest size in the candidate resource fragments as the target resource fragment.
In one embodiment, the processor when executing the computer program further performs the steps of: if not, scheduling the resources for the allocated users in the idle resources which are farthest from the boundary of the resource pool.
In one embodiment, the processor when executing the computer program further performs the steps of: marking the allocated users as secondary allocation users; after matching occupied resources and resource fragments is completed, scheduling resources for secondary allocation users in idle resources which are farthest from the boundary in a resource pool; the completion of matching the occupied resources and the resource fragments characterizes that each resource fragment in the resource pool is filled, or that no resource fragment matched with the occupied resources exists in each resource fragment.
In one embodiment, the processor when executing the computer program further performs the steps of: the occupied resources are adjusted to the resource pool of the traffic channel.
The computer device provided in this embodiment has similar implementation principles and technical effects to those of the above method embodiment, and will not be described herein.
In one embodiment, a computer readable storage medium is provided having a computer program stored thereon, which when executed by a processor, performs the steps of:
acquiring the distribution characteristics of each resource fragment in a resource pool of a channel; the distribution characteristics include the size of each resource fragment;
determining occupied resources of allocated users in an edge area of a resource pool;
determining target resource fragments matched with occupied resources in all the resource fragments according to the distribution characteristics;
and adjusting the occupied resources of the allocated users to the positions of the target resource fragments, and releasing the occupied resources in the resource pool.
In one embodiment, the computer program when executed by the processor further performs the steps of: starting from the boundary of the resource pool, acquiring an edge area matched with the sum of the sizes of the resource fragments; and in the edge area, acquiring an occupied resource set consisting of occupied resources of all allocated users.
In one embodiment, the computer program when executed by the processor further performs the steps of: sequencing each occupied resource in the occupied resource set according to the distance between each occupied resource and the boundary; and determining target resource fragments matched with the size of occupied resources in each resource fragment in sequence according to the sequence from the near to the far.
In one embodiment, the computer program when executed by the processor further performs the steps of: determining whether an alternative resource fragment which is larger than or equal to the occupied resource exists in each resource fragment; if yes, determining target resource fragments according to the alternative resource fragments.
In one embodiment, the computer program when executed by the processor further performs the steps of: determining whether the candidate resource fragment is unique; if yes, determining the alternative resource fragments as target resource fragments; if not, determining the resource fragment with the smallest size in the candidate resource fragments as the target resource fragment.
In one embodiment, the computer program when executed by the processor further performs the steps of: if not, scheduling the resources for the allocated users in the idle resources which are farthest from the boundary of the resource pool.
In one embodiment, the computer program when executed by the processor further performs the steps of: marking the allocated users as secondary allocation users; after matching occupied resources and resource fragments is completed, scheduling resources for secondary allocation users in idle resources which are farthest from the boundary in a resource pool; the completion of matching the occupied resources and the resource fragments characterizes that each resource fragment in the resource pool is filled, or that no resource fragment matched with the occupied resources exists in each resource fragment.
In one embodiment, the computer program when executed by the processor further performs the steps of: the occupied resources are adjusted to the resource pool of the traffic channel.
The computer readable storage medium provided in this embodiment has similar principles and technical effects to those of the above method embodiment, and will not be described herein.
Those skilled in the art will appreciate that implementing all or part of the above described methods may be accomplished by way of a computer program stored on a non-transitory computer readable storage medium, which when executed, may comprise the steps of the embodiments of the methods described above. Any reference to memory, storage, database, or other medium used in the various embodiments provided herein may include non-volatile and/or volatile memory. The nonvolatile memory can include Read Only Memory (ROM), programmable ROM (PROM), electrically Programmable ROM (EPROM), electrically Erasable Programmable ROM (EEPROM), or flash memory. Volatile memory can include Random Access Memory (RAM) or external cache memory. By way of illustration and not limitation, RAM is available in a variety of forms such as Static RAM (SRAM), dynamic RAM (DRAM), synchronous DRAM (SDRAM), double Data Rate SDRAM (DDRSDRAM), enhanced SDRAM (ESDRAM), synchronous Link DRAM (SLDRAM), memory bus direct RAM (RDRAM), direct memory bus dynamic RAM (DRDRAM), and memory bus dynamic RAM (RDRAM), among others.
The technical features of the above embodiments may be arbitrarily combined, and all possible combinations of the technical features in the above embodiments are not described for brevity of description, however, as long as there is no contradiction between the combinations of the technical features, they should be considered as the scope of the description.
The above examples merely represent a few embodiments of the present application, which are described in more detail and are not to be construed as limiting the scope of the invention. It should be noted that it would be apparent to those skilled in the art that various modifications and improvements could be made without departing from the spirit of the present application, which would be within the scope of the present application. Accordingly, the scope of protection of the present application is to be determined by the claims appended hereto.
Claims (11)
1. A method of resource control, the method comprising:
acquiring the distribution characteristics of each resource fragment in a resource pool of a channel; the distribution characteristics include a size of each of the resource fragments;
determining occupied resources of allocated users in an edge area of the resource pool;
determining target resource fragments matched with the occupied resources in the resource fragments according to the distribution characteristics; the method specifically comprises the following steps: acquiring the target resource fragments matched with the sizes of the occupied resources according to the position arrangement sequence of the occupied resources;
and adjusting the occupied resources of the allocated users to the positions of the target resource fragments, and releasing the occupied resources in the resource pool.
2. The resource control method of claim 1, wherein the distribution characteristics further comprise a sum of sizes of the resource fragments; the determining the occupied resources of the allocated users in the edge area of the resource pool comprises the following steps:
starting from the boundary of the resource pool, acquiring an edge area matched with the sum of the sizes of the resource fragments;
and in the edge area, acquiring an occupied resource set consisting of occupied resources of all allocated users.
3. The method of claim 2, wherein determining a target resource fragment in each of the resource fragments that matches the occupied resource comprises:
sorting the occupied resources in the occupied resource set according to the distance between the occupied resources and the boundary;
and determining target resource fragments matched with the size of the occupied resource in each resource fragment in sequence according to the sequence from the near to the far.
4. A method of controlling resources according to any of claims 1-3, wherein said determining a target resource fragment in each of said resource fragments that matches said occupied resources comprises:
determining whether alternative resource fragments larger than or equal to the occupied resources exist in each resource fragment;
if yes, determining the target resource fragments according to the alternative resource fragments.
5. The resource control method of claim 4, wherein the determining the target resource shard from the candidate resource shard comprises:
determining whether the candidate resource shard is unique;
if yes, determining the alternative resource fragments as the target resource fragments;
if not, determining the resource fragment with the smallest size in the candidate resource fragments as the target resource fragment.
6. The method of claim 4, wherein the determining whether the candidate resource fragments greater than or equal to the occupied resource exist in each of the resource fragments further comprises:
if not, scheduling resources for the allocated users in idle resources which are farthest from the boundary of the resource pool in the resource pool.
7. The method of claim 6, wherein the scheduling resources for the allocated users in the free resources in the resource pool that are farthest from the boundary of the resource pool comprises:
marking the allocated users as secondary allocation users;
after the occupied resources and the resource fragments are matched, scheduling resources for the secondary allocation users in idle resources farthest from the boundary in the resource pool; the completion matching the occupied resource with the resource shards characterizes that each of the resource shards in the resource pool has been filled, or that there is no resource shard in each of the resource shards that matches the occupied resource.
8. A method of controlling resources according to any of claims 1-3, wherein the edge region is a region of the resource pool adjacent to a traffic channel, and the releasing the occupied resources in the resource pool comprises:
and adjusting the occupied resources to a resource pool of the service channel.
9. A resource control apparatus, the apparatus comprising:
the acquisition module is used for acquiring the distribution characteristics of each resource fragment in the resource pool of the channel; the distribution characteristics include the size and location of each of the resource patches;
a determining module, configured to determine occupied resources of allocated users in an edge area of the resource pool;
the matching module is used for determining target resource fragments matched with the occupied resources in the resource fragments according to the distribution characteristics; the method is particularly used for: acquiring the target resource fragments matched with the sizes of the occupied resources according to the position arrangement sequence of the occupied resources;
and the adjusting module is used for adjusting the resources of the allocated users to the positions of the target resource fragments and releasing the occupied resources in the resource pool.
10. A base station comprising a memory and a processor, the memory storing a computer program, characterized in that the processor implements the steps of the method of any of claims 1 to 8 when the computer program is executed.
11. A computer readable storage medium, on which a computer program is stored, characterized in that the computer program, when being executed by a processor, implements the steps of the method of any of claims 1 to 8.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911141489.3A CN110933688B (en) | 2019-11-20 | 2019-11-20 | Resource control method, device, base station and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911141489.3A CN110933688B (en) | 2019-11-20 | 2019-11-20 | Resource control method, device, base station and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110933688A CN110933688A (en) | 2020-03-27 |
| CN110933688B true CN110933688B (en) | 2023-08-04 |
Family
ID=69850475
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201911141489.3A Active CN110933688B (en) | 2019-11-20 | 2019-11-20 | Resource control method, device, base station and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110933688B (en) |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101790234A (en) * | 2010-02-11 | 2010-07-28 | 上海华为技术有限公司 | Up signaling resource configuration method, system and device |
| CN108834216A (en) * | 2018-05-24 | 2018-11-16 | 京信通信系统（中国）有限公司 | A kind of resource regulating method and device |
| WO2019141370A1 (en) * | 2018-01-18 | 2019-07-25 | Nokia Solutions And Networks Oy | Resource allocation policy signaling |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102316590A (en) * | 2010-07-07 | 2012-01-11 | 中兴通讯股份有限公司 | Method and base station side equipment for resource defragmentation in long term evolution system |
| CN103312430B (en) * | 2012-03-06 | 2016-06-15 | 京信通信系统（中国）有限公司 | Resource integrated method and device |
| CN109151830B (en) * | 2017-06-15 | 2022-07-29 | 华为技术有限公司 | Method, device, equipment and system for frequency spectrum arrangement |
-
2019
- 2019-11-20 CN CN201911141489.3A patent/CN110933688B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101790234A (en) * | 2010-02-11 | 2010-07-28 | 上海华为技术有限公司 | Up signaling resource configuration method, system and device |
| WO2019141370A1 (en) * | 2018-01-18 | 2019-07-25 | Nokia Solutions And Networks Oy | Resource allocation policy signaling |
| CN108834216A (en) * | 2018-05-24 | 2018-11-16 | 京信通信系统（中国）有限公司 | A kind of resource regulating method and device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110933688A (en) | 2020-03-27 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US11290889B2 (en) | Method, apparatus, and computer readable storage medium for resource allocation among network slices | |
| US20200178305A1 (en) | System information transmission method, terminal and network device | |
| US11115963B2 (en) | Method and device for multiplexing uplink grant resources | |
| US20200178275A1 (en) | Method And Apparatus For Initiating Random Access Process | |
| JP2020534713A (en) | Signal transmission method and terminal device | |
| CN110621072B (en) | Resource scheduling method, device, base station equipment and storage medium | |
| US10880916B2 (en) | Resource scheduling method and apparatus for logical channel | |
| CN109068389B (en) | Narrowband Internet of things resource allocation method and device and base station | |
| CN110913487B (en) | Resource allocation method, device, base station and storage medium | |
| CN111163525B (en) | Resource scheduling method, device, base station equipment and storage medium | |
| CN110933688B (en) | Resource control method, device, base station and storage medium | |
| US20190166595A1 (en) | Information Transmission Method and Related Apparatus | |
| CN110636632B (en) | User scheduling method, device, base station and storage medium | |
| CN108495335B (en) | Cell resource allocation method, device, base station and storage medium | |
| CN110996397B (en) | Resource scheduling method, device, base station and storage medium | |
| CN112566258B (en) | Resource scheduling method, device, base station equipment and storage medium | |
| CN111819902B (en) | Random access method and device | |
| WO2018227596A1 (en) | Time domain resource indication method, data transmission method and device and communication system | |
| CN112788634B (en) | Communication system, method, apparatus, computer device, and storage medium | |
| CN112566259B (en) | Data transmission method, device, base station and storage medium | |
| CN109068392B (en) | User scheduling method, device and base station | |
| CN111342946B (en) | Frequency band combination reporting method and device, computer equipment and storage medium | |
| RU2735672C1 (en) | Method and device for transmitting data | |
| WO2018227459A1 (en) | Method for allocating resources to logical channel, and terminal device | |
| US10091797B2 (en) | Differentiated adaptation of selection probabilities for frequency channel selection |
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 | ||
| CB02 | Change of applicant information |
Address after: 510663 Shenzhou Road 10, Guangzhou Science City, Guangzhou economic and Technological Development Zone, Guangzhou, Guangdong Applicant after: Jingxin Network System Co.,Ltd. Address before: 510663 Shenzhou Road 10, Guangzhou Science City, Guangzhou economic and Technological Development Zone, Guangzhou, Guangdong Applicant before: COMBA TELECOM SYSTEMS (CHINA) Ltd. |
|
| CB02 | Change of applicant information | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |