CN108462964A - Interference mitigation method based on overlapping sub-clustering in UDN - Google Patents

Interference mitigation method based on overlapping sub-clustering in UDN Download PDF

Info

Publication number
CN108462964A
CN108462964A CN201810234243.XA CN201810234243A CN108462964A CN 108462964 A CN108462964 A CN 108462964A CN 201810234243 A CN201810234243 A CN 201810234243A CN 108462964 A CN108462964 A CN 108462964A
Authority
CN
China
Prior art keywords
cluster
small base
base station
quadrangle
user
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
CN201810234243.XA
Other languages
Chinese (zh)
Other versions
CN108462964B (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.)
Henan University of Technology
Original Assignee
Henan University of 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 Henan University of Technology filed Critical Henan University of Technology
Priority to CN201810234243.XA priority Critical patent/CN108462964B/en
Publication of CN108462964A publication Critical patent/CN108462964A/en
Application granted granted Critical
Publication of CN108462964B publication Critical patent/CN108462964B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

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/0032—Distributed allocation, i.e. involving a plurality of allocating devices, each making partial allocation
    • H04L5/0035—Resource allocation in a cooperative multipoint environment
    • 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/14—Spectrum sharing arrangements between different networks
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/04—Wireless resource allocation
    • H04W72/044—Wireless resource allocation based on the type of the allocated resource
    • H04W72/0453—Resources in frequency domain, e.g. a carrier in FDMA
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/50—Allocation or scheduling criteria for wireless resources
    • H04W72/54—Allocation or scheduling criteria for wireless resources based on quality criteria

Abstract

The invention discloses a kind of interference mitigation methods based on overlapping sub-clustering, are suitable for the super-intensive network using coordinated multipoint transmission.Path loss figure is constructed according to the path loss between small base station, find out shortest side successively in path loss figure, if in the presence of triangle or quadrangle using this side as wherein a line, then the small base station of one of triangle or multiple vertex correspondences of quadrangle is placed in a cluster, otherwise two small base stations of vertex correspondence on the side are placed in a cluster, for each user, calculate the average value of the user and the path loss of small base station in cluster, user is returned into cluster according to this average value, graph coloring is finally used to distribute frequency sub-band for each cluster on path loss figure, frequency sub-band of the small base station using distribution in each cluster and the user interactive data in this cluster.

Description

Interference mitigation method based on overlapping sub-clustering in UDN
Technical field
The present invention relates to the interference mitigation methods based on overlapping sub-clustering in the communications field, especially super-intensive network.
Background technology
Super-intensive network (UDN, Ultra Dense Network) is one of key technology of next generation mobile communication.UDN The small base station of the middle a large amount of low-power of deployment, can lifting system capacity, enhancing in-door covering, the raising availability of frequency spectrum.Due to small The distance between base station is close, if they use identical frequency range, can there is serious interference, therefore effective interference mitigation Method is the hot spot of research.
Interference mitigation method in existing UDN be divided into sub-clustering, resource allocation and cooperative multipoint transmission (CoMP, Coordinated Multiple Point) etc..
By sub-clustering, whole network is divided into several small networks, each small network includes Multiple Small Cell Sites.From a cluster One is selected in interior Multiple Small Cell Sites as cluster head, cluster head is responsible for the resource allocation in this cluster.Sub-clustering can reduce network size, The efficiency and performance for reducing operand, improving the network operation.
Resource management includes frequency allocation, resource block distribution and power distribution etc..Frequency allocation is by being adjacent slight Area or adjacent cluster distribute different frequency range abatement interference；Resource block distribution for adjacent cell or adjacent cluster by distributing Different resource block abatement interference；Power distribution changes the coverage area of small base station by adjusting the power of small base station, reaches and disappears Subtract the purpose of interference.
In the CoMP methods using joint transmission, user data is shared between small base station, there are multiple small bases in synchronization It stands while being a user service, convert interference signal to useful signal, achieve the purpose that interference mitigation.
For the UDN of user's high-speed mobile, document " Dynamic joint processing:Achieving high Spectral efficiency in uplink 5G cellular networks " propose by it is each it is small divide into 3 sectors, By 3 adjacent sector composition mixed cells, 3 small base stations of each mixed cell are user's clothes in the mixed cell Business distributes different frequency sub-band for adjacent mixed cell, is not just interfere with each other between such mixed cell.The document is assumed each small Area is all regular hexagon, and the distribution of small base station is well-regulated, however in systems in practice, the distribution of small base station is random , do not have it is well-regulated, it is impossible to the coverage area of all small base stations is all regular hexagon, therefore the method that the document proposes can not It uses in systems in practice.
Invention content
The present invention proposes a kind of interference mitigation method based on overlapping sub-clustering, is suitable for using the super of coordinated multipoint transmission Dense network.
Realizing the technical thought of the present invention is：Path loss figure is constructed according to the path loss between small base station, is damaged in path Shortest side is found out in consumption figure successively, if in the presence of triangle or quadrangle using this side as wherein a line, it will be therein The small base station of multiple vertex correspondences of one triangle or quadrangle is placed in a cluster, otherwise by two vertex correspondences on the side Small base station is placed in a cluster, for each user, calculates the average value of the user and the path loss of small base station in cluster, according to User is returned cluster by this average value, finally uses graph coloring for each cluster distribution frequency sub-band on path loss figure, in each cluster Frequency sub-band of the small base station using distribution and the user interactive data in this cluster.
In order to realize above-mentioned technical thought, the interference mitigation method proposed by the present invention based on overlapping sub-clustering, suitable for adopting With the super-intensive network of CoMP, include the following steps：
A, the corresponding path loss figure in small base station in tectonic network, the node in the figure correspond to small base station, and side corresponds to small Path loss between base station, if the path loss between small base station is less than pre-set loss thresholding, the two small bases Stand have between corresponding node while and while length be equal to path loss between two base stations, if the road between small base station Diameter loss is more than pre-set loss thresholding, then does not have side between the corresponding node in the two small base stations；
B, according to the path loss figure of step A constructions, to the sub-clustering that small base station is overlapped, each cluster includes that several are small Base station；
Each user is grouped into one of cluster by C；
D uses graph coloring algorithm to distribute frequency sub-band for each cluster；
E, the small base station in each cluster use the frequency sub-band that step D is distributed and the user interactive data in this cluster.
Further, the step B is specifically included：
Side all in path loss figure is placed in set L by B1, enables i=1, and it is empty set to enable set P；
B2 finds out shortest side in L, if shortest side has a plurality of, randomly selects one therein, uses l1Indicating should Side；
B3, if in the presence of with l1As the triangle or quadrangle on side, and triangle or quadrangle are then held not in set P Row step B4, if there is no with l1As the triangle or quadrangle on side, B5 is thened follow the steps；
B4 is found out with l1For all triangles and quadrangle of wherein a line, the sum of the length of side of each triangle is calculated And the sum of the length of side of each quadrangle, the triangle or quadrangle of the sum of length of side minimum are found out, by the triangle or quadrangle The small base station of several vertex correspondences be placed on cluster QiIn, all sides of the triangle or quadrangle are placed on set L1In, by the triangle Shape or quadrangle are placed in set P；
B5, by l1Two small base stations of vertex correspondence be placed on cluster QiIn, by l1It is placed on set L1In；
B6 is enabled Indicate L1Supplementary set in L, enables i=i+1；
B7 repeats step B2, step B3, step B4, step B5 and step B6, until L is empty set；
B8, if there is the triangle or quadrangle for not being included into set P in path loss figure, by each such three The small base station of three angular vertex correspondences or the small base station of four vertex correspondences of quadrangle are placed in a new cluster, if road The corresponding small base station of point that each degree is zero is then individually placed on a new cluster by the point that presence is zero in diameter loss figure In, small base station is divided into K cluster altogether from step B2 to step B8.
Further, the step C is specifically included：
C1 finds out the small base station nearest with the user distance, uses BS for u-th of useruIndicate the small base station, u=1, 2 ..., U, U are the sums of user in the network；
C2 finds out in K cluster comprising small base station BS u-th of useruSeveral clusters, useIndicate these clusters, unIt includes small base station BS to beuCluster sum, u=1,2 ..., U, U is the net The sum of user in network, K are the sums of cluster；
C3 calculates u-th of user and QsThe average value of the path loss of interior small base station, uses ru,sIt indicates, s=u1,u2,…, un, enableMin { } expressions are minimized, and u-th of user is grouped into clusterIn, u= 1,2 ..., U, U are the sums of user in the network.
Further, the step D is specifically included：
D1 uses mjIndicate j-th small base station in cluster Q1、Q2、…、QKThe number of middle appearance, j=1,2 ..., J, J are networks The sum of medium and small base station, K are the sums of cluster；
D2 enables M=max { m1,m2,…,mJ, max { } expressions are maximized, and frequency range is divided into M frequency sub-band, frequency sub-band Collection is combined into F={ f1,f2,…,fM}；
D3 uses graph coloring algorithm to distribute frequency sub-band for each cluster in the path loss figure of step A constructions, is adjacent Cluster distribute different frequency sub-band, the frequency sub-band of non-conterminous cluster can be identical.
Description of the drawings
Fig. 1 is the path loss figure of the embodiment of the present invention；
Fig. 2 is the sub-clustering figure of the embodiment of the present invention；
Fig. 3 is the frequency sub-band distribution diagram of the embodiment of the present invention；
Fig. 4 is the flow chart of the present invention；
Fig. 5 is the sub-clustering flow chart of the present invention.
Specific implementation mode
A kind of embodiment of the present invention is given below, the present invention will be further described in detail.Consider to include several The super-intensive network of small base station and multiple users, small base station and user are randomly dispersed in the network.Each base station is by returning Journey link is connected with master controller.
The corresponding path loss figure in small base station in master controller tectonic network first, as shown in Figure 1, the section in the figure The corresponding small base station of point, while the path loss between small base station is corresponded to, if the path loss between small base station is less than pre-set Thresholding is lost, then have between the corresponding node in the two small base stations while and while length be equal to road between two small base stations Diameter is lost, if path loss between small base station is more than pre-set loss thresholding, the corresponding node in the two small base stations Between there is no side.As embodiment, there are 24 small base stations, circle to represent small base station in Fig. 1, the number in circle represents small base station Serial number, the length of the digital representative edge between node on side.
The sub-clustering that small base station is overlapped according to the following steps：
Step 1, side all in path loss figure is placed in set L, enables i=1, it is empty set to enable set P；
Step 2, shortest side is found out in L, if shortest side has a plurality of, is randomly selected one therein, is used l1Table Show the side；
Step 3, if in the presence of with l1As the triangle or quadrangle on side, and triangle or quadrangle be in set P, then Step B4 is executed, if there is no with l1As the triangle or quadrangle on side, B5 is thened follow the steps；
Step 4, it finds out with l1For all triangles and quadrangle of wherein a line, calculate each triangle the length of side it With and each quadrangle the sum of the length of side, the triangle or quadrangle of the sum of length of side minimum are found out, by the triangle or four sides The small base station of several vertex correspondences of shape is placed on cluster QiIn, all sides of the triangle or quadrangle are placed on set L1In, by this three Angular or quadrangle is placed in set P；
Step 5, by l1Two small base stations of vertex correspondence be placed on cluster QiIn, by l1It is placed on set L1In；
Step 6, it enables Indicate L1Supplementary set in L, enables i=i+1；
Step 7, step B2, step B3, step B4, step B5 and step B6 are repeated, until L is empty set；
It step 8, will each in this way if there is the triangle or quadrangle for not being included into set P in path loss figure Triangle the small base station of three vertex correspondences or the small base station of four vertex correspondences of quadrangle be placed in a new cluster, If the point that presence is zero in path loss figure, by the corresponding small base station of point that each degree is zero be individually placed on one it is new In cluster, small base station is divided into K cluster altogether from step B2 to step B8.
Small base station is divided into 22 clusters by step 1 to step 7, uses BSiIndicate i-th small base station, i=1,2 ..., 24, each The small base station that cluster includes is respectively：
Q1={ BS11,BS13,BS14}
Q2={ BS13,BS14,BS18}
Q3={ BS1,BS2,BS7}
Q4={ BS15,BS16,BS22}
Q5={ BS10,BS14,BS17}
Q6={ BS10,BS15,BS17}
Q7={ BS22,BS23,BS24}
Q8={ BS6,BS10,BS14}
Q9={ BS1,BS7,BS8}
Q10={ BS7,BS8,BS9,BS16}
Q11={ BS15,BS17,BS22}
Q12={ BS2,BS3,BS10}
Q13={ BS20,BS21,BS24}
Q14={ BS4,BS6,BS11,BS14}
Q15={ BS18,BS19,BS20}
Q16={ BS5,BS11,BS12,BS13}
Q17={ BS3,BS4,BS6,BS10}
Q18={ BS14,BS18,BS20,BS21}
Q19={ BS17,BS22,BS24}
Q20={ BS4,BS5,BS11}
Q21={ BS13,BS18,BS19}
Q22={ BS2,BS10,BS15}
Step 8 is executed, 2 clusters of getting back are respectively：
Q23={ BS2,BS7,BS15,BS16}
Q24={ BS14,BS17,BS21,BS24}
The sub-clustering figure of the embodiment of the present invention is as shown in Fig. 2, white circle indicates small base station, in each triangle or quadrangle There are one grey primary colors, the number in each gray circles represents the serial number of cluster, triangle where gray circles or quadrangle The small base station of vertex correspondence is the small base station that the cluster includes.
Each user is grouped into one of cluster, is as follows：
Step 1, for u-th of user, the small base station nearest with the user distance is found out, BS is useduIndicate the small base station, u =1,2 ..., U, U are the sums of user in the network；
Step 2, it for u-th of user, is found out in all clusters comprising small base station BSuSeveral clusters, useIndicate these clusters, unIt includes small base station BS to beuCluster sum, u=1,2 ..., U, U is the net The sum of user in network；
Step 3, u-th of user and Q are calculatedsThe average value of the path loss of interior small base station, uses ru,sIt indicates, s=u1, u2,…,un, enableMin { } expressions are minimized, and u-th of user is grouped into cluster In, u=1,2 ..., U, U are the sums of user in the network.
It uses graph coloring algorithm to distribute frequency sub-band for each cluster, is as follows：
Step 1, m is usedjIndicate j-th small base station in base station cluster Q1、Q2、…、QKThe number of middle appearance, j=1,2 ..., J, J It is the sum of small base station in network, K is the sum of cluster,
Step 2, M=max { m are enabled1,m2,…,mJ, max { } expressions are maximized, and frequency range is divided into M frequency sub-band, son frequency Section collection is combined into F={ f1,f2,…,fM}；
Step 3, it in the path loss figure of step A constructions, uses graph coloring algorithm for each cluster sub-clustering frequency sub-band, is phase Adjacent cluster distributes different frequency sub-band, and the frequency sub-band of non-conterminous cluster can be identical.
In embodiment, frequency range is divided into 7 frequency sub-band by M=7, then graph coloring algorithm is used to distribute frequency sub-band, such as Fig. 3 Shown, white circle indicates small base station, and circle colored in each triangle or quadrangle represents frequency sub-band, each color in figure A frequency sub-band is represented, color in sharing 7 represents 7 frequency sub-band.
The small base station of each cluster uses the user service that the frequency sub-band of distribution is in this cluster.
In conjunction with flow chart, that is, Fig. 4 of the present invention, the interference mitigation method based on overlapping sub-clustering is as follows：
A, the corresponding path loss figure in small base station in tectonic network, the node in the figure correspond to small base station, and side corresponds to small Path loss between base station, if the path loss between small base station is less than pre-set loss thresholding, the two small bases Stand have between corresponding node while and while length be equal to path loss between two base stations, if the road between small base station Diameter loss is more than pre-set loss thresholding, then does not have side between the corresponding node in the two small base stations；
B, according to the path loss figure of step A constructions, to the sub-clustering that small base station is overlapped, each cluster includes that several are small Base station；
Each user is grouped into one of cluster by C；
D uses graph coloring algorithm to distribute frequency sub-band for each cluster；
E, the small base station in each cluster use the frequency sub-band that step D is distributed and the user interactive data in this cluster.
In conjunction with sub-clustering flow chart, that is, Fig. 5 of the present invention, small base station sub-clustering is as follows：
Side all in path loss figure is placed in set L by B1, enables i=1, and it is empty set to enable set P；
B2 finds out shortest side in L, if shortest side has a plurality of, randomly selects one therein, uses l1Indicating should Side；
B3, if in the presence of with l1As the triangle or quadrangle on side, and triangle or quadrangle are then held not in set P Row step B4, if there is no with l1As the triangle or quadrangle on side, B5 is thened follow the steps；
B4 is found out with l1For all triangles and quadrangle of wherein a line, the sum of the length of side of each triangle is calculated And the sum of the length of side of each quadrangle, the triangle or quadrangle of the sum of length of side minimum are found out, by the triangle or quadrangle The small base station of several vertex correspondences be placed on cluster QiIn, all sides of the triangle or quadrangle are placed on set L1In, by the triangle Shape or quadrangle are placed in set P；
B5, by l1Two small base stations of vertex correspondence be placed on cluster QiIn, by l1It is placed on set L1In；
B6 is enabled Indicate L1Supplementary set in L, enables i=i+1；
B7 repeats step B2, step B3, step B4, step B5 and step B6, until L is empty set；
B8, if there is the triangle or quadrangle for not being included into set P in path loss figure, by each such three The small base station of three angular vertex correspondences or the small base station of four vertex correspondences of quadrangle are placed in a new cluster, if road The corresponding small base station of point that each degree is zero is then individually placed on a new cluster by the point that presence is zero in diameter loss figure In, small base station is divided into K cluster altogether from step B2 to step B8.
Above example is only to the present invention's for example, those skilled in the art can carry out respectively the present invention Kind modification and variation is without departing from the spirit and scope of the present invention.In this way, if these modifications and changes of the present invention belongs to this Within the scope of invention claim and its equivalent technologies, then the present invention is also intended to include these modifications and variations.

Claims (1)

  1. Interference mitigation method based on overlapping sub-clustering in 1.UDN, is applicable in the UDN using coordinated multipoint transmission, it is characterised in that：Packet Include following steps：
    A, the corresponding path loss figure in small base station in tectonic network, the node in the figure correspond to small base station, and side corresponds to small base station Between path loss, if path loss between small base station is less than pre-set loss thresholding, the two small base stations pair Have between the node answered while and while length be equal to path loss between two base stations, if the path damage between small base station Consumption is more than pre-set loss thresholding, then does not have side between the corresponding node in the two small base stations；
    B, according to the path loss figure of step A constructions, to the sub-clustering that small base station is overlapped, each cluster includes several small bases It stands, detailed process is as follows：
    Side all in path loss figure is placed in set L by B1, enables i=1, and it is empty set to enable set P；
    B2 finds out shortest side in L, if shortest side has a plurality of, randomly selects one therein, uses l1Indicate the side；
    B3, if in the presence of with l1As the triangle or quadrangle on side, and triangle or quadrangle then follow the steps not in set P B4, if there is no with l1As the triangle or quadrangle on side, B5 is thened follow the steps；
    B4 is found out with l1For all triangles and quadrangle of wherein a line, the sum of length of side of each triangle and every is calculated The sum of the length of side of a quadrangle finds out the triangle or quadrangle of the sum of length of side minimum, by the several of the triangle or quadrangle The small base station of vertex correspondence is placed on cluster QiIn, all sides of the triangle or quadrangle are placed on set L1In, by the triangle or four Side shape is placed in set P；
    B5, by l1Two small base stations of vertex correspondence be placed on cluster QiIn, by l1It is placed on set L1In；
    B6 enables L=CLL1, CLL1Indicate L1Supplementary set in L, enables i=i+1；
    B7 repeats step B2, step B3, step B4, step B5 and step B6, until L is empty set；
    B8 will each such triangle if there is the triangle or quadrangle for not being included into set P in path loss figure The small base station of three vertex correspondences or the small base station of four vertex correspondences of quadrangle be placed in a new cluster, if path is damaged The corresponding small base station of point that each degree is zero is then individually placed in a new cluster by the point that presence is zero in consumption figure, from Small base station is divided into K cluster by step B2 to step B8 altogether；
    Each user is grouped into one of cluster by C, and detailed process is as follows：
    C1 finds out the small base station nearest with the user distance, uses BS for u-th of useruIndicate the small base station, u=1,2 ..., U, U are the sums of user in the network；
    C2 finds out in K cluster comprising small base station BS u-th of useruSeveral clusters, use Indicate these clusters, unIt includes small base station BS to beuCluster sum, u=1,2 ..., U, U is the sum of user in the network, and K is cluster Sum；
    C3 calculates u-th of user and QsThe average value of the path loss of interior small base station, uses ru,sIt indicates, s=u1,u2,…,un, enableMin { } expressions are minimized, and u-th of user is grouped into clusterIn, u=1, 2 ..., U, U are the sums of user in the network；
    D, uses graph coloring algorithm to distribute frequency sub-band for each cluster, and detailed process is as follows：
    D1 uses mjIndicate j-th small base station in cluster Q1、Q2、…、QKThe number of middle appearance, j=1,2 ..., J, J are small bases in network The sum stood, K are the sums of cluster；
    D2 enables M=max { m1,m2,…,mJ, max { } expressions are maximized, and frequency range is divided into M frequency sub-band, frequency sub-band set For F={ f1,f2,…,fM}；
    D3 uses graph coloring algorithm to distribute frequency sub-band for each cluster in the path loss figure of step A constructions, is adjacent cluster Different frequency sub-band is distributed, the frequency sub-band of non-conterminous cluster can be identical；
    E, the small base station in each cluster use the frequency sub-band that step D is distributed and the user interactive data in this cluster.
CN201810234243.XA 2018-03-21 2018-03-21 Interference reduction method based on overlapping clustering in UDN Active CN108462964B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201810234243.XA CN108462964B (en) 2018-03-21 2018-03-21 Interference reduction method based on overlapping clustering in UDN

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201810234243.XA CN108462964B (en) 2018-03-21 2018-03-21 Interference reduction method based on overlapping clustering in UDN

Publications (2)

Publication Number Publication Date
CN108462964A true CN108462964A (en) 2018-08-28
CN108462964B CN108462964B (en) 2021-12-31

Family

ID=63236577

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201810234243.XA Active CN108462964B (en) 2018-03-21 2018-03-21 Interference reduction method based on overlapping clustering in UDN

Country Status (1)

Country Link
CN (1) CN108462964B (en)

Citations (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20040092256A1 (en) * 2000-11-06 2004-05-13 Ralf Keller Cellular radio network reusing frequencies
CN104955077A (en) * 2015-05-15 2015-09-30 北京理工大学 Heterogeneous network cell clustering method and device based on user experience speed
WO2015149672A1 (en) * 2014-03-31 2015-10-08 Huawei Technologies Co., Ltd. Dynamic clustering for radio coordination in a virtual network
AU2014396695A1 (en) * 2014-06-06 2016-12-22 Telefonaktiebolaget Lm Ericsson (Publ) Cluster-based beacon signal transmission
CN107172682A (en) * 2017-07-10 2017-09-15 南京邮电大学 Super-intensive network radio resources distribution method based on dynamic clustering
US20170280467A1 (en) * 2014-09-04 2017-09-28 Samsung Electronics Co., Ltd Resource management method and apparatus
CN107371167A (en) * 2017-09-05 2017-11-21 上海无线通信研究中心 Cell cluster-dividing method and the overlapping multiplexing method of frequency spectrum based on the cell cluster-dividing method
CN107750056A (en) * 2017-10-25 2018-03-02 河南理工大学 Interference mitigation method in super-intensive network
CN107770874A (en) * 2017-10-25 2018-03-06 河南理工大学 Cluster-dividing method and channel allocation method in super-intensive network

Patent Citations (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20040092256A1 (en) * 2000-11-06 2004-05-13 Ralf Keller Cellular radio network reusing frequencies
WO2015149672A1 (en) * 2014-03-31 2015-10-08 Huawei Technologies Co., Ltd. Dynamic clustering for radio coordination in a virtual network
AU2014396695A1 (en) * 2014-06-06 2016-12-22 Telefonaktiebolaget Lm Ericsson (Publ) Cluster-based beacon signal transmission
US20170280467A1 (en) * 2014-09-04 2017-09-28 Samsung Electronics Co., Ltd Resource management method and apparatus
CN104955077A (en) * 2015-05-15 2015-09-30 北京理工大学 Heterogeneous network cell clustering method and device based on user experience speed
CN107172682A (en) * 2017-07-10 2017-09-15 南京邮电大学 Super-intensive network radio resources distribution method based on dynamic clustering
CN107371167A (en) * 2017-09-05 2017-11-21 上海无线通信研究中心 Cell cluster-dividing method and the overlapping multiplexing method of frequency spectrum based on the cell cluster-dividing method
CN107750056A (en) * 2017-10-25 2018-03-02 河南理工大学 Interference mitigation method in super-intensive network
CN107770874A (en) * 2017-10-25 2018-03-06 河南理工大学 Cluster-dividing method and channel allocation method in super-intensive network

Non-Patent Citations (4)

* Cited by examiner, † Cited by third party
Title
HAO LI等: "Multi-Dimensional Resource Allocation Aware User clustering in user-centric overlapped virtual cells", 《2017 13TH INTERNATIONAL CONFERENCE ON NATURAL COMPUTATION, FUZZY SYSTEMS AND KNOWLEDGE DISCOVERY (ICNC-FSKD)》 *
ZHI CHEN等: "A novel ICIC scheme for reducing intra cluster interference in LTE-Hi network", 《2016 IEEE INTERNATIONAL CONFERENCE ON NETWORK INFRASTRUCTURE AND DIGITAL CONTENT (IC-NIDC)》 *
陈偲艺: "基于图论的超密集组网技术研究", 《中国优秀硕士论文电子期刊网》 *
魏蓉: "高密度网络中基于分簇聚类算法的资源分配策略研究", 《中国优秀硕士论文电子期刊网》 *

Also Published As

Publication number Publication date
CN108462964B (en) 2021-12-31

Similar Documents

Publication Publication Date Title
CN101668295B (en) Resource reuse method and system for supporting cooperative transmission in communication system
CN107172682B (en) Ultra-dense network wireless resource allocation method based on dynamic clustering
CN104717755B (en) The down frequency spectrum resources distribution method of D2D technology is introduced in a kind of cellular network
CN103067985B (en) The binding of ultrahigh speed wireless lan channel and distribution method based on channel quality
CN104540139B (en) Isomery UNE resource allocation methods and system
CN104955077A (en) Heterogeneous network cell clustering method and device based on user experience speed
CN107750056B (en) Interference reduction method in ultra-dense network
CN104796902B (en) Frequency domain resource distribution method based on graph coloring in a kind of super-intensive network
CN106341826B (en) The resource optimal distribution method towards wireless power private network based on virtualization technology
Zhao et al. A coloring-based cluster resource allocation for ultra dense network
CN101754383B (en) Structuring method of CoMP cell cluster
CN107770874B (en) Clustering method and sub-channel allocation method in ultra-dense network
CN106792764B (en) Wireless base station planning method for power distribution terminal communication access network
CN108063632A (en) Cooperation resource allocation methods based on efficiency in isomery cloud access network
Li et al. An energy-effective network deployment scheme for 5G Cloud Radio Access Networks
CN107454601A (en) The wireless dummy mapping method of inter-cell interference is considered under a kind of super-intensive environment
CN104581974B (en) Dynamic base-station collaboration method based on orthogonal resource in super-intensive network
CN107333301B (en) Cognitive-based joint resource reallocation method in multi-generic heterogeneous network
Ru et al. Power and spectrum allocation in D2D networks based on coloring and chaos genetic algorithm
CN108462964A (en) Interference mitigation method based on overlapping sub-clustering in UDN
CN104581910B (en) Small base station asynchronous Poewr control method in towards the cooperative cluster of the amorphous covering of cell
CN108307514B (en) Inter-cluster interference elimination method based on dual clustering and resource allocation
Li et al. Resource sharing for cellular-assisted D2D communications with imperfect CSI: a many-to-many strategy
CN106304306B (en) The method for managing resource of multiple access access is mixed in heterogeneous network
CN103442365B (en) A kind of frequency multiplexing method reducing the interior CoMP system interference in station

Legal Events

Date Code Title Description
PB01 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