CN104703284B - A kind of method of resource allocation - Google Patents
A kind of method of resource allocation Download PDFInfo
- Publication number
- CN104703284B CN104703284B CN201310686703.XA CN201310686703A CN104703284B CN 104703284 B CN104703284 B CN 104703284B CN 201310686703 A CN201310686703 A CN 201310686703A CN 104703284 B CN104703284 B CN 104703284B
- Authority
- CN
- China
- Prior art keywords
- user
- resource
- scheduling
- pairing
- data
- 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.)
- Expired - Fee Related
Links
Classifications
-
- 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/56—Allocation or scheduling criteria for wireless resources based on priority criteria
Abstract
A kind of method of resource allocation, the method includes：Select the user of highest priority for the first scheduling user in dispatching Subscriber Queue；When the available free resource of system, the second scheduling user is determined in the pairing user of the first scheduling user, and determine first resource user and Secondary resource user between the two；Resource is distributed for first resource user, later in the resource of first resource user distribution, resource is distributed for Secondary resource user, and it is secondary pairing user to mark first resource user；System resource and scheduling Subscriber Queue are updated, selects the user of highest priority for the first scheduling user in dispatching Subscriber Queue again；System does not have idling-resource, then in the unappropriated resource of secondary pairing user, resource is distributed for corresponding pairing user.After the embodiment of the present invention, to avoid complicated resource lookup process and it can ensure that dispatching priority of users sequence is unaffected when carrying out uplink multi-users resource allocation, to ensure system performance.
Description
Technical field
This application involves fields of communication technology, more particularly, to a kind of method of resource allocation.
Background technology
LTE R8/R9 uplinks only support that single antenna is sent or the switching of 2 antennas is sent, and can support multi-user's multiple-input, multiple-output
（MU-MIMO）.In order to further increase the uplink throughput of LTE, LTE R10 uplinks introduce single user multiple-input, multiple-output（SU-
MIMO）, UE can be supported to be sent with 1,2,4 antenna.And in uplink（UL）MU-MIMO is carried out on the basis of SU-MIMO
Enhancing, mainly to UL demodulated reference signals（DM RS）In cyclic shift（CS）It is proposed based on orthogonal mask on the basis of multiplexing
（OCC）Enhanced scheme.Such scheme can increase by 2 times of reusing degree on the basis of CS is multiplexed, can be by selecting all layers
The different configurations of OCC complete UE and realize MU pairings in the case where occupying different bandwidth.
On the one hand it is that uplink scheduling brings more flexibilities, it can be achieved that same user that pairing UE occupies different bandwidth
It is matched simultaneously with multiple users；On the other hand, the multiple user's combinations of pairs that can be formed between user are during resource lookup
It is extremely complex, increase uplink scheduling complexity.
Uplink multi-users resource allocation belongs to an important step of uplink scheduling, in uplink scheduling a to user and right
After it distributes resource, the user is judged with the presence or absence of pairing user, and if so, being that pairing user carries out resource allocation simultaneously.
In view of the frequency domain resource of pairing user's distribution is differed with current scheduling user distribution frequency domain resource, once in the presence of
Case above will not occupy situation by two users simultaneously in the pairing resource for needing to consider last time in resource allocation next time,
To cause dispatching priority chaotic and complexity increase, system performance is further influenced.
Invention content
The embodiment of the present invention proposes a kind of method of resource allocation, carries out resource allocation for uplink multi-users, avoids
The resource lookup process of complexity simultaneously ensures that dispatching priority of users sequence is unaffected, to ensure system performance.
The technical solution of the embodiment of the present invention is as follows：
A kind of method of resource allocation, the method includes：
The first scheduling user of selection in dispatching Subscriber Queue；
The available free scheduling of resource of system determines the second scheduling user in the pairing user of the first scheduling user；
By user data to be transferred amount first scheduling user and second scheduling user in determine first resource user and
Two resource users；
Resource is distributed for first resource user, in the resource of first resource user distribution, is distributed for Secondary resource user
Resource；
System resource is updated, again the first scheduling user of selection in dispatching Subscriber Queue.
The selection first in dispatching Subscriber Queue dispatches user and includes：According to User Priority from high to low suitable
Sequence selects the user of highest priority for the first scheduling user in dispatching Subscriber Queue.
It is described to determine that the second scheduling user includes in the pairing user of the first scheduling user：
In the pairing user of the first scheduling user, the second scheduling user is determined according to user utility value；By channel quality
User utility value is determined with user's data to be transferred amount.
It is described to determine that the second scheduling user includes according to user utility value：The maximum user utility value pair of the pairing user
The user answered is the second scheduling user.
The data to be transferred amount by user determines first resource user in the first scheduling user and the second scheduling user
User includes with Secondary resource：
The data to be transferred amount of first scheduling user is more than or equal to the data to be transferred amount of the second scheduling user, then the first scheduling is used
Family is first resource user, and the second scheduling user is Secondary resource user.
The data to be transferred amount by user determines first resource user in the first scheduling user and the second scheduling user
User includes with Secondary resource：
The data to be transferred amount of first scheduling user is less than the data to be transferred amount of the second scheduling user, then the first scheduling user is
Secondary resource user, the second scheduling user are first resource user.
It is described to distribute resource for first resource user, it is Secondary resource user in the resource of first resource user distribution
Distributing resource includes：
Resource is distributed for first resource user, in the resource of first resource user distribution, is distributed for Secondary resource user
Resource；
Label first resource user is secondary pairing user, and first resource user and second is deleted in dispatching Subscriber Queue
Resource user.
System does not have idling-resource scheduling, the method further includes：
There is the pairing user not yet dispatched in secondary pairing user；
On the surplus resources of secondary pairing user, the pairing user not yet to dispatch distributes resource.
The pairing user's more than one not yet dispatched, the pairing user distribution resource not yet to dispatch include：
For maximum user utility value, the corresponding pairing user not yet dispatched distributes resource.
From can be seen that in above-mentioned technical proposal in embodiments of the present invention, selection first is dispatched in dispatching Subscriber Queue
User；The available free scheduling of resource of system determines the second scheduling user in the pairing user of the first scheduling user；By waiting for for user
It passes data volume and determines first resource user and Secondary resource user in the first scheduling user and the second scheduling user；For the first money
Source user distributes resource, and in the resource of first resource user distribution, resource is distributed for Secondary resource user；Update system resource
With scheduling Subscriber Queue, select the user of highest priority for the first scheduling user in dispatching Subscriber Queue again；System does not have
Available free resource distributes resource then in the unappropriated resource of secondary pairing user for corresponding pairing user.This method for
Uplink multi-users carry out resource allocation, avoid complicated resource lookup process and ensure dispatching priority of users sequence not by shadow
It rings, to ensure system performance.
Description of the drawings
Fig. 1 is the method flow schematic diagram of resource allocation；
Fig. 2 is the embodiment flow diagram of resource allocation.
Specific implementation mode
To make the object, technical solutions and advantages of the present invention express to be more clearly understood, below in conjunction with the accompanying drawings and specifically
The present invention is further described in more detail for embodiment.
In embodiments of the present invention, the user of highest priority is selected in the scheduling Subscriber Queue according to priority arrangement
User is dispatched for first, and then determines the second scheduling user, is that two users carry out resource allocations, and record secondary pairing user
And the remaining resource of secondary pairing user also utilizes the remaining resource of secondary pairing user, is when system does not have idling-resource
Correspondingly pairing user distributes resource.Above method to avoid complicated resource lookup process and can ensure dispatching priority of users
It is sequentially unaffected, to ensure system performance.
It is the method flow schematic diagram of resource allocation referring to attached drawing 1, specifically includes following steps：
101, select the user of highest priority for the first scheduling user in dispatching Subscriber Queue.
According to priority formula f (CQI, BSR), according to priority, the user that is ranked sequentially from high to low obtains scheduling user
Queue.According to the sequence of User Priority from high to low, it is first that the user of highest priority is selected in dispatching Subscriber Queue
Dispatch user.After selected first scheduling user completes scheduling, update scheduling Subscriber Queue selects in dispatching Subscriber Queue
The highest user of current priority is selected as the next time first scheduling user.
102, judge system whether idling-resource, if the available free resource of system, executes 103；If system is provided without idle
Source then executes 107.
103, the available free scheduling of resource of system determines the second scheduling user in the pairing user of the first scheduling user.
The available free scheduling of resource of system then needs to match from multiple since the first scheduling user has at least one pairing user
To determining a pairing user as the second scheduling user in user.
First, user utility value is determined by channel quality and user's data to be transmitted amount.Channel quality and user are to be transmitted
Data volume and user utility value are directly proportional relationships.Can carry out detailed setting according to specific system, the present invention to this simultaneously
Without limiting.
The corresponding pairing user of maximum user utility value is the second scheduling user.Due to priority and user utility value phase
It closes, ensures that the corresponding pairing user of maximum user utility value becomes the second scheduling user, so that it may to ensure according to the preferential of user
Grade carries out the scheduling of resource.
104, by the data to be transferred amount of user first resource user is determined in the first scheduling user and the second scheduling user
With Secondary resource user.
The data to be transmitted amount of first scheduling user is different from the second scheduling data to be transmitted amount of user, then selects wherein
The larger user of data to be transmitted amount uses as first resource user, the smaller user of data to be transmitted amount as Secondary resource
Family.
Specifically, the data to be transferred amount of the first scheduling user is more than or equal to the data to be transferred amount of the second scheduling user, then
First scheduling user is first resource user, and the second scheduling user is Secondary resource user.
The data to be transferred amount of first scheduling user is less than the data to be transferred amount of the second scheduling user, then the first scheduling user is
Secondary resource user, the second scheduling user are first resource user.
105, it is that first resource user distributes resource, is Secondary resource user in the resource of first resource user distribution
Resource is distributed, label first resource user is by secondary pairing user and records in distribution resource not by Secondary resource user occupancy
Surplus resources.
The purpose for determining first resource user is, is that the larger first resource user of data to be transmitted amount distributes resource,
Then in the resource of first resource user distribution, resource is distributed for Secondary resource user.If first resource user's is to be transmitted
Data volume is less than the data to be transmitted amount of Secondary resource user, then cannot achieve above-mentioned technical solution.
Since the data to be transmitted amount of first resource user is more than the data to be transmitted amount of Secondary resource user, that is to say, that
In the resource of first resource user distribution not completely occupied by Secondary resource user, also remaining resource, label first
Resource user is by secondary pairing user and records in distribution resource not by the surplus resources of Secondary resource user occupancy, exists in this way
When system does not have idling-resource, secondary pairing can also be carried out using the surplus resources of first resource user.
106, update system resource and scheduling Subscriber Queue, i.e., in dispatch Subscriber Queue deletion first resource user and
Two resource users, user is dispatched in selection first in dispatching Subscriber Queue again.
System resource is updated, selects the highest user of current priority as the first scheduling in dispatching Subscriber Queue again
User.
107, when system does not have idling-resource, then secondary pairing is carried out.
There is the pairing user not yet dispatched in i.e. secondary pairing user；On the surplus resources of secondary pairing user, for still
Unscheduled pairing user distributes resource.If there are multiple pairing users not yet dispatched, corresponded to for maximum user utility value
Pairing user distribute resource.
With reference to the technical solution that the present invention will be described in detail of specific embodiments and the drawings 2.
201, the user of the sequential selection highest priority in dispatching Subscriber Queue according to priority from high to low is the
One resource user.
202, the whether available free scheduling of resource of system is judged, if so, executing 203；Otherwise, 212 are executed.
203, the user utility value for calculating the pairing user of first resource user selects the maximum pairing of user utility value to use
Family is as Secondary resource user.
204, judge that the data to be transmitted amount of first resource user is more than or equal to the data to be transmitted amount of Secondary resource user,
If so, executing 205；Otherwise, 206 are executed.
It should be noted that the data to be transmitted amount as first resource user is more than or equal to the to be transmitted of Secondary resource user
Data volume, then first resource user is the first scheduling user, and Secondary resource user is the second scheduling user；As first resource user
Data to be transmitted amount be less than the data to be transmitted amount of Secondary resource user, then first resource user is the second scheduling user, the
Two resource users are the first scheduling user.Herein, in order to illustrate be not directed to the first scheduling user and second scheduling user, and
It is directly to be illustrated with first resource user and Secondary resource user.
205, it is that first resource user distributes resource.
206, it is distributed in resource in first resource user, resource is distributed for Secondary resource user.
207, label first resource user is secondary pairing user, and records secondary pairing resource.
208, it is that Secondary resource user distributes resource.
209, it is distributed in resource in Secondary resource user, resource is distributed for first resource user.
210, label Secondary resource user is secondary pairing user, and records secondary pairing resource.
211, system resource and scheduling Subscriber Queue update, delete first resource user and second in dispatching Subscriber Queue
Resource user.There are users in scheduling Subscriber Queue, then execute 201；Otherwise, terminate.
Whether have the user that can carry out secondary pairing, i.e., system has secondary pairing user and this secondary to match if 212, judging system
There is the pairing user not yet dispatched to user, if so, executing 213；Otherwise, terminate.
213, in the resource of secondary pairing user, the pairing user not yet to dispatch distributes resource.
The foregoing is only a preferred embodiment of the present invention, is not intended to limit the scope of the present invention.It is all
Within the spirit and principles in the present invention, any modification, equivalent replacement, improvement and so on should be included in the protection of the present invention
Within the scope of.
Claims (8)
1. a kind of method of resource allocation, which is characterized in that the method includes：
The first scheduling user of selection in dispatching Subscriber Queue；
The available free scheduling of resource of system determines the second scheduling user in the pairing user of the first scheduling user；
By the data to be transferred amount of user first resource user and the second money are determined in the first scheduling user and the second scheduling user
Source user；
Resource is distributed for first resource user, in the resource of first resource user distribution, resource is distributed for Secondary resource user；
Label first resource user is secondary pairing user, and first resource user and Secondary resource are deleted in dispatching Subscriber Queue
User；
System resource is updated, again the first scheduling user of selection in dispatching Subscriber Queue.
2. the method for resource allocation according to claim 1, which is characterized in that described to select first in dispatching Subscriber Queue
Dispatching user includes：According to the sequence of User Priority from high to low, the use of highest priority is selected in dispatching Subscriber Queue
Family is the first scheduling user.
3. the method for resource allocation according to claim 1, which is characterized in that the pairing user in the first scheduling user
User is dispatched in middle determination second：
In the pairing user of the first scheduling user, the second scheduling user is determined according to user utility value；By channel quality and use
Family data to be transferred amount determines user utility value.
4. the method for resource allocation according to claim 3, which is characterized in that described to determine the second tune according to user utility value
Spending user includes：The corresponding user of maximum user utility value of the pairing user is the second scheduling user.
5. the method for resource allocation according to claim 1, which is characterized in that the data to be transferred amount by user is first
Determine that first resource user and Secondary resource user include in scheduling user and the second scheduling user：
The data to be transferred amount of first scheduling user is more than or equal to the data to be transferred amount of the second scheduling user, then the first scheduling user is
First resource user, the second scheduling user are Secondary resource user.
6. the method for resource allocation according to claim 1, which is characterized in that the data to be transferred amount by user is first
Determine that first resource user and Secondary resource user include in scheduling user and the second scheduling user：
The data to be transferred amount of first scheduling user is less than the data to be transferred amount of the second scheduling user, then the first scheduling user is second
Resource user, the second scheduling user are first resource user.
7. the method for resource allocation according to claim 1, which is characterized in that system does not have idling-resource scheduling, the side
Method further comprises：
There is the pairing user not yet dispatched in secondary pairing user；
On the surplus resources of secondary pairing user, the pairing user not yet to dispatch distributes resource.
8. the method for resource allocation according to claim 7, which is characterized in that the pairing user more than one not yet dispatched
A, the pairing user distribution resource not yet to dispatch includes：It is not yet dispatched described in maximum user utility value is corresponding
It matches user and distributes resource.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310686703.XA CN104703284B (en) | 2013-12-09 | 2013-12-09 | A kind of method of resource allocation |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310686703.XA CN104703284B (en) | 2013-12-09 | 2013-12-09 | A kind of method of resource allocation |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104703284A CN104703284A (en) | 2015-06-10 |
| CN104703284B true CN104703284B (en) | 2018-08-24 |
Family
ID=53349954
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201310686703.XA Expired - Fee Related CN104703284B (en) | 2013-12-09 | 2013-12-09 | A kind of method of resource allocation |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104703284B (en) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106897124B (en) * | 2015-12-18 | 2020-03-10 | 华为技术有限公司 | Multi-tenant request processing method, device and equipment |
| CN113422676B (en) | 2017-09-08 | 2022-07-22 | 华为技术有限公司 | Method for determining resource position and method and device for determining resource |
| CN113286373B (en) * | 2020-02-19 | 2022-11-04 | 大唐移动通信设备有限公司 | Uplink multi-user-multi-input multi-output scheduling method and device |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102215585A (en) * | 2010-04-02 | 2011-10-12 | 电信科学技术研究院 | Method and device for pairing multiple users |
| CN102316597A (en) * | 2010-06-30 | 2012-01-11 | 中兴通讯股份有限公司 | Resource scheduling method and device for multiple input multiple output (MIMO) system |
| CN103096485A (en) * | 2011-11-08 | 2013-05-08 | 普天信息技术研究院有限公司 | Method of multi-user multi-input multi-output frequency selection scheduling of local thermodynamic equilibrium (LTE) system |
| WO2013115394A1 (en) * | 2012-01-30 | 2013-08-08 | Nec Corporation | Method of framework for dci multiplexing and search space design |
| CN103415081A (en) * | 2013-08-28 | 2013-11-27 | 北京北方烽火科技有限公司 | Resource dispatching method and base station |
-
2013
- 2013-12-09 CN CN201310686703.XA patent/CN104703284B/en not_active Expired - Fee Related
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102215585A (en) * | 2010-04-02 | 2011-10-12 | 电信科学技术研究院 | Method and device for pairing multiple users |
| CN102316597A (en) * | 2010-06-30 | 2012-01-11 | 中兴通讯股份有限公司 | Resource scheduling method and device for multiple input multiple output (MIMO) system |
| CN103096485A (en) * | 2011-11-08 | 2013-05-08 | 普天信息技术研究院有限公司 | Method of multi-user multi-input multi-output frequency selection scheduling of local thermodynamic equilibrium (LTE) system |
| WO2013115394A1 (en) * | 2012-01-30 | 2013-08-08 | Nec Corporation | Method of framework for dci multiplexing and search space design |
| CN103415081A (en) * | 2013-08-28 | 2013-11-27 | 北京北方烽火科技有限公司 | Resource dispatching method and base station |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104703284A (en) | 2015-06-10 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| JP6290863B2 (en) | Method and apparatus for CSI reporting | |
| CN103430607B (en) | Wireless communication system and device | |
| KR101324670B1 (en) | Uplink control signaling in cellular telecommunication system | |
| KR101601585B1 (en) | Control signaling for downlink coordinated multipoint wireless communication | |
| CN103687042B (en) | The transmission method and system of a kind of Physical Downlink Shared Channel | |
| CN104969486B (en) | The method and apparatus for transmitting signal | |
| CN110351063B (en) | Terminal station and receiving method | |
| CN105850088A (en) | System and method for orthogonal frequency division multiple access (OFDMA) resource allocation | |
| CN106031065A (en) | Transmission method, base station, and user equipment (UE) in non-orthogonal multiple access | |
| CN105723623A (en) | Methods for interference cancellation/suppression with network assistance | |
| CN103124207A (en) | Wireless communication system and device | |
| CN105379381B (en) | A kind of data dispatching method, device and equipment using unlicensed spectrum | |
| CN102025461B (en) | Frequency domain scheduling method and device | |
| CN103703846B (en) | The supply resource Elemental partition in the physical resource of downlink channel | |
| CN103139924A (en) | Method and device for scheduling resources | |
| CN104602352B (en) | For the improved method and device of the cooperative scheduling transmission in wireless network | |
| CN101645731B (en) | Method for allocating transmission modes | |
| CN101730139A (en) | Descending control channel assignment and blind test method | |
| CN103298114B (en) | The resource allocation method and device of uplink pilot signal in communication system | |
| CN104955155A (en) | PDSCH data receiving method, transmitting method, user equipment and eNB | |
| US20180242256A1 (en) | Enhanced power consumption management of a user equipment using a mobile communication network, wherein different sets of radio resources are used in dependency of a power consumption information | |
| CN101754347B (en) | CQI estimation method, system and device during multi-stream beamforming transmission | |
| CN104703284B (en) | A kind of method of resource allocation | |
| CN107113874A (en) | base station, user terminal and data transmission method | |
| KR101469730B1 (en) | Method and device for allocating resources in an ofdm network |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| CB02 | Change of applicant information |
Address after: 100080 Beijing, Haidian, North Street, No. two, No. 6, No. Applicant after: POTEVIO INFORMATION TECHNOLOGY Co.,Ltd. Address before: 100080 Beijing, Haidian, North Street, No. two, No. 6, No. Applicant before: PETEVIO INSTITUTE OF TECHNOLOGY Co.,Ltd. |
|
| CB02 | Change of applicant information | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20180824 Termination date: 20211209 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |