CN103167617B - A kind of multi-cell dynamic resource allocation method - Google Patents

A kind of multi-cell dynamic resource allocation method Download PDF

Info

Publication number
CN103167617B
CN103167617B CN201310078498.9A CN201310078498A CN103167617B CN 103167617 B CN103167617 B CN 103167617B CN 201310078498 A CN201310078498 A CN 201310078498A CN 103167617 B CN103167617 B CN 103167617B
Authority
CN
China
Prior art keywords
subscriber equipment
centroid
tolerance
community
allocation method
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
CN201310078498.9A
Other languages
Chinese (zh)
Other versions
CN103167617A (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.)
Shandong Weidi Information Technology Co., Ltd
Original Assignee
South China Normal University
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 South China Normal University filed Critical South China Normal University
Priority to CN201310078498.9A priority Critical patent/CN103167617B/en
Publication of CN103167617A publication Critical patent/CN103167617A/en
Application granted granted Critical
Publication of CN103167617B publication Critical patent/CN103167617B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Abstract

A kind of multi-cell dynamic resource allocation method, its based on the system realized comprise as Centroid controller and be distributed in the launch point of community, described Centroid is connected with described launch point backhaul lines; Described dynamic resource allocation method comprises the following steps: (1) collects channel condition information; (2) centralized scheduling is carried out by Centroid.The present invention safeguards the CQI list of a UE feedback in real time in information search and scheduling flow, has real-time and dynamic; Consider channel direction information in scheduling flow of the present invention, order instruction or the pre-coding matrix index that can effectively utilize feedback do AF panel based on beam direction.

Description

A kind of multi-cell dynamic resource allocation method
Technical field
The present invention relates to moving communicating field, especially a kind of method of Dynamic Resource Allocation for Multimedia of multi-cell cooperating.
Background technology
New generation of wireless development communication technologies is rapid in recent years, compares third generation wireless communication technology, Technology of New Generation Mobile Communications has that the network architecture is simple, signal time delay is little, the high communication quality, fireballing plurality of advantages.
In Technology of New Generation Mobile Communications, a typical technology is collaborative multicast communication (CoordinatedMulti-Pointtransmission, CoMP), and this is a kind of communication technology of multi-cell cooperating.Multiple community is connected by back haul link (backhaul), exchange message and (or) data, and carries out the Resourse Distribute that cooperates, thus reduces presence of intercell interference, finally improves cell edge throughput.Back haul link can be cable, microwave, optical fiber etc.In the CoMP network architecture, a corresponding wireless remote radio-frequency maser (RadioRemoteHeader, RRH) of community possibility, instead of the base station that complete, facilitate Centroid to carry out the multiple community of unified control like this.This RRH is also called launch point (TransmissionPoint, TP).Here do not distinguish " community " and " launch point ".
Prior art does not dynamically carry out multiple community associated Resourse Distribute in real time by channel condition information.
Summary of the invention
Technical problem to be solved by this invention is to provide a kind of multi-cell dynamic resource allocation method, dynamically carries out multiple community associated Resourse Distribute in real time by channel condition information.
For solving the problems of the technologies described above, technical scheme of the present invention is: a kind of multi-cell dynamic resource allocation method, its based on realize system comprise as Centroid controller and be distributed in community (launch point), described Centroid is connected with described launch point backhaul lines; Described dynamic resource allocation method comprises the following steps:
(1) channel condition information is collected; By the parameter of configurating channel status information feedback, the subscriber equipment carrying out all services of requirement feeds back corresponding channel condition information, Centroid safeguards a channel quality instruction list, the channel quality instruction under it comprises disturbance hypothesis, under the service of different districts, under different resource unit, under different user devices; The instruction of the channel quality of all feedbacks with four dimensions, is namely disturbed hypothesis, community, resource units, subscriber equipment by Centroid, is placed in a channel quality instruction list;
(2) centralized scheduling is carried out by Centroid; Specifically comprise the following steps:
(2.1) channel quality of maintenance instruction list is converted into the list of certain tolerance by Centroid;
(2.2) to each interference hypothesis, each community, each resource units, selects the subscriber equipment that tolerance is best;
(2.3) for different interference hypothesis, calculate multiple community and tolerance;
(2.4) select the interference hypothesis maximum with tolerance of multiple community, and under this interference being supposed, each community, each resource units, measures a best subscriber equipment as scheduling user's set.
As improvement, described scheduling is carried out within the scope of whole collaboration region; Collaboration region is the launch point set of a fixing or dynamically/semi-static change; For certain subscriber equipment, the launch point set participating in cooperation is whole collaboration region or its subset.
As improvement, described tolerance is equitable proportion tolerance.
As improvement, for step (2.2), if support MU-MIMO(MultipleUserMulti-Input-Multi-Output, multi-user-multiple-input and multiple-output), multiple subscriber equipment can be selected, share corresponding resource units.
As improvement, for step (2.4), if support MU-MIMO, multiple subscriber equipment can be selected, share corresponding resource units.
As improvement, for step (2.2), first go out under certain interference hypothesis according to metric sebection, under certain cell serves, under certain resource units, measure front M best subscriber equipment, then according to subscriber equipment feedback order instruction or pre-coding matrix index optimize further with a best subscriber equipment of the tolerance that channel direction is relevant.
The beneficial effect that the present invention is compared with prior art brought is:
1) the present invention safeguards the CQI list of a UE feedback in real time in information search and scheduling flow, has real-time and dynamic;
2) consider channel direction information in scheduling flow of the present invention, order instruction or the pre-coding matrix index that can effectively utilize feedback do AF panel based on beam direction;
3) have employed greedy algorithm in scheduling flow of the present invention, there is the character of global optimum.
Accompanying drawing explanation
Fig. 1 is present system frame diagram.
Fig. 2 is flow chart of the present invention.
Embodiment
Below in conjunction with Figure of description, the invention will be further described.
As shown in Figure 1, the system that the present invention is based on realization comprise as Centroid controller and be distributed in the launch point of community, described Centroid is connected with described launch point backhaul lines.The height of the received signal power level that Centroid should feed back according to subscriber equipment (UserEquipment, UE) selects the launch point set of Cell Edge User equipment UE and corresponding participation cooperation.The process of this selection course one often " long-term/broadband ", it can be different for being suitably for the launch point set that certain user equipment (UE) carries out cooperative operation.
Based on this " collection bunch " process, Centroid only needs the channel condition information of launch point set each launch point interior knowing the participation cooperation that user equipment (UE) is corresponding.
Algorithm flow of the present invention carries out within the scope of whole collaboration region, and whole collaboration region is a relatively-stationary set of cells, and is an one subset for the set of cells (measuring set) participating in cooperation certain user equipment (UE).
The network that the present invention is directed to has Combined Treatment function, namely can share data and channel condition information between each launch point.Like this, certain user equipment (UE) can be served by the multiple launch points cooperated, can be combine transmitting (JointTransmission, JT), also can be dynamic emission point selection (DynamicPointSelection, DPS) and/or dynamic emission point mourn in silence (DynamicPointBlanking, DPB).Channel condition information comprises order instruction (RankIndicator, RI) of user equipment (UE) feedback, channel quality instruction (ChannelQualityIndicator, CQI), and the information such as pre-coding matrix index (PrecodingMatrixIndex, PMI).Note, in time division duplex (TimeDivisionDuplex, TDD) system, RI/PMI can can't help user equipment (UE) feedback, but base station calculates acquisition voluntarily by modes such as channel reciprocity.
In CoMP system, when user equipment (UE) carries out information feedback, " initiatively " can suppose that certain or some launch points are mourned in silence (not transmitting) as interference.The a certain interference cases of user equipment (UE) hypothesis is exactly a kind of " interference hypothesis ".Whether mourn in silence can have impact to total interference power level due to launch point, so different situations of mourning in silence is called as different " interference hypothesis ".
The present invention mainly for be the Resourse Distribute (main manifestations is user scheduling here) of down link.The unit of Resourse Distribute is certain fixing Radio Resource particle in temporal frequency dimension, such as granularity is subframe (Subframe), frame (Frame) etc. in time, and in frequency, granularity is broadband (Wideband), subband (Subband), Resource Block (ResourceBlock) etc.
The present invention proposes a kind of method of multiple cell Dynamic Resource Allocation for Multimedia, this method carrys out optimally dynamically scheduling user's set UE according to channel condition information.Advantage of the present invention is: information search and scheduling flow include the channel quality indicator (CQI) list of maintenance customer's equipment UE feedback, have real-time and dynamic; Consider channel direction information in scheduling flow, the RI/PMI that can effectively utilize feedback does the AF panel based on beam direction; Have employed greedy algorithm in scheduling flow of the present invention, there is the character of global optimum.
As shown in Figure 2, concrete steps of the present invention are:
One, channel condition information flow process is collected
Centroid (comprising the corresponding launch point controlled) is by the parameter of configurating channel status information feedback, and the user equipment (UE) carrying out all services of requirement feeds back corresponding channel condition information.Centroid safeguards a channel quality indicator (CQI) list simultaneously, under comprising disturbance hypothesis, under the service of different districts, under different resource unit, and the channel quality indicator (CQI) under different user devices UE.Here not limiting the feedback system of user equipment (UE), can be cycle or aperiodic, can be different resource units etc.The channel quality indicator (CQI) of all feedbacks with four dimensions, is namely disturbed hypothesis, community, resource units, user equipment (UE) by Centroid, is placed in a channel quality indicator (CQI) list.
Such as:
Interference hypothesis-1:
Community-1:
Resource units-1:CQI 1,1,1,1, CQI 1,1,1,2,
Resource units-2:CQI 1,1,2,1, CQI 1,1,2,2,
Community-2:
Resource units-1:CQI 1,2,1,1, CQI 1,2,1,2,
Resource units-2:CQI 1,2,2,1, CQI 1,2,2,2,
Interference hypothesis-2:
Wherein CQI n, I, j, krepresent under interference hypothesis n, under cell i service, under resource units j, the CQI that user k is corresponding; Two, centralized scheduling flow process
Scheduling flow of the present invention is as follows:
1. the CQI list of maintenance is converted into the list of certain tolerance by Centroid, and this tolerance can be
Equitable proportion is measured;
Such as:
Interference hypothesis-1:
Community-1:
Resource units-1:Metric 1,1,1,1, Metric 1,1,1,2,
Resource units-2:Metric 1,1,2,1, Metric 1,1,2,2,
Community-2:
Resource units-1:Metric 1,2,1,1, Metric 1,2,1,2,
Resource units-2:Metric 1,2,2,1, Metric 1,2,2,2,
Interference hypothesis-2:
Wherein Metric n, i, j, krepresent under interference hypothesis n, under cell i service, under resource units j, the tolerance that user k is corresponding;
2., to each interference hypothesis, each community, each resource units, selects the user equipment (UE) that tolerance is best.If support MU-MIMO, multiple user equipment (UE) can be selected, share corresponding resource units;
Such as:
Interference hypothesis-1:
Community-1:
Resource units-1:{Metric_max 1,1,1, UE_index 1,1,1}
Resource units-2:{Metric_max 1,1,2, UE_index 1,1,2}
Community-2:
Resource units-1:{Metric_max 1,2,1, UE_index 1,2,1}
Resource units-2:{Metric_max 1.2.2, UE_index 1,2,2}
Interference hypothesis-2:
Wherein Metric_max n, i, jrepresent under interference hypothesis l, under cell i service, under resource units j, measure the tolerance that best user is corresponding; UE_indexn, i, j represent under interference hypothesis l, under cell i service, under resource units j, measure the index that best user is corresponding.
This second step can be optimized further, can first go out under certain interference hypothesis according to metric sebection, under certain cell serves, under certain resource units, measure front M best user equipment (UE), then measure a best user equipment (UE) according to other (RI/PMI indicating channel directional informations) optimized further with channel direction is relevant according to (as RI/PMI).
3. for different interference hypothesis, calculate multiple community and tolerance:
Such as:
Interference hypothesis-1:
Resource units-1:Metric_max 1,1,1+ Metric_max 1.2.1+
Resource units-2:Metric_max 1,1,2+ Metric_max 1,2,2+
Interference hypothesis-2:
4. select the interference hypothesis maximum with tolerance of multiple community, and under this interference being supposed, each community, each resource units, measures a best user equipment (UE) as scheduling UE.If support MU-MIMO, multiple user equipment (UE) can be selected, share corresponding resource units.
Such as:
Interference hypothesis-c:
Community-1:
Resource units-1:UE_index c, 1,1
Resource units-2:UE_index c.1.2
Community-2:
Resource units-1:UE_index c.2.1
Resource units-2:UE_index c, 2,2
The foregoing is only embodiments of the invention, be not limited to the present invention.The present invention can have various suitable change and change.All any amendments done within the spirit and principles in the present invention, equivalent replacement, improvement etc., all should be included within protection scope of the present invention.

Claims (5)

1. a multi-cell dynamic resource allocation method, its based on the system realized comprise as Centroid controller and be distributed in the launch point of community, described Centroid is connected with described launch point backhaul lines; Described dynamic resource allocation method comprises the following steps:
(1) channel condition information is collected; By the parameter of configurating channel status information feedback, the subscriber equipment carrying out all services of requirement feeds back corresponding channel condition information, Centroid safeguards a channel quality instruction list, the channel quality instruction under it comprises disturbance hypothesis, under the service of different districts, under different resource unit, under different user devices; The instruction of the channel quality of all feedbacks with four dimensions, is namely disturbed hypothesis, community, resource units, subscriber equipment by Centroid, is placed in a channel quality instruction list;
(2) centralized scheduling is carried out by Centroid; Specifically comprise the following steps:
(2.1) channel quality of maintenance instruction list is converted into the list of certain tolerance by Centroid;
(2.2) to each interference hypothesis, each community, selects the subscriber equipment that tolerance is best, and records the tolerance of this subscriber equipment and its correspondence;
(2.3) to each interference hypothesis, the tolerance of record in (2.2) of multiple community is summed up, selects interference hypothesis, make tolerance sum maximum;
(2.4) be as the criterion with the interference selected in (2.3) hypothesis, to each community, each resource units, in (2.2), the subscriber equipment of record is as scheduling user's set;
Described tolerance is equitable proportion tolerance.
2. a kind of multi-cell dynamic resource allocation method according to claim 1, is characterized in that: described scheduling is carried out within the scope of whole collaboration region; Collaboration region is the launch point set of a fixing or dynamically/semi-static change; For certain subscriber equipment, the launch point set participating in cooperation is whole collaboration region or its subset.
3. a kind of multi-cell dynamic resource allocation method according to claim 1, is characterized in that: for step (2.2), if support MU-MIMO, can select multiple subscriber equipment, shares corresponding resource units.
4. a kind of multi-cell dynamic resource allocation method according to claim 1, is characterized in that: for step (2.4), if support MU-MIMO, can select multiple subscriber equipment, shares corresponding resource units.
5. a kind of multi-cell dynamic resource allocation method according to claim 1, it is characterized in that: for step (2.2), first go out under certain interference hypothesis according to metric sebection, under certain cell serves, under certain resource units, measure front M best subscriber equipment, then according to subscriber equipment feedback order instruction or pre-coding matrix index optimize further with a best subscriber equipment of the tolerance that channel direction is relevant.
CN201310078498.9A 2013-03-12 2013-03-12 A kind of multi-cell dynamic resource allocation method Active CN103167617B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201310078498.9A CN103167617B (en) 2013-03-12 2013-03-12 A kind of multi-cell dynamic resource allocation method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201310078498.9A CN103167617B (en) 2013-03-12 2013-03-12 A kind of multi-cell dynamic resource allocation method

Publications (2)

Publication Number Publication Date
CN103167617A CN103167617A (en) 2013-06-19
CN103167617B true CN103167617B (en) 2016-03-16

Family

ID=48590268

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201310078498.9A Active CN103167617B (en) 2013-03-12 2013-03-12 A kind of multi-cell dynamic resource allocation method

Country Status (1)

Country Link
CN (1) CN103167617B (en)

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101990307A (en) * 2010-12-01 2011-03-23 西安电子科技大学 Method for lowering implicit feedback overhead by dynamic threshold under multiple user-multiple input multiple output (MU-MIMO)
CN102098737A (en) * 2009-12-11 2011-06-15 中兴通讯股份有限公司 Cell priority level based cooperation scheduling method and system
CN102821476A (en) * 2012-07-26 2012-12-12 新邮通信设备有限公司 Multi-cell joint processing method based on weighed sum metric
CN102917464A (en) * 2012-09-28 2013-02-06 新邮通信设备有限公司 Multi-cell cooperative scheduling method

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102098737A (en) * 2009-12-11 2011-06-15 中兴通讯股份有限公司 Cell priority level based cooperation scheduling method and system
CN101990307A (en) * 2010-12-01 2011-03-23 西安电子科技大学 Method for lowering implicit feedback overhead by dynamic threshold under multiple user-multiple input multiple output (MU-MIMO)
CN102821476A (en) * 2012-07-26 2012-12-12 新邮通信设备有限公司 Multi-cell joint processing method based on weighed sum metric
CN102917464A (en) * 2012-09-28 2013-02-06 新邮通信设备有限公司 Multi-cell cooperative scheduling method

Also Published As

Publication number Publication date
CN103167617A (en) 2013-06-19

Similar Documents

Publication Publication Date Title
Ding et al. Power allocation strategies in energy harvesting wireless cooperative networks
Kilaru et al. Review and analysis of promising technologies with respect to Fifth generation networks
CN104038319A (en) Channel state information (CSI) feedback method and user equipment
CN102668616A (en) Communication system having network access structure
US9560531B1 (en) Joint wireless and fixed network optimization for heterogeneous cellular networks
CN106028456B (en) The power distribution method of virtual subdistrict in a kind of 5G high density network
CN104717755A (en) Downlink frequency spectrum resource distribution method with D2D technology introduced in cellular network
US11777558B2 (en) Active set management for multiple-input multiple-output communications
CN102740490B (en) Method for scheduling large-scale distributed multiple input multiple output (MIMO) system by utilizing long-time channel information
Luo et al. Optimal joint water-filling for coordinated transmission over frequency-selective fading channels
CN103973394A (en) Informing method and device for CRS patterns and determining method and device for CRS patterns
CN106131855B (en) The method for channel allocation of virtual subdistrict in a kind of 5G high density network
Borgiattino et al. Efficient area formation for LTE broadcasting
CN102170328A (en) CoMP terminal capable of supporting double system and feedback method
US11032841B2 (en) Downlink active set management for multiple-input multiple-output communications
Xu et al. Resource allocation in OFDM-based wireless powered communication networks with SWIPT
CN102325375A (en) Resource allocation method and device
CN103067926A (en) Method and system capable of achieving resource reassortment
CN102821476B (en) Multi-cell joint processing method based on weighed sum metric
CN104469785B (en) The method, system and device of collaboration communication between a kind of micro- station
CN103260247B (en) Dispatching method, via node and base station
Pejanovic-Djurisic et al. Fundamental optimization criteria for green wireless communications
CN103167617B (en) A kind of multi-cell dynamic resource allocation method
Zhou et al. Radio resource allocation for RAN slicing in mobile networks
CN105517161A (en) Downlink resource distribution method and base station

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C14 Grant of patent or utility model
GR01 Patent grant
TR01 Transfer of patent right

Effective date of registration: 20201123

Address after: No.88 Zhujiang Road, Xuecheng District, Zaozhuang City, Shandong Province

Patentee after: Shandong Weidi Information Technology Co., Ltd

Address before: 510631 No. 55, Zhongshan Avenue, Tianhe District, Guangdong, Guangzhou

Patentee before: SOUTH CHINA NORMAL University

TR01 Transfer of patent right