CN106507365B - A kind of dynamic clustering method in heterogeneous network - Google Patents
A kind of dynamic clustering method in heterogeneous network Download PDFInfo
- Publication number
- CN106507365B CN106507365B CN201611034404.8A CN201611034404A CN106507365B CN 106507365 B CN106507365 B CN 106507365B CN 201611034404 A CN201611034404 A CN 201611034404A CN 106507365 B CN106507365 B CN 106507365B
- Authority
- CN
- China
- Prior art keywords
- sub
- clustering
- base station
- laa
- uplink
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W16/00—Network planning, e.g. coverage or traffic planning tools; Network deployment, e.g. resource partitioning or cells structures
- H04W16/02—Resource partitioning among network components, e.g. reuse partitioning
- H04W16/10—Dynamic resource partitioning
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L5/00—Arrangements affording multiple use of the transmission path
- H04L5/003—Arrangements for allocating sub-channels of the transmission path
- H04L5/0053—Allocation of signaling, i.e. of overhead other than pilot signals
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L5/00—Arrangements affording multiple use of the transmission path
- H04L5/003—Arrangements for allocating sub-channels of the transmission path
- H04L5/0058—Allocation criteria
- H04L5/0073—Allocation arrangements that take into account other cell interferences
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W16/00—Network planning, e.g. coverage or traffic planning tools; Network deployment, e.g. resource partitioning or cells structures
- H04W16/18—Network planning tools
Abstract
A kind of dynamic clustering method in heterogeneous network is claimed in the present invention, belongs to field of communication technology.Guarantee throughput of system in the case where minimizing ascending-descending subframes and staggeredly interfering to realize, improve user experience, lifting system performance, dynamic clustering method provided by the present invention carries out real-time cell sub-clustering using the uplink and downlink portfolio of the large scale loss in channel and real-time change in uplink and downlink caching, compared to traditional static clustering method, the sub-clustering result of this method makes the sub-frame configuration of base station that can more be adapted to the base station current traffic situation.The technical solution improves uplink and downlink handling capacity, reduces service delay, improves user experience.
Description
Technical field
The present invention relates to heterogeneous network cluster-based techniques fields, and in particular to a kind of dynamic clustering method in heterogeneous network.
Background technique
In existing technology, under the scene of dynamic TDD, cluster-based techniques can effectively solve intersection subframe interference and ask
Topic.Traditional cluster algorithm is typically all static clustering, and static clustering interferes some mutual serious intersection subframes of presence
LAA is assigned to base station in the same cluster, has identical transmission direction in synchronization with the base station LAA in cluster, can have in this way
Effect avoids the influence for intersecting subframe interference.But only consider in static clustering algorithm the large scales loss such as path loss because
Element, therefore, sub-clustering is fixed in transmission process.Identical sub-frame configuration is used with the base station in cluster, leads to certain bases
The sub-frame configuration stood cannot be adapted to the base station current traffic situation, so that the uplink and downlink handling capacity of these base stations is limited
System.
Summary of the invention
Present invention seek to address that the above problem of the prior art.A kind of effectively promotion upstream and downstream user handling capacity is proposed,
Reduce the dynamic clustering method in the heterogeneous network of service delay.
Technical scheme is as follows:
A kind of dynamic clustering method in heterogeneous network comprising following steps:
1) the uplink and downlink portfolio for, obtaining all cells in heterogeneous network, calculates the coupling loss between two base stations；
2) difference of the upstream traffic specific gravity of two base stations, is calculated；
3), the difference of coupling loss and upstream traffic specific gravity is normalized, and solve all base stations two-by-two it
Between degree of correlation information matrix；
4) subframe reconfiguration period and the sub-clustering number of polling type dynamic clustering algorithm of dynamic subframe allocation plan, are determined；
5), the M base station LAA is assigned in N number of cell cluster using polling type distribution method, the condition of distribution is to make cell every time
The value of average degree of correlation in cluster increases minimum；
6), based on cell sub-clustering as a result, calculate the uplink service specific gravity of each sub-clustering, selection and the uplink service specific gravity
The sub-frame configuration to match completes the sub-frame configuration of a cycle.
Further, when degree of correlation parameter alpha=1, dynamic clustering is only related to coupling loss, with traditional static clustering
Algorithm is completely the same.α instruction is the specific gravity of large scale loss and uplink service flow accounting difference in dynamic clustering scheme,
Value range is between [0,1].
Further, steps are as follows for the calculating of correlation matrix RM:
Step 1: uplink service compares difference between calculating two base stations WithTable respectively
Show the uplink and downlink traffic in the base station LAA a caching,
Step 2: to CLabAnd T_DabTwo values carry out linear normalization processing, and the numerical value after making normalization falls in [0,1]
Between, then the degree of correlation is solved in proportion,
Ensure that each symbol has its physical meaning；Wherein CLabRefer to the coupling loss of the base station LAA a Yu the base station LAA b, it includes road
Diameter loss and shadow fading；T_DabRefer to the difference of the base station LAA a Yu the base station LAA b uplink service flow accounting；Parameter alpha instruction
Be the specific gravity of large scale loss and uplink service flow accounting difference in dynamic clustering scheme, value range [0,1] it
Between.
Step 3: the coupling loss and upstream traffic difference between all base stations LAA are calculated, so that it may obtain a packet
Matrix RM=[rm containing the degree of correlation information between the base station pair LAA all in whole networkab]M×M。
Further, number N of the number M of step 5) the LAA cell base station always greater than sub-clustering.
Further, the ascending-descending subframes number for the sub-frame configuration that the step 6) and the uplink service specific gravity match by
Following formula determines:
NDL=10-NUL, NDLIndicate downlink subframe configured number；NULIndicate sub-frame of uplink configured number.
It advantages of the present invention and has the beneficial effect that:
The present invention proposes a kind of mixing dynamic clustering method, guarantee while minimizing ascending-descending subframes and staggeredly interfering
Throughput of system is unrestricted.The mixing dynamic clustering method of this new proposition defines a new sub-clustering index --- and it is related
It spends (Relevance Metric, RM), this index comprehensive considers the upper of real-time change in traditional large scale loss and caching
Downlink traffic, can be with the result of dynamic TDD synchronous adjustment cell sub-clustering.
Detailed description of the invention
Fig. 1 is the flow chart for the dynamic clustering method that the present invention is provided in preferred embodiment heterogeneous network.
Specific embodiment
Following will be combined with the drawings in the embodiments of the present invention, and technical solution in the embodiment of the present invention carries out clear, detailed
Carefully describe.Described embodiment is only a part of the embodiments of the present invention.
Technical scheme is as follows:
1, it is analyzed by the interference to dynamic LAA system, because intersecting the influence of subframe interference, needs the side by sub-clustering
Method reduces the influence of cross jamming.There are two the factor of influence sub-clustering performance is main, one is large scale loss, and one is small
Area's uplink and downlink portfolio.
In formula, CLabRefer to the coupling loss of the base station LAA a Yu the base station LAA b, T_DabRefer to the base station LAA a with
The difference of the base station LAA b uplink service flow specific gravity.Because of CLabAnd T_DabTwo variables are not in the same order of magnitude, if directly
By CLabAnd T_DabTwo values calculate the degree of correlation, cannot embody large scale loss and cell uplink and downlink portfolio simultaneously to sub-clustering
The influence of performance, therefore herein first to CLabAnd T_DabTwo values carry out linear normalizing
Change processing, the numerical value after making normalization is fallen between [0,1], then solves the degree of correlation in proportion.
WhereinWithRespectively indicate the uplink and downlink traffic in the base station LAA a caching.Parameter alpha refers in formula (1)
What is shown is the specific gravity of coupling loss and uplink service flow difference in specific gravity value in dynamic clustering scheme.From formula (1) it can be found that
As α=1, dynamic clustering is only related to coupling loss, completely the same with traditional static clustering algorithm.
The degree of correlation is the sole criterion of dynamic clustering.Definition according to the degree of correlation, it can be found that CLabIt is worth smaller, two base stations
Between interference it is bigger.T_DabIt is worth smaller, the uplink service flow specific gravity of two base stations is closer, and sub-frame configuration situation gets over phase
Seemingly.So if rm between two base stations LAAabIt is worth smaller, illustrates that their coupled relations are closer, upstream traffic specific gravity gets over phase
Seemingly.Therefore, such base station should more be assigned in the same cell cluster.
For entire dynamic LAA system, all there is coupling loss and upstream traffic difference between all base stations LAA, just
Available one matrix comprising the degree of correlation information between all base stations pair LAA in whole network:
RM=[rmab]M×M(3)
Because of a total of M LAA cell, matrix shares M row M column.Each element rmabAll represent cell a and cell b
Between the degree of correlation, the degree of correlation is smaller, two cells more should assign in same cluster.Wherein as a=b, rmab=0.
2, dynamic clustering standard is given in 1 --- the calculation method of the degree of correlation.Definition according to the degree of correlation, this section propose
A kind of polling type dynamic clustering algorithm, the core concept of the algorithm be exactly polling type the M base station LAA assigned into N number of cell
In cluster, the condition of distribution is that the value of the average degree of correlation in cell cluster is made to increase minimum every time.The detailed process of algorithm is shown in Table 1.
1 polling type dynamic clustering algorithm of table
In systems in practice, number N of the number M of LAA cell base station always greater than sub-clustering.The result of this sub-clustering mode
It is that the small LAA cell of average degree of correlation is assigned in same cluster, i.e., it is interference is stronger, there is the cell of similar uplink service ratio
It is assigned in the same sub-clustering, weaker by interfering, the uplink service cell bigger than difference is assigned in different clusters.
Based on polling type dynamic clustering algorithm above-mentioned, this dynamic subframe allocation plan can be according to the knot of each sub-clustering
Ascending-descending subframes configuration is periodically changed in fruit, and the LAA cell sub-frame configuration in each cluster is identical, facilitates to reduce in this way and intersect
Subframe interference.Specific step is as follows for the program:
Step 1 determines subframe reconfiguration period and the sub-clustering number of polling type dynamic clustering algorithm of dynamic subframe allocation plan
Mesh.
The moment is reconfigured in subframe in step 2, calculates the upstream traffic ratio of the coupling loss and each cell between each base station LAA
Weight.
Step 3 calculate dynamic clustering correlation matrix RM, based on correlation matrix execute polling type dynamic clustering algorithm into
Row cell sub-clustering.
Step 4 based on cell sub-clustering as a result, calculate the uplink service specific gravity of each sub-clustering, selection and the uplink service ratio
The matched sub-frame configuration of heavy phase.Wherein ascending-descending subframes number is determined by following formula:
NDL=10-NUL(5)
In formulaWithRefer to the uplink and downlink traffic in the base station LAA a caching.What K was indicated is assigned to some
LAA number of base stations in cluster.
Step 5 repeats step 2-4 in next reconfiguration period.
Beneficial effects of the present invention: compared to traditional static clustering algorithm, which can effectively be promoted
Upstream and downstream user handling capacity reduces service delay.
It show a specific embodiment flow chart of the invention referring to Fig.1, the specific implementation step of dynamic clustering method:
Step 1: cell uplink and downlink portfolio is calculatedWithThe coupling loss CL of the base station LAA a and the base station LAA bab
(such as path loss).
Step 2: the difference of the base station LAA a and the base station LAA b uplink service flow specific gravity are calculated
Step 3: to CLabAnd T_DabTwo values carry out linear normalization processing, determine coupling loss and uplink service stream
The specific gravity α for measuring specific gravity difference, the numerical value after making normalization is fallen between [0,1], then solves the degree of correlation in proportion
Step 4: it calculates between all base stations LAA and all there is coupling loss and upstream traffic difference, so that it may obtain one
A matrix comprising the degree of correlation information between all base stations pair LAA in whole network: RM=[rmab]M×M。
Step 5 determines subframe reconfiguration period and the sub-clustering number of polling type dynamic clustering algorithm of dynamic subframe allocation plan
Mesh.
Step 6: polling type the M base station LAA is assigned in N number of cell cluster, the condition of distribution is to make in cell cluster every time
Average degree of correlation value increase it is minimum.
Step 7 based on cell sub-clustering as a result, calculate the uplink service specific gravity of each sub-clustering, selection and the uplink service
The sub-frame configuration that specific gravity matches.
Step 8 repeats step 6 and seven in next reconfiguration period.
The above embodiment is interpreted as being merely to illustrate the present invention rather than limit the scope of the invention.?
After the content for having read record of the invention, technical staff can be made various changes or modifications the present invention, these equivalent changes
Change and modification equally falls into the scope of the claims in the present invention.
Claims (6)
1. a kind of dynamic clustering method in heterogeneous network, which comprises the following steps:
1) the uplink and downlink portfolio for, obtaining all cells in heterogeneous network, calculates the coupling loss between two base stations；
2) difference of the upstream traffic specific gravity of two base stations, is calculated；
3), the difference of coupling loss and upstream traffic specific gravity is normalized, and solves all base stations between any two
Degree of correlation information matrix；
4) subframe reconfiguration period and the sub-clustering number of polling type dynamic clustering algorithm of dynamic subframe allocation plan, are determined；
5), the M base station LAA is assigned in N number of cell cluster using polling type distribution method, the condition of distribution is to make in cell cluster every time
Average degree of correlation value increase it is minimum；
6), based on cell sub-clustering as a result, calculating the uplink service specific gravity of each sub-clustering, selection is with the uplink service than heavy phase
The sub-frame configuration matched completes the sub-frame configuration of a cycle.
2. the dynamic clustering method in heterogeneous network according to claim 1, which is characterized in that degree of correlation formula between base station
In parameter alpha value between [0,1] value, α instruction is that large scale loss is accounted for uplink service flow in dynamic clustering scheme
Than the specific gravity of difference.
3. the dynamic clustering method in heterogeneous network according to claim 2, which is characterized in that when parameter alpha=1, move
State sub-clustering is only related to coupling loss, completely the same with traditional static clustering algorithm.
4. the dynamic clustering method in heterogeneous network according to claim 1, which is characterized in that
Steps are as follows for the calculating of degree of correlation information matrix RM:
Step 1: uplink service compares difference between calculating two base stations WithRespectively indicate LAA
Uplink and downlink traffic in base station a caching；
Step 2: to CLabAnd T_DabTwo values carry out linear normalization processing, and the numerical value after making normalization is fallen between [0,1],
Solve the degree of correlation in proportion again,Wherein
CLabRefer to the coupling loss of the base station LAA a Yu the base station LAA b, it includes path loss and shadow fading；T_DabRefer to LAA
The difference of base station a and the base station LAA b uplink service flow accounting；Parameter alpha instruction is large scale loss in dynamic clustering scheme
With the specific gravity of uplink service flow accounting difference, value range is between [0,1]；
Step 3: the coupling loss and upstream traffic difference between all base stations LAA are calculated, so that it may obtain one comprising whole
Matrix RM=[the rm of degree of correlation information in a network between all base stations pair LAAab]M×M。
5. the dynamic clustering method in heterogeneous network according to claim 1, which is characterized in that
Number N of the number M of step 5) the LAA cell base station always greater than sub-clustering.
6. the dynamic clustering method in heterogeneous network according to claim 1, which is characterized in that in the step 6) and this
The ascending-descending subframes number for the sub-frame configuration that industry business specific gravity matches is determined by following formula:
NDL=10-NUL, NDLIndicate downlink subframe configured number；NULIndicate sub-frame of uplink configured number.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201611034404.8A CN106507365B (en) | 2016-11-22 | 2016-11-22 | A kind of dynamic clustering method in heterogeneous network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201611034404.8A CN106507365B (en) | 2016-11-22 | 2016-11-22 | A kind of dynamic clustering method in heterogeneous network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106507365A CN106507365A (en) | 2017-03-15 |
| CN106507365B true CN106507365B (en) | 2019-09-10 |
Family
ID=58328282
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201611034404.8A Active CN106507365B (en) | 2016-11-22 | 2016-11-22 | A kind of dynamic clustering method in heterogeneous network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106507365B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110267349B (en) * | 2019-06-20 | 2023-05-16 | 东南大学 | Improved 5G dynamic TDD network cell cluster interference coordination method |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102612037A (en) * | 2012-04-13 | 2012-07-25 | 北京邮电大学 | Dynamic clustering-based sub-band allocation method in femtocell network |
| CN105376744A (en) * | 2015-10-21 | 2016-03-02 | 中国南方电网有限责任公司超高压输电公司 | Method and device for clustering coordinated base stations in wireless heterogeneous network |
| WO2016029388A1 (en) * | 2014-08-27 | 2016-03-03 | 华为技术有限公司 | Abs configuration apparatus, configuration device and method |
-
2016
- 2016-11-22 CN CN201611034404.8A patent/CN106507365B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102612037A (en) * | 2012-04-13 | 2012-07-25 | 北京邮电大学 | Dynamic clustering-based sub-band allocation method in femtocell network |
| WO2016029388A1 (en) * | 2014-08-27 | 2016-03-03 | 华为技术有限公司 | Abs configuration apparatus, configuration device and method |
| CN105376744A (en) * | 2015-10-21 | 2016-03-02 | 中国南方电网有限责任公司超高压输电公司 | Method and device for clustering coordinated base stations in wireless heterogeneous network |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106507365A (en) | 2017-03-15 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103297979B (en) | Realize method and the base station of interference coordination | |
| CN110662245B (en) | Base station load early warning method and device based on deep learning | |
| CN104540234B (en) | A kind of associated task scheduling mechanism synchronously constrained based on CoMP under C RAN frameworks | |
| CN106341826B (en) | The resource optimal distribution method towards wireless power private network based on virtualization technology | |
| CN105323770A (en) | Expansion estimation method and expansion estimation device of wireless communication system | |
| CN104581748B (en) | A kind of method and apparatus identifying scene within a wireless communication network | |
| CN108055701B (en) | Resource scheduling method and base station | |
| CN103167620B (en) | A kind of wireless resource allocation methods and device | |
| US9544905B2 (en) | Baseband resource allocation method and device thereof | |
| CN107659973A (en) | Super-intensive network cluster dividing method based on density K means algorithms | |
| CN106507365B (en) | A kind of dynamic clustering method in heterogeneous network | |
| CN107846687A (en) | A kind of minizone coordinated dispatching method, device and base station | |
| CN105335313B (en) | A kind of transmission method and device of basic data | |
| TWI633804B (en) | Communication control device, communication control method, and information processing device | |
| CN105517000B (en) | A kind of method and device of cell splitting | |
| CN107947890B (en) | A kind of inter-cell interference coordination method and the network equipment | |
| CN110062360A (en) | A kind of resource allocation algorithm based on mMTC service classification | |
| CN103906144B (en) | A kind of method and device for the data service rate for adjusting mobile terminal | |
| CN106817691A (en) | A kind of PCI distribution method and device | |
| CN103269519A (en) | Method and system for allocating processing resource in centralized-type base station architecture | |
| CN109756887A (en) | High-speed rail is with mobile terminal recognition methods, device and computer readable storage medium | |
| CN103747488B (en) | carrier balancing method, device and system | |
| CN113162662B (en) | User clustering and power distribution method under CF-mMIMO | |
| CN103458414A (en) | Cell clustering method | |
| CN106937392A (en) | The scheduling method for wireless resource of user experience quality in a kind of business based on DASH |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |