CN104486767B - Dynamic ABS disturbance restraining methods based on sub-clustering in isomery cellular network - Google Patents

Dynamic ABS disturbance restraining methods based on sub-clustering in isomery cellular network Download PDF

Info

Publication number
CN104486767B
CN104486767B CN201410767493.1A CN201410767493A CN104486767B CN 104486767 B CN104486767 B CN 104486767B CN 201410767493 A CN201410767493 A CN 201410767493A CN 104486767 B CN104486767 B CN 104486767B
Authority
CN
China
Prior art keywords
mrow
msub
cellulor
interference
cluster
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN201410767493.1A
Other languages
Chinese (zh)
Other versions
CN104486767A (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.)
Chongqing University of Post and Telecommunications
Original Assignee
Chongqing University of Post and Telecommunications
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 Chongqing University of Post and Telecommunications filed Critical Chongqing University of Post and Telecommunications
Priority to CN201410767493.1A priority Critical patent/CN104486767B/en
Publication of CN104486767A publication Critical patent/CN104486767A/en
Application granted granted Critical
Publication of CN104486767B publication Critical patent/CN104486767B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W16/00Network planning, e.g. coverage or traffic planning tools; Network deployment, e.g. resource partitioning or cells structures
    • H04W16/14Spectrum sharing arrangements between different networks

Landscapes

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

Abstract

The present invention relates to the dynamic ABS disturbance restraining methods based on sub-clustering in a kind of isomery cellular network, belong to wireless communication technology field.Interference weight between this method cellulor computation-intensive first, the interference relationships established between small cell network, i.e., whether there is interference edge, so as to establish the interference figure on cellulor interference relationships between cellulor;The cellulor interference figure established is then based on, cellulor is assigned in K cluster, ensures that the interference weight between cluster is maximum in the assignment procedure, different band resources is finally distributed for different clusters.Disturbed to further reduce in cluster, staggered form dynamic ABS distribution methods are taken to the cellulor in cluster, size of the cellulor based on load is divided into two groups in cluster, according to two groups of load, user's average transmission rate information, the ABS ratios between dynamic regulation group, so as to reduce further the interference of cellulor in cluster, resource utilization is improved, so as to improve the handling capacity of system.

Description

Dynamic ABS disturbance restraining methods based on sub-clustering in isomery cellular network
Technical field
The invention belongs to wireless communication technology field, is related to the dynamic ABS based on sub-clustering in a kind of isomery cellular network and does Disturb suppressing method.
Background technology
With the development of cordless communication network, following wireless network just towards intelligent network, broadband, diversification, The direction evolution of synthesization.With a large amount of popularizations of intelligent terminal, data service will appear from explosive growth.In the 5G in future In network, data service will be mainly distributed on indoor and hot zones, and this causes super-intensive network turns into realize following 5G's One of Main Means of 1000 times of traffic demands.Super-intensive network can improve the network coverage, significantly lifting system capacity, and And business is shunted, there is more flexible network design and more efficient channeling.Future, towards the big band of high band Width, by using the network plan of more crypto set, dispose small cell/section and will be up to more than 100.
At the same time, more intensive network design also make it that network topology is more complicated, and inter-cell interference has become The principal element that system for restricting capacity increases, significantly reduces network energy efficiency.
Interference management method in conventional heterogeneous network, mainly go solve the problems, such as interference from two angles:First be from The angle of frequency domain, synchronization are interior by distributing different resource block for different users to avoid the interference of same frequency range, Huo Zheyi A little derivative methods, such as the power of some network nodes of same frequency range is reduced, so as to reduce the interference between same frequency, such method Consider the division of frequency domain resource, algorithm complex is typically higher, and it is single go to distribute resource from the angle of frequency domain, can not from when Between on a planning on the whole is done to system resource, the unreasonable distribution of resource is then caused on the long period;It is another then be From the angle of time domain, such as eICIC technologies, this method is applied to reduce macrocellular in the interference case of cellulor mostly, right Cellulor uses range expansion technique, the power in subframe by reducing some time slots of macro base station, corresponding small so as to reduce Interference in honeycomb subframe, so as to improve the communication quality of user in cellulor to a certain extent, expand cellulor Capacity, but such a method can not preferably coordinate the interference between cellulor in the case of cellulor comparatively dense.
Therefore, it is necessary to which a kind of effective interference management scheme, can have in following 5G highly dense cellular network The interference in the reduction dense cellular network on ground is imitated, while appropriate equilibrium is carried out to the load in dense cellular network, so as to The capacity of 5G systems is greatly improved, obtains the preferably availability of frequency spectrum, further improves the service quality of user.
The content of the invention
In view of this, it is an object of the invention to provide the dynamic ABS interference based on sub-clustering in a kind of isomery cellular network Suppressing method, this method can be good at improve dense cellular network in serious interference the problem of.
To reach above-mentioned purpose, the present invention provides following technical scheme:
The dynamic ABS disturbance restraining methods based on sub-clustering, comprise the following steps in a kind of isomery cellular network:
Step 1:Interference weight between computation-intensive cellulor, the interference relationships established between small cell network, i.e. chalcid fly It whether there is interference edge between nest, so as to establish the interference figure on cellulor interference relationships;
Step 2:Cellulor interference figure based on foundation, cellulor is assigned in K cluster, ensured in the assignment procedure Interference weight between cluster is maximum, and different band resources is finally distributed for different clusters;
Step 3:Cellulor in cluster is based on load capacity, is divided into two groups, main group of G1With from a group G2, wherein main group of G1It is each The load capacity of cellulor is higher than from a group G2Each cellulor load capacity, according to principal and subordinate organize load based on organize G1Distribute ABS Ratio is θ, from a group G2It is 1- θ to distribute ABS ratios.
Further, in step 1 disturb weight calculating and interference figure establish criterion and method specifically includes:
1) number of users counted in cellulor center range is N, and edge customer number is M, and M+N ≠ 0;
2) then serviced by cell i, the cellulor regional channel average quality RASQ disturbed by cell jijIt is expressed as:
WhereinThe SINR of cell edge k-th user is represented,Represent center of housing estate k-th user's SINR;
3) weight is wherein disturbedIf Wij≥Wth, then two cellulors, which exist, does Disturb side, wherein WthFor preset value, MAX (RASQij,RASQji) represent RASQijWith RASQjiMiddle maximum value;
4) the interference weight between each two cellulor is calculated successively can determine that interference figure G (V, E), wherein V represent chalcid fly Nest set, E are interference weight WijSet;
5) interference figure is periodically updated.
Further, the interference weight W in interference figure G (V, E) between each two cellulor is understood by step 1ij, by system frequency Spectrum resource is divided into K subsegment, R={ R1,R2..., Rk, point set V is assigned in K cluster so that weight is maximum between cluster, i.e., For:
Step 2 specifically includes:
1) initialize:ΩkRepresent node k degree, WiFor cluster RiWeight, for cluster RiHaveCalculate When method startsThere is Wi=0, V' represent remaining cellulor, according to the degree descending sort of cellulor point set, press According to ΩkOrder from big to small is chosen first from V' set and is sequentially allocated to k-th node into K cluster;
2) continue according to node ΩkOrder-assigned node from big to small is into K cluster, if node m is assigned into cluster Ri In, calculate interference weight in cluster
3) the cluster R that interference weight is minimum in cluster is selectedj, node m is distributed into cluster Rj, now V'=V'-m;
4) repeat the above steps 2), 3) until remaining cellulor set V' is sky;
5) sub-clustering again when interference figure changes.
Further, dynamic ABS subframe of the cellulor based on load and user's average service rate is matched somebody with somebody in the cluster in step 3 The scheme of putting specifically includes:
1) whole system adoption rate fair scheduling algorithm, cellulor is divided into two groups of G in cluster1And G2, for G1It is any in group Cellulor load is more than G2Arbitrarily small cellular load in group;
2) two groups are equipped with scheme using subframe is intersected, as main group of G1When using normal subframe, from a group G2Then use Corresponding ABS subframes, until meeting that two groups of ABS number of subframes all meets its preset value;
3) assume for cellulor CiMiddle user j long-times average service rate is Rij, G1Middle ABS subframes are equipped with ratio θ, then G2It is 1- θ that middle ABS subframes, which are equipped with ratio, 0.4≤θ≤0.6;
4) for full business model θ computational methods:
G1Load G in group1Number of users Num in groupG1Determine, G2Load G in group2Number of users Num in groupG2Determine;
Maximum throughput module is:
Optimize the distribution of ABS subframes it can thus be appreciated that:
5) for non-full business model θ computational methods:
Non-full business load is determined by base station data total amount waiting for transmission;
Assuming that base station CiThe data volume for being prepared as user j transmission is Bij, then main group of G1Middle user j has transmitted these data TimeFrom a group G2The time that middle user j transmission data need
Total transmission time is TΣ
OrderMakeHaveTherefore TΣMinimum value, θ be presentoptBest proportion is:
6) ABS ratios θ is periodically updated.
The beneficial effects of the present invention are:Method provided by the invention is established by cellulor interference figure and the side of sub-clustering Case, reasonably distribute frequency spectrum, it is suppressed that the interference of cellulor between cluster;By the dynamic ABS distribution methods based on load, to suppress The interference of cellulor in cluster, and the load in cluster is balanced, improve the utilization rate of frequency spectrum.
Brief description of the drawings
In order that the purpose of the present invention, technical scheme and beneficial effect are clearer, the present invention provides drawings described below and carried out Explanation:
Fig. 1 is the system architecture schematic diagram that control channel data channel is separated;
Fig. 2 is the overall flow schematic diagram of the method for the invention;
Fig. 3 is that interference figure establishes schematic diagram;
Fig. 4 is sub-clustering schematic flow sheet;
Fig. 5 is frequency spectrum distribution schematic diagram after sub-clustering;
Fig. 6 is dynamic ABS allocation flow schematic diagrames;
Fig. 7 is ABS configuration schematic diagrams in cluster.
Embodiment
Below in conjunction with accompanying drawing, the preferred embodiments of the present invention are described in detail.
The present invention is applied to intensive small cell network, in dense cellular network, not only there is interference between cellulor, There is also stronger interference to cellulor for macro base station.
As shown in figure 1, in order to avoid the interference of macro base station, using such as Fig. 1 system architectures, macrocellular is specially born in this framework The broadcast of row control information is loaded into, and cellulor is then responsible for carrying out the transmission of data message specially.First, UE accesses a grand honeybee Nest, then under the assistance of macrocellular, UE is linked into average received work(highest cellulor.
Fig. 2 is the overview flow chart of this method, and as can be seen from the figure this method is broadly divided into three main parts:
Step 1:Calculate the average area channel quality RASQ between cellulorij, obtain the interference weight W between cellulorij, Establish interference figure G (V, E);
Step 2:Sub-clustering is carried out to cellulor according to interference figure G (V, E), and the cellulor in different clusters used different Frequency spectrum resource;
Step 3:Mobile state ABS pro rates are entered to cellulor in cluster based on load, user's average transmission rate information.
In view of user mobility, and the change of load, periodicity T need to be repeated the above steps, in the shorter time Interior, it is constant that user is believed that the change of static and user load can be approximately considered, therefore T is arranged into the short period, and considers To the time it is shorter can increase overhead, calculate excessively frequent, T be arranged to 1s, can specifically be adjusted according to actual conditions, is such as used Family translational speed etc..
Step 1 describes in detail as follows:
Step 1.1:The number of users counted first in cellulor statistics cellulor center range is N, and edge customer number is M: User measures RSRP > RSRPthUser centered on then counting;User measures RSRP < RSRPthThen statistics is edge customer; RSRPthFor preset value.
Step 1.2:By the cellulor i of cellulor j interference zone leveling channel quality RASQijIt is expressed as:
WhereinThe SINR of edge customer is represented,Represent Cell Center User SINR;
Step 1.3:Calculate the interference weight between two adjacent cellulors:
Step 1.4:If Wij≥WthThen interference edge is present, and establishes using cellulor as summit V, interference weight WijFor the dry of side Figure G (V, E) is disturbed, and interference figure is updated with cycle T.
Fig. 3 is that interference figure establishes schematic diagram
As shown in figure 3, MiRepresent the number of users at cellulor i edges, NiRepresent the number of users at cellulor i centers, it is assumed that chalcid fly Nest 1, the distance between 2, No. 3 equidistant, i.e. d12=d13=d23, and the transmission power P of three cellulors1=P2=P3
The relation of three cellulor sums has:M1+N1=M2+N2=M3+N3
Edge customer quantitative relation has:M1< M2< M3
Because the interference that edge customer is subject in cellulor is larger, when cellulor amount of edge is more, cellulor is done The user disturbed concentrates edge region;Assuming that it is all first remove edge customer SINR it is identical, the SINR of central user is identical, according to The release of being not difficult of above-mentioned flow has:
Have for 1, No. 2 cellulor:RASQ12> RASQ21, then
Have for 2, No. 3 cellulors:RASQ23> RASQ32, then
Have for 1, No. 3 cellulor:RASQ12> RASQ31, then
And W13=W23> W12
It follows that when user is more be distributed in cell edge when, we will choose more small of Cell Edge User Area as judge interference weight important evidence, so during sub-clustering can preferably avoid Cell Edge User compared with By stronger interference when more, cause marginal user performance poor.
Step 2 describes in detail as follows:
Fig. 4 is the detailed process of interference figure sub-clustering, as shown in the figure:
Step 2.1:Initialization:ΩkRepresent node k degree, WiFor cluster RiWeight, for cluster RiHaveWhen algorithm startsThere is Wi=0;
Step 2.2:V' represents remaining cellulor, according to the degree descending sort of cellulor point set, another i=0;
Step 2.3:Choose Ω in set V'kMaximum element m is allocated;
Step 2.4:Judge that K cluster whether there is empty set, be then to continue step 2.5, otherwise jump to step 2.6;
Step 2.5:Element m is assigned to RiIn, i=i+1, return to step 2.4;
Step 2.6:Calculating elements m and each cluster interference weightChoose interference weight minimum Cluster, element m is distributed into this cluster;
Step 2.7:Repeat the above steps 2.3 to step 2.5 until remaining cellulor set V' for sky.
Fig. 5 is frequency spectrum distribution schematic diagram after sub-clustering:
After sub-clustering terminates, the interference between cluster is maximum, and the interference weight in cluster is smaller, therefore we are to different clusters R1、R2、R3、R4Use different frequency ranges 1,2,3,4;Larger interference between can elimination cluster, now still there is dry in cluster Disturb, we will suppress in subsequent step to interference in cluster.
Step 3 describes in detail as follows:
Reference picture 6, dynamic ABS distribution methods in cluster:
Step 3.1:Count all users in cluster and measure SINR, it is P that user, which receives power, and interference general power is I, noise work( Rate is N0, then SINR be represented by:
Step 3.2:Shorter in view of ABS subframe θ regulating cycles, its instantaneous service speed is approximately equal to being averaged in the cycle Service speed, therefore the computational methods of Mean Speed can be simplified as:
SINR is measured to user and carries out CQI mappings, and obtains its modulation coding mode, according to modulation coding mode, is calculated The size of its transmission block, you can obtain its service speed R;Or aromatic formula simple computation can be passed through:R=log (1+ SINR), you can obtain average service rate R;
Step 3.3:Cellulor in cluster is based on load capacity, is divided into two groups, main group of G1With from a group G2, wherein main group of G1It is every The load capacity of individual cellulor is higher than from a group G2Each cellulor load capacity;
Load metric standard in cluster:
For full business model:
Because all users need portfolio near infinites for transmitting big in cluster, therefore, we using number of users as Weigh the standard of load, G1Load G in group1Number of users in groupDetermine, G2Load G in group2Number of users in groupDetermine;
For non-full business model:
Load determines that this load is provided by specific business model by the total traffic for needing cellulor to transmit in cluster;
Step 3.4:G is organized based on the load organized according to principal and subordinate1It is θ to distribute ABS subframes ratio, from a group G2Distribute ABS subframe ratios Example is 1- θ, 0.4≤θ≤0.6;
For full business model θ computational methods:
Under full business model, the total amount of data to be transmitted of user is unlimited, therefore the transmission quantity in the unit interval is Handling capacity CΣThe as important measure standard of gauging system performance, therefore establish module CΣIt is as follows, another CΣMaximum is taken, this thing θ is then optimal ABS subframes ratio;
Maximum throughput module is:
Optimize the distribution of ABS subframes it can thus be appreciated that:
For non-full business model θ computational methods:
Non-full business load is determined by base station data total amount waiting for transmission;
Assuming that base station CiThe data volume for being prepared as user j transmission is Bij, then main group of G1Middle user j has transmitted these data TimeFrom a group G2The time that middle user j transmission data needFor non-full business Model, total business volume are also changing in dynamic change, user's average service rate, but generally speaking total transmission time is smaller more It is good, therefore establish and build total transmission time function TΣ, now another TΣMinimum, the θ's obtained is then most ABS subframes ratio;
Total transmission time is TΣ
OrderMakeHaveTherefore TΣMinimum value, θ be presentoptBest proportion is:
Step 3.6:Above-mentioned solution is obtained into ABS subframes to be configured:
Reference picture 7, ABS sub-frame configuration schemes:
ABS subframes optimal model as from the foregoing, the allocation proportion θ of ABS subframes in cluster is obtained, in order to further reduce Disturbed in cluster, scheme is equipped with using subframe is intersected to two groups:
In a frame structure, it is assumed that the subframe for normal data transfer is 8, G after above-mentioned solution1Group θ=0.4, Then G2Group θ=0.6, G1ABS number of subframes can be approximately 3, G in group2ABS number of subframes in group can be approximately 4, by Fig. 7 we As can be seen that work as main group of G1When using normal subframe, from a group G2Corresponding ABS subframes are then used, until meeting two groups ABS number of subframes all meets its preset value.
Finally illustrate, preferred embodiment above is merely illustrative of the technical solution of the present invention and unrestricted, although logical Cross above preferred embodiment the present invention is described in detail, it is to be understood by those skilled in the art that can be Various changes are made to it in form and in details, without departing from claims of the present invention limited range.

Claims (4)

  1. A kind of 1. dynamic ABS disturbance restraining methods based on sub-clustering in isomery cellular network, it is characterised in that:Including following step Suddenly:
    Step 1:Interference weight between computation-intensive cellulor, the interference relationships established between small cell network, i.e., between cellulor With the presence or absence of interference edge, so as to establish the interference figure on cellulor interference relationships;
    Step 2:Cellulor interference figure based on foundation, cellulor is assigned in K cluster, in the assignment procedure between guarantee cluster Interference weight it is maximum, be finally that different clusters distribute different band resources;
    Step 3:Cellulor in cluster is based on load capacity, is divided into two groups, main group of G1With from a group G2, wherein main group of G1Each chalcid fly The load capacity of nest is higher than from a group G2Each cellulor load capacity, according to principal and subordinate organize load based on organize G1Distribute ABS ratios For θ, from a group G2It is 1- θ to distribute ABS ratios.
  2. 2. the dynamic ABS disturbance restraining methods based on sub-clustering in a kind of isomery cellular network according to claim 1, it is special Sign is:In step 1 disturb weight calculating and interference figure establish criterion and method specifically includes:
    1) number of users counted in cellulor center range is N, and edge customer number is M, and M+N ≠ 0;
    2) then serviced by cell i, the cellulor regional channel average quality RASQ disturbed by cell jijIt is expressed as:
    <mrow> <msub> <mi>RASQ</mi> <mrow> <mi>i</mi> <mi>j</mi> </mrow> </msub> <mo>=</mo> <mfrac> <mrow> <mi>M</mi> <mo>*</mo> <munderover> <mo>&amp;Sigma;</mo> <mrow> <mi>k</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>M</mi> </munderover> <mrow> <msubsup> <mi>SINR</mi> <mi>k</mi> <mi>O</mi> </msubsup> </mrow> <mo>+</mo> <mi>N</mi> <mo>*</mo> <munderover> <mo>&amp;Sigma;</mo> <mrow> <mi>k</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>N</mi> </munderover> <mrow> <msubsup> <mi>SINR</mi> <mi>k</mi> <mi>I</mi> </msubsup> </mrow> </mrow> <msup> <mrow> <mo>(</mo> <mi>M</mi> <mo>+</mo> <mi>N</mi> <mo>)</mo> </mrow> <mn>2</mn> </msup> </mfrac> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>1</mn> <mo>)</mo> </mrow> </mrow>
    WhereinThe SINR of cell edge k-th user is represented,Represent the SINR of center of housing estate k-th user;
    3) weight is wherein disturbedImplication is interference weight between two cellulors and it Between the maximum of channel average quality be inversely proportional, i.e. channel quality between two cellulors is better, then between them Interference weight with regard to smaller;If Wij≥Wth, then two cellulors are interference edge, wherein W be presentthFor preset value, MAX (RASQij, RASQji) represent RASQijWith RASQjiMiddle maximum value;
    4) the interference weight between each two cellulor is calculated successively can determine that interference figure G (V, E), wherein V represent cellulor collection Close, E is interference weight WijSet;
    5) interference figure is periodically updated.
  3. 3. the dynamic ABS disturbance restraining methods based on sub-clustering in a kind of isomery cellular network according to claim 2, it is special Sign is:Interference weight W in interference figure G (V, E) between each two cellulor is understood by step 1ij, by system spectral resources point For K subsegment, R={ R1,R2..., Rk, point set V is assigned in K cluster so that weight is maximum between cluster, is:
    <mrow> <mi>m</mi> <mi>a</mi> <mi>x</mi> <munderover> <mo>&amp;Sigma;</mo> <mrow> <mi>i</mi> <mo>=</mo> <mn>1</mn> </mrow> <mrow> <mi>K</mi> <mo>-</mo> <mn>1</mn> </mrow> </munderover> <munderover> <mo>&amp;Sigma;</mo> <mrow> <mi>j</mi> <mo>=</mo> <mi>i</mi> <mo>+</mo> <mn>1</mn> </mrow> <mi>K</mi> </munderover> <munder> <mo>&amp;Sigma;</mo> <mrow> <msub> <mi>v</mi> <mn>1</mn> </msub> <mo>&amp;Element;</mo> <msub> <mi>R</mi> <mi>i</mi> </msub> <mo>,</mo> <msub> <mi>v</mi> <mn>2</mn> </msub> <mo>&amp;Element;</mo> <msub> <mi>R</mi> <mi>j</mi> </msub> </mrow> </munder> <mi>w</mi> <mrow> <mo>(</mo> <msub> <mi>v</mi> <mn>1</mn> </msub> <mo>,</mo> <msub> <mi>v</mi> <mn>2</mn> </msub> <mo>)</mo> </mrow> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>2</mn> <mo>)</mo> </mrow> </mrow>
    Wherein v1,v2For the element in cellulor set V;
    Step 2 specifically includes:
    1) initialize:ΩkRepresent node k degree, WiFor cluster RiWeight, for cluster RiHaveAlgorithm starts When forThere is Wi=0;The also unallocated small base station in cluster is represented with set V', according to cellulor point set Descending sort is spent, according to ΩkOrder from big to small is chosen first from V' set and is sequentially allocated to k-th node to K In cluster;wu,vFor cluster RiInterference weight between interior two nodes u and v;
    2) continue according to node ΩkOrder-assigned node from big to small is into K cluster, if node m is assigned into cluster RiIn, meter Calculate interference weight changing value in clusterwm,uInterference power between existing node u in new node m and cluster Weight;
    3) the cluster R that interference weight is minimum in cluster is selectedj, node m is distributed into cluster Rj, now V'=V'-m;
    4) repeat the above steps 2), 3) until remaining cellulor set V' is sky;
    5) sub-clustering again when interference figure changes.
  4. 4. the dynamic ABS disturbance restraining methods based on sub-clustering in a kind of isomery cellular network according to claim 1, it is special Sign is:Dynamic ABS sub-frame configuration scheme of the cellulor based on load and user's average service rate has in cluster in step 3 Body includes:
    1) whole system adoption rate fair scheduling algorithm, cellulor is divided into two groups of G in cluster1And G2, for G1Any chalcid fly in group Nest load is more than G2Arbitrarily small cellular load in group;
    2) two groups are equipped with scheme using subframe is intersected, as main group of G1When using normal subframe, from a group G2Then using corresponding ABS subframes, until meeting that two groups of ABS number of subframes all meets its preset value;
    3) assume for cellulor CiMiddle user j long-times average service rate is Rij, G1It is θ that middle ABS subframes, which are equipped with ratio, then G2It is 1- θ that middle ABS subframes, which are equipped with ratio, 0.4≤θ≤0.6;
    4) for full business model θ computational methods:
    G1Load G in group1Number of users in groupDetermine, G2Load G in group2Number of users in groupDetermine;
    Maximum throughput module is:
    <mrow> <msub> <mi>C</mi> <mi>&amp;Sigma;</mi> </msub> <mo>=</mo> <mrow> <mo>(</mo> <mn>1</mn> <mo>-</mo> <mi>&amp;theta;</mi> <mo>)</mo> </mrow> <mo>*</mo> <munder> <mo>&amp;Sigma;</mo> <mrow> <mi>i</mi> <mo>&amp;Element;</mo> <msub> <mi>G</mi> <mn>1</mn> </msub> </mrow> </munder> <munder> <mo>&amp;Sigma;</mo> <mrow> <mi>j</mi> <mo>&amp;Element;</mo> <msub> <mi>C</mi> <mi>i</mi> </msub> </mrow> </munder> <msub> <mi>R</mi> <mrow> <mi>i</mi> <mi>j</mi> </mrow> </msub> <mo>+</mo> <mi>&amp;theta;</mi> <mo>*</mo> <munder> <mo>&amp;Sigma;</mo> <mrow> <mi>i</mi> <mo>&amp;Element;</mo> <msub> <mi>G</mi> <mn>2</mn> </msub> </mrow> </munder> <munder> <mo>&amp;Sigma;</mo> <mrow> <mi>j</mi> <mo>&amp;Element;</mo> <msub> <mi>C</mi> <mi>i</mi> </msub> </mrow> </munder> <msub> <mi>R</mi> <mrow> <mi>i</mi> <mi>j</mi> </mrow> </msub> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>3</mn> <mo>)</mo> </mrow> </mrow>
    Optimize the distribution of ABS subframes it can thus be appreciated that:
    <mrow> <msubsup> <mi>&amp;theta;</mi> <mi>&amp;Sigma;</mi> <mrow> <mi>o</mi> <mi>p</mi> <mi>t</mi> </mrow> </msubsup> <mo>=</mo> <mfenced open = "{" close = ""> <mtable> <mtr> <mtd> <mrow> <msub> <mi>&amp;theta;</mi> <mi>max</mi> </msub> <mo>,</mo> <munder> <mo>&amp;Sigma;</mo> <mrow> <mi>i</mi> <mo>&amp;Element;</mo> <msub> <mi>G</mi> <mn>2</mn> </msub> </mrow> </munder> <munder> <mo>&amp;Sigma;</mo> <mrow> <mi>j</mi> <mo>&amp;Element;</mo> <msub> <mi>C</mi> <mi>i</mi> </msub> </mrow> </munder> <msub> <mi>R</mi> <mrow> <mi>i</mi> <mi>j</mi> </mrow> </msub> <mo>&gt;</mo> <munder> <mo>&amp;Sigma;</mo> <mrow> <mi>i</mi> <mo>&amp;Element;</mo> <msub> <mi>G</mi> <mn>1</mn> </msub> </mrow> </munder> <munder> <mo>&amp;Sigma;</mo> <mrow> <mi>j</mi> <mo>&amp;Element;</mo> <msub> <mi>C</mi> <mi>i</mi> </msub> </mrow> </munder> <msub> <mi>R</mi> <mrow> <mi>i</mi> <mi>j</mi> </mrow> </msub> </mrow> </mtd> </mtr> <mtr> <mtd> <mrow> <msub> <mi>&amp;theta;</mi> <mi>min</mi> </msub> <mo>,</mo> <mi>o</mi> <mi>t</mi> <mi>h</mi> <mi>e</mi> <mi>r</mi> <mi>w</mi> <mi>i</mi> <mi>s</mi> <mi>e</mi> </mrow> </mtd> </mtr> </mtable> </mfenced> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>4</mn> <mo>)</mo> </mrow> </mrow>
    5) for non-full business model θ computational methods:
    Non-full business load is determined by base station data total amount waiting for transmission;
    Assuming that base station CiThe data volume for being prepared as user j transmission is Bij, then main group of G1Middle user j by these data transmitted when BetweenFrom a group G2The time that middle user j transmission data need
    Total transmission time is TΣ
    <mrow> <msub> <mi>T</mi> <mi>&amp;Sigma;</mi> </msub> <mo>=</mo> <munder> <mo>&amp;Sigma;</mo> <mrow> <mi>i</mi> <mo>&amp;Element;</mo> <msub> <mi>G</mi> <mn>1</mn> </msub> </mrow> </munder> <munder> <mo>&amp;Sigma;</mo> <mrow> <mi>j</mi> <mo>&amp;Element;</mo> <msub> <mi>C</mi> <mi>i</mi> </msub> </mrow> </munder> <mfrac> <msub> <mi>B</mi> <mrow> <mi>i</mi> <mi>j</mi> </mrow> </msub> <mrow> <mo>(</mo> <mn>1</mn> <mo>-</mo> <mi>&amp;theta;</mi> <mo>)</mo> <msub> <mi>R</mi> <mrow> <mi>i</mi> <mi>j</mi> </mrow> </msub> </mrow> </mfrac> <mo>+</mo> <munder> <mo>&amp;Sigma;</mo> <mrow> <mi>i</mi> <mo>&amp;Element;</mo> <msub> <mi>G</mi> <mn>2</mn> </msub> </mrow> </munder> <munder> <mo>&amp;Sigma;</mo> <mrow> <mi>j</mi> <mo>&amp;Element;</mo> <msub> <mi>C</mi> <mi>i</mi> </msub> </mrow> </munder> <mfrac> <msub> <mi>B</mi> <mrow> <mi>i</mi> <mi>j</mi> </mrow> </msub> <mrow> <mi>&amp;theta;</mi> <mo>*</mo> <msub> <mi>R</mi> <mrow> <mi>i</mi> <mi>j</mi> </mrow> </msub> </mrow> </mfrac> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>5</mn> <mo>)</mo> </mrow> </mrow>
    OrderMakeHaveTherefore TΣIn the presence of Minimum value, θoptBest proportion is:
    <mrow> <msup> <mi>&amp;theta;</mi> <mrow> <mi>o</mi> <mi>p</mi> <mi>t</mi> </mrow> </msup> <mo>=</mo> <mfrac> <msqrt> <msub> <mi>T</mi> <msub> <mi>G</mi> <mn>2</mn> </msub> </msub> </msqrt> <mrow> <msqrt> <msub> <mi>T</mi> <msub> <mi>G</mi> <mn>2</mn> </msub> </msub> </msqrt> <mo>+</mo> <msqrt> <msub> <mi>T</mi> <msub> <mi>G</mi> <mn>1</mn> </msub> </msub> </msqrt> </mrow> </mfrac> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>6</mn> <mo>)</mo> </mrow> </mrow>
    6) ABS ratios θ is periodically updated.
CN201410767493.1A 2014-12-12 2014-12-12 Dynamic ABS disturbance restraining methods based on sub-clustering in isomery cellular network Active CN104486767B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201410767493.1A CN104486767B (en) 2014-12-12 2014-12-12 Dynamic ABS disturbance restraining methods based on sub-clustering in isomery cellular network

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201410767493.1A CN104486767B (en) 2014-12-12 2014-12-12 Dynamic ABS disturbance restraining methods based on sub-clustering in isomery cellular network

Publications (2)

Publication Number Publication Date
CN104486767A CN104486767A (en) 2015-04-01
CN104486767B true CN104486767B (en) 2017-12-08

Family

ID=52761257

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201410767493.1A Active CN104486767B (en) 2014-12-12 2014-12-12 Dynamic ABS disturbance restraining methods based on sub-clustering in isomery cellular network

Country Status (1)

Country Link
CN (1) CN104486767B (en)

Families Citing this family (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106658552B (en) * 2015-10-30 2019-09-17 普天信息技术有限公司 Interference management method, system
CN108307412B (en) * 2018-02-08 2020-08-07 北京邮电大学 User-centered ultra-dense network interference management method based on grouping game
CN108809470B (en) * 2018-07-04 2020-04-07 西安邮电大学 Clustering algorithm in ultra-dense cellular network
CN111711986B (en) * 2020-05-06 2022-06-07 哈尔滨工业大学 UC-UDN proportional fair resource allocation method in 5G communication system

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP2453711A1 (en) * 2010-11-15 2012-05-16 NTT DoCoMo, Inc. Method for assigning frequency subbands to a plurality of interfering nodes in a wireless communication network, controller for a wireless communication network and wireless communication network
CN104105100A (en) * 2013-04-02 2014-10-15 中国科学院计算技术研究所 Downlink interference elimination method and system based on pseudo random sub-channel selection strategy

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9198046B2 (en) * 2012-10-01 2015-11-24 Nokia Solutions And Networks Oy Enhanced metrics exchange for a wireless network

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP2453711A1 (en) * 2010-11-15 2012-05-16 NTT DoCoMo, Inc. Method for assigning frequency subbands to a plurality of interfering nodes in a wireless communication network, controller for a wireless communication network and wireless communication network
CN104105100A (en) * 2013-04-02 2014-10-15 中国科学院计算技术研究所 Downlink interference elimination method and system based on pseudo random sub-channel selection strategy

Also Published As

Publication number Publication date
CN104486767A (en) 2015-04-01

Similar Documents

Publication Publication Date Title
CN103929781B (en) Cross-layer interference coordination optimization method in super dense heterogeneous network
CN102026388B (en) Method for allocating radio resources under coordinated multipoint transmission/reception (CoMP) in long term evolution-advanced (LTE-A) system
CN103781118B (en) Integrated processes is distributed with resource based on multiple services heterogeneous wireless network Access Control
CN103096335A (en) Optimization method of spectrum efficiency and energy efficiency of wireless communication system
CN104486767B (en) Dynamic ABS disturbance restraining methods based on sub-clustering in isomery cellular network
CN104902431B (en) A kind of LTE network mid-span cell D2D communication spectrum distribution methods
CN103024921A (en) Scheduling method based on CQI (channel quality indicator) feedback parameter and SINR (signal to interference plus noise ratio) numerical grouping
CN106454920A (en) Resource allocation optimization algorithm based on time delay guarantee in LTE (Long Term Evolution) and D2D (Device-to-Device) hybrid network
CN106060851A (en) Secure resource optimization method under congestion control in heterogeneous cloud wireless access network
CN105959234A (en) Load balance resource optimization method under safety perceptive cloud radio access network
CN102026379B (en) Home node base station and method for choosing carrier-wave thereof
CN102098786B (en) Resource allocation method for femtocell in hybrid access way
Zhang et al. Dynamic user-centric clustering for uplink cooperation in multi-cell wireless networks
CN107070583A (en) A kind of efficiency optimization method of heterogeneous network enhancement type district interference coordination
CN104159314B (en) The distributed energy saving resources distribution method of heterogeneous network
CN104883727B (en) Power distribution method for maximizing D2D user rate in cellular heterogeneous network
Liu et al. Distributed cooperative admission and power control for device-to-device links with QoS protection in cognitive heterogeneous network
CN105578482B (en) A kind of honeycomb heterogeneous network resource allocation methods
CN104378785B (en) The ascending-descending subframes method for reconfiguration and device of a kind of Microcell
CN106358204A (en) Full-duplex inter-cell interference coordination method under honeycomb heterogeneous network
WO2024060523A1 (en) Time domain resource allocation method and apparatus, electronic device, and storage medium
WO2024060524A1 (en) Resource allocation method and apparatus, resource scheduling method, and device
Huang et al. Geometric approach based resource allocation in heterogeneous cellular networks
CN102104964B (en) Method and system for coordinating and scheduling frequency band resources in cellular network
CN103442365B (en) A kind of frequency multiplexing method reducing the interior CoMP system interference in station

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant