CN108134623B - Interference reduction method based on single-frequency-band clustering in ultra-dense network - Google Patents

Interference reduction method based on single-frequency-band clustering in ultra-dense network Download PDF

Info

Publication number
CN108134623B
CN108134623B CN201810052725.3A CN201810052725A CN108134623B CN 108134623 B CN108134623 B CN 108134623B CN 201810052725 A CN201810052725 A CN 201810052725A CN 108134623 B CN108134623 B CN 108134623B
Authority
CN
China
Prior art keywords
user
base station
cluster
users
sub
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN201810052725.3A
Other languages
Chinese (zh)
Other versions
CN108134623A (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 CN201810052725.3A priority Critical patent/CN108134623B/en
Publication of CN108134623A publication Critical patent/CN108134623A/en
Application granted granted Critical
Publication of CN108134623B publication Critical patent/CN108134623B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04B—TRANSMISSION
    • H04B7/00—Radio transmission systems, i.e. using radiation field
    • H04B7/02—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas
    • H04B7/022—Site diversity; Macro-diversity
    • H04B7/024—Co-operative use of antennas of several sites, e.g. in co-ordinated multipoint or co-operative multiple-input multiple-output [MIMO] systems
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04J—MULTIPLEX COMMUNICATION
    • H04J11/00—Orthogonal multiplex systems, e.g. using WALSH codes
    • H04J11/0023—Interference mitigation or co-ordination
    • H04J11/005—Interference mitigation or co-ordination of intercell interference
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/02—Topology update or discovery
    • 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
    • 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

Landscapes

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

Abstract

The invention discloses an interference reduction method based on single-frequency-band clustering in an ultra-dense network, which is suitable for the ultra-dense network adopting CoMP. Constructing a topological structure diagram based on the geographical position of a user, wherein a node represents the user, connecting two user lines which are positioned in two adjacent small cells and have a distance less than or equal to a certain value, finding out the shortest side in the topological structure diagram in sequence, obtaining a user cluster according to the difference of the degrees of the two nodes, placing a small base station of the small cell in which the user in the user cluster is positioned in a service base station cluster, dividing the frequency band into a plurality of sub-frequency bands according to the occurrence frequency of each small base station in the base station cluster, distributing different sub-frequency bands for the users which are served by each small base station and positioned in different user clusters, calculating the average value of the path loss from each user to the small base station in each base station cluster at intervals of a plurality of time slots, and clustering the users again according to the average value.

Description

Interference reduction method based on single-frequency-band clustering in ultra-dense network
Technical Field
The invention relates to the field of communication, in particular to an interference reduction method based on single-frequency-band clustering in an ultra-dense network.
Background
Ultra Dense Networks (UDNs) are one of the key technologies for next-generation mobile communications. The UDN achieves the goal of increasing system capacity by deploying a large number of small base stations of low power. If the small base stations use the same frequency band, there will be serious interference, so interference mitigation is one of the key technologies of UDN.
The existing interference reduction method in UDN is divided into clustering, resource allocation, Coordinated multipoint transmission (CoMP), and the like. The whole network is divided into a plurality of clusters through clustering, and each cluster comprises a plurality of small base stations. In the clustering method proposed at the earliest, the small base stations with small interference are placed in one cluster, the small base stations with large interference are placed in different clusters, the small base stations in the same cluster adopt the same frequency band, and the small base stations in different clusters adopt different frequency bands. Most of the existing clustering methods place small base stations with large interference in one cluster, place small base stations with small interference in different clusters, and select a cluster head in each cluster. In the resource allocation method, a cluster head allocates different frequency bands or power for small base stations in the cluster, so that the purpose of interference reduction is achieved; in the CoMP method adopting the joint transmission, interference signals are converted into useful signals through sharing user data among the small base stations, and the purpose of interference reduction is achieved.
The document "Dynamic joint processing: Achievehigh spectral efficiency in uplink 5G cellular Networks" (Hajisami Abolfazl, Pompili Dario, Computer Networks,2017) states that: conventional CoMP converts the interference range from the cell boundary to the cluster boundary, and some users are always located at the cluster boundary, so these users can suffer from inter-cluster interference from other clusters, and even if each cluster uses all sub-bands, the problem of inter-cluster interference cannot be solved by adopting dynamic CoMP clustering. In order to reduce inter-cluster interference, the document proposes an interference reduction method based on single-frequency-band clustering, for each frequency band, an adjacent small cell is divided into a virtual cluster, a user in the virtual cluster is located at the center of the cluster, and the distance between the user and a small base station outside the cluster is as far as possible, so that interference can be effectively reduced. The virtual cluster is defined according to each frequency band, a sub-frequency band is adopted in each virtual cluster, and each small cell is possibly positioned in a plurality of virtual clusters using different frequency bands. The document also indicates that if the location of a user changes, the cluster where the serving small cell of the user is located is changed according to the sum of the intra-cluster interference power and the inter-cluster interference power of the user, however, the document does not give a specific clustering method and a specific sub-band allocation method.
Disclosure of Invention
In summary, in order to solve the existing technical problem, the present invention provides an interference reduction method based on single-band clustering, which is suitable for a super-dense network using CoMP.
The technical idea for realizing the invention is as follows: constructing a topological structure diagram based on the geographical position of a user, wherein a node represents the user, connecting two user lines which are positioned in two adjacent small cells and have a distance less than or equal to a certain value, finding out the shortest side in the topological structure diagram in sequence, obtaining a user cluster according to the difference of the degrees of the two nodes, placing a small base station of the small cell in which the user in the user cluster is positioned in a service base station cluster, dividing the frequency band into a plurality of sub-frequency bands according to the occurrence frequency of each small base station in the base station cluster, distributing different sub-frequency bands for the users which are served by each small base station and positioned in different user clusters, calculating the average value of the path loss from each user to the small base station in each base station cluster at intervals of a plurality of time slots, and clustering the users again according to the average value.
In order to implement the above technical idea, the interference reduction method based on single-band clustering provided by the invention is suitable for a super-dense network adopting CoMP, and comprises the following steps:
a, constructing a topological structure diagram based on the geographic position of a user, wherein a node represents the user, two users which are positioned in two adjacent small cells and have a distance less than or equal to D are connected by a line, the length of the line is equal to the distance between the two users, no edge exists between the other users, and D is a preset distance threshold;
b, dividing users in the network into a plurality of user clusters, wherein each user cluster comprises a plurality of users, and finding out a serving base station cluster of each user cluster;
c, dividing the frequency band into a plurality of sub-frequency bands according to the base station cluster obtained in the step B, and distributing a single sub-frequency band for each user cluster;
D，Qkthe inner small base station is UkServing base station, U, of an inner userkThe inner user uses the sub-band direction Q allocated in the step CkInner small base stationTransmitting a signal, or QKThe step C used by the inner small base station is UkSub-band direction U allocated by inner userkThe inner user sends a signal, K is 1,2, …, and K is the total number of the user cluster and the total number of the base station cluster;
e, for each user, calculating the Q of the user to the base station cluster every a plurality of time slotskAverage value of path loss of inner small base station, pkWhere K is 1,2, …, K is the total number of user clusters and also the total number of base station clusters, let pg＝min{p1,p2,…,pKG is a positive integer between 1 and K, and the user is classified into a user cluster UgPerforming the following steps;
and F, repeating the steps A to E at intervals, clustering again and allocating sub-frequency bands to each user cluster.
Further, the step B specifically includes:
b1, setting i to 1, where i represents the serial number of the user cluster found each time and the serial number of the base station cluster serving the user cluster;
b2, finding out the shortest side in the latest topological structure chart, if the shortest side has a plurality of sides, randomly selecting one of the sides, and using a and B to represent two nodes connected with the side;
b3, if the degrees of a and B are both 1, placing two users corresponding to the two nodes in the user cluster UiIn the method, the small base station of the small cell where the two users are located is placed in a base station cluster QiPerforming the following steps;
b4, if the degree of one node in a and B is 1 and the degree of the other node is 2, c represents the other node connected with the node with the degree of 2, then placing three users corresponding to the three nodes in a user cluster UiIn the method, the small base stations of the small cells in which the three users are positioned are placed in a base station cluster QiPerforming the following steps;
b5, if the degrees of a and B are both 2, and both are connected to node d, and a, B and d are located in three cells, then placing the three users corresponding to the three nodes in user cluster UiIn the method, the small base stations of the small cells in which the three users are positioned are placed in a base station cluster QiPerforming the following steps;
b6, at latestDeleting U in topological structure diagramiObtaining a new topology structure diagram by the nodes corresponding to the user and the edges connected with the nodes, and enabling i to be i + 1;
b7, in the new topological structure chart, repeating step B2, step B3, step B4, step B5 and step B6 until all edges in the topological structure chart are deleted, dividing the users and the small base stations into K user clusters and K base station clusters, and using U to usekRepresenting user clusters by QkDenotes a base station cluster, K is 1,2, …, K, QkThe inner small base station is UkA serving base station of an inner user;
b8, if there is a node with zero degree in the new topological structure chart, calculating the user-to-base station cluster Q corresponding to the node with zero degreekAverage value of path loss of inner small base station, rkWhere K is 1,2, …, K is the total number of user clusters and also the total number of base station clusters, and let r bee＝min{r1,r2,…,rKThe min { } represents the minimum value, e is a positive integer between 1 and K, and the user corresponding to the node is classified into a user cluster UeIn (1).
Further, the step C specifically includes:
c1, 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 user clusters and is also the total number of base station clusters;
c2, let M be max { M ═ M1,m2,…,mJThe maximum value is taken, the frequency band is divided into L sub-frequency bands, L is larger than or equal to M, and the set of the sub-frequency bands is F ═ F { }1,f2,…,fL}，flIs the L-th sub-band, L ═ 1,2, …, L;
c3, allocating any sub-band from L sub-bands to user cluster U1All users in (1), let n be 2;
c4, finding out a base station cluster QnFinding out users distributed with sub-frequency band in small cell where inner small base station is located, and using F1Representing a set of sub-bands to which these users are allocated, from CFF1U allocated to any one of the sub-bandsnUser of (1), CFF1Is represented by F1Complementary set in F, let n be n + 1;
c5, repeating the step C4 until all user clusters are allocated sub-bands.
Drawings
FIG. 1 is a user topology structure diagram of an embodiment of the present invention;
FIG. 2 is a diagram of sub-band allocation according to an embodiment of the present invention;
FIG. 3 is a flow chart of the present invention;
FIG. 4 is a clustering flow diagram of the present invention;
fig. 5 is a flow chart of the allocation of sub-bands of the present invention.
Detailed Description
The present invention will be described in further detail with reference to an embodiment. 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. A plurality of users are put together to form a user cluster, a plurality of base stations serve the users in a joint transmission mode at the same time, and the base stations are put together to form a service base station cluster of the user cluster.
The central controller first constructs a topology structure diagram based on the geographic location of the user, as shown in fig. 1, a quadrangle represents the user, the quadrangle has two numbers, the number before the comma represents the serial number of the small cell, i.e., the serial number of the small base station, the number after the comma represents the serial number of the user in the small cell, the circle in the diagram represents the small base station, and the number in the circle represents the serial number of the small base station. In fig. 1, 16 small cells are 16 small base stations, and the boundaries of the small cells are drawn by dashed lines.
In a user topology structure diagram, two users which are positioned in two adjacent small cells and have a distance less than or equal to D are connected by a line, the length of the line is equal to the distance between the two users, no edge exists between the other users, no edge exists between small base stations, and no edge exists between the small base stations and the users. D is a preset distance threshold.
Finding out the shortest side in the latest user topology structure chart, if the shortest side has a plurality of sides, randomly selecting one of the sides, and using a and b to represent two nodes connected with the side.
If the degrees of a and b are both 1, placing two users corresponding to the two nodes in a user cluster U1In the method, the small base station of the small cell where the two users are located is placed in a base station cluster Q1In (1).
If the degree of one node in a and b is 1 and the degree of the other node is 2, c represents the other node connected with the node with the degree of 2, three users corresponding to the three nodes are placed in a user cluster U1In the method, the small base stations of the small cells in which the three users are positioned are placed in a base station cluster Q1In (1).
If the degrees of a and b are both 2, and are all connected to a node d, and a, b and d are located in three cells, then three users corresponding to the three nodes are placed in a user cluster U1In the method, the small base stations of the small cells in which the three users are positioned are placed in a base station cluster Q1In (1).
Q1The small cell in is U1Serving base station, Q, of a subscriber1Is U1The serving base station cluster for the user.
Deleting U in latest topological structure diagram1The method comprises the steps of obtaining a new topological structure diagram by using nodes corresponding to users and edges connected with the nodes, finding the shortest edge in the diagram, finding a user cluster and a base station cluster by adopting the same method, deleting the nodes corresponding to the users in the user cluster and the edges connected with the nodes until all the edges in the topological structure diagram are deleted, dividing the users and the small base station into 15 user clusters and 15 base station clusters, and using U (universal serial bus) to divide the users and the small base station into 15 user clusters and 15 base station clusterskRepresenting user clusters by QkDenotes a base station cluster, k is 1,2, …,15, QkThe inner small base station is UkThe serving base station of the inner user.
By ui,jDenotes the jth user served by the ith small base station, using bsiDenotes the ith small base station, i ═ 1,2, …,16, j ∈ {2,3,4 }.
The 1 st pair of user clusters and base station clusters are U respectively1＝{u2,3 u1,2 u8,2And Q1＝{bs1 bs2 bs8}。
The 2 nd pair of user cluster and base station cluster are U respectively2＝{u12,2 u13,3 u15,1And Q2＝{bs12 bs13 bs15}。
The 3 rd pair of user cluster and base station cluster are U respectively3＝{u13,1 u14,1And Q3＝{bs13 bs14}。
The 4 th pair of user cluster and base station cluster are U respectively4＝{u8,3 u10,1And Q4＝{bs8 bs10}。
The 5 th pair of user cluster and base station cluster are U respectively5＝{u5,1 u6,1And Q5＝{bs5 bs6}。
The 6 th pair of user cluster and base station cluster are U respectively6＝{u9,3 u10,2And Q6＝{bs9 bs10}。
The 7 th pair of user cluster and base station cluster are U respectively7＝{u10,3 u12,1And Q7＝{bs10 bs12}。
The 8 th pair of user cluster and base station cluster are U respectively8＝{u6,2 u7,7 u11,1And Q8＝{bs6 bs7 bs11}。
The 9 th pair of user cluster and base station cluster are U respectively9＝{u3,3 u4,2 u8,1And Q9＝{bs3 bs4 bs8}。
The 10 th pair of user cluster and base station cluster are U respectively10＝{u1,1 u9,1 u9,2And Q10＝{bs1 bs9}。
The 11 th pair of user cluster and base station cluster are U respectively11＝{u4,3 u7,1And Q11＝{bs4 bs7}。
The 12 th pair of user cluster and base station cluster are U respectively12＝{u2,2 u3,1And Q12＝{bs2 bs3}。
The 13 th pair of user cluster and base station cluster are U respectively13＝{u10,4 u11,3And Q13＝{bs10 bs11}。
The 14 th pair of user cluster and base station cluster are U respectively14＝{u12,3 u16,1And Q14＝{bs12 bs16}。
The 15 th pair of user cluster and base station cluster are U respectively15＝{u15,3 u16,2And Q15＝{bs15 bs16}。
If the new topological structure chart has nodes with zero degree, the user-to-base station cluster Q corresponding to the nodes with zero degree of calculationkAverage value of path loss of inner small base station, rkDenotes, k is 1,2, …,15, let re＝min{r1,r2,…,r15The min { } represents taking the minimum value, e is a positive integer between 1 and 15, and the user corresponding to the node is classified into a user cluster UeIn (1). After the users corresponding to the nodes with the degree of zero are classified into the user clusters, the number of the user clusters is not changed, and at this time, the user clusters and the base station clusters are respectively:
the 1 st pair of user clusters and base station clusters are U respectively1＝{u2,3 u1,2 u8,2And Q1＝{bs1 bs2 bs8}。
The 2 nd pair of user cluster and base station cluster are U respectively2＝{u12,2 u13,3 u15,1 u15,2And Q2＝{bs12 bs13 bs15}。
The 3 rd pair of user cluster and base station cluster are U respectively3＝{u13,1 u13,2 u14,1 u14,2And Q3＝{bs13 bs14}。
The 4 th pair of user cluster and base station cluster are U respectively4＝{u8,3 u10,1And Q4＝{bs8 bs10}。
The 5 th pair of user cluster and base station cluster are U respectively5＝{u5,1 u5,2 u6,1 u6,3And Q5＝{bs5 bs6}。
The 6 th pair of user cluster and base station cluster are U respectively6＝{u9,3 u10,2And Q6＝{bs9 bs10}。
The 7 th pair of user cluster and base station cluster are U respectively7＝{u10,3 u12,1And Q7＝{bs10 bs12}。
The 8 th pair of user cluster and base station cluster are U respectively8＝{u6,2 u7,7 u11,1 u11,2And Q8＝{bs6 bs7 bs11}。
The 9 th pair of user cluster and base station cluster are U respectively9＝{u3,2 u3,3 u4,2 u8,1And Q9＝{bs3 bs4 bs8}。
The 10 th pair of user cluster and base station cluster are U respectively10＝{u1,1 u1,3 u9,1 u9,2And Q10＝{bs1 bs9}。
The 11 th pair of user cluster and base station cluster are U respectively11＝{u4,1 u4,3 u7,1 u7,2And Q11＝{bs4 bs7}。
The 12 th pair of user cluster and base station cluster are U respectively12＝{u2,1 u2,2 u3,1And Q12＝{bs2 bs3}。
The 13 th pair of user cluster and base station cluster are U respectively13＝{u10,4 u11,3And Q13＝{bs10 bs11}。
The 14 th pair of user cluster and base station cluster are U respectively14＝{u12,3 u16,1 u16,3And Q14＝{bs12 bs16}。
The 15 th pair of user cluster and base station cluster are U respectively15＝{u15,3 u16,2And Q15＝{bs15 bs16}。
By mjRepresents that the jth small base station is in a base station cluster Q1、Q2、…、Q15J is 1,2, …, 16. M1＝2，M2＝2，M3＝2，M4＝2，M5＝1，M6＝2，M7＝2，M8＝3，M9＝2，M10＝4，M11＝2，M12＝3，M13＝2，M14＝1，M15＝2，M16Let M be max { M ═ 21,m2,…,m16Dividing the frequency band into 4 sub-bands, where F is { F ═ 4}1,f2,f3,f4}。
Any one of the 4 sub-frequency bands is distributed to a user cluster U1All users in (1). Finding base station cluster Q2Finding out users distributed with sub-frequency band in small cell where inner small base station is located, and using F1Representing a set of sub-bands to which these users are allocated, from CFF1U allocated to any one of the sub-bands2User of (1), CFF1Is represented by F1Complement in F. And allocating a single frequency band to other user clusters by adopting the same method.
Fig. 2 is a diagram of sub-band allocation, where colors represent sub-bands, different colors represent different sub-bands, green represents sub-band 1, yellow represents sub-band 2, blue represents sub-band 3, and gray represents sub-band 4. Taking sub-band 1 as an example, small cell 1, small cell 2 and small cell 8 use sub-band 1 as user u2,3User u1,2And user u8,2The three users are located at the central positions of the three base stations. Although the small base station 1 and the small base station 9 are adjacent, and the small base station 9 adopts the sub-band 1 as the user u9,3Service, small base station 1 and user u9,3Is far away, the small base station 9 and the user u2,3User u1,2And user u8,2Is far away and the cluster interference is generatedSmaller or even negligible.
QkThe inner small base station is UkServing base station, U, of an inner userkThe inner user uses the sub-band direction Q allocated in the step CkInner small base station transmitting signal, or QKThe step C used by the inner small base station is UkSub-band direction U allocated by inner userkThe inner user sends a signal, K is 1,2, …, and K is the total number of user clusters and also the total number of base station clusters.
For each user, calculating Q from the user to the base station cluster every several time slotskAverage value of path loss of inner small base station, pkWhere K is 1,2, …, K is the total number of user clusters and also the total number of base station clusters, let pg＝min{p1,p2,…,pKG is a positive integer between 1 and K, and the user is classified into a user cluster UgIn (1).
And repeating the steps A to E at intervals, clustering again and allocating sub-frequency bands to each user cluster.
With reference to the flowchart of the present invention, i.e., fig. 3, the interference reduction method based on single-band clustering specifically includes the following steps:
a, constructing a topological structure diagram based on the geographic position of a user, wherein a node represents the user, two users which are positioned in two adjacent small cells and have a distance less than or equal to D are connected by a line, the length of the line is equal to the distance between the two users, no edge exists between the other users, and D is a preset distance;
b, dividing users in the network into a plurality of user clusters, wherein each user cluster comprises a plurality of users, and finding out a serving base station cluster of each user cluster;
c, dividing the frequency band into a plurality of sub-frequency bands according to the base station cluster obtained in the step B, and distributing a single sub-frequency band for each user cluster;
D，Qkthe inner small base station is UkServing base station, U, of an inner userkThe inner user uses the sub-band direction Q allocated in the step CkInner small base station transmitting signal, or QKThe step C used by the inner small base station is UkSub-band direction U allocated by inner userkInner userSending a signal;
e, for each user, calculating the Q of the user to the base station cluster every a plurality of time slotskAverage value of path loss of inner small base station, pkWhere K is 1,2, …, K is the total number of user clusters and also the total number of base station clusters, let pg＝min{p1,p2,…,pKG is a positive integer between 1 and K, and the user is classified into a user cluster UgPerforming the following steps;
and F, repeating the steps A to E at intervals of T, re-clustering and allocating sub-frequency bands to each cluster.
With reference to the clustering flowchart of the present invention, i.e., fig. 4, the specific steps of clustering users and clustering base stations are as follows:
b1, setting i to 1, where i represents the serial number of the user cluster found each time and the serial number of the base station cluster serving the user cluster;
b2, finding out the shortest side in the latest topological structure chart, if the shortest side has a plurality of sides, randomly selecting one of the sides, and using a and B to represent two nodes connected with the side;
b3, if the degrees of a and B are both 1, placing two users corresponding to the two nodes in the user cluster UiIn the method, the small base station of the small cell where the two users are located is placed in a base station cluster QiPerforming the following steps;
b4, if the degree of one node in a and B is 1 and the degree of the other node is 2, c represents the other node connected with the node with the degree of 2, then placing three users corresponding to the three nodes in a user cluster UiIn the method, the small base stations of the small cells in which the three users are positioned are placed in a base station cluster QiPerforming the following steps;
b5, if the degrees of a and B are both 2, and both are connected to node d, and a, B and d are located in three cells, then placing the three users corresponding to the three nodes in user cluster UiIn the method, the small base stations of the small cells in which the three users are positioned are placed in a base station cluster QiPerforming the following steps;
b6, deleting U in the topological structure diagramiObtaining a new topology structure diagram by the nodes corresponding to the user and the edges connected with the nodes, and enabling i to be i + 1;
b7, in the new topological structure chart, repeating step B2, step B3, step B4, step B5 and step B6 until all edges in the topological structure chart are deleted, dividing the users and the small base stations into K user clusters and K base station clusters, and using U to usekRepresenting user clusters by QkDenotes a base station cluster, K is 1,2, …, K, QkThe inner small base station is UkA serving base station of an inner user;
b8, if there is a node with zero degree in the new topological structure chart, calculating the user-to-base station cluster Q corresponding to the node with zero degreekAverage value of path loss of inner small base station, rkWhere K is 1,2, …, K is the total number of user clusters and also the total number of base station clusters, and let r bee＝min{r1,r2,…,rKE is a positive integer from 1 to K, and the user corresponding to the node is classified into a user cluster UeIn (1).
With reference to the flowchart of allocating sub-bands of the present invention, i.e., fig. 5, the specific steps of allocating sub-bands for a user cluster and a base station cluster are as follows:
c1, 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 user clusters and is also the total number of base station clusters;
c2, let M be max { M ═ M1,m2,…,mJDividing the frequency band into L sub-frequency bands, wherein L is more than or equal to M, and the set of sub-frequency bands is F ═ F1,f2,…,fL}，flIs the L-th sub-band, L ═ 1,2, …, L;
c3, allocating any sub-band from L sub-bands to user cluster U1All users in (1), let n be 2;
c4, finding out a base station cluster QnFinding out users distributed with sub-frequency band in small cell where inner small base station is located, and using F1Representing a set of sub-bands to which these users are allocated, from CFF1U allocated to any frequency band in the middlenUser of (1), CFF1Is represented by F1Complement in FSetting n as n + 1;
c5, repeating the step C4 until all user clusters are allocated sub-bands.
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. The interference reduction method based on single-frequency-band clustering in the ultra-dense network is characterized by being suitable for the ultra-dense network adopting CoMP, and comprising the following steps:
a, constructing a topological structure diagram based on the geographic position of a user, wherein a node represents the user, two users which are positioned in two adjacent small cells and have a distance less than or equal to D are connected by a line, the length of the line is equal to the distance between the two users, no edge exists between the other users, and D is a preset distance threshold;
b, dividing users in the network into a plurality of user clusters, wherein each user cluster comprises a plurality of users, and finding out a serving base station cluster of each user cluster, wherein the specific process is as follows;
b1, setting i to 1, where i represents the serial number of the user cluster found each time and the serial number of the base station cluster serving the user cluster;
b2, finding out the shortest side in the latest topological structure chart, if the shortest side has a plurality of sides, randomly selecting one of the sides, and using a and B to represent two nodes connected with the side;
b3, if the degrees of a and B are both 1, placing two users corresponding to the two nodes in the user cluster UiIn the method, the small base station of the small cell where the two users are located is placed in a base station cluster QiPerforming the following steps;
b4, if the degree of one node in a and B is 1 and the degree of the other node is 2, c represents the other node connected with the node with the degree of 2, then placing three users corresponding to the three nodes in a user cluster UiIn (3), locate the three usersSmall base station of small cell is placed in base station cluster QiPerforming the following steps;
b5, if the degrees of a and B are both 2, and both are connected to node d, and a, B and d are located in three cells, then placing the three users corresponding to the three nodes in user cluster UiIn the method, the small base stations of the small cells in which the three users are positioned are placed in a base station cluster QiPerforming the following steps;
b6, deleting U in the latest topological structure diagramiObtaining a new topology structure diagram by the nodes corresponding to the user and the edges connected with the nodes, and enabling i to be i + 1;
b7, in the new topological structure chart, repeating step B2, step B3, step B4, step B5 and step B6 until all edges in the topological structure chart are deleted, dividing the users and the small base stations into K user clusters and K base station clusters, and using U to usekRepresenting user clusters by QkDenotes a base station cluster, K is 1,2, …, K, QkThe inner small base station is UkA serving base station of an inner user;
b8, if there is a node with zero degree in the new topological structure chart, calculating the user-to-base station cluster Q corresponding to the node with zero degreekAverage value of path loss of inner small base station, rkWhere K is 1,2, …, K is the total number of user clusters and also the total number of base station clusters, and let r bee＝min{r1,r2,…,rKThe min { } represents the minimum value, e is a positive integer between 1 and K, and the user corresponding to the node is classified into a user cluster UePerforming the following steps;
c, dividing the frequency band into a plurality of sub-frequency bands according to the base station cluster obtained in the step B, and distributing a single sub-frequency band for each user cluster, wherein the specific process is as follows:
c1, 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 user clusters and is also the total number of base station clusters;
c2, let M be max { M ═ M1,m2,…,mJThe maximum value is taken, the frequency band is divided into L sub-frequency bands, L is larger than or equal to M, and the set of the sub-frequency bands is F ═ F { }1,f2,…,fL}，flIs the L-th sub-band, L ═ 1,2, …, L;
c3, allocating any sub-band from L sub-bands to user cluster U1All users in (1), let n be 2;
c4, finding out a base station cluster QnFinding out users distributed with sub-frequency band in small cell where inner small base station is located, and using F1Representing a set of sub-bands to which these users are allocated, from CFF1U allocated to any one of the sub-bandsnUser of (1), CFF1Is represented by F1Complementary set in F, let n be n + 1;
c5, repeating the step C4 until all user clusters are allocated with sub-frequency bands;
D，Qkthe inner small base station is UkServing base station, U, of an inner userkThe inner user uses the sub-band direction Q allocated in the step CkInner small base station transmitting signal, or QKThe step C used by the inner small base station is UkSub-band direction U allocated by inner userkThe inner user sends a signal, K is 1,2, …, and K is the total number of the user cluster and the total number of the base station cluster;
e, for each user, calculating the Q of the user to the base station cluster every a plurality of time slotskAverage value of path loss of inner small base station, pkWhere K is 1,2, …, K is the total number of user clusters and also the total number of base station clusters, let pg＝min{p1,p2,…,pKG is a positive integer between 1 and K, and the user is classified into a user cluster UgPerforming the following steps;
and F, repeating the steps A to E at intervals, clustering again and allocating sub-frequency bands to each user cluster.
CN201810052725.3A 2018-01-19 2018-01-19 Interference reduction method based on single-frequency-band clustering in ultra-dense network Active CN108134623B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201810052725.3A CN108134623B (en) 2018-01-19 2018-01-19 Interference reduction method based on single-frequency-band clustering in ultra-dense network

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201810052725.3A CN108134623B (en) 2018-01-19 2018-01-19 Interference reduction method based on single-frequency-band clustering in ultra-dense network

Publications (2)

Publication Number Publication Date
CN108134623A CN108134623A (en) 2018-06-08
CN108134623B true CN108134623B (en) 2020-12-11

Family

ID=62399826

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201810052725.3A Active CN108134623B (en) 2018-01-19 2018-01-19 Interference reduction method based on single-frequency-band clustering in ultra-dense network

Country Status (1)

Country Link
CN (1) CN108134623B (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112583511B (en) * 2020-12-06 2024-03-29 广州技象科技有限公司 Networking method, device, equipment and storage medium based on same time slot transmission

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101511107A (en) * 2009-03-23 2009-08-19 北京邮电大学 Frequency planning method based on synergic multi-point single-user multi-input multi-output
CN101754383A (en) * 2010-02-02 2010-06-23 中国科学院计算技术研究所 Structuring method of CoMP cell cluster
CN103415020A (en) * 2013-07-26 2013-11-27 西安交通大学 Interference solution based on frequency division in relay system
CN103929781A (en) * 2014-04-09 2014-07-16 东南大学 Cross-layer interference coordination optimization method in super dense heterogeneous network
CN104320814A (en) * 2014-10-20 2015-01-28 中国科学院计算技术研究所 CoMP clustering method and inter-cell resource scheduling method

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9185669B2 (en) * 2011-09-08 2015-11-10 Lg Electronics Inc. Synchronization method for distributed antenna system and apparatus using the same
TWI589174B (en) * 2015-12-07 2017-06-21 國立交通大學 Cooperative transmission system for multiple access point in wireless local area and method thereof

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101511107A (en) * 2009-03-23 2009-08-19 北京邮电大学 Frequency planning method based on synergic multi-point single-user multi-input multi-output
CN101754383A (en) * 2010-02-02 2010-06-23 中国科学院计算技术研究所 Structuring method of CoMP cell cluster
CN103415020A (en) * 2013-07-26 2013-11-27 西安交通大学 Interference solution based on frequency division in relay system
CN103929781A (en) * 2014-04-09 2014-07-16 东南大学 Cross-layer interference coordination optimization method in super dense heterogeneous network
CN104320814A (en) * 2014-10-20 2015-01-28 中国科学院计算技术研究所 CoMP clustering method and inter-cell resource scheduling method

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
"Phase Rotation and Power Allocation Precoding for Orthogonalized Spatial Multiplexing System";Xinji Tian等;《2011 2nd International Conference on Artificial Intelligence, Management Science and Electronic Commerce (AIMSEC)》;20110810;全文 *

Also Published As

Publication number Publication date
CN108134623A (en) 2018-06-08

Similar Documents

Publication Publication Date Title
CN108391317B (en) Resource allocation method and system for D2D communication in cellular network
CN103118368B (en) The resource allocation methods of a kind of proximity of devices discovery and base station
WO2015127880A1 (en) Base station frequency resource allocation method and network device
US20170318472A1 (en) Method, apparatus, system and computer program
CN109982437B (en) D2D communication spectrum allocation method based on location-aware weighted graph
CN102014440B (en) Method, device and system for inter-cell interference coordination (ICIC)
CN108235369B (en) Method and apparatus for mitigating interference in a heterogeneous network using cross-base station interference coordination
CN104955077A (en) Heterogeneous network cell clustering method and device based on user experience speed
CN107770874B (en) Clustering method and sub-channel allocation method in ultra-dense network
EP2638676A1 (en) Allocation of resources in a communication system
CN104254130A (en) Method, device and system for allocating D2D (Device-to-Device) user link and cellular user shared resources
Zhang et al. Subcarrier allocation algorithms based on graph-coloring in Cognitive Radio NC-OFDM system
CN104412647B (en) The method for being used to help solve the cluster optimization of the border issue in communication system
Oueis et al. Distributed mobile cloud computing: A multi-user clustering solution
RU2650189C1 (en) Method of data transmitting and communication device
CN108134623B (en) Interference reduction method based on single-frequency-band clustering in ultra-dense network
CN106912059B (en) Cognitive relay network joint relay selection and resource allocation method supporting mutual information accumulation
Kim et al. Resource allocation in cluster based ultra dense network
WO2024060523A1 (en) Time domain resource allocation method and apparatus, electronic device, and storage medium
CN104322099A (en) Service offloading method, apparatus and system
CN108834158B (en) Interference management method for ultra-dense networking
CN103237309A (en) Quasi-dynamic frequency resource classification method for interference coordination of LTE-A (Long Term Evolution-Advanced) relay system
CN108307514B (en) Inter-cluster interference elimination method based on dual clustering and resource allocation
CN106304306B (en) The method for managing resource of multiple access access is mixed in heterogeneous network
Touati et al. Model-Based optimization for JT CoMP in C-RAN

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