CN103068056A - Collaboration dispatching and beamforming method based on three-neighborhood collaboration cluster - Google Patents

Abstract

The invention discloses a collaboration dispatching and beamforming method based on a three-neighborhood collaboration cluster. Firstly, two interference sources in the collaboration cluster are determined by a service base station, and accordingly users in a sector are classified; secondly, in each short dispatching cycle, dispatching information is exchanged between the service base station and two collaboration base stations, a transmission channel half orthogonal norm is used by the service base station to select out non-interference users, the collaboration base stations select interference channels for the service base station from a user set sent from the service base station according to the dispatching information of the service base station so that a candidate user set with parallelism is met, and the service base station selects the remaining dispatching users from the candidate set according to the transmission channel half orthogonal norm; and finally, improved zero-forcing beamforming is used by the service base station to eliminate the interference among users of the dispatching users, and meanwhile, the interference to the dispatching users in adjacent neighborhoods is restrained. The collaboration dispatching and beamforming method based on the three-neighborhood collaboration cluster can effectively improve the spectral efficiency of border users, and can be widely applied to large-scale cellular networks.

Description

A kind of cooperative scheduling and beam shaping method based on three cell cooperatives bunch

Technical field

The Long Term Evolution that the present invention relates to 3GPPLTE-Advanced(third generation partner program is follow-up) the standardized process field, particularly relate to cooperative scheduling and beam shaping (CS/CB) method in a kind of cooperative multipoint transmission (CoMP) technology.

Background technology

Modern cellular cell improves power system capacity by the multiplexing and microminiaturized mode of global frequencies, so that cell edge region becomes interference-limited zone.Cell Edge User is away from serving BS and be subject to the strong interference of neighbor cell, and spectrum efficiency is low, and can not solve by multiple-input and multiple-output (MIMO) and spatial reuse (SDMA).Inter-Cell Interference Coordination take soft-frequency reuse as representative (ICIC) be although method can effectively be slowed down presence of intercell interference, improves the spectrum efficiency of edge customer, this be the performance of sacrificing whole network be cost, be not only method.

3GPP adopts cooperative multipoint transmission (CoMP) to solve problem of inter-cell interference in the LTE-Advanced standardization agreement Release10 that finishes.The CoMP technology forms a cooperative cluster with a plurality of adjacent residential quarters, reduces ICI by joint transmission or the signal transmission of coordinating each base station, improves the received signal quality of edge customer.According to sharing users data whether between the base station in the cooperative cluster, CoMP can be divided into Combined Treatment (JP) and cooperative scheduling and beam shaping (CS/CB) two large classes.User data can be shared in cooperative cluster among the JP, and this user also can be served in the base station that cooperates except the service base station; And user data only is kept at serving BS among the CS/CB, only has serving BS could serve this user.The main thought of CS/CB is that the edge customer of current suitable service is coordinated to determine in the base station of cooperating with each other, and reduces the interference to the neighbor cell user by precoding (cooperative beam excipient).

The present invention is directed to Cell Edge User, propose a kind of cooperative scheduling and beam shaping method based on three cell cooperatives bunch, wherein the collaboration region of three residential quarters is three adjacent sectors.At first, the reference signal mean receiving power of serving BS when long determined two interference sources in the cooperative cluster, i.e. two powers that cooperative base station is disturbed, and accordingly this sector user is classified; Secondly, in each dispatching cycle in short-term, serving BS and two mutual schedule informations of cooperative base station, serving BS utilizes transmission channel semi-orthogonal criterion to select noiseless user, cooperative base station is utilized the parallel criterion of interference channel according to the schedule information of serving BS, chooses the candidate user set that interference channel satisfies collimation for serving BS from user's set that serving BS sends, serving BS is selected remaining dispatched users according to transmission channel semi-orthogonal criterion in candidate collection; At last, serving BS is eliminated the inter-user interference of dispatched users by improved close-to zero beam excipient, suppresses simultaneously the interference to the neighbor cell dispatched users.The method has taken into full account the interference source power when long, interference channel collimation in short-term and transmission channel semi-orthogonal, can determine the user of current the most suitable service, and suppress presence of intercell interference by precoding, significantly improve the spectrum efficiency of edge customer.

Summary of the invention

Technical problem: the invention provides a kind of cooperative scheduling and beam shaping method based on three cell cooperatives bunch, can effectively improve the spectrum efficiency of edge customer, and can be applied to the large, honeycomb network.

Technical scheme: for solving the problems of the technologies described above, the invention provides a kind of cooperative scheduling and beam shaping method based on three cell cooperatives bunch, the reference signal mean receiving power of serving BS when long determined two interference sources in the cooperative cluster, it is the power that cooperative base station is disturbed, and accordingly this sector user is classified, wherein cooperative cluster is made of three adjacent sectors of three adjacent residential quarters; In each dispatching cycle in short-term, serving BS and two mutual schedule informations of cooperative base station, serving BS utilizes transmission channel semi-orthogonal criterion to select noiseless user, cooperative base station is according to the schedule information of serving BS, utilize the parallel criterion of interference channel, choose the candidate user set that interference channel satisfies collimation for serving BS from user's set that serving BS sends, serving BS is selected remaining dispatched users according to transmission channel semi-orthogonal criterion in candidate collection; At last, serving BS is eliminated the inter-user interference of dispatched users by improved close-to zero beam excipient, suppresses simultaneously the interference to the neighbor cell dispatched users; The method comprises the steps:

Step 1, segmentation user set;

Each serving BS is according to the reference signal mean receiving power from each base station in the cooperative cluster of measurement period the last period

Each user determines user type for this sector, and wherein each measurement period comprises for tens to up to a hundred dispatching cycles, and be 1 time slot or 1 Transmission Time Interval TTI each dispatching cycle; First kind user, be central user, be not subjected to the strong jamming of adjacent two cooperative base station, the Equations of The Second Kind user only is subject to the strong jamming of an adjacent cooperative base station, the 3rd class user only is subject to the strong jamming of adjacent another cooperative base station, and the 4th class user is subject to the strong jamming of adjacent two cooperative base station; Take sector s as example, more than four class users set be designated as respectively

With

Cooperative multipoint transmission user's set

Be defined as $U_c^s=U_{\stackrel{\‾}{s}}^s+U_{\hat{s}}^s+U_{\stackrel{\‾}{s},\hat{s}}^s;$

Step 2, determine user's set of the scheduling of serving BS in each dispatching cycle;

In each dispatching cycle, each user measures from each base station in the cooperative cluster, be channel vector and the corresponding Reference Signal Received Power RSRP of serving BS and two cooperative base station, and feed back to serving BS, serving BS and cooperative base station shared channel vector; Afterwards, each serving BS determines that with following method the user who is dispatched this dispatching cycle gathers: each serving BS is determined first user and other noiseless user; Cooperative base station is utilized the parallel criterion of interference channel according to the schedule information of serving BS, from user's set that serving BS sends over, chooses the candidate user set that satisfies the interference channel collimation for serving BS; Serving BS is selected remaining dispatched users according to transmission channel semi-orthogonal criterion in candidate collection; At last, serving BS is eliminated the inter-user interference of dispatched users by improved close-to zero beam excipient precoding, and suppresses interference that the adjacent sectors dispatched users is caused;

Step 3, upgrade the reference signal mean receiving power from each base station

In the finish time of this measurement period, each serving BS upgrades the reference signal mean receiving power for each user of this sector

Comprise the reference signal mean receiving power from serving BS

And from the reference signal mean receiving power of cooperative base station

Preferably, step 11, in the zero hour of measurement period, the set of initialization all types of user:

$U_{\stackrel{\‾}{s}}^s=\mathrm{\φ},$ $U_{\hat{s}}^s=\mathrm{\φ}$ With $U_{\stackrel{\‾}{s},\hat{s}}^s=\mathrm{\φ};$ Wherein $U_{\mathrm{cu}}^s,U_{\stackrel{\‾}{s}}^s,U_{\hat{s}}^s$ With

Represent respectively the first kind, Equations of The Second Kind, the 3rd class and the 4th class user set of sector s;

Step 12, weigh the power of interference source with threshold value th, determine the type under the user, wherein th＞0; If the reference signal mean receiving power that user k utilizes previous measurement period to upgrade

Calculate:

${\stackrel{\‾}{\mathrm{RSRP}}}_{s,k}^s-{\stackrel{\‾}{\mathrm{RSRP}}}_{s,k}^{\stackrel{\‾}{s}}>\mathrm{th}$

${\stackrel{\‾}{\mathrm{RSRP}}}_{s,k}^s-{\stackrel{\‾}{\mathrm{RSRP}}}_{s,k}^{\hat{s}}>\mathrm{th}$

Then k belongs to central user, upgrades

If k calculates:

${\stackrel{\‾}{\mathrm{RSRP}}}_{s,k}^s-{\stackrel{\‾}{\mathrm{RSRP}}}_{s,k}^{\stackrel{\‾}{s}}\≤\mathrm{th}$

${\stackrel{\‾}{\mathrm{RSRP}}}_{s,k}^s-{\stackrel{\‾}{\mathrm{RSRP}}}_{s,k}^{\hat{s}}>\mathrm{th}$

Then k belongs to the Equations of The Second Kind user, upgrades

If k calculates:

${\stackrel{\‾}{\mathrm{RSRP}}}_{s,k}^s-{\stackrel{\‾}{\mathrm{RSRP}}}_{s,k}^{\stackrel{\‾}{s}}>\mathrm{th}$

${\stackrel{\‾}{\mathrm{RSRP}}}_{s,k}^s-{\stackrel{\‾}{\mathrm{RSRP}}}_{s,k}^{\hat{s}}\≤\mathrm{th}$

Then k belongs to the 3rd class user, upgrades

If k calculates:

${\stackrel{\‾}{\mathrm{RSRP}}}_{s,k}^s-{\stackrel{\‾}{\mathrm{RSRP}}}_{s,k}^{\stackrel{\‾}{s}}\≤\mathrm{th}$

${\stackrel{\‾}{\mathrm{RSRP}}}_{s,k}^s-{\stackrel{\‾}{\mathrm{RSRP}}}_{s,k}^{\hat{s}}\≤\mathrm{th}$

Then k belongs to the 4th class user, upgrades

In above-mentioned each formula, k=1 wherein ... K, K represent the number of users of each sector;

The reference signal mean receiving power of expression serving BS s user k in the s of sector, place,

The expression cooperative base station

The reference signal mean receiving power of user k in the s of sector,

The expression cooperative base station

The reference signal mean receiving power of user k in the s of sector; Right Individual usefulness is carried out this operation per family, has obtained set

With

And obtained cooperative multipoint transmission user set

Preferably, in the described step 2, serving BS and two cooperative base station interactive information, and coordinate completing user and select, concrete steps are as follows:

Step 21, user k measure it with each base station between channel vector, comprise and serving BS s between transmission channel vectorial

With cooperative base station

Between interference channel vector

And and cooperative base station Between interference channel vector

And measurement comprises the Reference Signal Received Power from serving BS s from the Reference Signal Received Power of each base station From cooperative base station

Reference Signal Received Power

And from cooperative base station

Reference Signal Received Power

Serving BS s and two cooperative base station

With Interactive channel information, cooperative base station Obtain Cooperative base station Obtain

Wherein, N _tRepresent respectively the base station transmit antennas number, user's reception antenna number be 1, m ∈ 1 ... M}, expression the m dispatching cycle, M is measurement period; For for purpose of brevity, following steps are omitted Time labeling;

Step 22, initialization

I=2; If ξ=1 then makes t=1;

Wherein,

Represent the set of this sector dispatched users,

Noiseless user's set of expression adjacent sectors; T represents the noiseless number of users of each sector, and serving BS s is by the interference of precoding elimination to the noiseless user of adjacent sectors; I represents i dispatched users; ξ represents to suppress the required spatial degrees of freedom of presence of intercell interference, symbol

Expression rounds downwards;

Step 23, selection first user π (s, 1);

The first user π (s, 1) of serving BS s is definite in the mode of poll, namely

Upgrade $S_s^{\mathrm{\ξ}}\←S_s^{\mathrm{\ξ}}\∪\left\{\mathrm{\π}(s,1)\right\},$ $U_c^s\←U_c^s-\left\{\mathrm{\π}(s,1)\right\},$ And upgrade $U_x^s\←U_x^s-\left\{\mathrm{\π}(s,1)\right\},$ Wherein

Be the type under the π (s, 1); Serving BS s and two cooperative base station exchange messages, serving BS s obtains cooperative base station

The first user of scheduling

And cooperative base station

The first user of scheduling Serving BS s need consider interference that the cooperative base station dispatched users is caused, includes it in the user scheduling mechanism to the interference channel of cooperative base station dispatched users: upgrade ${\tilde{S}}_s^{\mathrm{\ξ}}\←{\tilde{S}}_s^{\mathrm{\ξ}}\∪\left\{\mathrm{\π}(\stackrel{\‾}{s},1)\right\},$ Order $g_{(s,1)}=h_{s,\mathrm{\π}(s,1)}^s,$

G wherein _sThe Orthogonal Vectors of expression through obtaining behind the Schimidt orthogonalization, g _{(s, i)}Represent i vector; If ξ 〉=2, then order

${\tilde{S}}_s^{\mathrm{\ξ}}\←{\tilde{S}}_s^{\mathrm{\ξ}}\∪\left\{\mathrm{\π}(\hat{s},1)\right\};$

In this step, π (s, 1) is the first user of serving BS s scheduling,

Be cooperative base station

The first user of scheduling,

Be cooperative base station

The first user of scheduling; Mod () expression rems, || the element number that comprises in the expression set;

Be the type under the π (s, 1), namely

The set of expression sector s service-user,

Noiseless user's set of expression adjacent sectors;

Step 24, select remaining t-1 noiseless user;

If i＞t jumps to step 25; Otherwise serving BS s gathers π (s) and current Vector Groups g according to the user who has dispatched _s, use semi-orthogonal user selection algorithm SUS and gather from cooperative multipoint transmission

In select i dispatched users π (s, i); Upgrade

Serving BS s and two cooperative base station exchange schedule informations, serving BS s obtains cooperative base station

The i user of scheduling

And cooperative base station

I user of scheduling

Upgrade ${\tilde{S}}_s^{\mathrm{\ξ}}\←{\tilde{S}}_s^{\mathrm{\ξ}}\∪\{\mathrm{\π}(\stackrel{\‾}{s},i),\mathrm{\π}(\hat{s},i)\},$ And renewal Vector Groups g _s:

$g_{(s,|g_s|+1)}=h_{s,\mathrm{\π}(s,i)}^s-\underset{j=1}{\overset{\left|g_s\right|}{\mathrm{\Σ}}}\frac{h_{s,\mathrm{\π}(s,i)}^s{g}_{(s,j)}^H}{{\left|\right|g_{(s,j)}\left|\right|}^2}{g}_{(s,j)},$ $g_{(s,|g_s|+1)}=h_{\stackrel{\_}{s},\mathrm{\π}(\stackrel{\_}{s},i)}^s-\underset{j=1}{\overset{\left|g_s\right|}{\mathrm{\Σ}}}\frac{h_{\stackrel{\_}{s},\mathrm{\π}(\stackrel{\_}{s},i)}^s{g}_{(s,j)}^H}{{\left|\right|g_{(s,j)}\left|\right|}^2}{g}_{(s,j)},$

$g_{(s,|g_s|+1)}=h_{\hat{s},\mathrm{\π}(\hat{s},i)}^s-\underset{j=1}{\overset{\left|g_s\right|}{\mathrm{\Σ}}}\frac{h_{\hat{s},\mathrm{\π}(\hat{s},i)}^s{g}_{(s,j)}^H}{{\left|\right|g_{(s,j)}\left|\right|}^2}{g}_{(s,j)};$ Upgrade $U_c^s\←U_c^s-\left\{\mathrm{\π}(s,i)\right\},$ $U_x^s\←U_x^s-\left\{\mathrm{\π}(s,i)\right\},$ Wherein

Upgrade i ← i+1, turn back to step 24;

In this step, t represents the noiseless number of users of each sector, i user of π (s, i) expression serving BS s scheduling,

Be cooperative base station

The i user of scheduling,

Be cooperative base station

I user of scheduling, the current user's set of having dispatched of π (s) expression serving BS s; g _sBe defined Orthogonal Vectors before;

The set of expression sector s service-user,

Noiseless user's set of expression adjacent sectors;

S is cooperative multipoint transmission user's set of serving BS s place sector s;

Step 25, the N for being left _t-ξ-t service-user is determined candidate user set;

Serving BS s will

With

Send to cooperative base station

Will

With

Send to cooperative base station Cooperative base station

The initialization set

J=1 wherein ..., t; Cooperative base station

The initialization set

J=1 wherein ..., t; According to interference channel collimation, cooperative base station

For serving BS s selects user's set:

For from each j of 1 to t, to each

Calculate the collimation of the interference channel of user k and modulated degree user π (s, j), wherein interference source is cooperative base station

If result of calculation is:

$\frac{|h_{s,k}^{\stackrel{\‾}{s}}*{\left(h_{s,\mathrm{\π}(s,j)}^{\stackrel{\‾}{s}}\right)}^H|}{\left|\right|h_{s,k}^{\stackrel{\‾}{s}}\left|\right|*\left|\right|h_{s,\mathrm{\π}(s,j)}^{\stackrel{\‾}{s}}\left|\right|}\≥\mathrm{\γ},$

Be that interference channel satisfies the collimation requirement, upgrade so Wherein γ is the threshold value of weighing collimation between the interference channel vector; Similarly, for from each j of 1 to t, to each

Calculate the collimation of the interference channel of user k and modulated degree user π (s, j), wherein interference source is the base station

If result of calculation is:

$\frac{|h_{s,k}^{\stackrel{\‾}{s}}*{\left(h_{s,\mathrm{\π}(s,j)}^{\stackrel{\‾}{s}}\right)}^H|}{\left|\right|h_{s,k}^{\stackrel{\‾}{s}}\left|\right|*\left|\right|h_{s,\mathrm{\π}(s,j)}^{\stackrel{\‾}{s}}\left|\right|}\≥\mathrm{\γ},$

Be that interference channel satisfies the collimation requirement, upgrade so

Wherein γ is the threshold value of weighing collimation between the interference channel vector; Cooperative base station

Calculate

And will

With

Send to serving BS s;

Meanwhile, according to interference channel collimation, cooperative base station

For serving BS s selects user's set:

For from each j of 1 to t, to each

Calculate the collimation of the interference channel of user k and modulated degree user π (s, j), wherein interference source is cooperative base station

If result of calculation is:

$\frac{|h_{s,k}^{\hat{s}}*{\left(h_{s,\mathrm{\π}(s,j)}^{\hat{s}}\right)}^H|}{\left|\right|h_{s,k}^{\hat{s}}\left|\right|*\left|\right|h_{s,\mathrm{\π}(s,j)}^{\hat{s}}\left|\right|}\≥\mathrm{\γ},$

Be that interference channel satisfies the collimation requirement, upgrade so

Wherein γ is the threshold value of weighing collimation between the interference channel vector; Similarly, for from each j of 1 to t, to each

Calculate the collimation of the interference channel of user k and modulated degree user π (s, j), wherein interference source is the base station

If result of calculation is:

$\frac{|h_{s,k}^{\hat{s}}*{\left(h_{s,\mathrm{\π}(s,j)}^{\hat{s}}\right)}^H|}{\left|\right|h_{s,k}^{\hat{s}}\left|\right|*\left|\right|h_{s,\mathrm{\π}(s,j)}^{\hat{s}}\left|\right|}\≥\mathrm{\γ},$

Be that interference channel satisfies the collimation requirement, upgrade so Wherein γ is the threshold value of weighing collimation between the interference channel vector; Cooperative base station

Calculate

And will

And

Send to serving BS s; According to user's set that cooperative base station is sent, serving BS s calculates final candidate user set

Wherein

In this step,

Expression is gathered with the user that j noiseless user's interference channel satisfies collimation,

For

Union, j=1 ..., t, interference source are cooperative base station

These are used per family from set

Expression is gathered with the user that j noiseless user's interference channel satisfies collimation,

For

Union, j=1 ..., t, interference source are cooperative base station

These are used per family from set

Expression is gathered with the user that j noiseless user's interference channel satisfies collimation, For

Union, j=1 ..., t, interference source are cooperative base station

These are used per family from set

Expression is gathered with the user that j noiseless user's interference channel satisfies collimation, For

Union, j=1 ..., t, interference source are cooperative base station

These are used per family from set

For satisfying the final candidate user set of interference channel collimation;

Step 26, determine remaining N _t-ξ-t dispatched users;

If i＞N _t-ξ then jumps to step 27; Otherwise serving BS s gathers π (s) and Vector Groups g according to the user who has dispatched _s, use semi-orthogonal user selection algorithm SUS from candidate collection

In pick out i service-user π (s, i); Upgrade $S_s^{\mathrm{\ξ}}\←S_s^{\mathrm{\ξ}}\∪\left\{\mathrm{\π}(s,i)\right\},$ $g_{(s,|g_s|+1)}=h_{s,\mathrm{\π}(s,i)}^s-\underset{j=1}{\overset{\left|g_s\right|}{\mathrm{\Σ}}}\frac{h_{s,\mathrm{\π}(s,i)}^s{g}_{(s,j)}^H}{{\left|\right|g_{(s,j)}\left|\right|}^2}{g}_{(s,j)},$

Upgrade i ← i+1, turn back to step 26;

Step 27, serving BS utilize improved close-to zero beam excipient to eliminate the inter-user interference of dispatched users, reduce simultaneously the interference to the adjacent sectors dispatched users; In improved close-to zero beam excipient, the channel stack not only comprises the transmission channel vector of dispatched users, comprises that also serving BS is to the noiseless user's of adjacent sectors scheduling interference channel vector; After the channel stack asked pseudoinverse, the precoding vector of corresponding dispatched users transmission channel formed final pre-coding matrix.

Preferably, serving BS upgrades each user's of this sector reference signal mean receiving power the finish time as follows at measurement period

${\stackrel{\‾}{\mathrm{RSRP}}}_{s,k}^s=\frac{1}{M}\underset{m=1}{\overset{M}{\mathrm{\Σ}}}{\mathrm{RSRP}}_{s,k}^s\left(m\right)$

${\stackrel{\‾}{\mathrm{RSRP}}}_{s,k}^{\stackrel{\‾}{s}}=\frac{1}{M}\underset{m=1}{\overset{M}{\mathrm{\Σ}}}{\mathrm{RSRP}}_{s,k}^{\stackrel{\‾}{s}}\left(m\right)$

${\stackrel{\‾}{\mathrm{RSRP}}}_{s,k}^{\hat{s}}=\frac{1}{M}\underset{m=1}{\overset{M}{\mathrm{\Σ}}}{\mathrm{RSRP}}_{s,k}^{\hat{s}}\left(m\right)$

Wherein, k=1 ..., K is user label, K represents the number of users of each sector, The reference signal mean receiving power of expression serving BS s user k in the s of sector, place,

The expression cooperative base station

The reference signal mean receiving power of user k in the s of sector,

The expression cooperative base station

The reference signal mean receiving power of user k in the s of sector, m represents m dispatching cycle, M represents the length of measurement period, serving BS s to K of this sector with carrying out per family this operation; In the incipient stage of next measurement period, serving BS s utilization here obtains upgrading

And

This sector user is classified.

Beneficial effect: cooperative scheduling and beam shaping method based on three cell cooperatives bunch that the embodiment of the invention provides have following advantage:

1, this method is based on small-scale cooperative cluster, and transinformation content is little between the base station, is fit to very much the cellular network of back haul link (Backhaul) finite capacity.

2, this method is distinguished the power of interference source in the cooperative cluster, has got rational compromise between user's interference channel collimation and transmission channel orthogonality, so that cooperative base station can be enriched effective candidate user set for serving BS provides.By cooperation, so that not only satisfy the semi-orthogonal of transmission channel between the service-user of each residential quarter, the interference channel collimation that satisfies simultaneously is conducive to precoding and alleviates presence of intercell interference between the base station.

3, the base station utilizes improved ZFBF precoding, can not only eliminate the inter-user interference of service-user, can also significantly suppress the interference that the neighbor cell user is caused.

4, this method is isolated the operation independent process as much as possible from the collaborative process process, has effectively reduced the interaction times between cooperative base station, has reduced the complexity of information interaction expense and processing.

Description of drawings

Fig. 1 for the embodiment of the invention provide a kind of based on the cooperative scheduling of three cell cooperatives bunch and the application scenarios of beam shaping method.

Fig. 2 for the embodiment of the invention provide a kind of based on the cooperative scheduling of three cell cooperatives bunch and the sequential chart of beam shaping method.

Embodiment

The present invention will be described below with reference to accompanying drawings.

The invention discloses a kind of cooperative scheduling and beam shaping method based on three cell cooperatives bunch.At first, the reference signal mean receiving power of serving BS when long determined two interference sources in the cooperative cluster, the i.e. powers disturbed of two cooperative base station, and accordingly this sector user is classified, wherein cooperative cluster is made of three adjacent sectors of three adjacent residential quarters; Secondly, in each dispatching cycle in short-term, serving BS and two mutual schedule informations of cooperative base station, serving BS utilizes transmission channel semi-orthogonal criterion to select noiseless user, cooperative base station is utilized the parallel criterion of interference channel according to the schedule information of serving BS, chooses the candidate user set that interference channel satisfies collimation for serving BS from user's set that serving BS sends, serving BS is selected remaining dispatched users according to transmission channel semi-orthogonal criterion in candidate collection; At last, serving BS is eliminated the inter-user interference of dispatched users by improved close-to zero beam excipient, suppresses simultaneously the interference to the neighbor cell dispatched users.The present invention can improve the spectrum efficiency of edge customer effectively, and can be applied to the large, honeycomb network.

The embodiment of the invention provides a kind of cooperative scheduling and beam shaping method based on three cell cooperatives bunch, and wherein the collaboration region of three residential quarters is three adjacent sectors, be designated as respectively s,

With

Concrete implementation step is as follows:

Step 1, segmentation user set.If the user moves with low rate, receive Reference Signal Received Power (RSRP) from each base station and change very littlely within considerable time, thereby each serving BS is according to the reference signal mean receiving power from each base station in the cooperative cluster of measurement period the last period

Each user determines user type for this sector, and wherein each measurement period comprises for tens to up to a hundred dispatching cycles, and be 1 time slot or 1 Transmission Time Interval TTI each dispatching cycle; First kind user, be central user, be not subjected to the strong jamming of adjacent two cooperative base station, the Equations of The Second Kind user only is subject to the strong jamming of an adjacent cooperative base station, the 3rd class user only is subject to the strong jamming of adjacent another cooperative base station, and the 4th class user is subject to the strong jamming of adjacent two cooperative base station; Take sector s as example, more than four class users set be designated as respectively

With

Cooperative multipoint transmission user's set

Be defined as $U_c^s=U_{\stackrel{\‾}{s}}^s+U_{\hat{s}}^s+U_{\stackrel{\‾}{s},\hat{s}}^s;$

Step 2, determine user's set of each of serving BS scheduling dispatching cycle.In each dispatching cycle, each user measures from each base station in the cooperative cluster, be channel vector and the corresponding Reference Signal Received Power RSRP of serving BS and two cooperative base station, and feed back to serving BS, serving BS and cooperative base station shared channel vector; Afterwards, each serving BS determines that with following method the user who is dispatched this dispatching cycle gathers: each serving BS is determined first user and other noiseless user; Cooperative base station is utilized the parallel criterion of interference channel according to the schedule information of serving BS, from user's set that serving BS sends over, chooses the candidate user set that satisfies the interference channel collimation for serving BS; Serving BS is selected remaining dispatched users according to transmission channel semi-orthogonal criterion in candidate collection.At last, serving BS is eliminated the inter-user interference of dispatched users by improved close-to zero beam excipient precoding, and suppresses interference that the neighbor cell dispatched users is caused.

Step 3, upgrade the reference signal mean receiving power from each base station

In the finish time of this measurement period, each serving BS upgrades the reference signal mean receiving power for each user of this sector Comprise the reference signal mean receiving power from serving BS

And from the reference signal mean receiving power of cooperative base station

Above-mentioned method, wherein, in the described step 1, (take sector s as example) determined in all types of user set as follows:

Step 1), in the zero hour of measurement period, initialization all types of user set:

With

Wherein $U_{\mathrm{cu}}^s,U_{\stackrel{\‾}{s}}^s,U_{\hat{s}}^s$ With

Represent respectively the first kind, Equations of The Second Kind, the 3rd class and the 4th class user set of sector s.

Step 2), weigh the power of interference source with threshold value th, determine the type under the user, wherein th＞0; If user k utilizes previous measurement period to upgrade

Calculate:

${\stackrel{\‾}{\mathrm{RSRP}}}_{s,k}^s-{\stackrel{\‾}{\mathrm{RSRP}}}_{s,k}^{\stackrel{\‾}{s}}>\mathrm{th}$

${\stackrel{\‾}{\mathrm{RSRP}}}_{s,k}^s-{\stackrel{\‾}{\mathrm{RSRP}}}_{s,k}^{\hat{s}}>\mathrm{th}$

Then k belongs to central user, upgrades

If k calculates:

${\stackrel{\‾}{\mathrm{RSRP}}}_{s,k}^s-{\stackrel{\‾}{\mathrm{RSRP}}}_{s,k}^{\stackrel{\‾}{s}}\≤\mathrm{th}$

${\stackrel{\‾}{\mathrm{RSRP}}}_{s,k}^s-{\stackrel{\‾}{\mathrm{RSRP}}}_{s,k}^{\hat{s}}>\mathrm{th}$

Upgrade $U_{\stackrel{\‾}{s}}^s\←U_{\stackrel{\‾}{s}}^s\∪\left\{k\right\};$ If k calculates:

${\stackrel{\‾}{\mathrm{RSRP}}}_{s,k}^s-{\stackrel{\‾}{\mathrm{RSRP}}}_{s,k}^{\stackrel{\‾}{s}}>\mathrm{th}$

${\stackrel{\‾}{\mathrm{RSRP}}}_{s,k}^s-{\stackrel{\‾}{\mathrm{RSRP}}}_{s,k}^{\hat{s}}\≤\mathrm{th}$

Upgrade $U_{\hat{s}}^s\←U_{\hat{s}}^s\∪\left\{k\right\};$ If k calculates:

${\stackrel{\‾}{\mathrm{RSRP}}}_{s,k}^s-{\stackrel{\‾}{\mathrm{RSRP}}}_{s,k}^{\stackrel{\‾}{s}}\≤\mathrm{th}$

${\stackrel{\‾}{\mathrm{RSRP}}}_{s,k}^s-{\stackrel{\‾}{\mathrm{RSRP}}}_{s,k}^{\hat{s}}\≤\mathrm{th}$

Upgrade $U_{\stackrel{\‾}{s},\hat{s}}^s\←U_{\stackrel{\‾}{s},\hat{s}}^s\∪\left\{k\right\}.$

In above-mentioned each formula, k=1 wherein ... K, K represent the number of users of each sector; The reference signal mean receiving power of expression serving BS s user k in the s of sector, place,

The expression cooperative base station

The reference signal mean receiving power of user k in the s of sector,

The expression cooperative base station

The reference signal mean receiving power of user k in the s of sector; To K with carrying out per family this operation, obtained set

With

And obtained cooperative multipoint transmission user set

Above-mentioned method, wherein, in the described step 2, interactive information between the base station, and coordinate completing user and select, concrete steps are as follows:

Step 1), user k estimate it with each base station between channel vector, comprise and serving BS s between transmission channel vectorial

With cooperative base station Between interference channel vector

And and cooperative base station

Between interference channel vector

And measurement comprises the Reference Signal Received Power from serving BS s from the Reference Signal Received Power of each base station

From cooperative base station

Reference Signal Received Power

And from cooperative base station

Reference Signal Received Power

Serving BS s and two cooperative base station

With

Interactive channel information, cooperative base station

Obtain

Cooperative base station

Obtain

Wherein, N _tRepresent respectively the base station transmit antennas number, user's reception antenna number be 1, m ∈ 1 ... M}, expression the m dispatching cycle, M is measurement period; For for purpose of brevity, following steps are omitted Time labeling.

Step 2), initialization

I=2; If ξ=1 then makes t=1.Wherein, Represent the set of this sector dispatched users,

Noiseless user's set of expression adjacent sectors; T represents the noiseless number of users of each sector, and serving BS s is by the interference of precoding elimination to the noiseless user of adjacent sectors; I represents i dispatched users; ξ represents to suppress the required spatial degrees of freedom of presence of intercell interference, symbol

Expression rounds downwards.

Step 3), selection first user π (s, 1).First user is definite in the mode of poll, namely $\mathrm{\π}(s,1)=\mathrm{mod}(m,|U_c^s\left|\right)+1;$ Upgrade $S_s^{\mathrm{\ξ}}\←S_s^{\mathrm{\ξ}}\∪\left\{\mathrm{\π}(s,1)\right\},$ $U_c^s\←U_c^s-\left\{\mathrm{\π}(s,1)\right\},$ And upgrade

Wherein

Be the type under the π (s, 1); Serving BS s and two cooperative base station exchange messages, serving BS s obtains cooperative base station The first user of scheduling

And cooperative base station

The first user of scheduling Serving BS s need consider interference that the cooperative base station dispatched users is caused, includes it in the user scheduling mechanism to the interference channel of cooperative base station dispatched users: upgrade

Order $g_{(s,1)}=h_{s,\mathrm{\π}(s,1)}^s,g_{(s,2)}=h_{\stackrel{\‾}{s},\mathrm{\π}(\stackrel{\‾}{s},1)}^s-\underset{j=1}{\overset{\left|g_s\right|}{\mathrm{\Σ}}}\frac{h_{\stackrel{\‾}{s},\mathrm{\π}(\stackrel{\‾}{s},1)}^s{g}_{(s,1)}^H}{{\left|\right|g_{(s,j)}\left|\right|}^2}{g}_{(s,j)},$ G wherein _sThe Orthogonal Vectors of expression through obtaining behind the Schimidt orthogonalization, g _{(s, i)}Represent i vector; If ξ 〉=2, then order

$g_{(s,3)}=h_{\hat{s},\mathrm{\π}(\hat{s},1)}^s-\underset{j=1}{\overset{\left|g_s\right|}{\mathrm{\Σ}}}\frac{h_{\hat{s},\mathrm{\π}(\hat{s},1)}^s{g}_{(s,j)}^H}{{\left|\right|g_{(s,j)}\left|\right|}^2}{g}_{(s,j)},{\tilde{S}}_s^{\mathrm{\ξ}}\←{\tilde{S}}_s^{\mathrm{\ξ}}\∪\left\{\mathrm{\π}(\hat{s},1)\right\}.$

Step 4), select remaining t-1 noiseless user.If i＞t jumps to step 5); Otherwise serving BS s gathers π (s) and current Vector Groups g according to the user who has dispatched _s, use semi-orthogonal user selection algorithm SUS and gather from cooperative multipoint transmission

In select i dispatched users π (s, i); Upgrade

Serving BS s and two cooperative base station exchange schedule informations, serving BS s obtains cooperative base station

The i user of scheduling

And cooperative base station

I user of scheduling

Upgrade And renewal Vector Groups g _s:

$g_{(s,|g_s|+1)}=h_{s,\mathrm{\π}(s,i)}^s-\underset{j=1}{\overset{\left|g_s\right|}{\mathrm{\Σ}}}\frac{h_{s,\mathrm{\π}(s,i)}^s{g}_{(s,j)}^H}{{\left|\right|g_{(s,j)}\left|\right|}^2}{g}_{(s,j)},$ $g_{(s,|g_s|+1)}=h_{\stackrel{\_}{s},\mathrm{\π}(\stackrel{\_}{s},i)}^s-\underset{j=1}{\overset{\left|g_s\right|}{\mathrm{\Σ}}}\frac{h_{\stackrel{\_}{s},\mathrm{\π}(\stackrel{\_}{s},i)}^s{g}_{(s,j)}^H}{{\left|\right|g_{(s,j)}\left|\right|}^2}{g}_{(s,j)},$

$g_{(s,|g_s|+1)}=h_{\hat{s},\mathrm{\π}(\hat{s},i)}^s-\underset{j=1}{\overset{\left|g_s\right|}{\mathrm{\Σ}}}\frac{h_{\hat{s},\mathrm{\π}(\hat{s},i)}^s{g}_{(s,j)}^H}{{\left|\right|g_{(s,j)}\left|\right|}^2}{g}_{(s,j)};$ Upgrade $U_c^s\←U_c^s-\left\{\mathrm{\π}(s,i)\right\},$ $U_x^s\←U_x^s-\left\{\mathrm{\π}(s,i)\right\},$ Wherein Upgrade i ← i+1, turn back to step 4).

Step 5), the N for being left _t-ξ-t dispatched users is determined candidate user set.Serving BS s will

With

Send to cooperative base station

Will

With

Send to cooperative base station

According to interference channel collimation, cooperative base station

For serving BS s selects user's set:

for?j＝1:t

end

Wherein γ is the threshold value of weighing collimation between the interference channel vector; Cooperative base station

Calculate

And will

With

Send to serving BS s;

Meanwhile, according to interference channel collimation, cooperative base station

For serving BS s selects user's set:

forj＝1:t

end

Cooperative base station

Calculate

And will

And

Send to serving BS s; According to user's set that cooperative base station is sent, serving BS s calculates final candidate user set

Wherein

In this step,

Expression is gathered with the user that j noiseless user's interference channel satisfies collimation, For

Set, j=1 ..., t, interference source are cooperative base station

These are used per family from set

Expression is gathered with the user that j noiseless user's interference channel satisfies collimation, For

Set, j=1 ..., t, interference source are cooperative base station

These are used per family from set

Expression is gathered with the user that j noiseless user's interference channel satisfies collimation,

For

Set, j=1 ..., t, interference source are cooperative base station

These are used per family from set Expression is gathered with the user that j noiseless user's interference channel satisfies collimation,

For Set, j=1 ..., t, interference source are cooperative base station

These are used per family from set

For satisfying the final candidate user set of interference channel collimation.

Step 6), determine remaining N _t-ξ-t dispatched users.If i＞N _t-ξ then jumps to step 7); Otherwise serving BS s gathers π (s) and Vector Groups g according to the user who has dispatched _s, use semi-orthogonal user selection algorithm SUS from candidate collection In pick out i service-user π (s, i); Upgrade

$g_{(s,|g_s|+1)}=h_{s,\mathrm{\π}(s,i)}^s-\underset{j=1}{\overset{\left|g_s\right|}{\mathrm{\Σ}}}\frac{h_{s,\mathrm{\π}(s,i)}^s{g}_{(s,j)}^H}{{\left|\right|g_{(s,j)}\left|\right|}^2}{g}_{(s,j)},$ Upgrade i ← i+1, turn back to step 6).

Step 7), serving BS utilize improved close-to zero beam excipient to eliminate the inter-user interference of dispatched users, reduce simultaneously the interference to the adjacent sectors dispatched users.In improved close-to zero beam excipient, the channel stack not only comprises the transmission channel vector of dispatched users, comprises that also serving BS is to the noiseless user's of adjacent sectors scheduling interference channel vector.After the channel stack asked pseudoinverse, the precoding vector group of corresponding dispatched users transmission channel formed final pre-coding matrix.Take ξ=2 as example, the pre-coding matrix W (S of base station s _s) be:

$W\left(S_s\right)=[w_{s,\mathrm{\π}(s,1)},...,w_{s,\mathrm{\π}(s,N_t-\mathrm{\ξ})}]$

As seen $h_{\stackrel{\‾}{s},\mathrm{\π}(\stackrel{\‾}{s},1)}^s{w}_{s,\mathrm{\π}(s,i)}=0,$ $\∀\mathrm{\π}(s,i)\∈S_s^{\mathrm{\ξ}},$ It is the sector

In the user

Be not subjected to the interference from base station s; If base station

Other users of service

Satisfy:

$\frac{|h_{\stackrel{\‾}{s},\mathrm{\π}(\stackrel{\‾}{s},i)}^s*{\left(h_{\stackrel{\‾}{s},\mathrm{\π}(\stackrel{\‾}{s},1)}^s\right)}^H|}{\left(\right|h_{\stackrel{\‾}{s},\mathrm{\π}(\stackrel{\‾}{s},i)}^s|*|h_{\stackrel{\‾}{s},\mathrm{\π}(\stackrel{\‾}{s},1)}^s)}\→1$

Then base station s is to the user

Presence of intercell interference equally effectively alleviated.

Above-mentioned method, wherein, in the described step 3, serving BS upgrades each user's of this sector reference signal mean receiving power the finish time as follows at measurement period

${\stackrel{\‾}{\mathrm{RSRP}}}_{s,k}^s=\frac{1}{M}\underset{m=1}{\overset{M}{\mathrm{\Σ}}}{\mathrm{RSRP}}_{s,k}^s\left(m\right)$

${\stackrel{\‾}{\mathrm{RSRP}}}_{s,k}^{\stackrel{\‾}{s}}=\frac{1}{M}\underset{m=1}{\overset{M}{\mathrm{\Σ}}}{\mathrm{RSRP}}_{s,k}^{\stackrel{\‾}{s}}\left(m\right)$

${\stackrel{\‾}{\mathrm{RSRP}}}_{s,k}^{\hat{s}}=\frac{1}{M}\underset{m=1}{\overset{M}{\mathrm{\Σ}}}{\mathrm{RSRP}}_{s,k}^{\hat{s}}\left(m\right)$

Wherein, k=1 ..., K is user label, K represents the number of users of each sector,

The reference signal mean receiving power of expression serving BS s user k in the s of sector, place,

The expression cooperative base station

The reference signal mean receiving power of user k in the s of sector,

The expression cooperative base station

The reference signal mean receiving power of user k in the s of sector, m represents m dispatching cycle, M represents the length of measurement period, serving BS s to K of this sector with carrying out per family this operation; In the incipient stage of next measurement period, serving BS s utilization here obtains upgrading

And

This sector user is classified.

The above only is preferred embodiments of the present invention; protection scope of the present invention is not limited with above-mentioned execution mode; as long as the equivalence that those of ordinary skills do according to disclosed content is modified or changed, all should include in the protection range of putting down in writing in claims.

Claims (4)

1. cooperative scheduling and beam shaping method based on three cell cooperatives bunch, it is characterized in that, the reference signal mean receiving power of serving BS when long determined two interference sources in the cooperative cluster, it is the power that cooperative base station is disturbed, and accordingly this sector user is classified, wherein cooperative cluster is made of three adjacent sectors of three adjacent residential quarters; In each dispatching cycle in short-term, serving BS and two mutual schedule informations of cooperative base station, serving BS utilizes transmission channel semi-orthogonal criterion to select noiseless user, cooperative base station is according to the schedule information of serving BS, utilize the parallel criterion of interference channel, choose the candidate user set that interference channel satisfies collimation for serving BS from user's set that serving BS sends, serving BS is selected remaining dispatched users according to transmission channel semi-orthogonal criterion in candidate collection; At last, serving BS is eliminated the inter-user interference of dispatched users by improved close-to zero beam excipient, suppresses simultaneously the interference to the neighbor cell dispatched users; The method comprises the steps:

Step 1, segmentation user set;

Each serving BS is according to the reference signal mean receiving power from each base station in the cooperative cluster of measurement period the last period

, each user determines user type for this sector, and wherein each measurement period comprises for tens to up to a hundred dispatching cycles, and be 1 time slot or 1 Transmission Time Interval TTI each dispatching cycle; First kind user, be central user, be not subjected to the strong jamming of adjacent two cooperative base station, the Equations of The Second Kind user only is subject to the strong jamming of an adjacent cooperative base station, the 3rd class user only is subject to the strong jamming of adjacent another cooperative base station, and the 4th class user is subject to the strong jamming of adjacent two cooperative base station; Take sector s as example, more than four class users set be designated as respectively

With

Cooperative multipoint transmission user's set Be defined as

Step 2, determine user's set of the scheduling of serving BS in each dispatching cycle;

In each dispatching cycle, each user measures from each base station in the cooperative cluster, be channel vector and the corresponding Reference Signal Received Power RSRP of serving BS and two cooperative base station, and feed back to serving BS, serving BS and cooperative base station shared channel vector; Afterwards, each serving BS determines that with following method the user who is dispatched this dispatching cycle gathers: each serving BS is determined first user and other noiseless user; Cooperative base station is utilized the parallel criterion of interference channel according to the schedule information of serving BS, from user's set that serving BS sends over, chooses the candidate user set that satisfies the interference channel collimation for serving BS; Serving BS is selected remaining dispatched users according to transmission channel semi-orthogonal criterion in candidate collection; At last, serving BS is eliminated the inter-user interference of dispatched users by improved close-to zero beam excipient precoding, and suppresses interference that the adjacent sectors dispatched users is caused;

Step 3, upgrade the reference signal mean receiving power from each base station

In the finish time of this measurement period, each serving BS upgrades the reference signal mean receiving power for each user of this sector

Comprise the reference signal mean receiving power from serving BS

And from the reference signal mean receiving power of cooperative base station

2. cooperative scheduling and beam shaping method based on three cell cooperatives bunch according to claim 1 is characterized in that, in the step 1, described all types of user set is determined as follows:

Step 11, in the zero hour of measurement period, initialization all types of user set:

With Wherein

With

Represent respectively the first kind, Equations of The Second Kind, the 3rd class and the 4th class user set of sector s;

Step 12, weigh the power of interference source with threshold value th, determine the type under the user, wherein th＞0; If the reference signal mean receiving power that user k utilizes previous measurement period to upgrade

Calculate:

Then k belongs to central user, upgrades If k calculates:

Then k belongs to the Equations of The Second Kind user, upgrades

If k calculates:

Then k belongs to the 3rd class user, upgrades

If k calculates:

Then k belongs to the 4th class user, upgrades

In above-mentioned each formula, k=1 wherein ... K, K represent the number of users of each sector;

The reference signal mean receiving power of expression serving BS s user k in the s of sector, place,

The expression cooperative base station

The reference signal mean receiving power of user k in the s of sector,

The expression cooperative base station

The reference signal mean receiving power of user k in the s of sector; To K with carrying out per family this operation, obtained set

With And obtained cooperative multipoint transmission user set

3. cooperative scheduling and beam shaping method based on three cell cooperatives bunch according to claim 1 is characterized in that, in the described step 2, and serving BS and two cooperative base station interactive information, and coordinate completing user and select, concrete steps are as follows:

Step 21, user k measure it with each base station between channel vector, comprise and serving BS s between transmission channel vectorial

With cooperative base station

Between interference channel vector

And and cooperative base station

Between interference channel vector

And measurement comprises the Reference Signal Received Power from serving BS s from the Reference Signal Received Power of each base station From cooperative base station Reference Signal Received Power

And from cooperative base station

Reference Signal Received Power

Serving BS s and two cooperative base station

With Interactive channel information, cooperative base station

Obtain

Cooperative base station

Obtain

Wherein, N _tRepresent respectively the base station transmit antennas number, user's reception antenna number be 1, m ∈ 1 ... M}, expression the m dispatching cycle, M is measurement period; For for purpose of brevity, following steps are omitted Time labeling;

Step 22, initialization

I=2; If ξ=1 then makes t=1;

Wherein,

Represent the set of this sector dispatched users,

Noiseless user's set of expression adjacent sectors; T represents the noiseless number of users of each sector, and serving BS s is by the interference of precoding elimination to the noiseless user of adjacent sectors; I represents i dispatched users; ξ represents to suppress the required spatial degrees of freedom of presence of intercell interference, symbol

Expression rounds downwards;

Step 23, selection first user π (s, 1);

The first user π (s, 1) of serving BS s is definite in the mode of poll, namely

Upgrade

And upgrade

Wherein

Be the type under the π (s, 1); Serving BS s and two cooperative base station exchange messages, serving BS s obtains cooperative base station

The first user of scheduling And cooperative base station

The first user of scheduling

Serving BS s need consider interference that the cooperative base station dispatched users is caused, includes it in the user scheduling mechanism to the interference channel of cooperative base station dispatched users: upgrade

Order

G wherein _sThe Orthogonal Vectors of expression through obtaining behind the Schimidt orthogonalization, g _{(s, i)}Represent i vector; If ξ 〉=2, then order

In this step, π (s, 1) is the first user of serving BS s scheduling,

Be cooperative base station The first user of scheduling,

Be cooperative base station The first user of scheduling; Mod () expression rems, || the element number that comprises in the expression set;

Be the type under the π (s, 1), namely

The set of expression sector s service-user,

Noiseless user's set of expression adjacent sectors;

Step 24, select remaining t-1 noiseless user;

If i＞t jumps to step 25; Otherwise serving BS s gathers π (s) and current Vector Groups g according to the user who has dispatched _s, use semi-orthogonal user selection algorithm SUS and gather from cooperative multipoint transmission

In select i dispatched users π (s, i); Upgrade

Serving BS s and two cooperative base station exchange schedule informations, serving BS s obtains cooperative base station

The i user of scheduling

And cooperative base station

I user of scheduling Upgrade

And renewal Vector Groups g _s:

Upgrade

Wherein

Upgrade i ← i+1, turn back to step 24;

In this step, t represents the noiseless number of users of each sector, i user of π (s, i) expression serving BS s scheduling,

Be cooperative base station

The i user of scheduling,

Be cooperative base station I user of scheduling, the current user's set of having dispatched of π (s) expression serving BS s; g _sBe defined Orthogonal Vectors before; The set of expression sector s service-user,

Noiseless user's set of expression adjacent sectors;

Cooperative multipoint transmission user's set for serving BS s place sector s;

Step 25, the N for being left _t-ξ-t service-user is determined candidate user set;

Serving BS s will

With

Send to cooperative base station

, will

With

Send to cooperative base station

Cooperative base station

The initialization set

J=1 wherein ..., t; Cooperative base station The initialization set

J=1 wherein ..., t; According to interference channel collimation, cooperative base station

For serving BS s selects user's set:

For from each j of 1 to t, to each

Calculate the collimation of the interference channel of user k and modulated degree user π (s, j), wherein interference source is cooperative base station

If result of calculation is:

Be that interference channel satisfies the collimation requirement, upgrade so

Wherein γ is the threshold value of weighing collimation between the interference channel vector; Similarly, for from each j of 1 to t, to each

Calculate the collimation of the interference channel of user k and modulated degree user π (s, j), wherein interference source is the base station If result of calculation is:

Be that interference channel satisfies the collimation requirement, upgrade so

Wherein γ is the threshold value of weighing collimation between the interference channel vector; Cooperative base station Calculate

And will

With

Send to serving BS s;

Meanwhile, according to interference channel collimation, cooperative base station

For serving BS s selects user's set:

For from each j of 1 to t, to each

Calculate the collimation of the interference channel of user k and modulated degree user π (s, j), wherein interference source is cooperative base station If result of calculation is:

Be that interference channel satisfies the collimation requirement, upgrade so

Wherein γ is the threshold value of weighing collimation between the interference channel vector; Similarly, for from each j of 1 to t, to each

Calculate the collimation of the interference channel of user k and modulated degree user π (s, j), wherein interference source is the base station

If result of calculation is:

Be that interference channel satisfies the collimation requirement, upgrade so

Wherein γ is the threshold value of weighing collimation between the interference channel vector; Cooperative base station

Calculate

And will

And

Send to serving BS s; According to user's set that cooperative base station is sent, serving BS s calculates final candidate user set Wherein

In this step,

Expression is gathered with the user that j noiseless user's interference channel satisfies collimation,

For

Union, j=1 ..., t, interference source are cooperative base station

These are used per family from set

Expression is gathered with the user that j noiseless user's interference channel satisfies collimation,

For

Union, j=1 ..., t, interference source are cooperative base station

These are used per family from set Expression is gathered with the user that j noiseless user's interference channel satisfies collimation,

For

Union, j=1 ..., t, interference source are cooperative base station

These are used per family from set

Expression is gathered with the user that j noiseless user's interference channel satisfies collimation,

For

Union, j=1 ..., t, interference source are cooperative base station

These are used per family from set

For satisfying the final candidate user set of interference channel collimation;

Step 26, determine remaining N _t-ξ-t dispatched users;

If i＞N _t-ξ then jumps to step 27; Otherwise serving BS s gathers π (s) and Vector Groups g according to the user who has dispatched _s, use semi-orthogonal user selection algorithm SUS from candidate collection In pick out i service-user π (s, i); Upgrade

Upgrade i ← i+1, turn back to step 26;

Step 27, serving BS utilize improved close-to zero beam excipient to eliminate the inter-user interference of dispatched users, reduce simultaneously the interference to the adjacent sectors dispatched users; In improved close-to zero beam excipient, the channel stack not only comprises the transmission channel vector of dispatched users, comprises that also serving BS is to the noiseless user's of adjacent sectors scheduling interference channel vector; After the channel stack asked pseudoinverse, the precoding vector of corresponding dispatched users transmission channel formed final pre-coding matrix.

4. cooperative scheduling and beam shaping method based on three cell cooperatives bunch according to claim 1 is characterized in that in the step 3 that serving BS upgrades each user's of this sector reference signal mean receiving power the finish time as follows at measurement period

Wherein, k=1 ..., K is user label, K represents the number of users of each sector,

The reference signal mean receiving power of expression serving BS s user k in the s of sector, place, The expression cooperative base station

The reference signal mean receiving power of user k in the s of sector,

The expression cooperative base station

The reference signal mean receiving power of user k in the s of sector, m represents m dispatching cycle, M represents the length of measurement period, serving BS s to K of this sector with carrying out per family this operation; In the incipient stage of next measurement period, serving BS s utilization here obtains upgrading

And

This sector user is classified.

Images