CN104703284A - Resource allocation method - Google Patents

Resource allocation method Download PDF

Info

Publication number
CN104703284A
CN104703284A CN201310686703.XA CN201310686703A CN104703284A CN 104703284 A CN104703284 A CN 104703284A CN 201310686703 A CN201310686703 A CN 201310686703A CN 104703284 A CN104703284 A CN 104703284A
Authority
CN
China
Prior art keywords
user
resource
dispatched users
dispatched
pairing
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.)
Granted
Application number
CN201310686703.XA
Other languages
Chinese (zh)
Other versions
CN104703284B (en
Inventor
解芳
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Potevio Institute of Technology Co Ltd
Original Assignee
Potevio Institute of Technology Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Potevio Institute of Technology Co Ltd filed Critical Potevio Institute of Technology Co Ltd
Priority to CN201310686703.XA priority Critical patent/CN104703284B/en
Publication of CN104703284A publication Critical patent/CN104703284A/en
Application granted granted Critical
Publication of CN104703284B publication Critical patent/CN104703284B/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W72/00Local resource management
    • H04W72/50Allocation or scheduling criteria for wireless resources
    • H04W72/56Allocation or scheduling criteria for wireless resources based on priority criteria

Abstract

The invention discloses a resource allocation method. The resource allocation method includes: selecting a highest-priority user as a first scheduling user from a scheduling user queue; when free resources exist in a system, determining a second scheduling user in pairing users of the first scheduling user, and determining a first resource user and a second resource user between the first and second scheduling users; allocating resources to the first resource user, then allocating resources to the second resource user from the resources allocated to the first resource user, and marking the first resource user as a secondary pairing user; updating system resources and scheduling the user queue, and reselecting a highest-priority user as the first scheduling user from the scheduling user queue; if no free resources exists in the system, allocating resources to the corresponding pairing users from the resources not allocated to the secondary fairing user. By application of the resource allocation method, a complex resource searching process can be avoided in uplink multi-user resource allocation while user scheduling priority sequence is unaffected, and accordingly system performance can be guaranteed.

Description

A kind of method of Resourse Distribute
Technical field
The application relates to communication technical field, more specifically, relates to a kind of method of Resourse Distribute.
Background technology
LTE R8/R9 is up only supports single antenna to send or 2 antennas switching transmission, can support multi-user's multiple-input, multiple-output (MU-MIMO).In order to improve the uplink throughput of LTE further, LTE R10 is up introduces single user multiple-input, multiple-output (SU-MIMO), can support that UE is with 1, and 2,4 antennas send.And on the basis of up (UL) SU-MIMO, MU-MIMO is strengthened, mainly the enhanced scheme based on orthogonal mask (OCC) is proposed on cyclic shift (CS) multiplexing basis to UL demodulated reference signal (DM RS).This kind of scheme can increase the reusing degree of 2 times on the basis that CS is multiplexing, can realize MU pairing by selecting the different configuration of the OCC of all layers complete UE when taking different bandwidth.
Pairing UE takies different bandwidth on the one hand for uplink scheduling brings more flexibility, can realize same user and multiple user matches simultaneously; On the other hand, multiple user's combinations of pairs that can form between user are very complicated in resource lookup process, add uplink scheduling complexity.
Uplink multi-users Resourse Distribute belongs to an important step of uplink scheduling, after uplink scheduling is to a user and to its Resources allocation, judges whether this user exists pairing user, if existed, simultaneously for pairing user carries out Resourse Distribute.
Consider that the frequency domain resource that pairing user distributes and current scheduling user distribute frequency domain resource not identical, once there is above situation, do not occupied situation by two users by the pairing resource needing to consider last time when upper once Resourse Distribute simultaneously, thus cause dispatching priority confusion and complexity to increase, further influential system performance.
Summary of the invention
The embodiment of the present invention proposes a kind of method of Resourse Distribute, carries out Resourse Distribute for uplink multi-users, avoids complicated resource lookup process and ensures that dispatching priority of users order is unaffected, thus ensureing systematic function.
The technical scheme of the embodiment of the present invention is as follows:
A method for Resourse Distribute, described method comprises:
The first dispatched users is selected in dispatched users queue;
The available free scheduling of resource of system, determines the second dispatched users in the pairing user of the first dispatched users;
In the first dispatched users and the second dispatched users, first resource user and Secondary resource user is determined by the data to be transferred amount of user;
For first resource user resource allocation, in the resource that first resource user distributes, be Secondary resource user resource allocation;
Upgrade system resource, again in dispatched users queue, select the first dispatched users.
Described first dispatched users of selecting in dispatched users queue comprises: according to User Priority order from high to low, select the user that priority is the highest to be the first dispatched users in dispatched users queue.
Describedly in the pairing user of the first dispatched users, determine that the second dispatched users comprises:
In the pairing user of the first dispatched users, determine the second dispatched users according to user utility value; By channel quality and user's data to be transferred amount determination user utility value.
Describedly determine that the second dispatched users comprises according to user utility value: the user that the maximum user utility value of described pairing user is corresponding is the second dispatched users.
The described data to be transferred amount by user determines that in the first dispatched users and the second dispatched users first resource user and Secondary resource user comprise:
The data to be transferred amount of the first dispatched users is more than or equal to the data to be transferred amount of the second dispatched users, then the first dispatched users is first resource user, and the second dispatched users is Secondary resource user.
The described data to be transferred amount by user determines that in the first dispatched users and the second dispatched users first resource user and Secondary resource user comprise:
The data to be transferred amount of the first dispatched users is less than the data to be transferred amount of the second dispatched users, then the first dispatched users is Secondary resource user, and the second dispatched users is first resource user.
Described is first resource user resource allocation, in the resource that first resource user distributes, for Secondary resource user resource allocation comprises:
For first resource user resource allocation, in the resource that first resource user distributes, be Secondary resource user resource allocation;
Mark first resource user is secondary pairing user, deletes first resource user and Secondary resource user in dispatched users queue.
System does not have idling-resource to dispatch, and described method comprises further:
There is the pairing user not yet dispatched in secondary pairing user;
On the surplus resources of secondary pairing user, it is the pairing user resource allocation not yet dispatched.
More than one of the described pairing user not yet dispatched, the described pairing user resource allocation for not yet dispatching comprises: for maximum user utility value corresponding described in the pairing user resource allocation not yet dispatched.
As can be seen from technique scheme, in dispatched users queue, select the first dispatched users in embodiments of the present invention; The available free scheduling of resource of system, determines the second dispatched users in the pairing user of the first dispatched users; In the first dispatched users and the second dispatched users, first resource user and Secondary resource user is determined by the data to be transferred amount of user; For first resource user resource allocation, in the resource that first resource user distributes, be Secondary resource user resource allocation; Upgrade system resource and dispatched users queue, again in dispatched users queue, select the user that priority is the highest to be the first dispatched users; System does not have idling-resource, then in the unappropriated resource of secondary pairing user, for matching user resource allocation accordingly.The method carries out Resourse Distribute for uplink multi-users, avoids complicated resource lookup process and ensures that dispatching priority of users order is unaffected, thus ensureing systematic function.
Accompanying drawing explanation
Fig. 1 is the method flow schematic diagram of Resourse Distribute;
Fig. 2 is the embodiment schematic flow sheet of Resourse Distribute.
Embodiment
Express clearly clear for making the object, technical solutions and advantages of the present invention, below in conjunction with drawings and the specific embodiments, the present invention is further described in more detail.
In embodiments of the present invention, the user that priority is the highest is being selected to be the first dispatched users according in the dispatched users queue of priority arrangement, and then determine the second dispatched users, be that two users carry out Resourse Distribute, and record secondary pairing user and the remaining resource of secondary pairing user, when system does not have idling-resource, also utilize the remaining resource of secondary pairing user, for correspondingly matching user resource allocation.Above method can be avoided complicated resource lookup process and ensure that dispatching priority of users order is unaffected, thus ensures systematic function.
See the method flow schematic diagram that accompanying drawing 1 is Resourse Distribute, specifically comprise the following steps:
101, in dispatched users queue, the user that priority is the highest is selected to be the first dispatched users.
According to priority formula f (CQI, BSR), according to priority, order arrangement user from high to low obtains dispatched users queue.According to User Priority order from high to low, in dispatched users queue, the user that priority is the highest is selected to be the first dispatched users.After the first selected dispatched users completes scheduling, upgrade dispatched users queue, select in dispatched users queue user that current priority is the highest as on once the first dispatched users.
102, judge system whether idling-resource, if the available free resource of system, then perform 103; If system does not have idling-resource, then perform 107.
103, the available free scheduling of resource of system, determines the second dispatched users in the pairing user of the first dispatched users.
The available free scheduling of resource of system, because the first dispatched users has at least one pairing user, then needs from multiple pairing user, determine that a pairing user is as the second dispatched users.
First, by channel quality and user's data to be transmitted amount determination user utility value.Channel quality and user's data to be transmitted amount are the relations be directly proportional to user utility value.Can carry out detailed setting according to concrete system, the present invention does not limit this.
Pairing user corresponding to maximum user utility value is the second dispatched users.Because priority is relevant to user utility value, ensure that pairing user corresponding to maximum user utility value becomes the second dispatched users, just can ensure that the priority according to user carries out the scheduling of resource.
104, in the first dispatched users and the second dispatched users, first resource user and Secondary resource user is determined by the data to be transferred amount of user.
The data to be transmitted amount of the first dispatched users is different from the data to be transmitted amount of the second dispatched users, then select user that wherein data to be transmitted amount is larger as first resource user, and the less user of data to be transmitted amount is as Secondary resource user.
Specifically, the data to be transferred amount of the first dispatched users is more than or equal to the data to be transferred amount of the second dispatched users, then the first dispatched users is first resource user, and the second dispatched users is Secondary resource user.
The data to be transferred amount of the first dispatched users is less than the data to be transferred amount of the second dispatched users, then the first dispatched users is Secondary resource user, and the second dispatched users is first resource user.
105, being first resource user resource allocation, in the resource that first resource user distributes, is Secondary resource user resource allocation, and mark first resource user matches user recording in institute's Resources allocation not by the surplus resources of Secondary resource CU for secondary.
Determining that the object of first resource user is, is the first resource user resource allocation that data to be transmitted amount is larger, then in the resource of first resource user distribution, is Secondary resource user resource allocation.If the data to be transmitted amount of first resource user is less than the data to be transmitted amount of Secondary resource user, then cannot realize above-mentioned technical scheme.
Data to be transmitted amount due to first resource user is greater than the data to be transmitted amount of Secondary resource user, that is first resource user distribute resource in not completely shared by Secondary resource user, also has remaining resource, mark first resource user matches user recording in institute's Resources allocation not by the surplus resources of Secondary resource CU for secondary, like this when system does not have idling-resource, the surplus resources of first resource user can also be utilized to carry out secondary pairing.
106, upgrade system resource and dispatched users queue, namely in dispatched users queue, delete first resource user and Secondary resource user, again in dispatched users queue, select the first dispatched users.
Upgrade system resource, in dispatched users queue, again select user that current priority is the highest as the first dispatched users.
107, when system does not have idling-resource, then secondary pairing is carried out.
Namely there is the pairing user not yet dispatched in secondary pairing user; On the surplus resources of secondary pairing user, it is the pairing user resource allocation not yet dispatched.If there is multiple pairing user not yet dispatched, be then pairing user resource allocation corresponding to maximum user utility value.
Technical scheme of the present invention is described in detail below in conjunction with specific embodiments and the drawings 2.
201, be first resource user according to the user that priority selective sequential priority is from high to low the highest in dispatched users queue.
202, judge the whether available free scheduling of resource of system, if had, perform 203; Otherwise, perform 212.
203, calculate the user utility value of the pairing user of first resource user, the pairing user selecting user utility value maximum 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, then perform 205; Otherwise, perform 206.
It should be noted that, when 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, then first resource user is the first dispatched users, and Secondary resource user is the second dispatched users; When the data to be transmitted amount of first resource user is less than the data to be transmitted amount of Secondary resource user, then first resource user is the second dispatched users, and Secondary resource user is the first dispatched users., do not relate to the first dispatched users and the second dispatched users to illustrate herein, but be directly described with first resource user and Secondary resource user.
205, be first resource user resource allocation.
206, on first resource user resource allocation, be Secondary resource user resource allocation.
207, mark first resource user for secondary pairing user, and record secondary pairing resource.
208, be Secondary resource user resource allocation.
209, on Secondary resource user resource allocation, be first resource user resource allocation.
210, mark Secondary resource user for secondary pairing user, and record secondary pairing resource.
211, system resource and dispatched users queue upgrade, and delete first resource user and Secondary resource user in dispatched users queue.There is user in dispatched users queue, then perform 201; Otherwise, terminate.
212, judge whether system has the user that can carry out secondary pairing, namely system have secondary match user and this secondary pairing user there is the pairing user not yet dispatched, if so, execution 213; Otherwise, terminate.
213, in the resource of secondary pairing user, be the pairing user resource allocation not yet dispatched.
The above, be only preferred embodiment of the present invention, be not intended to limit protection scope of the present invention.Within the spirit and principles in the present invention all, any amendment done, equivalent replacement, improvement etc., all should be included within protection scope of the present invention.

Claims (9)

1. a method for Resourse Distribute, is characterized in that, described method comprises:
The first dispatched users is selected in dispatched users queue;
The available free scheduling of resource of system, determines the second dispatched users in the pairing user of the first dispatched users;
In the first dispatched users and the second dispatched users, first resource user and Secondary resource user is determined by the data to be transferred amount of user;
For first resource user resource allocation, in the resource that first resource user distributes, be Secondary resource user resource allocation;
Upgrade system resource, again in dispatched users queue, select the first dispatched users.
2. the method for Resourse Distribute according to claim 1, it is characterized in that, described first dispatched users of selecting in dispatched users queue comprises: according to User Priority order from high to low, select the user that priority is the highest to be the first dispatched users in dispatched users queue.
3. the method for Resourse Distribute according to claim 1, is characterized in that, describedly in the pairing user of the first dispatched users, determines that the second dispatched users comprises:
In the pairing user of the first dispatched users, determine the second dispatched users according to user utility value; By channel quality and user's data to be transferred amount determination user utility value.
4. the method for Resourse Distribute according to claim 3, is characterized in that, describedly determines that the second dispatched users comprises according to user utility value: the user that the maximum user utility value of described pairing user is corresponding is the second dispatched users.
5. the method for Resourse Distribute according to claim 1, it is characterized in that, the described data to be transferred amount by user determines that in the first dispatched users and the second dispatched users first resource user and Secondary resource user comprise:
The data to be transferred amount of the first dispatched users is more than or equal to the data to be transferred amount of the second dispatched users, then the first dispatched users is first resource user, and the second dispatched users is Secondary resource user.
6. the method for Resourse Distribute according to claim 1, it is characterized in that, the described data to be transferred amount by user determines that in the first dispatched users and the second dispatched users first resource user and Secondary resource user comprise:
The data to be transferred amount of the first dispatched users is less than the data to be transferred amount of the second dispatched users, then the first dispatched users is Secondary resource user, and the second dispatched users is first resource user.
7. the method for Resourse Distribute according to claim 1, it is characterized in that, described is first resource user resource allocation, in the resource that first resource user distributes, for Secondary resource user resource allocation comprises:
For first resource user resource allocation, in the resource that first resource user distributes, be Secondary resource user resource allocation;
Mark first resource user is secondary pairing user, deletes first resource user and Secondary resource user in dispatched users queue.
8. the method for Resourse Distribute according to claim 7, it is characterized in that, system does not have idling-resource to dispatch, and described method comprises further:
There is the pairing user not yet dispatched in secondary pairing user;
On the surplus resources of secondary pairing user, it is the pairing user resource allocation not yet dispatched.
9. the method for Resourse Distribute according to claim 8, it is characterized in that, more than one of the described pairing user not yet dispatched, the described pairing user resource allocation for not yet dispatching comprises: for maximum user utility value corresponding described in the pairing user resource allocation not yet dispatched.
CN201310686703.XA 2013-12-09 2013-12-09 A kind of method of resource allocation Expired - Fee Related CN104703284B (en)

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 true CN104703284A (en) 2015-06-10
CN104703284B 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)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106897124A (en) * 2015-12-18 2017-06-27 华为软件技术有限公司 A kind of multi-tenant request processing method, device and equipment
CN109474955A (en) * 2017-09-08 2019-03-15 华为技术有限公司 It determines the method for resource location and determines the method and device of resource
CN113286373A (en) * 2020-02-19 2021-08-20 大唐移动通信设备有限公司 Uplink multi-user-multi-input multi-output scheduling method and device

Citations (5)

* Cited by examiner, † Cited by third party
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

Patent Citations (5)

* Cited by examiner, † Cited by third party
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

Cited By (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106897124A (en) * 2015-12-18 2017-06-27 华为软件技术有限公司 A kind of multi-tenant request processing method, device and equipment
CN106897124B (en) * 2015-12-18 2020-03-10 华为技术有限公司 Multi-tenant request processing method, device and equipment
CN109474955A (en) * 2017-09-08 2019-03-15 华为技术有限公司 It determines the method for resource location and determines the method and device of resource
CN113422676A (en) * 2017-09-08 2021-09-21 华为技术有限公司 Method for determining resource position and method and device for determining resource
US11272525B2 (en) 2017-09-08 2022-03-08 Huawei Technologies Co., Ltd. Resource location determining method and apparatus, and resource determining method and apparatus
CN113422676B (en) * 2017-09-08 2022-07-22 华为技术有限公司 Method for determining resource position and method and device for determining resource
CN109474955B (en) * 2017-09-08 2023-11-10 华为技术有限公司 Method for determining resource position and method and device for determining resource
CN113286373A (en) * 2020-02-19 2021-08-20 大唐移动通信设备有限公司 Uplink multi-user-multi-input multi-output scheduling method and device
CN113286373B (en) * 2020-02-19 2022-11-04 大唐移动通信设备有限公司 Uplink multi-user-multi-input multi-output scheduling method and device

Also Published As

Publication number Publication date
CN104703284B (en) 2018-08-24

Similar Documents

Publication Publication Date Title
US9674753B2 (en) Channel state information feedback scheme for cooperative multi point transmission and carrier aggregation scenario
KR101427245B1 (en) Method of and apparatus for mapping to demodulation reference signal port
CN103378924B (en) The determination method and device of transport block size, synchronous method, apparatus and system
CN105490791B (en) SRS signal sending and triggering method, device, user equipment and base station
JP2013529426A5 (en)
CN103687042A (en) Transmission method and system for physical downlink shared channel
KR20140139027A (en) Control signaling for downlink coordinated multipoint wireless communication
CN102355732A (en) Downlink control information transmission method and device
CN103139924A (en) Method and device for scheduling resources
CN105379381B (en) A kind of data dispatching method, device and equipment using unlicensed spectrum
CN105766049A (en) Signaling designs for network assisted interference cancellation and suppression
WO2013091366A1 (en) Port mapping, precoding matrix and modulation coding manner selection method and device
CN102291225B (en) Channel state information periodic feedback method and device
CN105101307A (en) Method, system and related equipment for configuring neighbor cell transmission parameters in heterogeneous networks
CN102378379A (en) Channel state indication reference signal (CSI-RS) initial position configuration and indication method, CSI-RS receiving method, network-side equipment and terminal
CN107736065A (en) A kind of resource allocation information indicating means, base station and user equipment
CN102244563B (en) Method, device and system for transmitting and receiving data
CN104955155A (en) PDSCH data receiving method, transmitting method, user equipment and eNB
CN104602179A (en) D2D (Device to Device) data transmission method and user equipment
CN103313367A (en) Uplink multi-user method applicable to wireless local area network
CN103096477B (en) Enhancement mode PDCCH implementation method and relevant device
CN102264129A (en) Method and device for distributing resources
CN104703284A (en) Resource allocation method
CN103037510A (en) Indicating method, system and device for enhancing downlink control channel resources
CN105992380A (en) Base station, mobile station, and downlink scheduling method

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