CN104780611B - A kind of resource allocation methods and device - Google Patents
A kind of resource allocation methods and device Download PDFInfo
- Publication number
- CN104780611B CN104780611B CN201510146206.XA CN201510146206A CN104780611B CN 104780611 B CN104780611 B CN 104780611B CN 201510146206 A CN201510146206 A CN 201510146206A CN 104780611 B CN104780611 B CN 104780611B
- Authority
- CN
- China
- Prior art keywords
- base station
- user terminal
- user side
- downlink channel
- user
- 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
- 238000000034 method Methods 0.000 title claims abstract description 48
- 238000013468 resource allocation Methods 0.000 title claims abstract description 25
- 230000005540 biological transmission Effects 0.000 claims abstract description 64
- 238000012512 characterization method Methods 0.000 claims abstract description 16
- 238000009826 distribution Methods 0.000 claims abstract description 8
- 230000008569 process Effects 0.000 claims description 10
- 238000012545 processing Methods 0.000 claims description 9
- 230000008859 change Effects 0.000 claims description 6
- 230000001105 regulatory effect Effects 0.000 claims description 4
- 101100194362 Schizosaccharomyces pombe (strain 972 / ATCC 24843) res1 gene Proteins 0.000 description 23
- 238000010586 diagram Methods 0.000 description 13
- 238000003860 storage Methods 0.000 description 11
- 238000004590 computer program Methods 0.000 description 9
- 101100194363 Schizosaccharomyces pombe (strain 972 / ATCC 24843) res2 gene Proteins 0.000 description 7
- 102100030441 Ubiquitin-conjugating enzyme E2 Z Human genes 0.000 description 6
- 101710192875 Ubiquitin-conjugating enzyme E2 Z Proteins 0.000 description 6
- 230000006870 function Effects 0.000 description 4
- 101150055297 SET1 gene Proteins 0.000 description 3
- 230000002776 aggregation Effects 0.000 description 3
- 238000004220 aggregation Methods 0.000 description 3
- 238000005516 engineering process Methods 0.000 description 3
- 230000003287 optical effect Effects 0.000 description 3
- 230000004048 modification Effects 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 101150117538 Set2 gene Proteins 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000004364 calculation method Methods 0.000 description 1
- 238000004891 communication Methods 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 238000010295 mobile communication Methods 0.000 description 1
- 238000012163 sequencing technique Methods 0.000 description 1
- 230000003068 static effect Effects 0.000 description 1
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
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/12—Wireless traffic scheduling
- H04W72/1221—Wireless traffic scheduling based on age of data to be sent
-
- 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/535—Allocation or scheduling criteria for wireless resources based on resource usage policies
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
This application discloses a kind of resource allocation methods, and for solving in the prior art, base station is the unreasonable problem of the mode of each user terminal distribution resource block.Include mainly：Determine the state table value indicative of each user terminal of resource block to be allocated；Wherein, the state table value indicative indicates the variation tendency of downlink channel condition between user terminal and base station；According to the state table value indicative, the Set Status characterization value of each user terminal set is determined；Wherein, the user terminal set is divided to the complete or collected works being made of each user terminal, and same user terminal set uses identical transmission mode, different user end set to use different transmission modes；The Set Status characterization value indicates the variation tendency of the downlink channel condition under the transmission mode that user terminal set uses；According to the Set Status characterization value, transfers resource block in base station and distribute to user terminal.Disclosed herein as well is a kind of resource allocation devices.
Description
Technical Field
The present application relates to the field of communications, and in particular, to a method and an apparatus for resource allocation.
Background
With the rapid development of mobile communication technology, people can realize data transmission between each base station and a user terminal in a heterogeneous network scene. However, in the process of data transmission, due to the influence that the coverage area of each base station is limited and the number of the user terminals is increasing, how to reasonably allocate resource blocks to the user terminals by each base station under the condition of limited resource blocks becomes a problem which needs to be solved urgently.
The following describes a scenario in which a base station allocates resource blocks to a user terminal in a heterogeneous network in the prior art. The heterogeneous network may be a virtual platform where each base station (macro base station and micro base station) performs information transmission, reception, and sharing with the user terminal in a joint cooperation manner under the condition that multiple transmission modes coexist. Through the heterogeneous network, the data required between each base station and the user terminal can be linked together, thereby realizing the sharing of network resource blocks.
(1) Distributed distribution mode: the method refers to that base stations of the whole network respectively and independently schedule and allocate resource blocks to user terminals. And each base station has a virtual scheduling entity to complete the scheduling of the resource block. As shown in fig. 1, assume that there are a Macro base station (Macro eNB), two micro base stations (Pico eNB1 and Pico eNB2) in a cell, where each base station has a corresponding virtual scheduling Entity (Schedule Entity). When a Macro base station (Macro eNB) performs downlink data transmission to user terminals (Macro UE1 and Macro UE2), resource blocks are allocated for the user terminals (Macro UE) through a set virtual scheduling Entity (Schedule Entity), and similarly, when two micro base stations (Pico eNB1 and Pico eNB2) perform downlink data transmission to the user terminals (Pico UE1, Pico UE2, Pico UE3 and Pico UE4), resource blocks are allocated for the user terminals (Pico UE1, Pico UE2, Pico UE3 and Pico UE4) through respective virtual scheduling entities (Schedule Entity).
(2) Centralized distribution mode: the resource blocks in the whole network are uniformly distributed by one scheduling entity. As shown in fig. 2, there are a Macro base station (Macro eNB), two micro base stations (Pico eNB1 and Pico eNB2) in a cell, and when the Macro base station (Macro eNB) transmits data to user terminals (Macro UE1 and Macro UE2), resource blocks are allocated to the user terminals (Macro UE1 and Macro UE2) through a unified virtual scheduling Entity (Schedule Entity).
(3) Part centralized distribution mode: in the whole network, resource blocks of some base station sets are uniformly scheduled and distributed by a scheduling entity; and the resource blocks which do not belong to the base station set are allocated by adopting other scheduling entities. As shown in fig. 3, a Macro base station (Macro eNB) and a micro base station (Pico eNB1) may respectively allocate resource blocks to user terminals by using a unified virtual scheduling Entity (Schedule Entity1) for the Macro base station (Macro eNB) and the micro base station (Pico eNB1) within a set range; and for the micro base station (Pico eNB2), since it is not in a set range with the Macro base station (Macro eNB) and the micro base station (Pico eNB1), the micro base station (Pico eNB2) uses a virtual scheduling Entity (Schedule Entity2) to allocate resource blocks to the user terminals respectively.
In the scenarios of the above (1) - (3) of heterogeneous networks, when a scheduling entity performs resource block scheduling, since in the prior art, multiple ues with the maximum channel transmission rate always appear in a "bundled" shared resource block form, the time period for scheduling resource blocks may be confused, and a ue located at a cell edge or a ue with a smaller transmission rate may not be allocated to a corresponding resource block. Therefore, each ue cannot be reasonably allocated a valid resource block.
For example, as shown in fig. 4, in a transmission mode of multi-antenna data transmission (MU-CoMP) between Multiple base stations and Multiple users, at a first scheduling time schedule 0, UE2 and UE3 appear in the form of "bundled" shared resource blocks, and by the time of the next scheduling time schedule 1, the MU combination changes, and if the resource blocks are still allocated according to the method of the first scheduling time, UE1 is always allocated preferentially and other UEs may not be allocated, which results in irrational resource allocation.
Disclosure of Invention
The embodiment of the application provides a resource allocation method, which solves the problem that in the prior art, a base station allocates resource blocks to each user side in an unreasonable manner.
The embodiment of the application also provides a resource allocation device, which solves the problem that in the prior art, the mode of allocating the resource blocks to each user side by the base station is unreasonable.
The embodiment of the application adopts the following technical scheme:
a method for resource allocation, comprising:
determining a state representation value of each user side of a resource block to be distributed; the state representation value represents the change trend of the state of a downlink channel between a user side and a base station;
determining a set state representation value of each user side set according to the state representation value; the user terminal sets are obtained by dividing a complete set formed by each user terminal, the same user terminal set adopts the same transmission mode, and different user terminal sets adopt different transmission modes; the set state representation value represents the variation trend of the downlink channel state in the transmission mode adopted by the user side set;
and calling resource blocks in the base station to be distributed to the user side according to the set state representation value.
A resource allocation apparatus, comprising:
the determining unit is used for determining a state representation value of each user side of the resource blocks to be distributed; the state representation value represents the change trend of the state of a downlink channel between a user side and a base station;
the computing unit is used for determining a set state representation value of each user side set according to the state representation value; the user terminal sets are obtained by dividing a complete set formed by each user terminal, the same user terminal set adopts the same transmission mode, and different user terminal sets adopt different transmission modes; the set state representation value represents the variation trend of the downlink channel state in the transmission mode adopted by the user side set;
and the calling unit is used for calling resource blocks in the base station to be distributed to the user side according to the set state representation value.
The embodiment of the application adopts at least one technical scheme which can achieve the following beneficial effects:
the set state representation value of each user terminal set is determined according to the state representation value of each user terminal of the resource block to be distributed, and the resource block in the base station is called to be distributed to the user terminal according to the set state representation value. Therefore, the problem that in the prior art, the mode that the base station distributes the resource blocks to the user terminals is unreasonable is solved.
Drawings
The accompanying drawings, which are included to provide a further understanding of the application and are incorporated in and constitute a part of this application, illustrate embodiment(s) of the application and together with the description serve to explain the application and not to limit the application. In the drawings:
fig. 1 is a schematic diagram illustrating a base station allocating resources to a user terminal in a distributed resource block allocation manner;
fig. 2 is a schematic diagram illustrating a base station allocating resources to a user terminal in a centralized resource block allocation manner;
fig. 3 is a schematic diagram illustrating a base station allocating resources to a user terminal in a manner of partially and centrally allocating resource blocks;
FIG. 4 is a diagram illustrating a conventional resource scheduling scheme;
FIG. 5 is a flow chart of a method of resource allocation;
FIG. 6 is a flow chart of a method of resource allocation;
fig. 7 is a block diagram of a resource allocation apparatus.
Detailed Description
In order to make the objects, technical solutions and advantages of the present application more apparent, the technical solutions of the present application will be described in detail and completely with reference to the following specific embodiments of the present application and the accompanying drawings. It should be apparent that the described embodiments are only some of the embodiments of the present application, 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 application.
The technical solutions provided by the embodiments of the present application are described in detail below with reference to the accompanying drawings.
Example 1
In order to solve the problem in the prior art that a manner in which a base station allocates resource blocks to each user side is unreasonable, embodiment 1 of the present application provides a resource allocation method. The execution subject for implementing the method provided by the present application may be a base station or a third-party device independent of the base station and the user side, and the present application is not limited thereto. However, for the sake of understanding, the following embodiments of the present application assume that the execution subject is a third-party device.
The specific implementation flow chart of the method is shown in fig. 5, and mainly comprises the following steps:
step 51, determining a state representation value of each user side of a resource block to be distributed;
the state representation value represents the variation trend of the downlink channel state between the user terminal and the base station.
Step 52, determining a set state representation value of each user terminal set according to the state representation value;
the user terminal sets are obtained by dividing a complete set formed by each user terminal, the same user terminal set adopts the same transmission mode, and different user terminal sets adopt different transmission modes; and the set state characterization value represents the variation trend of the downlink channel state in the transmission mode adopted by the user side set.
And 53, calling resource blocks in the base station to be distributed to the user side according to the set state representation value.
By adopting the method provided by embodiment 1, the set state characterization value of each user side set is determined based on the state characterization value of each user side of the resource block to be allocated, so that the problem that the manner in which the base station allocates the resource block to each user side is unreasonable in the prior art is solved.
Some alternative methods for implementing steps 51-53 are described below, respectively, as follows:
1. an implementation for the previously described step 51 may include the following sub-steps a 1-a 2:
sub-step a1, obtaining the historical speed of the downlink channel between each user terminal and the base station, and the current requested downlink channel speed of each user terminal.
And a substep a2, determining a state representation value of each user terminal according to the historical rate of the downlink channel between each user terminal and the base station and the current requested downlink channel rate of each user terminal.
According to the descriptions of the sub-steps A1-A2, if the average rate of data transmitted by the base station (hereinafter referred to as AP) received by the user terminal (hereinafter referred to as UE) before the t time slot is assumed to be Ri(t) (which may be expressed as the historical rate of the downlink channel between the UE and the AP, i is the UE number), the average rate at which the UE requests the AP to send data (i.e., the rate supportable by the current channel) is Ui(t) (which may be expressed as the downlink channel rate currently requested by the UE and i is the UE side number), and then, may be expressed by equation [1]]And determining the state representation Value PF _ Value of each user terminal.
wherein i represents the client number, β is a control parameter, and β can be a natural number.
2. For the implementation of the foregoing step 52, the sum of all state characterizing values included in each user side set may be respectively calculated according to the state characterizing value of each user side of the resource block to be allocated, and the sum is used as a set state characterizing value. Or, respectively calculating the product of the state characterizing values of the clients included in each client set as a set state characterizing value. For the method of calculating the state characterizing value of the user terminal set according to the state characterizing value of each user terminal, the present application is not limited to the above two methods, and other methods can be selected to calculate the set state characterizing value of the user terminal set according to different application scenario requirements.
Alternatively, if it is assumed that: presence base stations AP1, AP2, and AP 3; the user terminals in the coverage of at least one base station in the AP1, the AP2 and the AP3 are UE1, UE2 and UE 3; the transmission modes between the User terminal and the base station include multi-antenna data transmission (MU) between Multiple base stations and Multiple users and Single User-CoMP (SU) between Multiple base stations and a Single User. The transmission relationship between the base station and the ue can be specifically shown in table one:
table one:
| user terminal | Base station | Transmission mode |
| UE1 | AP1 | Single base station transmission MU |
| UE2 | AP1 | Single base station transmission MU |
| UE3 | AP1 | Multi-base station transmission MU |
| UE4 | AP2 | Multi-base station transmission MU |
| UE5 | AP3 | Multi-base station transmission SU |
| UE6 | AP3 | Single base station transmission SU |
According to the transmission relationship between the base station and the UE in table one, the PF _ Value values of the UE1, UE2, and UE3 can be obtained by formula [1], which is specifically shown in table two:
table two:
| user terminal | Base station | Transmission mode | Characteristic value of state |
| UE1 | AP1 | Single base station transmission MU | PF_Value(11) |
| UE2 | AP1 | Single base station transmission MU | PF_Value(12) |
| UE3 | AP1 | Multi-base station transmission MU | PF_Value(13) |
| UE4 | AP2 | Multi-base station transmission MU | PF_Value(24) |
| UE5 | AP3 | Multi-base station transmission SU | PF_Value(35) |
| UE6 | AP3 | Single base station transmission SU | PF_Value(36) |
According to table two, the ues with the same transmission mode are regarded as a ue set, and then the set state characterization value sch _ value of each ue set is determined according to the formula [2 ].
Wherein i is the number of the ue, j is the number of the ue set, and TM is the transmission mode.
According to table two, the set state representation value sch _ value (i) of each ue set can be obtained from the formula [2], and as shown in table three,
table three:
the transmission category in table three may refer to a category to which the user terminals having the same transmission mode belong together, and the name of the category is the name of the transmission mode. For example, in table two, both USE1 and USE2 belong to single base station transmission MU transmission mode, and therefore, USE1 and USE2 can be assigned to single base station transmission MU category.
3. With respect to the foregoing step 53, an implementation thereof may include: traversing each user terminal set according to the set state representation value of each user terminal set determined in the step 52; then, the resource blocks in the base station are called to be allocated to the user terminal set according to the traversal result, so that the user terminals in the user terminal set can obtain corresponding resources.
Specifically, the process of traversing each set of user terminals may include: executing specific operation aiming at each traversed user side set; and the specific operation may include:
judging whether the base station has available resource blocks to be distributed to the user terminal set; if not, determining that the resource block of the base station is failed to be allocated to the user side set; if so, the available resource blocks of the base station are called to be allocated to the set of the user terminals.
For the implementation of step 53, the following specific examples are given:
taking table three as an example, the ues set1 to UESET4 may be ordered according to the magnitude of the aggregate state characterization values of ues set1 to UESET 4; suppose the ordering results are: UESET1 → UESET2 → → UESET3 → UESET 4; and then, according to the sequencing result, each user side set is traversed to distribute resource blocks. Further, it can be assumed that the allocable resource block states in the scheduling set are as shown in the table four resource state allocation table,
table four:
| resource block | AP1 | AP2 | AP3 |
| RES1 | Can be distributed | Can be distributed | Can be distributed |
| RES2 | Can be distributed | Can be distributed | Can be distributed |
In the description of table four, RES1 and RES2 denote resource blocks allocatable to AP1, AP2, and AP3, respectively.
It should be noted that, because the numbers of the resource blocks in each base station in the scheduling set may be set uniformly, and then whether an allocable resource block exists may be determined by traversing all the resource blocks or by searching for the numbers of the unallocated resource blocks in the database, the method for determining whether an allocable resource block exists belongs to the prior art, and is not described herein again.
The following is a specific operation of the base station to allocate resource blocks to the user terminal:
since the scheduling is performed for the first time, neither RES1 nor RES2 is scheduled, the scheduling set informs AP1, AP2, and AP3 to select RES1 for allocation.
(1) According to table three, in order of priority of ordering, first go to UESET1, allocate RES1 for UESET 1.
Looking at resource allocation table four, RES1 of AP1 is in an allocable state, so RES1 is allocated to UESET1, and the state of resource allocation table four is updated to the state shown in table five:
table five:
| resource block | AP1 | AP2 | AP3 |
| RES1 | UESET1 | Can be distributed | Can be distributed |
| RES2 | Can be distributed | Can be distributed | Can be distributed |
(2) According to table three, resource blocks are allocated for UESET2 in a sorted priority order, next traversing to UESET 2.
According to the third table, the resource blocks required by the UESET2 are RES1 of AP1 and AP2,
looking at resource allocation table five, RES1 of AP1 is already occupied by UESET1 and thus the allocation fails.
(3) According to table three, resource blocks are allocated for UESET3 in a sorted priority order, next traversing to UESET 3. The resource blocks required for UESET3 are RES1 for AP2 and AP 3.
Looking at the resource allocation table five, RES1 of AP2 and AP3 are allocable states, so RES1 is allocated to UESET3, and the allocation state shown in resource allocation table five is updated to the allocation state shown in table six:
table six:
| resource block | AP1 | AP2 | AP3 |
| RES1 | UESET1 | UESET3 | UESET3 |
| RES2 | Can be distributed | Can be distributed | Can be distributed |
(4) According to table three, resource blocks are allocated for UESET4 in a sorted priority order, next traversing to UESET 4. The resource block required for UESET4 is RES1 of AP 3.
Looking at the resource allocation table six, RES1 of AP3 has been occupied by UESET3 and thus the allocation has failed.
After the processes (1) to (4) are performed, all the user side sets have been traversed. And gets the traversal result as shown in table seven,
TABLE VII:
| user side set | Resource allocation results |
| UESET1 | Success of the method |
| UESET2 | Failure of |
| UESET3 | Success of the method |
| UESET4 | Failure of |
Assignment to RES1 is completed in the above-described (1) to (4), and similarly, assignment may be made by RES 2. And the resulting allocation states of RES1 and RES2 are shown in table eight,
table eight:
| resource block | AP1 | AP2 | AP3 |
| RES1 | UESET1 | UESET3 | UESET3 |
| RES2 | UESET2 | UESET2 | UESET4 |
4. For the determination result in 3 that whether there is an available resource block allocated to each of the traversed user end sets by the base station, the following processing manner may also be used:
the first judgment result is:
when it is determined that the base station successfully allocates the resource blocks to the set of user terminals, according to the formula [3]
And updating the historical speed of the downlink channel between the user side in the user side set successfully allocated with the resource block and the base station.
The second judgment result is: when it is determined that the base station fails to allocate resource blocks to the user terminal set, according to the formula [4]
And updating the historical rate of the downlink channel between the user terminal in the user terminal set with the unsuccessful resource block distribution and the base station.
The relevant parameters referred to in the above equations [3] and [4] are expressed as follows:
Ri(t +1) is the updated historical rate of the downlink channel between the user terminal with the number i and the base station;
Ri(t) is the historical rate before updating of the downlink channel between the user terminal numbered i and the base station;
tcparameters for regulating historical rates;
Ui(t) the downlink channel rate currently requested by the user end with the number i;
i is a client number, i is 1,2,3,. k, k is the total number of clients in the client set;
and t is the number of the time slot corresponding to the historical speed before the updating.
Regarding the two determination results, taking (1) and (2) as examples:
as can be seen from (1), RES1 of AP1 is in an allocatable state, and thus RES1 is allocated to UESET1, and then allocation of AP1 to UESET1 is successful, and thus, the historical rates of USE1 and USE2 in UESET1 can be updated using equation [3 ].
The method comprises the following specific steps:
when the first judgment result is obtained, it is assumed that the historical rates of the downlink channels between the USE1 and the USE2 in the ue set1 and the AP1 are updated (i.e., (t +1) time slot) in the t time slot, and therefore, it is possible to prepare for determining the priority of allocating resource blocks in the next time slot (i.e., (t +1) time slot) for the USE1 and the USE 2. Specifically, the formula [3]]The updated historical rate of the downlink channel between the USE1 and the AP1 is R11(t +1), i.e.
Similarly, the historical rate of the downlink channel between USE2 and AP1 may be determined to be R12(t+1)。
From (2), RES1 of AP1 is in an unallocated state, and thus allocation of RES1 to UESET2 fails, and thus the historical rates of USE3 and USE4 in UESET2 can be updated using equation [4 ].
The method comprises the following specific steps:
when the result is the second determination, it is assumed that the historical rates of the downlink channels between the USE3 and the USE4 in the ue set2 and the AP1 are updated (i.e., (t +1) time slot) in the t time slot, and therefore, it is possible to prepare for determining the priority of allocating resource blocks in the next time slot (i.e., (t +1) time slot) for the USE3 and the USE 4. Specifically, the formula [4]]The updated historical rate of the downlink channel between the USE3 and the AP1 is R13(t +1) that is
Similarly, during the t time slot, the historical rate R of the downlink channel between the ue4 and the AP1 after updating (i.e., (t +1) time slot) in the UESET2 can also be obtained14(t+1)。
The following is a general description of the manner proposed in the above 1-4, as shown in fig. 6, and mainly includes the following steps:
step 61, judging whether the dispatching set has allocable resource blocks, if so, executing step 62; otherwise, the allocation is ended.
And 62, selecting the number of the allocable resource block.
It is assumed that the resource block with the number of 6 is not allocated (hereinafter, referred to as resource block No. 6).
And step 63, determining the state representation value of each user side of the resource block to be distributed.
Step 64, determining an aggregation state representation value of each ue aggregation (hereinafter, referred to as sch _ value (j), where j represents a ue aggregation number) according to the state representation value.
And step 65, sorting the user side sets to be traversed according to the size of the sch _ value (j) of each user side set, wherein the user side sets to be traversed are the user side sets of which the set state representation values are calculated.
The sorting results can be referred to table three above.
And step 66, traversing each user terminal set according to the sorting result of the step 65.
And step 67, when the user side sets are traversed, informing the base station to allocate the No. 6 resource block to each user side set.
Step 68, judging whether the base station successfully distributes the resource blocks to the user terminal set;
if successful, go to step 69; if not, go to step 610.
Step 69, determining the historical rate of the downlink channel between the user terminal and the base station in the user terminal set with successfully updated and distributed resource blocks according to the formula [3 ]; then, step 611 is performed.
Step 610, determining the historical speed of the downlink channel between the user terminal and the base station in the user terminal set with unsuccessful updating and distributing the resource block according to the formula [4 ]; then, step 611 is performed.
611, judging whether all the user side sets are traversed; if the traversal is finished, returning to the step 61; otherwise, step 66 is performed.
It should be noted that the execution subjects of the steps of the method provided in embodiment 1 may be the same device, or different devices may be used as the execution subjects of the method. For example, the execution subject of steps 51 and 52 may be device 1, and the execution subject of step 53 may be device 2; for another example, the execution subject of step 51 may be device 1, and the execution subjects of steps 52 and 53 may be device 2; and so on.
Example 2
In order to solve the problem in the prior art that a manner in which a base station allocates resource blocks to each user side is unreasonable, embodiment 2 of the present application provides a resource allocation apparatus. The implementation structure of the apparatus is shown in fig. 7, and specifically includes: a determination unit 71, a calculation unit 72 and a retrieval unit 73,
a determining unit 71, configured to determine a state characterization value of each ue of the resource blocks to be allocated; the state representation value represents the change trend of the state of a downlink channel between a user side and a base station;
a calculating unit 72, configured to determine a set state characterization value of each user side set according to the state characterization value; the user terminal sets are obtained by dividing a complete set formed by each user terminal, the same user terminal set adopts the same transmission mode, and different user terminal sets adopt different transmission modes; the set state representation value represents the variation trend of the downlink channel state in the transmission mode adopted by the user side set;
and the invoking unit 73 is configured to invoke resource blocks in the base station to be allocated to the user terminal according to the set state characterization value.
In one embodiment, the determining unit 71 may include:
an obtaining subunit, configured to obtain a historical rate of a downlink channel between each user terminal and the base station, and a downlink channel rate currently requested by each user terminal;
and the determining subunit is configured to determine the state characterization value of each user side according to the historical rate of the downlink channel and the rate of the downlink channel.
In one embodiment, the computing unit 72 may be configured to: and respectively calculating the sum of all the state representation values contained in each user side set according to the state representation values to serve as a set state representation value.
In one embodiment, the retrieving unit 73 may be configured to:
traversing each user side set according to the set state representation value;
wherein, the process of traversing each user terminal set comprises the following steps: executing specific operation aiming at each traversed user side set; the specific operations include:
judging whether the base station has available resource blocks to be distributed to the user side set or not; if not, determining that the resource block of the base station is failed to be allocated to the user side set; and if so, calling available resource blocks of the base station to be allocated to the user terminal set.
In an embodiment, the resource allocation apparatus provided in the present application may further include:
a first processing unit, configured to, when it is determined that the base station successfully allocates the resource blocks to the ue, allocate the resource blocks to the ue according to a formula
Updating the historical rate of a downlink channel between a user side in the user side set successfully distributed with the resource block and the base station;
a second processing unit, configured to, when it is determined that the base station fails to allocate the resource blocks to the user terminal, allocate the resource blocks to the user terminal according to a formula
Updating the historical rate of a downlink channel between a user side in a user side set with unsuccessful resource block distribution and the base station;
wherein R isi(t +1) is the updated historical rate of the downlink channel between the user terminal with the number i and the base station;
Ri(t) is the historical rate before updating of the downlink channel between the user terminal numbered i and the base station;
tcparameters for regulating historical rates;
Ui(t) the downlink channel rate currently requested by the user end with the number i;
i is a client number, i is 1,2,3,. k, k is the total number of clients in the client set;
and t is the number of the time slot corresponding to the historical speed before the updating.
By adopting the apparatus provided in embodiment 2, the set state characterization value of each user side set is determined based on the state characterization value of each user side of the resource block to be allocated, so that the problem that the manner in which the base station allocates the resource block to each user side is unreasonable in the prior art is solved.
As will be appreciated by one skilled in the art, embodiments of the present invention may be provided as a method, system, or computer program product. Accordingly, the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present invention may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.
The present invention is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the invention. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
In a typical configuration, a computing device includes one or more processors (CPUs), input/output interfaces, network interfaces, and memory.
The memory may include forms of volatile memory in a computer readable medium, Random Access Memory (RAM) and/or non-volatile memory, such as Read Only Memory (ROM) or flash memory (flash RAM). Memory is an example of a computer-readable medium.
Computer-readable media, including both non-transitory and non-transitory, removable and non-removable media, may implement information storage by any method or technology. The information may be computer readable instructions, data structures, modules of a program, or other data. Examples of computer storage media include, but are not limited to, phase change memory (PRAM), Static Random Access Memory (SRAM), Dynamic Random Access Memory (DRAM), other types of Random Access Memory (RAM), Read Only Memory (ROM), Electrically Erasable Programmable Read Only Memory (EEPROM), flash memory or other memory technology, compact disc read only memory (CD-ROM), Digital Versatile Discs (DVD) or other optical storage, magnetic cassettes, magnetic tape magnetic disk storage or other magnetic storage devices, or any other non-transmission medium that can be used to store information that can be accessed by a computing device. As defined herein, a computer readable medium does not include a transitory computer readable medium such as a modulated data signal and a carrier wave.
It should also be noted that the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising an … …" does not exclude the presence of other like elements in a process, method, article, or apparatus that comprises the element.
As will be appreciated by one skilled in the art, embodiments of the present application may be provided as a method, system, or computer program product. Accordingly, the present application may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present application may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.
The above description is only an example of the present application and is not intended to limit the present application. Various modifications and changes may occur to those skilled in the art. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present application should be included in the scope of the claims of the present application.
Claims (8)
1. A method for resource allocation, comprising:
determining a state representation value of each user side of a resource block to be distributed; the state representation value represents the change trend of the state of a downlink channel between a user side and a base station;
determining a set state representation value of each user side set according to the state representation value; wherein,
the user terminal sets are obtained by dividing a complete set formed by each user terminal, the same user terminal set adopts the same transmission mode, different user terminal sets adopt different transmission modes, and the transmission modes comprise multi-antenna data transmission between multiple base stations and multiple users and multi-antenna data transmission between the multiple base stations and a single user;
the set state representation value represents the variation trend of the downlink channel state in the transmission mode adopted by the user side set;
according to the set state representation value, resource blocks in the base station are called and distributed to the user side; wherein,
according to the set state representation value, resource blocks in the base station are called to be distributed to the user side, and the method comprises the following steps:
traversing each user side set according to the set state representation value;
wherein, the process of traversing each user terminal set comprises the following steps: executing specific operation aiming at each traversed user side set; the specific operations include:
judging whether the base station has available resource blocks to be distributed to the user side set or not; if not, determining that the resource block of the base station is failed to be allocated to the user side set; and if so, calling available resource blocks of the base station to be allocated to the user terminal set.
2. The method of claim 1,
determining a state representation value of each user side of a resource block to be distributed, comprising:
acquiring the historical speed of a downlink channel between each user side and the base station and the current requested downlink channel speed of each user side;
and determining the state representation value of each user side according to the historical speed of the downlink channel and the speed of the downlink channel.
3. The method of claim 2,
determining a set state representation value of each user terminal set according to the state representation value, including:
and respectively calculating the sum of all the state representation values contained in each user side set according to the state representation values to serve as a set state representation value.
4. The method of claim 1, wherein the method further comprises:
when the base station is determined to successfully distribute the resource blocks to the user terminal set, according to a formula
Updating the historical rate of a downlink channel between a user side in the user side set successfully distributed with the resource block and the base station;
when it is determined that the base station fails to allocate the resource blocks to the user terminal set, allocating the resource blocks to the user terminal set according to the formula
Updating the historical rate of a downlink channel between a user side in a user side set with unsuccessful resource block distribution and the base station;
wherein R isi(t +1) is the updated historical rate of the downlink channel between the user terminal with the number i and the base station;
Ri(t) is the historical rate before updating of the downlink channel between the user terminal numbered i and the base station;
tcparameters for regulating historical rates;
Ui(t) the downlink channel rate currently requested by the user end with the number i;
i is a client number, i is 1,2,3,. k, k is the total number of clients in the client set;
and t is the number of the time slot corresponding to the historical speed before the updating.
5. A resource allocation apparatus, comprising:
the determining unit is used for determining a state representation value of each user side of the resource blocks to be distributed; the state representation value represents the change trend of the state of a downlink channel between a user side and a base station;
the computing unit is used for determining a set state representation value of each user side set according to the state representation value; wherein,
the user terminal sets are obtained by dividing a complete set formed by each user terminal, the same user terminal set adopts the same transmission mode, different user terminal sets adopt different transmission modes, and the transmission modes comprise multi-antenna data transmission between multiple base stations and multiple users and multi-antenna data transmission between the multiple base stations and a single user;
the set state representation value represents the variation trend of the downlink channel state in the transmission mode adopted by the user side set;
the calling unit is used for calling resource blocks in the base station to be distributed to the user side according to the set state representation value; wherein the computing unit is to:
traversing each user side set according to the set state representation value;
wherein, the process of traversing each user terminal set comprises the following steps: executing specific operation aiming at each traversed user side set; the specific operations include:
judging whether the base station has available resource blocks to be distributed to the user side set or not; if not, determining that the resource block of the base station is failed to be allocated to the user side set; and if so, calling available resource blocks of the base station to be allocated to the user terminal set.
6. The apparatus of claim 5, wherein the determining unit comprises:
an obtaining subunit, configured to obtain a historical rate of a downlink channel between each user terminal and the base station, and a downlink channel rate currently requested by each user terminal;
and the determining subunit is configured to determine the state characterization value of each user side according to the historical rate of the downlink channel and the rate of the downlink channel.
7. The apparatus of claim 6, wherein the computing unit is to:
and respectively calculating the sum of all the state representation values contained in each user side set according to the state representation values to serve as a set state representation value.
8. The apparatus of claim 5, wherein the apparatus further comprises:
a first processing unit, configured to, when it is determined that the base station successfully allocates the resource blocks to the set of user terminals, allocate resource blocks to the set of user terminals according to a formula
Updating the historical rate of a downlink channel between a user side in the user side set successfully distributed with the resource block and the base station;
a second processing unit, configured to, when it is determined that the base station fails to allocate the resource blocks to the user end set, allocate the resource blocks to the user end set according to a formula
Updating the historical rate of a downlink channel between a user side in a user side set with unsuccessful resource block distribution and the base station;
wherein R isi(t +1) is the updated historical rate of the downlink channel between the user terminal with the number i and the base station;
Ri(t) is the historical rate before updating of the downlink channel between the user terminal numbered i and the base station;
tcparameters for regulating historical rates;
Ui(t) the downlink channel rate currently requested by the user end with the number i;
i is a client number, i is 1,2,3,. k, k is the total number of clients in the client set;
and t is the number of the time slot corresponding to the historical speed before the updating.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510146206.XA CN104780611B (en) | 2015-03-30 | 2015-03-30 | A kind of resource allocation methods and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510146206.XA CN104780611B (en) | 2015-03-30 | 2015-03-30 | A kind of resource allocation methods and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104780611A CN104780611A (en) | 2015-07-15 |
| CN104780611B true CN104780611B (en) | 2018-09-07 |
Family
ID=53621756
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510146206.XA Active CN104780611B (en) | 2015-03-30 | 2015-03-30 | A kind of resource allocation methods and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104780611B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111461356B (en) * | 2019-01-03 | 2023-09-01 | 顺丰科技有限公司 | Resource management method, device, equipment and storage medium thereof |
| CN112188629B (en) * | 2020-09-28 | 2024-01-16 | 海能达通信股份有限公司 | Communication method, system and base station |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102340882A (en) * | 2011-09-13 | 2012-02-01 | 华中科技大学 | Multi-user proportional fair method based on different-rate updating policy |
| CN102573092A (en) * | 2011-10-31 | 2012-07-11 | 华中科技大学 | Improved proportional fairness scheduling algorithm based on multiuser eigenmode transmission (MET) precoding technology |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103222323B (en) * | 2012-05-22 | 2017-12-15 | 华为技术有限公司 | Dispatching method and device for MU MIMO |
-
2015
- 2015-03-30 CN CN201510146206.XA patent/CN104780611B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102340882A (en) * | 2011-09-13 | 2012-02-01 | 华中科技大学 | Multi-user proportional fair method based on different-rate updating policy |
| CN102573092A (en) * | 2011-10-31 | 2012-07-11 | 华中科技大学 | Improved proportional fairness scheduling algorithm based on multiuser eigenmode transmission (MET) precoding technology |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104780611A (en) | 2015-07-15 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10117103B2 (en) | Method for sharing network and network element | |
| CN102595612B (en) | A kind of resource allocation methods and device | |
| CN103650614B (en) | Resource allocation methods, device, network side equipment and terminal | |
| CN104918256B (en) | A kind of transmission dispatching method and device | |
| CN104780611B (en) | A kind of resource allocation methods and device | |
| CN110475284B (en) | Method and device for resource allocation | |
| JP2014531835A (en) | Scheduling assignment method and apparatus in multipoint cooperative system | |
| CN107567095B (en) | Physical uplink control channel PUCCH resource allocation method and base station | |
| WO2015085562A1 (en) | System, device and method for coordinating load balance | |
| WO2012174912A1 (en) | Method and device for sending interference coordination request | |
| CN107947890B (en) | A kind of inter-cell interference coordination method and the network equipment | |
| CN108541067B (en) | Resource scheduling method and device | |
| CN104010374B (en) | A kind of method and device carrying out traffic scheduling | |
| CN112601257B (en) | Radio access network RAN slice resource allocation method and related equipment | |
| CN104363659A (en) | Resource allocation device, resource allocation system and resource allocation method | |
| CN105766040A (en) | Group scheduling method and system for mtc ues | |
| WO2017024781A1 (en) | Data bearer migration method, apparatus, and evolved node b | |
| CN108124313B (en) | Resource allocation method and base station | |
| WO2016184166A1 (en) | Method and apparatus for allocating carrier aggregation bandwidth | |
| CN109041241A (en) | SR resource allocation methods and device | |
| CN109429335B (en) | Method and equipment for seizing cluster voice users across operators | |
| CN104185291B (en) | A kind of method and device of scheduling of resource | |
| US20220124738A1 (en) | Assigning a service quality to a wireless connection | |
| CN115243378B (en) | Resource allocation method and device, electronic equipment and storage medium | |
| WO2021077904A1 (en) | Spatial division multiplex access method and apparatus, electronic device, and computer-readable medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| EXSB | Decision made by sipo to initiate substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |