CN108462964B - Interference reduction method based on overlapping clustering in UDN - Google Patents

Interference reduction method based on overlapping clustering in UDN Download PDF

Info

Publication number
CN108462964B
CN108462964B CN201810234243.XA CN201810234243A CN108462964B CN 108462964 B CN108462964 B CN 108462964B CN 201810234243 A CN201810234243 A CN 201810234243A CN 108462964 B CN108462964 B CN 108462964B
Authority
CN
China
Prior art keywords
small base
base stations
cluster
path loss
triangle
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.)
Expired - Fee Related
Application number
CN201810234243.XA
Other languages
Chinese (zh)
Other versions
CN108462964A (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
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

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

Landscapes

  • Engineering & Computer Science (AREA)
  • Signal Processing (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Quality & Reliability (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

本发明公开了一种基于重叠分簇的干扰消减方法，适用于采用多点协作传输的超密集网络。根据小基站间的路径损耗构造路径损耗图，在路径损耗图中依次找出最短的边，若存在以此边作为其中一条边的三角形或四边形，则将其中的一个三角形或四边形的多个顶点对应的小基站放在一个簇中，否则将该边的两个顶点对应小基站放在一个簇中，对于每个用户，计算该用户与簇内小基站的路径损耗的平均值，根据此平均值将用户归簇，最后在路径损耗图上采用图着色为每个簇分配子频段，每个簇内的小基站采用分配的子频段与本簇内的用户交互数据。

Figure 201810234243

The invention discloses an interference reduction method based on overlapping clustering, which is suitable for an ultra-dense network adopting multi-point cooperative transmission. Construct a path loss graph according to the path loss between small base stations, and find the shortest edge in the path loss graph in turn. The corresponding small base stations are placed in a cluster, otherwise the two vertices of the edge corresponding to the small base stations are placed in a cluster. For each user, the average path loss of the user and the small base stations in the cluster is calculated, and according to this average The users are clustered according to the value, and finally the sub-bands are allocated to each cluster by using graph coloring on the path loss graph.

Figure 201810234243

Description

Interference reduction method based on overlapping clustering in UDN
Technical Field
The invention relates to the field of communication, in particular to an interference reduction method based on overlapping clustering in an ultra-dense network.
Background
Ultra Dense Networks (UDNs) are one of the key technologies for next-generation mobile communications. A large number of small base stations with low power are deployed in the UDN, so that the system capacity can be improved, the indoor coverage can be enhanced, and the frequency spectrum utilization rate can be improved. Because the distances between small base stations are very close, if they use the same frequency band, there will be serious interference, so the effective interference reduction method is a hot point of research.
The existing interference reduction method in UDN is divided into clustering, resource allocation, Coordinated multipoint transmission (CoMP), and the like.
By clustering, the whole network is divided into a plurality of small networks, and each small network comprises a plurality of small base stations. And selecting one small base station from the plurality of small base stations in one cluster as a cluster head, wherein the cluster head is responsible for resource allocation in the cluster. Clustering can reduce network scale, reduce computation amount and improve network operation efficiency and performance.
The resource management includes frequency band allocation, resource block allocation, power allocation and the like. The frequency band allocation reduces interference by allocating different frequency bands to adjacent small cells or adjacent clusters; resource block allocation reduces interference by allocating different resource blocks to adjacent small cells or adjacent clusters; the power distribution changes the coverage area of the small base station by adjusting the power of the small base station, thereby achieving the purpose of reducing the interference.
In the CoMP method adopting the joint transmission, user data is shared among small base stations, a plurality of small base stations serve one user at the same time, interference signals are converted into useful signals, and the purpose of interference reduction is achieved.
For the UDN where users move at high speed, the document "Dynamic joint processing" proposes to divide each cell into 3 sectors, to make up 3 adjacent sectors into a mixed cell, and to allocate 3 cell base stations of each mixed cell to users in the mixed cell and to allocate different sub-bands to the adjacent mixed cells, so that the mixed cells do not interfere with each other. The document assumes that each cell is a regular hexagon and the distribution of the small base stations is regular, however, in an actual system, the distribution of the small base stations is random and irregular, and the coverage area of all the small base stations cannot be regular hexagons, so the method proposed by the document cannot be used in the actual system.
Disclosure of Invention
The invention provides an interference reduction method based on overlapping clustering, which is suitable for an ultra-dense network adopting multi-point cooperative transmission.
The technical idea for realizing the invention is as follows: constructing a path loss graph according to path losses among small base stations, finding out the shortest side in the path loss graph in sequence, if a triangle or a quadrangle taking the side as one side exists, placing the small base stations corresponding to a plurality of vertexes of one triangle or quadrangle in one cluster, otherwise, placing the small base stations corresponding to two vertexes of the side in one cluster, calculating the average value of the path losses of the user and the small base stations in the cluster for each user, clustering the users according to the average value, finally coloring the path loss graph by adopting the graph to allocate a sub-frequency band for each cluster, and enabling the small base stations in each cluster to adopt the allocated sub-frequency band to interact data with the users in the cluster.
In order to realize the technical idea, the interference reduction method based on the overlapping clustering provided by the invention is suitable for a super-dense network adopting CoMP, and comprises the following steps:
a, constructing a path loss graph corresponding to small base stations in a network, wherein nodes in the graph correspond to the small base stations, edges correspond to the path loss between the small base stations, if the path loss between the small base stations is smaller than a preset loss threshold, edges exist between the nodes corresponding to the two small base stations, the length of the edges is equal to the path loss between the two base stations, and if the path loss between the small base stations is larger than the preset loss threshold, no edge exists between the nodes corresponding to the two small base stations;
b, performing overlapped clustering on the small base stations according to the path loss graph constructed in the step A, wherein each cluster comprises a plurality of small base stations;
c, grouping each user into one of the clusters;
d, distributing a sub-frequency band for each cluster by adopting a graph coloring algorithm;
e, the small base station in each cluster uses the sub-frequency band distributed in the step D to interact data with the user in the cluster.
Further, the step B specifically includes:
b1, putting all edges in the path loss graph in a set L, making i equal to 1, and making a set P an empty set;
b2, finding out the shortest side in L, if there are more sides, selecting one of the sides randomly, and using L1Representing the edge;
b3 if present, with l1If the triangle or quadrangle as a side is not in the set P, step B4 is executed if there is no triangle or quadrangle with l1Triangle or quadrangle as side, step B5 is performed;
b4, find out1Calculating the sum of the side lengths of all triangles and quadrilaterals of one side, finding out the triangle or quadrilateral with the minimum sum of the side lengths, and placing the small base stations corresponding to the vertexes of the triangle or quadrilateral onCluster QiIn (2), all the sides of the triangle or quadrangle are placed in the set L1Put the triangle or quadrangle in the set P;
b5, mixing l1The two vertexes of the cluster corresponding to the small base stations are placed in the cluster QiIn (1), mixing1Put in the set L1Performing the following steps;
b6, order
Figure BDA0001603467740000041
Figure BDA0001603467740000042
Represents L1Complementary set in L, let i ═ i + 1;
b7, repeating the step B2, the step B3, the step B4, the step B5 and the step B6 until L is an empty set;
b8, if there is a triangle or a quadrangle which is not included in the set P in the path loss map, placing the small base stations corresponding to the three vertices of each triangle or the four vertices of the quadrangle in a new cluster, if there is a zero degree point in the path loss map, placing the small base stations corresponding to each zero degree point in a new cluster, and dividing the small base stations into K clusters from step B2 to step B8.
Further, the step C specifically includes:
c1, for the u-th user, finding out the small base station nearest to the user, and using BSuRepresents the small base station, U is 1,2, …, U is the total number of users in the network;
c2, for the u-th user, finding out the small base station BS contained in K clustersuA plurality of clusters of
Figure BDA0001603467740000043
Denotes these clusters, unIs composed of a small base station BSuU is 1,2, …, U is the total number of users in the network, K is the total number of clusters;
c3, calculating the u-th user and QsAverage value of path loss of inner small base station, ru,sIs represented by the formula, s ═ u1,u2,…,unLet us order
Figure BDA0001603467740000044
min { } represents taking the minimum value, and grouping the u-th user into a cluster
Figure BDA0001603467740000045
Where U is 1,2, …, U being the total number of users in the network.
Further, the step D specifically includes:
d1, using mjRepresents that the jth small base station is in the cluster Q1、Q2、…、QKJ is 1,2, …, J is the total number of small base stations in the network, K is the total number of clusters;
d2, let M be max { M ═ M1,m2,…,mJThe maximum value is taken, the frequency band is divided into M sub-frequency bands, and the set of the sub-frequency bands is F ═ F { }1,f2,…,fM}；
D3, in the path loss diagram constructed in step a, a diagram coloring algorithm is adopted to allocate a sub-band for each cluster, different sub-bands are allocated for adjacent clusters, and the sub-bands of non-adjacent clusters can be the same.
Drawings
FIG. 1 is a path loss diagram of an embodiment of the present invention;
FIG. 2 is a clustering diagram of an embodiment of the present invention;
FIG. 3 is a diagram of sub-band allocation according to an embodiment of the present invention;
FIG. 4 is a flow chart of the present invention;
FIG. 5 is a clustering flow diagram of the present invention.
Detailed Description
An embodiment of the present invention is given below, and the present invention will be described in further detail. Consider an ultra-dense network comprising several small base stations and a plurality of users, both randomly distributed within the network. Each base station is connected to the central controller through a backhaul link.
The central controller first constructs a path loss graph corresponding to a small base station in a network, as shown in fig. 1, a node in the graph corresponds to the small base station, and an edge corresponds to a path loss between the small base stations, if the path loss between the small base stations is smaller than a preset loss threshold, there is an edge between the nodes corresponding to the two small base stations and the length of the edge is equal to the path loss between the two small base stations, and if the path loss between the small base stations is larger than the preset loss threshold, there is no edge between the nodes corresponding to the two small base stations. As an example, there are 24 small base stations in fig. 1, the circles represent the small base stations, the numbers in the circles represent the serial numbers of the small base stations, and the numbers on the edges between the nodes represent the lengths of the edges.
Performing overlapped clustering on the small base stations according to the following steps:
step 1, putting all edges in a path loss graph in a set L, making i equal to 1, and making a set P an empty set;
step 2, finding out the shortest side in L, if the shortest side has a plurality of sides, randomly selecting one of the sides, and using L1Representing the edge;
step 3, if present, with l1If the triangle or quadrangle as a side is not in the set P, step B4 is executed if there is no triangle or quadrangle with l1Triangle or quadrangle as side, step B5 is performed;
step 4, find out1Calculating the sum of the side lengths of all triangles and quadrilaterals of one side, finding out the triangle or quadrilateral with the minimum sum of the side lengths, and placing the small base stations corresponding to the vertexes of the triangle or quadrilateral in a cluster QiIn (2), all the sides of the triangle or quadrangle are placed in the set L1Put the triangle or quadrangle in the set P;
step 5, mixing1The two vertexes of the cluster corresponding to the small base stations are placed in the cluster QiIn (1), mixing1Put in the set L1Performing the following steps;
step 6, order
Figure BDA0001603467740000061
Figure BDA0001603467740000062
Represents L1Complementary set in L, let i ═ i + 1;
step 7, repeating the step B2, the step B3, the step B4, the step B5 and the step B6 until L is an empty set;
and 8, if the path loss graph has triangles or quadrilaterals which are not classified into the set P, placing the small base stations corresponding to three vertexes of each triangle or four vertexes of the quadrilaterals in a new cluster, if the path loss graph has zero degree points, placing the small base stations corresponding to the zero degree points in a new cluster, and dividing the small base stations into K clusters from the step B2 to the step B8.
Step 1 to step 7, the small base station is divided into 22 clusters, and the BS is usediThe ith small base station is represented, i is 1,2, …,24, and the small base stations included in each cluster are:
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, and 2 clusters are obtained again, which are:
Q23＝{BS2,BS7,BS15,BS16}
Q24＝{BS14,BS17,BS21,BS24}
the clustering graph of the embodiment of the invention is shown in fig. 2, white circles represent small base stations, each triangle or quadrangle has a gray primary color, the number in each gray circle represents the serial number of the cluster, and the small base station corresponding to the vertex of the triangle or quadrangle where the gray circle is located is the small base station contained in the cluster.
Each user is classified into one cluster, and the specific steps are as follows:
step 1, for the u-th user, finding out the small base station nearest to the user, and using BSuDenotes the small cell, U is 1,2, …, U is the total number of users in the network；
Step 2, for the u-th user, finding out the small base station BS contained in all the clustersuA plurality of clusters of
Figure BDA0001603467740000081
Denotes these clusters, unIs composed of a small base station BSuU is 1,2, …, U being the total number of users in the network;
step 3, calculating the u-th user and QsAverage value of path loss of inner small base station, ru,sIs represented by the formula, s ═ u1,u2,…,unLet us order
Figure BDA0001603467740000082
min { } represents taking the minimum value, and grouping the u-th user into a cluster
Figure BDA0001603467740000083
Where U is 1,2, …, U being the total number of users in the network.
And allocating a sub-frequency band for each cluster by adopting a graph coloring algorithm, wherein the method comprises the following specific steps:
step 1, using mjRepresents that the jth small base station is in a base station cluster Q1、Q2、…、QKJ is 1,2, …, J is the total number of small base stations in the network, K is the total number of clusters,
step 2, let M be max { M ═ M1,m2,…,mJThe maximum value is taken, the frequency band is divided into M sub-frequency bands, and the set of the sub-frequency bands is F ═ F { }1,f2,…,fM}；
And step 3, in the path loss graph constructed in the step A, clustering sub-bands for each cluster by adopting a graph coloring algorithm, distributing different sub-bands for adjacent clusters, wherein the sub-bands of non-adjacent clusters can be the same.
In the embodiment, M is 7, the frequency band is divided into 7 sub-bands, and then the sub-bands are allocated by using a graph coloring algorithm, as shown in fig. 3, a white circle represents a small base station, a colored circle in each triangle or quadrangle represents a sub-band, each color represents a sub-band, and there are 7 colors, which represent 7 sub-bands.
And the small base station of each cluster uses the allocated sub-frequency band to serve the users in the cluster.
With reference to the flowchart of the present invention, i.e., fig. 4, the interference reduction method based on overlapping clustering specifically includes the following steps:
a, constructing a path loss graph corresponding to small base stations in a network, wherein nodes in the graph correspond to the small base stations, edges correspond to the path loss between the small base stations, if the path loss between the small base stations is smaller than a preset loss threshold, edges exist between the nodes corresponding to the two small base stations, the length of the edges is equal to the path loss between the two base stations, and if the path loss between the small base stations is larger than the preset loss threshold, no edge exists between the nodes corresponding to the two small base stations;
b, performing overlapped clustering on the small base stations according to the path loss graph constructed in the step A, wherein each cluster comprises a plurality of small base stations;
c, grouping each user into one of the clusters;
d, distributing a sub-frequency band for each cluster by adopting a graph coloring algorithm;
e, the small base station in each cluster uses the sub-frequency band distributed in the step D to interact data with the user in the cluster.
With reference to the clustering flowchart of the present invention, i.e., fig. 5, the specific steps for clustering the small base stations are as follows:
b1, putting all edges in the path loss graph in a set L, making i equal to 1, and making a set P an empty set;
b2, finding out the shortest side in L, if there are more sides, selecting one of the sides randomly, and using L1Representing the edge;
b3 if present, with l1If the triangle or quadrangle as a side is not in the set P, step B4 is executed if there is no triangle or quadrangle with l1Triangle or quadrangle as side, step B5 is performed;
b4, find out1For all triangles and quadrilaterals of one of the sides, the sum of the sides of each triangle is calculated andfinding out the triangle or quadrangle with the minimum sum of side lengths, and placing the small base stations corresponding to the vertexes of the triangle or quadrangle in the cluster QiIn (2), all the sides of the triangle or quadrangle are placed in the set L1Put the triangle or quadrangle in the set P;
b5, mixing l1The two vertexes of the cluster corresponding to the small base stations are placed in the cluster QiIn (1), mixing1Put in the set L1Performing the following steps;
b6, order
Figure BDA0001603467740000101
Figure BDA0001603467740000102
Represents L1Complementary set in L, let i ═ i + 1;
b7, repeating the step B2, the step B3, the step B4, the step B5 and the step B6 until L is an empty set;
b8, if there is a triangle or a quadrangle which is not included in the set P in the path loss map, placing the small base stations corresponding to the three vertices of each triangle or the four vertices of the quadrangle in a new cluster, if there is a zero degree point in the path loss map, placing the small base stations corresponding to each zero degree point in a new cluster, and dividing the small base stations into K clusters from step B2 to step B8.
The above embodiments are merely illustrative of the present invention, and those skilled in the art can make various changes and modifications to the present invention without departing from the spirit and scope of the present invention. Thus, if such modifications and variations of the present invention fall within the scope of the claims of the present invention and their equivalents, the present invention is also intended to include such modifications and variations.

Claims (1)

  1. An interference reduction method based on overlapping clustering in a UDN is suitable for the UDN adopting multi-point cooperative transmission, and is characterized in that: the method comprises the following steps:
    a, constructing a path loss graph corresponding to small base stations in a network, wherein nodes in the graph correspond to the small base stations, edges correspond to the path loss between the small base stations, if the path loss between the small base stations is smaller than a preset loss threshold, edges exist between the nodes corresponding to the two small base stations, the length of the edges is equal to the path loss between the two base stations, and if the path loss between the small base stations is larger than the preset loss threshold, no edge exists between the nodes corresponding to the two small base stations;
    b, according to the path loss diagram constructed in the step A, performing overlapped clustering on the small base stations, wherein each cluster comprises a plurality of small base stations, and the specific process is as follows:
    b1, putting all edges in the path loss graph in a set L, making i equal to 1, and making a set P an empty set;
    b2, finding out the shortest side in L, if there are more sides, selecting one of the sides randomly, and using L1Representing the edge;
    b3 if present, with l1If the triangle or quadrangle as a side is not in the set P, step B4 is executed if there is no triangle or quadrangle with l1Triangle or quadrangle as side, step B5 is performed;
    b4, find out1Calculating the sum of the side lengths of all triangles and quadrilaterals of one side, finding out the triangle or quadrilateral with the minimum sum of the side lengths, and placing the small base stations corresponding to the vertexes of the triangle or quadrilateral in a cluster QiIn (2), all the sides of the triangle or quadrangle are placed in the set L1Put the triangle or quadrangle in the set P;
    b5, mixing l1The two vertexes of the cluster corresponding to the small base stations are placed in the cluster QiIn (1), mixing1Put in the set L1Performing the following steps;
    b6, order
    Figure FDA0003346130410000021
    Figure FDA0003346130410000022
    Represents L1Complementary set in L, let i ═i+1；
    B7, repeating the step B2, the step B3, the step B4, the step B5 and the step B6 until L is an empty set;
    b8, if there is triangle or quadrangle which is not included in the set P in the path loss map, placing the small base stations corresponding to three vertices of each such triangle or four vertices of quadrangle in a new cluster, if there is a zero degree point in the path loss map, placing the small base stations corresponding to each zero degree point in a new cluster separately, where the degree is according to the meaning in the graph algorithm, that is, the degree of a point, equal to the number of edges connected to the point, and each point in the path loss map has its own degree; dividing the small base stations into K clusters from the step B2 to the step B8;
    c, grouping each user into one of the clusters, wherein the specific process is as follows:
    c1, for the u-th user, finding out the small base station nearest to the user, and using BSuRepresents the small base station, U is 1,2, …, U is the total number of users in the network;
    c2, for the u-th user, finding out the small base station BS contained in K clustersuA plurality of clusters of
    Figure FDA0003346130410000023
    Denotes these clusters, unIs composed of a small base station BSuU is 1,2, …, U is the total number of users in the network, K is the total number of clusters;
    c3, calculating the u-th user and QsAverage value of path loss of inner small base station, ru,sIs represented by the formula, s ═ u1,u2,…,unLet us order
    Figure FDA0003346130410000024
    min { } represents taking the minimum value, and grouping the u-th user into a cluster
    Figure FDA0003346130410000025
    Where U is 1,2, …, U being the total number of users in the network;
    d, distributing a sub-frequency band for each cluster by adopting a graph coloring algorithm, wherein the specific process is as follows:
    d1, using mjRepresents that the jth small base station is in the cluster Q1、Q2、…、QKJ is 1,2, …, J is the total number of small base stations in the network, K is the total number of clusters;
    d2, let M be max { M ═ M1,m2,…,mJThe maximum value is taken, the frequency band is divided into M sub-frequency bands, and the set of the sub-frequency bands is F ═ F { }1,f2,…,fM}；
    D3, in the path loss graph constructed in the step A, a graph coloring algorithm is adopted to allocate a sub-frequency band for each cluster, different sub-frequency bands are allocated for adjacent clusters, and the sub-frequency bands of non-adjacent clusters can be the same;
    e, the small base station in each cluster uses the sub-frequency band distributed in the step D to interact data with the user in the cluster.
CN201810234243.XA 2018-03-21 2018-03-21 Interference reduction method based on overlapping clustering in UDN Expired - Fee Related 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 CN108462964A (en) 2018-08-28
CN108462964B true CN108462964B (en) 2021-12-31

Family

ID=63236577

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201810234243.XA Expired - Fee Related 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)

Family Cites Families (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1204283A1 (en) * 2000-11-06 2002-05-08 Telefonaktiebolaget L M Ericsson (Publ) Cellular radio network reusing frequencies
US9787370B2 (en) * 2014-03-31 2017-10-10 Huawei Technologies Co., Ltd. Dynamic clustering for radio coordination in a virtual network
MX378649B (en) * 2014-06-06 2025-03-10 Ericsson Telefon Ab L M GROUP-BASED BEACON SIGNAL TRANSMISSION.
CN105407474B (en) * 2014-09-04 2021-01-12 北京三星通信技术研究有限公司 Resource management method and base station
CN104955077B (en) * 2015-05-15 2018-05-08 北京理工大学 A kind of heterogeneous network cell cluster-dividing method and device based on user experience speed
CN107172682B (en) * 2017-07-10 2020-06-12 南京邮电大学 A method of wireless resource allocation for ultra-dense networks based on dynamic clustering
CN107371167B (en) * 2017-09-05 2021-03-30 上海无线通信研究中心 Cell clustering method and frequency spectrum overlapping multiplexing method based on cell clustering method
CN107750056B (en) * 2017-10-25 2020-12-11 河南理工大学 Interference Mitigation Methods in Ultra-Dense Networks
CN107770874B (en) * 2017-10-25 2021-06-15 河南理工大学 Clustering and Subchannel Allocation in Ultra-Dense Networks

Also Published As

Publication number Publication date
CN108462964A (en) 2018-08-28

Similar Documents

Publication Publication Date Title
CN107172682B (en) A method of wireless resource allocation for ultra-dense networks based on dynamic clustering
CN105230070B (en) A radio resource allocation method and radio resource allocation device
CN104540139B (en) Isomery UNE resource allocation methods and system
CN101982991B (en) Heterogeneous service QoS based LTE network inter-cell interference ordination method
CN107770874B (en) Clustering and Subchannel Allocation in Ultra-Dense Networks
CN107750056B (en) Interference Mitigation Methods in Ultra-Dense Networks
Jiang et al. Base station association game in multi-cell wireless networks (special paper)
CN103873146A (en) Resource scheduling method in indoor distribution visible light communication system
CN103648168B (en) Combined type dynamic spectrum distribution method in heterogeneous network convergence scene
CN102821391B (en) Distance ratio based D2D (dimension to dimension) link spectrum allocation method
CN102065437A (en) Graph coloring-based wireless frequency allocation working method
Parizi et al. Resource unit allocation in coordinated OFDMA multi-user Wi-Fi systems
Hatoum et al. Q-FCRA: QoS-based OFDMA femtocell resource allocation algorithm
CN106851658A (en) The frequency spectrum distributing method of the OFDMA two-tier networks based on graph theory
CN107454601B (en) A wireless virtual mapping method considering inter-cell interference in ultra-dense environments
CN103491550B (en) Cognitive radio dynamic spectrum distribution method integrated with system overall transmission speed and distribution equity
CN103442365B (en) A kind of frequency multiplexing method reducing the interior CoMP system interference in station
CN104602353A (en) Wireless resource allocation method for D2D links in cellular mobile communication system
CN108462964B (en) Interference reduction method based on overlapping clustering in UDN
Ru et al. Power and spectrum allocation in D2D networks based on coloring and chaos genetic algorithm
CN108307514B (en) Intercluster Interference Elimination Method Based on Double Clustering and Resource Allocation
CN104486767A (en) Cluster-based dynamic ABS interference rejection method in heterogeneous cellular network
CN103347262B (en) Home eNodeB frequency multiplexing method based on hypergraph
CN108134623B (en) Interference mitigation method based on single-band clustering in ultra-dense networks
CN104811942A (en) Heterogeneous network frequency spectrum resource distribution method and apparatus

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
CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20211231

CF01 Termination of patent right due to non-payment of annual fee