CN103249160B - A kind of resource allocation methods in lte-a system under CoMP - Google Patents

A kind of resource allocation methods in lte-a system under CoMP Download PDF

Info

Publication number
CN103249160B
CN103249160B CN201210024868.6A CN201210024868A CN103249160B CN 103249160 B CN103249160 B CN 103249160B CN 201210024868 A CN201210024868 A CN 201210024868A CN 103249160 B CN103249160 B CN 103249160B
Authority
CN
China
Prior art keywords
comp
cell
rsrp
cooperation
terminal
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
Application number
CN201210024868.6A
Other languages
Chinese (zh)
Other versions
CN103249160A (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.)
Spreadtrum Communications Shanghai Co Ltd
Research Institute of Telecommunications Transmission Ministry of Industry and Information Technology
Original Assignee
Spreadtrum Communications Shanghai Co Ltd
Research Institute of Telecommunications Transmission Ministry of Industry and Information Technology
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 Spreadtrum Communications Shanghai Co Ltd, Research Institute of Telecommunications Transmission Ministry of Industry and Information Technology filed Critical Spreadtrum Communications Shanghai Co Ltd
Priority to CN201210024868.6A priority Critical patent/CN103249160B/en
Publication of CN103249160A publication Critical patent/CN103249160A/en
Application granted granted Critical
Publication of CN103249160B publication Critical patent/CN103249160B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Landscapes

  • Mobile Radio Communication Systems (AREA)

Abstract

The present invention relates to the resource allocation methods under CoMP in a kind of lte-a system, by the base stations of cells all in measuring system community user Reference Signal Received Power (Reference signal Received power, abbreviation RSRP), the corresponding cell of maximum RSRP numerical value is found out as serving cell, and in CoMP measuring assembly, cell corresponding with the RSRP within RSRP numerical value difference threshold value is as the cooperation cell CoMP, the cooperation set of each user is determined with this, then the performance according to each RB under CoMP transmission mode and under single cell pattern, the adaptive transmission mode for selecting the RB.The present invention is directed to coordinated multipoint transmission CoMP system, proposes a kind of resource scheduling algorithm, which does not limit the cooperation cell number of each user service, and is suitable for the cell cooperative collection selection method of collaboration set overlapping, is conducive to the raising of handling capacity.

Description

A kind of resource allocation methods in lte-a system under CoMP
Technical field
The present invention relates to fields of communication technology, and in particular, to the resource allocation side in a kind of lte-a system under CoMP Method.
Background technique
With increasing for broadband wireless data business demand, it is desirable that reach higher spectrum efficiency, LTE-A (Long Term Evolution-Advanced multi-cell cooperating CoMP (Coordinated Multiple Points) skill) is introduced in system Art, to eliminate inter-cell interference, wherein resource allocation is one of the critical issue in CoMP technology, how to determine each user by Whether several cell serves dispatch CoMP user on each resource block and are required to the cooperative information between cell to determine, only according to Resource Scheduler by this cell base station is difficult to realize.
Common CoMP dispatching algorithm is joint ratio fair scheduling scheme (Joint Proportional Fairness Scheduling, abbreviation JPF), the program is edge customer and central user by dividing user, determine CoMP user set, Then each resource block is measured in the superiority and inferiority of CoMP transmission mode and single cell transmission mode, determines the transmission mode of the RB, it should Method is limited in that the cooperation cell for being only applicable to 3 sectors, and collaboration set is nonoverlapping cell.
Present multipoint cooperative scene introduces wireless radio remote unit (Remote Radio Header, RRH), makes More cells carry out cooperation and are possibly realized, it is therefore necessary to study a kind of unrestricted resource allocation with cooperation cell number Method.
Summary of the invention
The present invention passes through Reference Signal Received Power of the base station in community user of all cells in measuring system (Reference signal Received power, abbreviation RSRP) finds out the corresponding cell of maximum RSRP numerical value as clothes Business cell, and in CoMP measuring assembly, cell corresponding with the RSRP within RSRP numerical value difference threshold value is as CoMP Cooperation cell determines the cooperation set of each user with this, then according to each RB under CoMP transmission mode and single cell Performance under mode, the adaptive transmission mode for selecting the RB.
In order to achieve the above object, the invention proposes the resource scheduling algorithms under CoMP in a kind of lte-a system, are applicable in It is overlapped in collaboration set, and the unfixed situation of collaboration set.Resource allocation side in lte-a system proposed by the present invention under CoMP Method, including:
Step 1:For each terminal, all cells are measured in reception power (the Reference Signal of reference signal Received Power, abbreviation RSRP), wherein RSRPjIt is the Reference Signal Received Power of j-th of cell;
Step 2:Find out maximum RSRP value RSRPmax, determining to meet RSRPmax-RSRPj< RSRPthresholdCooperation it is small Cell j is added in the cooperation set of the terminal by area, if the number of cooperation cell is 1, which is single community user, If the number of cooperation cell is greater than 1, which is CoMP user;
Step 3:Resource allocation is carried out to RB all in system, initializes i=1, wherein i is that RB counts mark;
Step 4:Initialize the set that set omega is all cells in whole system;
Step 5:The priority of all CoMP users in set omega is ranked up from high to low, is denoted as set U;
Step 6:To the highest user Uc of weight in set U, its collaboration set is determined, if the CoMP of the user is preferential The RB is just set as using CoMP transmission, otherwise the RB is set as by grade greater than the summation of single user priority in corresponding cooperation cell Single cell transmission, and cooperation used set is removed from set omega;
Step 7:If set omega is not empty, the resource allocation of return step 5 to step 6, no to then follow the steps 8;
Step 8:If i=NRB, wherein NRBIt is RB sum, algorithm terminates, and resource allocation is completed, and otherwise updates i, i=i+ 1, return step 4 arrives the resource allocation of step 7.
As a preferred embodiment, step 5 includes:
Step 5a:The priority valve of all users on each RB is calculated according to proportional fair algorithm;
Step 5b:Construct CoMP user highest priority weight table;
As a preferred embodiment, step 6 includes:
Step 6a:Screening collaboration set is the CoMP user set U of subset Ω;
Step 6b:It finds out the highest user of weight in U and determines its collaboration set;
Step 6c:Search weight table.
As a preferred embodiment, proportional fair algorithm calculates the upper all list community users of each RB in single cell transmission mould Weight under formula and CoMP user CoMP transmission mode
Wherein RK, i(t) on for i-th RB user UEk in the attainable maximum transmission rate of scheduling instance t,For Average transmission rate, more new formula are:
The present invention passes through Reference Signal Received Power of the base station in community user of all cells in measuring system (Reference Signal Received Power, abbreviation RSRP) finds out the corresponding cell of maximum RSRP numerical value as clothes Business cell, and in CoMP measuring assembly, cell corresponding with the RSRP within RSRP numerical value difference threshold value is as CoMP Cooperation cell determines the cooperation set of each user with this, then according to each RB under CoMP transmission mode and single cell Performance under mode, the adaptive transmission mode for selecting the RB.The present invention can satisfy cooperation cell overlapping and cooperation cell The unfixed requirement of number.
Detailed description of the invention
Fig. 1 is the resource allocation methods schematic diagram in lte-a system of the present invention under CoMP.
Specific embodiment
It elaborates below to the embodiment of the present invention, the present embodiment carries out under the premise of the technical scheme of the present invention Implement, the detailed implementation method and specific operation process are given, but protection scope of the present invention is not limited to following implementation Example.For different network systems, the present invention can have different embodiments.
As shown in Figure 1, the resource allocation methods in lte-a system proposed by the present invention under CoMP, including:
Step 1:For each terminal, all cells are measured in reception power (the Reference Signal of reference signal Received Power, abbreviation RSRP), wherein RSRPjIt is the Reference Signal Received Power of j-th of cell;
Step 2:Find out maximum RSRP value RSRPmax, determining to meet RSRPmax-RSRPj< RSRPthresholdCooperation it is small Cell j is added in the cooperation set of the terminal by area, if the number of cooperation cell is 1, which is single community user, If the number of cooperation cell is greater than 1, which is CoMP user;
Step 3:Resource allocation is carried out to RB all in system, initializes i=1, wherein i is that RB counts mark;
Step 4:Initialize the set that set omega is all cells in whole system;
Step 5:The priority of all CoMP users in set omega is ranked up from high to low, is denoted as set U;
Step 6:To the highest user Uc of weight in set U, its collaboration set is determined, if the CoMP of the user is preferential The RB is just set as using CoMP transmission, otherwise the RB is set as by grade greater than the summation of single user priority in corresponding cooperation cell Single cell transmission, and cooperation used set is removed from set omega;
Step 7:If set omega is not empty, the resource allocation of return step 5 to step 6, no to then follow the steps 8;
Step 8:If i=NRB, wherein NRBIt is RB sum, algorithm terminates, and resource allocation is completed, and otherwise updates i, i=i+ 1, return step 4 arrives the resource allocation of step 7.
As a preferred embodiment, step 5 includes:
Step 5a:The priority valve of all users on each RB is calculated according to proportional fair algorithm;
Step 5b:Construct CoMP user highest priority weight table.
As a preferred embodiment, step 6 includes:
Step 6a:Screening collaboration set is the CoMP user set U of Ω subset;
Step 6b:It finds out the highest user of weight in U and determines its collaboration set;
Step 6c:Search weight table.
In one embodiment of the invention, resource allocation the specific steps are:
Step 1:RSRP numerical value of the user k on cell j is denoted as RSRPK, j
Step 2:The RSRP of largest cell is denoted as RSRPmax, find out RSRPmax-RSRPj< RSRPthresholdCell, add Enter in cooperation set, if the number of cooperation set is 1, which is single community user, if cooperation cell is greater than 1, the use Family is multiple cell user;
Step 3:Resource allocation is carried out to RB all in system, initializes i=1, wherein i is that RB counts mark;
Step 4:Initialize the set that set omega is all cells in whole system;
Step 5:Resource allocation is done to each RB, the priority of the multiple cell user in Ω is ranked up;
Step 6:Find out the user UE of greatest prioritym, corresponding cooperation cell number is N, and cell is { cell1, cell2..., cellN, cell is found out respectively1To cellNSingle community user UE of middle highest priority1, UE2... UEN, such as Fruit N × PM, i> P1, i+P2, i...+PN, i, user UEmUse resource RBiCoMP transmission is carried out, otherwise user UE1, UE2... UEN Single cell transmission is carried out using resource RBi;
Step 7:Update set omega, Ω=Ω-{ cell1..., cellN, if Ω be not it is empty, the above steps are repeated 5 Resource allocation is carried out to 6;
Step 8:If Ω is sky, the resource allocation of above step 4 to step 7 is carried out to next RB, until all RB resource allocation complete.
In conclusion being not intended to limit the scope of protection of the present invention the above are presently preferred embodiments of the present invention.It is not carrying on the back In the case where spirit of that invention and its essence, person of ordinary skill in the field makes various corresponding in accordance with the present invention Change and modification, but these corresponding changes and modifications all should belong to scope of protection of the claims of the invention.

Claims (3)

1. the resource allocation methods in a kind of lte-a system under CoMP, which is characterized in that including:
Step 1:For each terminal, the reception power (Reference of the reference signal of the base station of all cells is measured Signal Received Power, abbreviation RSRP), wherein RSRPjIt is the Reference Signal Received Power of the base station of j-th of cell;
Step 2:Find out maximum RSRP value RSRPmax, determining to meet RSRPmax-RSRPj< RSRPthresholdCooperation cell, Middle RSRPthresholdIt is the received power threshold of reference signal, cell j is added in the cooperation set of terminal, if cooperation is small The number in area is 1, and terminal is single cell terminal, if the number of cooperation cell is greater than 1, terminal is CoMP terminal;
Step 3:Resource allocation is carried out to RB all in system, initializes i=1, wherein i is that RB counts mark;
Step 4:Initialize the set that set omega is all cells in whole system;
Step 5:The priority of all CoMP terminals in set omega is ranked up from high to low, is denoted as set U;
Wherein, step 5 includes:
Step 5a:The priority valve of all CoMP terminals on each RB is calculated according to proportional fair algorithm;
Step 5b:Construct CoMP terminal highest priority weight table;
Step 6:To the highest terminal Uc of priority valve in set U, its cooperation set is determined, if the CoMP of CoMP terminal is excellent The RB just is set as otherwise should using CoMP transmission by first grade greater than the summation of single cell terminal priority in corresponding cooperation cell RB is set as single cell transmission, and cooperation used set is removed from set omega;
Step 7:If set omega is not empty, the resource allocation of return step 5 to step 6;
Step 8:If i=NRB, wherein NRBIt is RB sum, algorithm terminates, and resource allocation is completed, and otherwise updates i, i=i+1, returns Return the resource allocation that step 4 arrives step 6.
2. the resource allocation methods in lte-a system according to claim 1 under CoMP, which is characterized in that step 6 packet It includes:
Step 6a:Screen the set U;
Step 6b:It finds out the highest terminal of priority valve in U and determines its cooperation set;
Step 6c:Search weight table.
3. the resource allocation methods in lte-a system according to claim 1 under CoMP, which is characterized in that public with ratio It is all on each RB of flat algorithm calculating that single cell terminals are under single cell transmission mode and CoMP terminal is under CoMP transmission mode Weight
Wherein Rk,iIt (t) is UE on i-th of RBkIn the attainable maximum transmission rate of scheduling instance t institute, Pk,iIt (t) is UEkI-th Priority valve on a RB,For average transmission rate, more new formula is:
Wherein tcFor renewal time window.
CN201210024868.6A 2012-02-06 2012-02-06 A kind of resource allocation methods in lte-a system under CoMP Active CN103249160B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201210024868.6A CN103249160B (en) 2012-02-06 2012-02-06 A kind of resource allocation methods in lte-a system under CoMP

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201210024868.6A CN103249160B (en) 2012-02-06 2012-02-06 A kind of resource allocation methods in lte-a system under CoMP

Publications (2)

Publication Number Publication Date
CN103249160A CN103249160A (en) 2013-08-14
CN103249160B true CN103249160B (en) 2018-11-20

Family

ID=48928316

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201210024868.6A Active CN103249160B (en) 2012-02-06 2012-02-06 A kind of resource allocation methods in lte-a system under CoMP

Country Status (1)

Country Link
CN (1) CN103249160B (en)

Families Citing this family (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103763708B (en) 2014-01-23 2017-07-14 上海无线通信研究中心 A kind of network spectrum sharing method
CN105007628B (en) * 2014-04-23 2019-02-26 普天信息技术有限公司 A kind of wireless resource allocation methods and device
WO2016086407A1 (en) * 2014-12-05 2016-06-09 华为技术有限公司 Terminal, network device and coordinated multi-point transmission cooperating set selection method
CN105657853B (en) * 2016-03-24 2019-01-29 重庆信科设计有限公司 A kind of CoMP user dispatching method based on business difference
CN107359973B (en) * 2016-05-09 2021-08-13 中兴通讯股份有限公司 Method and device for selecting transmission node
CN109151831B (en) * 2017-06-27 2020-11-10 大唐移动通信设备有限公司 Method and device for allocating resources of serving cell and cooperative cell
CN107318133B (en) * 2017-07-31 2020-03-13 北京邮电大学 Base station resource allocation method, macro base station and terminal

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101583164A (en) * 2009-06-18 2009-11-18 西安电子科技大学 Method for selecting uplink cells in LTE-A
CN101895921A (en) * 2009-05-18 2010-11-24 普天信息技术研究院有限公司 Method for selecting coordinated multipoint cell
CN102026388A (en) * 2011-01-07 2011-04-20 西安电子科技大学 Method for allocating radio resources under coordinated multipoint transmission/reception (CoMP) in long term evolution-advanced (LTE-A) system

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101895921A (en) * 2009-05-18 2010-11-24 普天信息技术研究院有限公司 Method for selecting coordinated multipoint cell
CN101583164A (en) * 2009-06-18 2009-11-18 西安电子科技大学 Method for selecting uplink cells in LTE-A
CN102026388A (en) * 2011-01-07 2011-04-20 西安电子科技大学 Method for allocating radio resources under coordinated multipoint transmission/reception (CoMP) in long term evolution-advanced (LTE-A) system

Also Published As

Publication number Publication date
CN103249160A (en) 2013-08-14

Similar Documents

Publication Publication Date Title
CN103249160B (en) A kind of resource allocation methods in lte-a system under CoMP
Yang et al. Heterogeneous cellular network with energy harvesting-based D2D communication
CN102026388B (en) Method for allocating radio resources under coordinated multipoint transmission/reception (CoMP) in long term evolution-advanced (LTE-A) system
CN101997583B (en) Method and device for pairing uplink multi-user multi-input multi-output (MIMO) users supporting cooperation multi-point transmission
CN103929781B (en) Cross-layer interference coordination optimization method in super dense heterogeneous network
CN106454850B (en) The resource allocation methods of honeycomb heterogeneous network efficiency optimization
CN102202406B (en) Method for suppressing interference
CN101784078B (en) Load balancing and throughput optimization method in mobile communication system
CN104410480A (en) Large-scale fading based pilot frequency distribution method in large-scale MIMO (multiple input multiple output) system
CN102869052B (en) Communication means in isomery mobile communications network and equipment
CN105636219B (en) Resource regulating method and device
US9179484B2 (en) Method and device for allocating group identifier
CN103581928A (en) Method and device for cell combination
CN105933923B (en) A kind of super-intensive networking cell cluster-dividing method
CN102395158B (en) Load balance optimization method considering user service quality requirements in mobile communication system
CN103209472B (en) A kind of method and system for carrying out cooperative scheduling inter-cell uplink interference coordination
CN106131855A (en) The method for channel allocation of virtual subdistrict in a kind of 5G high density network
CN104581974B (en) Dynamic base-station collaboration method based on orthogonal resource in super-intensive network
Dahrouj et al. Coordinated scheduling for wireless backhaul networks with soft frequency reuse
CN103428702A (en) Resource allocation method for controlling inter-cell interference
CN106131966B (en) User scheduling method based on dense distribution formula wireless network dynamic clustering
CN103024752A (en) Method and system for selecting user collaboration subdistrict set
CN103517441A (en) Method of interference coordination among cells and system thereof
CN103442365B (en) A kind of frequency multiplexing method reducing the interior CoMP system interference in station
CN105960005B (en) The Poewr control method of user fairness is ensured in super-intensive 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
ASS Succession or assignment of patent right

Owner name: ZHANXUN COMMUNICATION (SHANGHAI) CO. LTD.

Effective date: 20141017

C41 Transfer of patent application or patent right or utility model
TA01 Transfer of patent application right

Effective date of registration: 20141017

Address after: 100191 Haidian District, North Garden Road, No. 52 Telecommunications Research Institute, block B, level 6, Beijing

Applicant after: Research Institute of Telecommunications Transmission, Ministry of Industry and Information Technology

Applicant after: Zhanxun Communication (Shanghai) Co., Ltd.

Address before: 100191 Haidian District, North Garden Road, No. 52 Telecommunications Research Institute, block B, level 6, Beijing

Applicant before: Research Institute of Telecommunications Transmission, Ministry of Industry and Information Technology

GR01 Patent grant
GR01 Patent grant