WO2013053220A1

WO2013053220A1 - Resource allocation method, device and base station

Info

Publication number: WO2013053220A1
Application number: PCT/CN2012/074174
Authority: WO
Inventors: 章正权
Original assignee: 中兴通讯股份有限公司
Priority date: 2011-10-14
Filing date: 2012-04-17
Publication date: 2013-04-18
Also published as: CN102333379A; CN102333379B

Abstract

Disclosed are a resource allocation method, device and base station. The method comprises: when a base station acquires that a first user equipment (UE) requests resource allocation, allocating a resource to the first UE through a resource algorithm; the base station determining whether the resource allocation is successful, and when it is determined that resource allocation is failed, selecting a second UE in a cell according to a predetermined condition; the base station recycling the resource of the second UE, and allocating the recycled resource of the second UE to the first UE. By means of the present invention, in the case that a UE fails to request resource allocation, through sorting according to priority levels in a cell, the resource of a UE with a low priority level is forcefully moved to a UE with a high priority level, thereby solving the problem of no idle resource for allocation when a high priority user requests resource allocation.

Description

Resource allocation method, device and base station

The present invention relates to the field of communications, and relates to a resource allocation method in an LTE (Long Term Evolution) communication system, and more particularly, to a resource allocation method, apparatus, and base station. Background technique

In the LTE communication system, when the RRC (Radio Resource Control) connection is established, the eNodeB (Evolved NodeB) needs to allocate related physical resources to the UE (User Equipment) and connect through the RRC. A setup message or an RRC connection reconfiguration message is brought to the UE. The physical resources that the eNodeB needs to allocate for the UE include: 1) uplink physical layer control information carried by the PUCCH (Physical Uplink Control Channel), including an uplink scheduling request, and ACK/NACK for the downlink data (acknowledgment/non-acknowledgement) Information and CSI (Channel State Information) feedback;

2) Channel sounding reference signals, etc.

UE in the specified CQI (Channel Quality Indicator) / PMI

(Precoding Matrix Indicator) / RI ( Rank Indication) The CQI/PMI/RI information is reported on the time and frequency resources respectively. The eNodeB selects a corresponding MCS (Modulation and Coding Scheme) according to the reported CQI, and is used for downlink scheduling and rate adaptation. In the LTE system, MIMO (Multiple Input Multiple Output) technology is introduced, and precoding is used to implement mapping from "Layer" to "Physical Antenna Port". In the closed loop mode, the UE selects the appropriate number of layers of spatial multiplexing by measuring the state of the downlink channel, and selects a precoding vector from the codebook set, which is expressed in the form of RI and PMI, respectively, at the specified time and frequency resources. Reported to the eNodeB. eNodeB based on this information The prediction determines the spatial multiplexing scheme to be used in subsequent downlink data transmission, including the number of layers employed and the precoding vector. The UE reports the SR (Scheduling Request) information on the specified time and frequency resources. The eNodeB performs uplink scheduling based on the SR information reported by the UE. The UE reports ACK/NACK information on the specified ACK/NACK resource. The eNodeB determines whether to retransmit the downlink data packet based on the ACK/NACK reported by the UE. The UE transmits an SRS (Sounding Reference Signal) at a specified time and frequency resource. The eNodeB measures the state of the uplink channel by demodulating the signal for adaptive scheduling of uplink data transmission.

The physical resources required for the UE to send the uplink control information and the channel sounding reference signal are allocated by the base station and are brought to the UE by the RRC connection setup message or the RRC connection reconfiguration message when the RRC connection is established. Due to the limited physical resources of the system, if the number of UEs in the system is too large, some UEs may not be able to allocate physical resources temporarily, which may affect the performance of the UE. There are two problems with the current physical resource allocation method:

1) The physical resources that are vacant in the case of UE release or the like cannot be allocated to the UEs that are not allocated physical resources in the system, which reduces the usage rate of physical resources;

2) When a high-priority user accesses, the physical resource allocation fails if there is no free physical resource, which affects the performance of the UE and affects the experience of the high-priority user.

Therefore, in the prior art, there is a problem that the idle physical resource is not allocated to the UE for use, or the high-priority user access may have no free physical resources to be allocated. Currently, no good solution has been proposed for this problem. . Summary of the invention

The embodiment of the present invention provides a resource allocation method, a device, and a base station, which are used to solve the problem that the idle physical resource in the prior art is not allocated to the UE and the high-priority user access may be free. problem.

For the purpose of implementing the embodiments of the present invention, according to an aspect of the embodiments of the present invention, a resource allocation method is provided, and the following technical solutions are adopted: The resource allocation method includes: when acquiring the resource allocation by the first UE, the base station performs resource allocation for the first UE by using a resource algorithm; the base station determines whether the resource allocation is successful, and selects the cell in the cell according to a preset condition when determining that the resource allocation fails. a second UE; the base station recovers resources of the second UE, and allocates the resources of the recovered second UE to the first UE.

Preferably, the selecting the second UE in the cell according to the preset condition comprises: the base station sorting all the UEs that have been accessed in the cell according to the priority from the smallest to the largest, generating the first UE list; and sequentially traversing the first UE list. A UE with a lower priority than the first UE and acquiring resources is selected as the second UE.

Preferably, performing resource allocation for the first UE by using the resource algorithm includes: dividing all resources in the cell into N-dimensional resources, where N is a natural number; when the first UE requests resource allocation, traversing the N-th resources And the first resource is marked with the first identifier; the first resource is determined to be occupied, and if not, the first resource is allocated to the first UE, and the first identifier is marked with an occupation label.

Preferably, the first UE requests the resource allocation, and the resource allocation to the first UE by the resource algorithm further includes: after traversing all the resources in the Nth-dimensional resource in sequence, continuing to traverse the N-1th-dimensional resource; After the unoccupied resources are not found in the middle, it is confirmed that the first UE requests the resource allocation to fail.

Preferably, the base station performs resource allocation for the first UE by using the resource algorithm when acquiring the resource allocation by the first UE. The base station acquires the first UE to request to create a new bearer or release the bearer, and the base station is the first UE according to the request of the first UE. Re-allocate resources.

Preferably, when the base station acquires the first UE to request to release the bearer, the resource allocation method includes: the base station recovers the resources of the first UE; and the base station performs the priority ranking from all the UEs in the cell to generate the second UE list; The eNB traverses the UEs that are not allocated resources in the second UE list, and collects and allocates the resources of the first UE to the UEs with the highest priority among the second UE list. Preferably, the method for recovering the resources of the first UE is: the base station determines whether the first UE acquires the resource, and if not, directly returns a message that the recovery is successful; if yes, the base station indexes the resource corresponding to the first UE in all resources. The location, clear the resource allocation ID on the location, and return a message that the recovery was successful.

Preferably, the resources are: physical resources required by the base station, and are required to be established by the RRC connection, and carry the uplink control information and the channel sounding reference signal to the UE.

According to another aspect of the embodiments of the present invention, a resource allocation apparatus is provided, and the following technical solutions are adopted:

The resource allocation device includes a resource algorithm module, configured to: when the first UE requests the resource allocation, the base station performs resource allocation for the first UE by using a resource algorithm; and the selecting module is configured to determine, by the base station, whether the resource allocation is Successfully, and when determining that the resource allocation fails, selecting a second UE in the cell according to a preset condition; and recovering and allocating a module, the base station recovering resources of the second UE, and recovering the The resources of the two UEs are allocated to the first UE.

Preferably, the selecting module includes: a sorting module, configured, by the base station, sorting all the accessed UEs from small to large according to priorities in the cell, generating a first UE list; And traversing the first UE list in sequence, and selecting, as the second UE, a UE with a lower priority than the first UE and acquiring resources.

Preferably, the resource algorithm module includes: a dividing module, configured to divide all resources in the cell into N-dimensional resources, where N is a natural number; and an identity module, configured to request resource allocation in the first UE And traversing the first resource in the Nth-dimensional resource, and marking the first resource with the first identifier; the allocation module, configured to determine whether the first resource is occupied, and if not, the first resource Assigning to the first UE, and marking the first identifier with an occupation label.

According to still another aspect of an embodiment of the present invention, a base station is provided, and the following technical solutions are adopted:

The base station includes the resource allocation device described above. It can be seen that, in the case that the UE requests the resource allocation to be failed, the UE decommissions the resources of the low-priority UE to the high-priority UE by using the priority ranking in the cell, thereby solving the high preference and the user. When resource allocation is requested, there is no problem of free resources that can be allocated, thereby improving the user experience of high priority users.

In addition, when the UE is released, the base station improves resource usage efficiency and improves user experience by reclaiming resources and timely allocating UEs that have been accessed but not allocated resources in the system. DRAWINGS

FIG. 1 is a main flowchart of a resource allocation method according to an embodiment of the present invention;

2 is a schematic diagram of processing physical resources of a new access or handover UE according to an embodiment of the present invention; FIG. 3 is a schematic diagram of physical resource allocation for a UE to create, modify, or release a bearer according to an embodiment of the present invention; FIG. Schematic diagram of physical resource processing;

FIG. 5 is a schematic diagram of a physical resource algorithm according to an embodiment of the present invention;

6 is a schematic diagram of processing a physical resource allocation failure according to an embodiment of the present invention;

7 is a schematic diagram of candidate UE selection processing according to an embodiment of the present invention;

FIG. 8 is a schematic diagram of physical resource recycling processing according to an embodiment of the present invention; FIG.

FIG. 9 is a schematic diagram of processing a physical resource according to an embodiment of the present invention;

FIG. 10 is a schematic diagram of a main structure of a resource allocation apparatus according to an embodiment of the present invention. detailed description

The embodiments of the present invention are described in detail below with reference to the drawings, but the embodiments of the present invention can be implemented in various different ways as defined and covered by the claims.

FIG. 1 is a main flowchart of a resource allocation method according to an embodiment of the present invention.

Referring to Figure 1, the resource allocation method mainly includes:

S10: The base station performs resource allocation for the first UE by using a resource algorithm when acquiring the resource allocation by the first UE. S12: The base station determines whether the resource allocation is successful, and when determining that the resource allocation fails, selecting the second UE in the cell according to a preset condition;

S14: The base station recovers the resources of the second UE, and allocates the resources of the recovered second UE to the foregoing technical solution in this embodiment. In case the UE requests the resource allocation to fail, the UE sorts by priority in the cell. The resource of the low-priority UE is forcibly detached to the high-priority UE, and the problem that the high-priority user requests the resource allocation without the available idle resource is solved, thereby improving the user experience of the high-priority user.

FIG. 2 is a schematic diagram of processing physical resources of a newly accessed or cut-in UE according to an embodiment of the present invention. The resources allocated in this embodiment are physical resources.

Referring to FIG. 2, when the UE newly accesses or cuts in, the following steps are performed: Step 101: The base station invokes a physical resource algorithm module to allocate physical resources for the new access or cut-in UE;

Step 1011: The base station invoking the determining module determines whether the physical resource allocation is successful. Step 102: When the physical resource allocation is successful, the base station invokes the UE management module to bring the allocated physical resource to the UE through an RRC connection setup message;

Step 103: When the foregoing physical resource allocation fails, the base station invokes a physical resource allocation failure processing module for processing;

Step 1031: The base station invoking the determining module determines whether the processing of the physical resource allocation failure processing module is successful.

Step 104: When the physical resource allocation failure processing module is successfully processed, the base station invokes the UE management module to send an RRC connection setup message and carries the allocated physical resource to the UE;

Step 105: When the physical resource allocation failure processing module fails to process, that is, the physical resource is not allocated, the base station invokes the UE management module to send an RRC connection setup message but does not carry related physical resource information. In the above technical solution of the embodiment, the UE fails to allocate physical resources through the physical resource algorithm module, and the base station dynamically allocates physical resources in the cell through the physical resource allocation failure processing module, thereby effectively ensuring the experience of the high priority user. .

FIG. 3 is a schematic diagram of physical resource allocation for a UE to create, modify, or release a bearer according to an embodiment of the present invention. The resources allocated in this embodiment are physical resources.

As shown in Figure 3, for the UE to create, modify, or release the hosted physical resource, the processing method can be as follows:

Step 201: The base station invoking the determining module determines whether the UE (including the UE that newly creates, modifies, or releases the physical resource) has allocated the physical resource.

Step 202: If the UE has allocated the physical resource, the base station invokes the UE management module to bring the allocated physical resource to the UE through the RRC connection reconfiguration message;

Step 203: If the UE does not allocate physical resources, the base station invokes a physical resource algorithm module to allocate physical resources to the UE.

Step 2031: The base station continues to call the determining module to determine whether the base station invokes the physical resource algorithm module to allocate physical resources to the UE.

Step 204: If the physical resource algorithm module successfully allocates a physical resource to the UE, the base station invokes the UE management module to bring the allocated physical resource to the UE by using an RRC connection reconfiguration message. Step 205: If the physical resource algorithm module is the UE When the physical resource allocation fails, the base station invokes a physical resource allocation failure processing module;

Step 2051: The base station invoking the determining module determines whether the base station invokes the physical resource allocation failure processing module is successful.

Step 206: If the base station invokes the determining module to determine that the base station invokes the physical resource allocation failure processing module successfully, the base station invokes the UE management module to send an RRC connection reconfiguration message and carries the allocated physical resources;

Step 207: If the base station invokes the determining module to determine that the base station invokes the physical resource allocation failure. If the management module fails, it indicates that there is no physical resource that can be allocated, and the UE management module is called to deliver the RRC connection reconfiguration message, but does not carry physical resource related information.

In the above technical solution of the present embodiment, when the UE that has accessed the cell is newly creating, modifying, or releasing the physical resource, the embodiment of the present invention re-allocates the physical resource to the UE, and the dynamic of the physical resource is also implemented. Allocation, maximizing the utilization of physical resources.

FIG. 4 is a schematic diagram of processing physical resources when a UE is released according to an embodiment of the present invention.

Referring to FIG. 4, the specific processing method for the physical resources released by the UE in FIG. 3 in the foregoing embodiment may be as follows:

Step 301: The base station invokes a physical resource recovery module to recover the physical resources of the UE. Step 302: The base station sorts the UEs in the cell according to priorities from large to small, and generates one.

UE list;

Step 303: Read the first UE from the foregoing UE list.

Step 3031: Determine whether the UE does not allocate physical resources.

Step 304: If yes, the base station reclaims the physical resources of the UE, and allocates the recovered physical resources to the UE to be allocated according to the priority level;

Step 305: The base station invokes the UE management module to send an RRC connection reconfiguration message and carries the allocated physical resources.

Step 306: If the first UE is allocated a physical resource, the base station reads the next UE in the list, and returns to step 3031.

Step 307: The base station invoking the determining module determines whether the UE in the UE list is traversed, and if no, returns to step 306.

In the foregoing technical solution of the embodiment, the physical resources that are released are recovered in time, and the recovered physical resources are allocated to the high-priority UE to be allocated according to the priority level, thereby improving the utilization of the limited physical resources. At the same time, it better serves the UE with higher priority and improves the user experience of the high priority UE. FIG. 5 is a schematic diagram of a physical resource algorithm according to an embodiment of the present invention.

Referring to FIG. 5, in step S10, the base station performs resource allocation for the first UE by using a resource algorithm when the first UE requests the resource allocation. The specific process of the resource algorithm may be as follows:

Step 401: When the UE newly accesses or cuts in, it traverses the first resource of the first dimension resource, where all resources are classified into N-dimensional resources, and N is a natural number;

Step 4011: After traversing each resource, the base station determines whether the resource of the dimension is traversed;

Step 4012: If yes, the resource allocation fails.

Step 4013: If no, traversing the first resource of the second dimension resource;

Step 4014: Also determine whether the resource of the second dimension is traversed;

Step 4015: If no, continue to traverse the next resource of the second dimension resource, and return to step 4014;

Step 4016: If yes, traverse the next resource of the first dimension resource, and return to step 4011;

Step 402: In turn, traversing the first resource of the N-1th dimension resource;

Step 4021: Determine whether the dimension resource is traversed;

Step 4022: If yes, traverse the next resource of the N-2th resource, and return to the execution step

402;

Step 4023: If no, traverse the first resource of the Nth dimension resource;

Step 4024: Determine whether the Nth dimension resource is traversed;

Step 4025: If yes, traverse the next resource of the N-1th dimension resource;

Step 403: If no, determine whether the N-dimensional resource is already occupied;

Step 4031: If yes, traverse the next resource of the dimension, and return to step 4024; Step 4032: If no, the occupied resource is marked on the corresponding resource, and the resource allocation is successful. A more specific implementation manner of this embodiment is: when the UE newly accesses or cuts in, the first resource that traverses the Nth-dimensional resource is recorded as (0, 0 0, 0), where N is a natural number, and all resources are divided. An N-dimensional resource; if the resource (0, 0 0, 0) is not occupied, the resource is allocated to the UE, and the occupied label is returned, and if the resource is occupied, the second resource of the N-th resource is traversed. , recorded as (0, 0 0, 1). If the resource (0, 0 0, 1) is not occupied, allocate the resource to the UE, and put the occupancy label, return; if occupied, and so on, continue to traverse the Nth dimension resource; if traversing the Nth dimension resource If no allocation is successful, the second resource in the N-1th dimension is traversed and recorded as (0, 0 1, 0). If the resource is occupied, the second resource that traverses the N-1th resource is recorded as (0, 0 1, 1). If resources (0,

0 1, 1) is not occupied, then allocate the resource to the UE, and put the occupancy label, return; if occupied, and so on, continue to traverse the N-1th resource; after traversing all N-dimensional resources, if not If the available physical resources are found, the allocation fails.

Through the foregoing technical solution of the embodiment, the resource allocation is performed for the newly accessed or switched UE by the resource algorithm, and the related resource index is saved, and the corresponding physical resource is occupied, which reduces the time for repeated search and improves the time. The efficiency of physical resource allocation.

FIG. 6 is a schematic diagram of processing of physical resource allocation failure according to an embodiment of the present invention.

As shown in FIG. 6, when the physical resource allocation fails, the method may be processed as follows: Step 501: The base station invokes the candidate UE module to select one candidate UE;

Step 502: Call a physical resource recovery module to recover physical resources of the candidate UE.

Step 503: The calling physical resource algorithm module allocates the recovered physical resource to the UE whose physical resource allocation fails.

With the foregoing technical solution of the embodiment, when the physical resource allocation of the access UE fails, the candidate UE module forcibly demolitions the physical resources of the UE with the lower priority to the new access UE, thereby reducing the high priority due to the limited physical resources. The performance impact of the UE.

FIG. 7 is a schematic diagram of candidate UE selection processing according to an embodiment of the present invention. Referring to FIG. 7, in the foregoing embodiment, in step 501, the base station invokes the candidate UE module to select one candidate UE, and the implementation manner of the candidate UE may be:

Step 601: Sort all UEs in the cell from small to large according to the UE priority, and generate a UE list.

Step 602: Read, from the UE list, the first UE.

Step 603: Determine whether the UE is the last UE in the cell.

Step 6031: If yes, no candidate UE is found;

Step 6032: If no, determine whether the preferred level of the UE is smaller than the UE to be accessed, and whether the UE has been allocated physical resources;

Step 6033: If yes, find the candidate UE;

Step 6034: If yes, determine whether the priority level of the UE is greater than or equal to the UE to be accessed; Step 6035: If no, read the next UE from the UE list, and return to step 603; Step 6036: If yes, no candidate UE is found. .

In the above technical solution of the embodiment, the physical resources of the low-priority UE are allocated to the high-priority UE, and the physical resources are reduced if there is no free physical resource when the user accesses the high-priority user. The possibility of allocation failure.

FIG. 8 is a schematic diagram of physical resource recycling processing according to an embodiment of the present invention.

Referring to FIG. 8, in step S14, the base station recovers resources of the second UE, and the specific physical resource recovery implementation manner is:

Step 701: Determine whether the UE is allocated resources.

Step 702: If no, directly return the recovery success information;

Step 703: If yes, find the corresponding allocated resource location according to the N-dimensional resource index, and after clearing the resource allocation identifier, return the recovery success information.

In the above technical solution of the embodiment, the corresponding resource location is found by allocating the relevant index of the resource, and the identifier of the resource allocation is cleared, so as to be allocated to the subsequently accessed UE, thereby High resource utilization.

FIG. 9 is a schematic diagram of processing a physical resource delivery process according to an embodiment of the present invention.

As shown in FIG. 9, the resource allocation and re-allocation messages in all the foregoing embodiments are sent to the UE through the RRC connection, and the specific steps are as follows:

Step 801: The base station determines whether the state machine is in an RRC establishment waiting state.

Step 802: If yes, organize an RRC connection setup message, and send the message to the UE;

Step 8021: After the state machine sends successfully, transition to the RRC connection completion waiting state; Step 803: If no, determine the status and whether it is in the RRC connection reconfiguration waiting state; Step 804: If yes, organize the RRC connection reconfiguration message, and send to UE;

Step 8041: State Machine Transition The RRC Connection Reconfiguration completes the wait state.

With the foregoing technical solution of the embodiment, the resource allocation message or the resource reconfiguration message is sent to the UE through the RRC connection.

FIG. 10 is a schematic diagram of a main structure of a resource allocation apparatus according to an embodiment of the present invention.

Referring to FIG. 10, the resource allocation device includes:

The resource allocation device includes a resource algorithm module 30, configured to: when the first UE requests the resource allocation, the base station performs resource allocation for the first UE by using a resource algorithm; and the 4 mega-module module 50 is configured to determine, by the base station, Whether the resource allocation is successful, and when determining that the resource allocation fails, selecting a second UE in the cell according to a preset condition; and recovering and allocating a module 70, configured to recover, by the base station, the resource of the second UE, and Allocating the recovered resources of the second UE to the first UE.

Optionally, the selecting module 50 includes a sorting module (not shown), where the base station sorts all the accessed UEs from small to large in the cell to generate a first UE list. And traversing a module (not shown) for sequentially traversing the first UE list, and selecting a UE with a lower priority than the first UE and acquiring a resource as the second UE.

Optionally, the resource algorithm module 30 includes a partitioning module (not shown) for All the resources in the cell are divided into N-dimensional resources, where N is a natural number; an identity module (not shown) is configured to traverse the first resource in the N-th resource when the first UE requests resource allocation And marking the first identifier with the first identifier; and an allocation module (not shown) for determining whether the first resource is occupied, and if not, assigning the first resource to the first resource a UE, and an occupation label for the first identifier.

The base station includes the resource allocation device described above.

The above is only the embodiment of the present invention, and it should be noted that those skilled in the art can also make some improvements and retouching without departing from the principles of the embodiments of the present invention. It should be considered as the scope of protection of the embodiments of the present invention.

Claims

Claim

A resource allocation method, comprising:

When the base station acquires the resource allocation by the first user equipment, the base station performs resource allocation for the first UE by using a resource algorithm;

Determining, by the base station, whether the resource allocation is successful, and determining that the resource allocation fails, selecting a second UE in the cell according to a preset condition;

The base station recovers resources of the second UE, and allocates the recovered resources of the second UE to the first UE.

The resource allocation method according to claim 1, wherein the selecting the second UE in the cell according to the preset condition comprises:

The base station sorts all the UEs that have been accessed according to the priority from the smallest to the largest in the cell, and generates a first UE list;

And traversing the first UE list in sequence, and selecting, as the second UE, a UE with a lower priority than the first UE and having obtained a resource.

The resource allocation method according to claim 1, wherein the resource allocation by the resource algorithm for the first UE includes:

All the resources in the cell are divided into N-dimensional resources, where N is a natural number; when the first UE requests resource allocation, traversing the first resource in the N-th resource, and recording the first resource The first identifier;

Determining whether the first resource is occupied, and if not, assigning the first resource to the first UE, and marking the first identifier to an occupation label.

The resource allocation method according to claim 3, wherein the resource allocation by the resource algorithm for the first UE further includes:

After traversing all the resources in the Nth-dimensional resource in sequence, continuing to traverse the N-1th dimension After confirming that none of the N-dimensional resources finds an unoccupied resource, it is confirmed that the first UE requests resource allocation failure.

The resource allocation method according to claim 1, wherein, when the base station obtains the resource allocation by the first UE, performing resource allocation for the first UE by using a resource algorithm includes:

And the base station acquires, by the first UE, a new bearer or a release bearer, and the base station performs resource reallocation for the first UE according to the request of the first UE.

The resource allocation method according to claim 5, wherein when the base station obtains the first UE to request to release a bearer, the resource allocation method includes:

Reaching, by the base station, resources of the first UE;

The base station performs priority ordering on all UEs in the cell from large to small to generate a second UE list;

The eNB traverses the UEs that are not allocated resources in the second UE list, and collects and allocates the resources of the first UE to the UEs with the highest priority in the second UE list.

The resource allocation method according to claim 6, wherein the method for recovering resources of the first UE is:

Determining, by the base station, whether the first UE acquires a resource, and if not, directly returning a message that the recovery is successful;

If yes, the base station indexes the location of the resource corresponding to the first UE in all resources, clears the resource allocation identifier in the location, and returns a message that the recovery is successful.

The resource allocation method according to any one of claims 1 to 7, wherein the resource is:

The physical resources required for the uplink control information and the channel sounding reference signal that are established by the base station and are controlled by the RRC connection and carried to the UE by the radio resource.

A resource allocation device, comprising:

a resource algorithm module, configured to: when the first user equipment UE requests the resource allocation, the base station performs resource allocation for the first UE by using a resource algorithm;

a selecting module, configured to determine, by the base station, whether the resource allocation is successful, and when determining that the resource allocation fails, selecting a second UE in the cell according to a preset condition;

And a recovery and allocation module, configured to: recover, by the base station, resources of the second UE, and allocate the recovered resources of the second UE to the first UE.

10. The resource allocation apparatus according to claim 9, wherein the selection module comprises:

a sorting module, configured to: in the cell, sort all the UEs that have been accessed according to priorities from small to large, to generate a first UE list;

And a traversing module, configured to sequentially traverse the first UE list, and select a UE with a lower priority than the first UE and acquiring a resource as the second UE.

The resource allocation device according to claim 9, wherein the resource algorithm module comprises:

a dividing module, configured to divide all resources in the cell into N-dimensional resources, where N is a natural number;

An identifier module, configured to traverse the first resource in the Nth dimension resource when the first UE requests the resource allocation, and record the first identifier in the first resource;

The allocating module is configured to determine whether the first resource is occupied, and if not, allocate the first resource to the first UE, and put an occupation label for the first identifier.

A base station, comprising the resource allocation device according to any one of claims 9 to 11.