CN112218379B - Mobile communication dynamic interference coordination method and system based on joint transmission - Google Patents

Mobile communication dynamic interference coordination method and system based on joint transmission Download PDF

Info

Publication number
CN112218379B
CN112218379B CN201910629471.1A CN201910629471A CN112218379B CN 112218379 B CN112218379 B CN 112218379B CN 201910629471 A CN201910629471 A CN 201910629471A CN 112218379 B CN112218379 B CN 112218379B
Authority
CN
China
Prior art keywords
cell
scheduling
ues
edge
throughput
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
CN201910629471.1A
Other languages
Chinese (zh)
Other versions
CN112218379A (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.)
Institute of Information Engineering of CAS
Original Assignee
Institute of Information Engineering of CAS
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 Institute of Information Engineering of CAS filed Critical Institute of Information Engineering of CAS
Priority to CN201910629471.1A priority Critical patent/CN112218379B/en
Publication of CN112218379A publication Critical patent/CN112218379A/en
Application granted granted Critical
Publication of CN112218379B publication Critical patent/CN112218379B/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
    • H04W72/00—Local resource management
    • H04W72/12—Wireless traffic scheduling
    • H04W72/121—Wireless traffic scheduling for groups of terminals or users
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/12—Wireless traffic scheduling
    • 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)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Quality & Reliability (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

The invention relates to a mobile communication dynamic interference coordination method and a mobile communication dynamic interference coordination system based on joint transmission. The method comprises the following steps: 1) initializing a cooperation cluster set of each UE, and dividing all UEs into non-JT UEs and JT UEs; 2) optimizing resource scheduling according to the time-frequency resource utilization rate and scheduling fairness of the UE to obtain the optimal JT UE number; 3) and determining the macro base station resource block of the edge UE which needs to be silenced according to the throughput and scheduling fairness of the UE. The invention adopts JT scheme to ensure the cell edge user throughput of UDN; the method improves the throughput of users at the edge of the cell and simultaneously gives consideration to scheduling fairness; the achievable system performance varies at different JT UE numbers, and therefore may provide a reference for JT UE selection.

Description

Mobile communication dynamic interference coordination method and system based on joint transmission
Technical Field
The present invention relates to the field of wireless mobile communication technologies, and in particular, to a method and a system for coordinating mobile communication dynamic interference based on joint transmission.
Background
In the Long Term Evolution (LTE) Release 8(Release 8, R8) phase, the common Inter-Cell Interference Coordination (ICIC) techniques mainly include partial frequency reuse and soft frequency reuse. The two basic frequency domain interference coordination schemes can effectively improve the cell edge user performance of the homogeneous network. However, with the rapid development of mobile communication, the network capacity that a homogeneous network can achieve cannot meet the increasing data communication demand, and therefore heterogeneous networks have come into force.
Heterogeneous networks contain many low power nodes such as micro base stations, pico base stations, home base stations, etc. The availability of these low power nodes greatly reduces the feasibility of frequency domain based interference coordination schemes. Therefore, LTE R10 proposes an ici c scheme based on the time domain, i.e. an enhanced inter-cell interference coordination (eICIC) scheme; LTE R11 proposes an spatial domain-based ICIC scheme, namely a Coordinated Multi-point (CoMP) technique. Joint Transmission (JT) is an important implementation manner of CoMP technology, and plays an important role in improving the spectrum efficiency of cell edge users. Joint JT transmission refers to that several base stations with the same frequency provide service for edge users at the same time, that is, multiple cooperative cells transmit data to the same UE at the same time and frequency, thereby reducing inter-cell interference and improving the quality of received signals of users.
With the advent of the 5G era, in order to meet the demand for Ultra-high speed, Ultra-low latency, and the like, the concept of Ultra-dense networks (UDNs) has been proposed. In the UDN, the deployment of a large number of Small cells (Small cells) shortens the distance between User Equipment (UE) and a base station, and greatly improves the spectrum efficiency and the system capacity. However, due to the sharp increase of cell density, the interference problem becomes more complicated, and the traditional interference coordination scheme cannot realize optimal resource scheduling.
Disclosure of Invention
The invention provides a mobile communication dynamic interference coordination method and a mobile communication dynamic interference coordination system based on joint transmission in order to reduce interference in a UDN scene.
The technical scheme adopted by the invention is as follows:
a mobile communication dynamic interference coordination method based on joint transmission is characterized by comprising the following steps:
1) initializing a cooperation cluster set of each UE, and dividing all UEs into non-JT UEs (non-JT UEs) and JT UEs;
2) optimizing resource scheduling according to the time-frequency resource utilization rate and scheduling fairness of the UE to obtain the optimal JT UE number;
3) and determining the macro base station resource block of the edge UE which needs to be silenced according to the throughput and scheduling fairness of the UE.
Further, steps 2) -3) are carried out in an iteration mode, and optimal resource scheduling is achieved.
Further, the initializing a cooperative cluster set of each UE in step 1) includes:
1-1) selecting a main service cell of each UE according to the size of large-scale received power;
1-2) calculating Geometry (large-scale SINR) of the UE to judge whether the UE is JT UE;
1-3) selecting a cooperating cell of the JT UE.
Further, in step 1-2), if UE k satisfies the following condition, it is JT UE:
Figure BDA0002128223740000021
wherein the GeometrykRepresents the large-scale SINR of UE k;
let the cooperative cluster set of UE k be
Figure BDA0002128223740000022
Then the large-scale received power of each cooperative cell should satisfy:
|G0，k-Gi，k|＜β1，i＝1～Nc，k-1
wherein, c0Is the primary serving cell of UE k, ciA cooperative cell for UE k; g0，kRepresents the large-scale received power, G, of the UE k primary serving celli，kRepresenting the large scale received power of the cooperative cell; beta is a0And beta1Represents a threshold value; n is a radical ofc，kIndicated UE k serving cell number.
Further, step 2) optimizes the user scheduling matrix α by using the following formula:
Figure BDA0002128223740000023
Figure BDA0002128223740000024
Figure BDA0002128223740000025
gi，k＝{0，1}
wherein, the SINRkSignal to interference plus noise ratio for UE k; alpha represents an Nc×NuDimensional UE scheduling matrix, NcFor the total number of cells in a UDN scenario, NuIs the total number of UEs, αi，kThe epsilon alpha represents the service condition of the UE k by the cell i; pi，k＝Gi，k||Hi，kwi||2Wherein G isi，kRepresenting the large scale received power, H, from UE k to cell ii，kRepresenting the fast fading channel matrix, w, from UE k to cell iiA beamforming vector representing cell i; sigma2Is the variance of additive white gaussian noise; suppose a scheduling period is a radio frame, and includes N subframessThe total number of RBs in one slot is NRThe number of RBs allocated by the UE each time it is scheduled is npThe number of UE in the coverage area of the cell i is Ni，u。
Further, the step 3) includes three transmission modes Mt，t＝{1，2，3}：
M1: keeping the RB corresponding to the cell which generates the maximum interference to the edge users silent;
M2: keeping silent RB currently allocated by the edge user, and additionally allocating other RB for data transmission;
M3: no RB is muted and the existing transmission mode is maintained.
Further, step 3) determines M using the following proceduret：
3.1) calculating the total throughput of edge users in the system;
3.2) calculating the average value of the proportional fair coefficient;
3.3) jointly considering the calculation results of 3.1) and 3.2) to obtain the M selected finallyt。
Based on the same inventive concept, the invention also provides a mobile communication dynamic interference coordination system based on joint transmission, which comprises:
the dynamic cooperation cluster dividing unit is used for initializing a cooperation cluster set of each UE, dividing all the UEs into non-JT UEs (non-JT UEs) and JT UEs, and optimizing resource scheduling according to the time-frequency resource utilization rate and scheduling fairness of the UEs to obtain the optimal JT UE number;
the dynamic joint silence transmission unit is used for determining macro base station resource blocks needing silence of the edge UE according to the throughput and scheduling fairness of the UE;
and the iterative optimization unit is used for controlling the dynamic cooperative cluster partitioning unit and the dynamic joint silent transmission unit to carry out iterative optimization so as to realize optimal resource scheduling.
The invention has the following beneficial effects:
(1) the JT scheme is adopted to ensure the cell edge user throughput of the UDN;
(2) the method improves the throughput of users at the edge of the cell and simultaneously gives consideration to scheduling fairness;
(3) the scheme of the present invention can achieve different system performance at different numbers of JT UEs, and thus can provide a reference for JT UE selection.
Drawings
FIG. 1 is a flow chart of the steps of the method of the present invention.
Fig. 2 is a schematic diagram of resource scheduling before and after iteration. Wherein (a) is a schematic diagram of initial resource scheduling, and (b) is a schematic diagram of resource scheduling after iteration.
Figure 3 is a graph of the performance of the cell average spectral efficiency of the conventional CoMP JT scheme versus the scheme described in the present invention.
Fig. 4 is a graph of the performance of the cell-edge spectral efficiency of the conventional CoMP JT scheme versus the scheme of the present invention.
Detailed Description
In order to make the aforementioned objects, features and advantages of the present invention comprehensible, the present invention shall be described in further detail with reference to the following detailed description and accompanying drawings.
The invention provides an interference coordination scheme suitable for a UDN scene, and the core idea of the scheme is mainly reflected in three aspects: dynamic Coordination Cluster Division (DCCD), Dynamic Joint-Muting Transmission (DJMT), and iterative optimization.
1.DCCD
The main purpose of DCCD is to solve the JT UE selection and resource allocation problem, and the JT UE serving cell selection mainly considers the channel quality of the communication link and the load balancing of the cells. The method comprises the following specific steps:
(1) initializing a cooperation cluster set of each UE, and dividing all UEs into non-JT UEs (non-JT UEs) and JT UEs;
(2) and the resource utilization rate and the scheduling fairness are considered, the resource scheduling condition is optimized, and the system capacity is ensured to reach the maximum.
JT UE is user equipment which adopts joint transmission, and two or more cells serve the user equipment; non-JT UE is a UE that does not use joint transmission, i.e., only one primary cell serves the UE.
Wherein, the "system capacity" refers to the maximum information rate transmitted without error.
2.DJMT
The main purpose of DJMT is to improve the throughput of edge UEs, and decide whether to mute a corresponding macro base station Resource Block (RB) based on a Channel Quality Indicator (CQI) fed back by the UE. The DJMT scheme provides three alternative transmission modes Mt，t＝{1，2，3}：
M1: keeping the RB corresponding to the cell which generates the maximum interference to the edge users silent;
M2: keeping silent RB currently allocated by the edge user, and additionally allocating other RB for data transmission;
M3: no RB is muted and the existing transmission mode is maintained.
For each UE, which DJMT scheme to select depends on two factors, throughput and scheduling fairness, the specific steps are as follows:
(1) calculating the total throughput of edge users in the system;
(2) calculating the average value of the proportional fairness coefficient of the system;
(3) and (3) jointly considering the calculation results of (1) and (2) to obtain the finally selected DJMT scheme.
3. Iterative optimization
After the DCCD and DJMT procedures are completed, the UEs can be classified into three categories: one is non-JT UE, that is, only one main cell serves the non-JT UE; JT UE, that is, two or more cells serve it; and thirdly, JT-sounding UE, that is, when the UE is scheduled, the corresponding RB of the cell with the largest interference needs to be muted. Due to the generation of JT-listening UEs, the RBs corresponding to the cells with the strongest interference are muted, and the UEs originally scheduled on the RBs cannot allocate resources, which causes a change in the user scheduling situation. Therefore, the scheme further optimizes the user scheduling condition through an iteration method.
The processing flow of the scheme is shown in the attached figure 1. The implementation of this scheme is described in detail below.
Assume the total number of cells in the UDN scenario is NcThe total number of the UEs is NuAnd alpha represents an Nc×NuDimensional UE scheduling matrix, where αi，kE.g. alpha represents the service condition of UE k by cell i, if alpha i，k1 denotes that cell i is the serving cell of UE k, if α i，k0 represents that cell i is not the serving cell for UE k. The SINR (Signal to Interference plus Noise Ratio) of UE k is:
Figure BDA0002128223740000051
wherein G isi，kRepresenting the large scale received power, H, from UE k to cell ii，kRepresenting the fast fading channel matrix, w, from UE k to cell iiThe beamforming vector, σ, representing cell i2Is the variance of additive white gaussian noise. Gi，k、Hi，k、wiAre parameters well known in the art.
Let Pi，k＝Gi，k||Hi，kwi||2And then:
Figure BDA0002128223740000052
(1) DCCD scheme
First, initializing a cooperation cluster set of each UE, which may be divided into three steps: firstly, selecting a main service cell of each UE according to the size of large-scale received power; secondly, calculating the large-scale SINR (usually expressed by Geometry) of the UE to determine whether the UE is a JT UE; third, select the cooperating cell of the JT UE.
If UE k is JT UE, the conditions to be satisfied are:
Figure BDA0002128223740000053
wherein the GeometrykRepresents the large-scale SINR of UE k;
let the cooperative cluster set of UE k be
Figure BDA0002128223740000054
Then the large-scale received power of each cooperative cell should satisfy:
|G0，k-Gi，k|＜β1，i＝1～Nc，k-1
wherein, c0Is the primary serving cell of UE k, ciA cooperative cell for UE k; g0，kRepresents the large-scale received power, G, of the UE k primary serving celli，kRepresenting the large scale received power of the cooperative cell; beta is a0And beta1Represents a threshold value; n is a radical ofc，kIndicated UE k serving cell number.
According to the obtained cooperation cluster set
Figure BDA0002128223740000065
The initialization of the matrix α can be done, i.e.:
Figure BDA0002128223740000061
if c isi∈SkThen α isi，k1 is ═ 1; otherwise, αi，k＝0。
After the cooperative cluster initialization process is finished, all the UEs are divided into non-JT UEs and JT UEs, but the dividing mode is rough, and the optimal JT UE number cannot be obtained. Next, we take the resource allocation into account and optimize the user scheduling matrix α.
Suppose a scheduling period is a radio frame, and includes N subframessThe total number of RBs in one slot is NRThe number of RBs allocated by the UE each time it is scheduled is npThe number of UE in the coverage area of the cell i is Ni，u. In order to ensure that each cell can utilize time-frequency resources to the maximum extent in each scheduling period, on the premise of ensuring that each UE in the cell can be scheduled, the number of JT UEs can be increased, and the resource utilization rate is improved; on the contrary, if too many JT UEs are initialized, which may result in that some UEs cannot be scheduled, the number of JT UEs should be reduced to ensure fairness of UE scheduling. The matrix α should therefore satisfy:
Figure BDA0002128223740000062
in order to avoid too large backhaul link overhead caused by inter-cell information sharing, the present scheme defines the number of serving cells of one JT UE not greater than 3(3 is a preferred value, and may be other values as well), that is:
Figure BDA0002128223740000063
in summary, in the present scheme, under the constraint conditions of the above two formulas, the user scheduling matrix α is solved to ensure that the system capacity reaches the maximum, that is:
Figure BDA0002128223740000064
Figure BDA0002128223740000071
Figure BDA0002128223740000072
Figure BDA0002128223740000073
αi，k＝{0，1}
wherein, BkRepresenting the system bandwidth.
(2) DJMT scheme
The DCCD scheme divides all UEs into non-JT UEs and JT UEs, and optimizes the service cell set of the JT UEs. However, for a few edge users with very poor channel quality, it is not enough to reach the service quality requirement by means of joint transmission scheme, and then the DJMT scheme is adopted to further improve the throughput of the edge users.
In order to improve the throughput of edge users and simultaneously consider the fairness of user scheduling, the DJMT scheme provides three selectable transmission modes Mt，t＝{1，2，3}：
M1: keeping the RB corresponding to the cell which generates the maximum interference to the edge users silent;
M2: keeping silent RB currently allocated by edge users and additionally allocating other RBs for data transmission
M3: no RB is muted and the existing transmission mode is maintained.
Assume UEj is an edge user with extremely poor channel quality, and its cooperative cluster set
Figure BDA0002128223740000074
Nc，jFor the number of serving cells, the SINR of UEj satisfies:
Figure BDA0002128223740000075
wherein, ct∈SjThe serving cell of the ue j is represented,
Figure BDA0002128223740000076
indicating a macro cell that interferes with UEj,
Figure BDA0002128223740000077
represents a small cell that generates interference to UE j; beta is a2Is a threshold value;
Figure BDA0002128223740000078
Figure BDA0002128223740000079
respectively from UEj to serving cell ctInterfering macro cell
Figure BDA00021282237400000710
And interfering with small cells
Figure BDA00021282237400000711
Large scale received power;
Figure BDA00021282237400000712
Figure BDA00021282237400000713
respectively from UEj to serving cell ctInterfering macro cell
Figure BDA00021282237400000714
And interfering with small cells
Figure BDA00021282237400000715
Fast fading channel matrix of (1);
Figure BDA00021282237400000716
respectively indicate serving cells ctInterfering macro cell
Figure BDA00021282237400000717
And interfering with small cells
Figure BDA00021282237400000718
The beamforming vector of (1).
For UEj, which DJMT scheme to choose depends on both throughput and scheduling fairness. First, an average throughput T of UEj is calculated in a current RB and a Transmission Time Interval (TTI)j. Suppose a common edge user N in the systemu，edgeAnd if the total throughput of the edge users in the system is:
Figure BDA0002128223740000081
wherein,
Figure BDA0002128223740000082
the total throughput of the system edge users is shown with the DJMT scheme Mt.
Considering only the throughput of the edge users is not comprehensive, neglecting the fairness of user scheduling. For example, if DJMT scheme M is used1The RBs corresponding to the cell with the strongest interference will remain silent, which may result in the users originally scheduled on these RBs not being able to obtain resources in the current TTI. Therefore, it is important to consider fairness in user scheduling.
In this scheme, we consider a Proportional Fair (PF) scheduling algorithm, and then the Proportional fair coefficient of UEj can be calculated as:
Figure BDA0002128223740000083
wherein r isjRepresenting the instantaneous throughput estimated by UEj at the current slot. Thus, the average of the system proportional fair coefficient mayTo calculate a proportional fairness coefficient per user, namely:
Figure BDA0002128223740000084
wherein, PtIndicating the use of DJMT scheme MtThe system schedules fairness for the users.
According to obtaining
Figure BDA0002128223740000085
And PtThe final selected DJMT scheme can be calculated, i.e.:
Figure BDA0002128223740000086
wherein, delta1，δ2And E (0-1) represents the weight values of the throughput of the edge user and the scheduling fairness of the user respectively.
(3) Iterative optimization algorithm
With DCCD and DJMT, all users in the system are divided into three types: non-JT UE, JT-mutting UE. The generation of JT-multicasting UE causes the RB corresponding to the cell with the strongest interference to be muted, and the UE originally scheduled on the RB cannot allocate resources, resulting in a change of the user scheduling matrix α. Therefore, the scheme further optimizes the user scheduling matrix alpha through an iteration method.
By executing the DCCD and DJMT scheme for the first time, the initial user scheduling matrix α is obtained, and the resource scheduling situation is schematically shown in fig. 2 (a). Wherein, UE0 and UE3 are non-JT UEs; UE1 is JT UE; UE2 is a JT-mutting UE, and when UE2 is scheduled on RB1, the selected DJMT scheme is M1At this time, the macro base station interferes the macro base station most, and therefore, the macro cell needs to keep silent on RB1, and the originally scheduled UE0 cannot be scheduled on this RB. At this point, if the UE0 is directly abandoned, then the fairness of user scheduling is significantly impacted, and therefore the optimization resources are made by performing iterative algorithms (i.e., re-performing DCCD and DJMT schemes)Source scheduling), scheduling the UE0 on RB2, as shown in fig. 2 (b). At this point, one iteration optimization is completed, and the user scheduling matrix alpha is updated. By analogy, after several times of iterative optimization, a final user scheduling matrix alpha is obtained, and the resource scheduling of the whole network is completed.
The results of the conventional CoMP JT scheme and the scheme of the present invention before and after iteration are simulated, as shown in fig. 3 and 4, the performance comparison of the average spectrum efficiency of the cell and the edge spectrum efficiency of the cell is respectively given, and it can be seen that: compared with the traditional CoMP JT scheme, the scheme can ensure that the cell edge spectrum efficiency is greatly improved under the condition of no loss of the cell average spectrum efficiency, and the gain can reach 45.33 percent.
Based on the same inventive concept, another embodiment of the present invention provides a mobile communication dynamic interference coordination system based on joint transmission, which includes:
the dynamic cooperation cluster dividing unit is used for initializing a cooperation cluster set of each UE, dividing all the UEs into non-JT UEs (non-JT UEs) and JT UEs, and optimizing resource scheduling according to the time-frequency resource utilization rate and scheduling fairness of the UEs to obtain the optimal JT UE number;
the dynamic joint silence transmission unit is used for determining macro base station resource blocks needing silence of the edge UE according to the throughput and scheduling fairness of the UE;
and the iterative optimization unit is used for controlling the dynamic cooperative cluster partitioning unit and the dynamic joint silent transmission unit to carry out iterative optimization so as to realize optimal resource scheduling.
The above embodiments are only intended to illustrate the technical solution of the present invention and not to limit the same, and a person skilled in the art can modify the technical solution of the present invention or substitute the same without departing from the principle and scope of the present invention, and the scope of the present invention should be determined by the claims.

Claims (6)

1. A mobile communication dynamic interference coordination method based on joint transmission is characterized by comprising the following steps:
1) initializing a cooperation cluster set of each UE, and dividing all UEs into non-JT UEs and JT UEs;
2) optimizing resource scheduling according to the time-frequency resource utilization rate and scheduling fairness of the UE to obtain the optimal JT UE number;
3) determining a macro base station resource block which needs to be silenced of the edge UE according to the throughput and scheduling fairness of the UE;
wherein, the initializing a cooperation cluster set of each UE in step 1) includes:
1-1) selecting a main service cell of each UE according to the size of large-scale received power;
1-2) calculating the large-scale SINR of the UE to judge whether the UE is JT UE;
1-3) selecting a cooperative cell of JT UE;
wherein, in step 1-2), if UE k satisfies the following condition, it is JT UE:
Figure FDA0003493822210000011
wherein the GeometrykRepresents the large-scale SINR of UE k;
let the cooperative cluster set of UE k be
Figure FDA0003493822210000012
Then the large-scale received power of each cooperative cell should satisfy:
|G0,k-Gi,k|<β1，i＝1～Nc,k-1
wherein, c0Is the primary serving cell of UE k, ciA cooperative cell for UE k; g0,kRepresents the large-scale received power, G, of the UE k primary serving celli,kRepresenting the large scale received power of the cooperative cell; beta is a0And beta1Represents a threshold value; n is a radical ofc,kThe indicated number of UE k serving cells;
wherein, the step 2) adopts the following formula to optimize the user scheduling matrix alpha:
Figure FDA0003493822210000013
Figure FDA0003493822210000014
Figure FDA0003493822210000015
αi,k＝{0,1}
wherein, the SINRkSignal to interference plus noise ratio for UE k; alpha represents an Nc×NuDimensional UE scheduling matrix, NcFor the total number of cells in a UDN scenario, NuIs the total number of UEs, αi,kThe epsilon alpha represents the service condition of the UE k by the cell i; pi,k＝Gi,k‖Hi, kwi‖2Wherein G isi,kRepresenting the large scale received power, H, from UE k to cell ii,kRepresenting the fast fading channel matrix, w, from UE k to cell iiA beamforming vector representing cell i; sigma2Is the variance of additive white gaussian noise; suppose a scheduling period is a radio frame, and includes N subframessThe total number of RBs in one slot is NRThe number of RBs allocated by the UE each time it is scheduled is npThe number of UE in the coverage area of the cell i is Ni,u；
Wherein step 3) is according to
Figure FDA0003493822210000021
And PtCalculating to obtain the scheme M of final selectiontNamely:
Figure FDA0003493822210000022
wherein, delta1,δ2E (0-1) respectively represents the throughput and the user scheduling of the edge userThe weight value of the fairness of the degree,
Figure FDA0003493822210000023
indicates the adoption of scheme MtTotal throughput, P, of edge users in case of (2)tThe average of the proportional fair coefficients is shown.
2. The method of claim 1, wherein steps 2) -3) are iterated to achieve optimal resource scheduling.
3. The method of claim 1, wherein step 3) comprises three transmission modes Mt,t＝{1,2,3}：
M1: keeping the RB corresponding to the cell which generates the maximum interference to the edge users silent;
M2: keeping silent RB currently allocated by the edge user, and additionally allocating other RB for data transmission;
M3: no RB is muted and the existing transmission mode is maintained.
4. A method according to claim 3, wherein step 3) determines M using the following stepst：
3.1) calculating the total throughput of edge users in the system;
3.2) calculating the average value of the proportional fair coefficient;
3.3) jointly considering the calculation results of 3.1) and 3.2) to obtain the M selected finallyt。
5. The method of claim 4, wherein the total throughput is calculated using the following equation:
Figure FDA0003493822210000024
wherein,
Figure FDA0003493822210000025
indicates the adoption of scheme MtIn case of (2), the total throughput of the edge user; t isjThe average throughput of UE j calculated in the current RB and transmission time interval is UE j which is an edge user with extremely poor channel quality; n is a radical ofu,edgeThe number of edge users;
the average value of the proportional fair coefficient is calculated by the following formula:
Figure FDA0003493822210000026
wherein, PtIs the average value of the proportional fair coefficient and represents that the scheme M is adoptedtUser scheduling fairness under the circumstances of (1); n is a radical ofuThe total number of the UE is; p is a radical ofjIs the proportional fair coefficient for UE j;
Figure FDA0003493822210000027
rjrepresents the estimated instantaneous throughput of UE j at the current time slot;
then, according to
Figure FDA0003493822210000031
And PtCalculating to obtain the scheme M of final selectiont。
6. A mobile communication dynamic interference coordination system based on joint transmission by using the method of any claim 1 to 5, comprising:
the dynamic cooperation cluster dividing unit is used for initializing a cooperation cluster set of each UE, dividing all the UEs into non-JT UEs and JT UEs, and optimizing resource scheduling according to the time-frequency resource utilization rate and scheduling fairness of the UEs to obtain the optimal JT UE number;
the dynamic joint silence transmission unit is used for determining macro base station resource blocks needing silence of the edge UE according to the throughput and scheduling fairness of the UE;
and the iterative optimization unit is used for controlling the dynamic cooperative cluster partitioning unit and the dynamic joint silent transmission unit to carry out iterative optimization so as to realize optimal resource scheduling.
CN201910629471.1A 2019-07-12 2019-07-12 Mobile communication dynamic interference coordination method and system based on joint transmission Expired - Fee Related CN112218379B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201910629471.1A CN112218379B (en) 2019-07-12 2019-07-12 Mobile communication dynamic interference coordination method and system based on joint transmission

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201910629471.1A CN112218379B (en) 2019-07-12 2019-07-12 Mobile communication dynamic interference coordination method and system based on joint transmission

Publications (2)

Publication Number Publication Date
CN112218379A CN112218379A (en) 2021-01-12
CN112218379B true CN112218379B (en) 2022-03-22

Family

ID=74047850

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201910629471.1A Expired - Fee Related CN112218379B (en) 2019-07-12 2019-07-12 Mobile communication dynamic interference coordination method and system based on joint transmission

Country Status (1)

Country Link
CN (1) CN112218379B (en)

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102056177A (en) * 2010-12-16 2011-05-11 西安交通大学 Coordinated node point selection and wireless resource dispatching method in coordinated multi-point transmission technology
CN102118825A (en) * 2009-12-31 2011-07-06 华为技术有限公司 Method for realizing multipoint joint transmission, terminal and system
CN102612155A (en) * 2011-12-22 2012-07-25 北京邮电大学 Scheduling method and system for joint transmission of heterogeneous network
CN104272606A (en) * 2012-05-09 2015-01-07 三星电子株式会社 Csi definitions and feedback modes for coordinated multi-point transmission
CN104703212A (en) * 2013-12-06 2015-06-10 索尼公司 Device in wireless communication system, wireless communication system and method

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102118825A (en) * 2009-12-31 2011-07-06 华为技术有限公司 Method for realizing multipoint joint transmission, terminal and system
CN102056177A (en) * 2010-12-16 2011-05-11 西安交通大学 Coordinated node point selection and wireless resource dispatching method in coordinated multi-point transmission technology
CN102612155A (en) * 2011-12-22 2012-07-25 北京邮电大学 Scheduling method and system for joint transmission of heterogeneous network
CN104272606A (en) * 2012-05-09 2015-01-07 三星电子株式会社 Csi definitions and feedback modes for coordinated multi-point transmission
CN104703212A (en) * 2013-12-06 2015-06-10 索尼公司 Device in wireless communication system, wireless communication system and method

Non-Patent Citations (3)

* Cited by examiner, † Cited by third party
Title
An Effective Scheduling Scheme for CoMP in Heterogeneous Scenario;Xiaona Li;《2012 IEEE 23rd International Symposium on Personal, Indoor and Mobile Radio Communications - (PIMRC)》;20121129;全文 *
Energy Efficient Co-Ordinated Multi-Point Joint Transmission(CoMP-JT) for LTE-A;Jigar P. Ahir;《International Conference on Communication and Signal Processing, April 3-5, 2018, India》;20181108;全文 *
协作多点传输在异构场景下的联合处理技术研究;李晓娜;《中国优秀硕士学位论文全文数据库》;20131115;全文 *

Also Published As

Publication number Publication date
CN112218379A (en) 2021-01-12

Similar Documents

Publication Publication Date Title
JP5484819B2 (en) Multi-cell cooperative transmission method
CN102356652B (en) Adaptive resource partitioning in wireless communication network
KR101681094B1 (en) Method and apparatus for controlling transmit power in wireless network
JP5657765B2 (en) Method for controlling operation in a cell of a wireless cellular network, base station and wireless cellular network
WO2011083774A1 (en) Communication apparatus and communication method
CN106899993B (en) Network optimization method facing large-scale MIMO network and base station thereof
JP2010246113A (en) Method, system and transmitter for adaptive coordinated transmission in wireless communications
Huang et al. An analytical framework for heterogeneous partial feedback design in heterogeneous multicell OFDMA networks
CN110337113B (en) Interference control method based on cell dynamic clustering in dense DTDD network
CN106793047B (en) Uplink power control method and base station
CN102056177A (en) Coordinated node point selection and wireless resource dispatching method in coordinated multi-point transmission technology
Yu et al. Dynamic resource allocation in TDD-based heterogeneous cloud radio access networks
Zhang et al. Dynamic user-centric clustering for uplink cooperation in multi-cell wireless networks
CN110049473B (en) Joint wireless channel allocation and power control method for relay enhanced D2D communication
WO2013000242A1 (en) Resource allocation method and device
JP2014531835A (en) Scheduling assignment method and apparatus in multipoint cooperative system
CN106961293A (en) Wireless network distribution dense network resource allocation algorithm
Giese et al. Application of coordinated beam selection in heterogeneous LTE-advanced networks
CN112218379B (en) Mobile communication dynamic interference coordination method and system based on joint transmission
CN106851830B (en) Resource allocation method and device for LTE-A heterogeneous network
Huang et al. HICIC: Hybrid inter-cell interference coordination for two-tier heterogeneous networks with non-uniform topologies
CN105898874A (en) Coordinated multipoint (CoMP) transmission-based distributed heterogeneous network resource distribution method and system
CN102742188A (en) Distributed resource allocation method and device for reducing intercell downlink interference
You et al. Delay guaranteed joint user association and channel allocation for fog radio access networks
Asgharimoghaddam et al. Decentralized multi-cell beamforming via large system analysis in correlated channels

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: 20220322

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