CN103997738B - A kind of anti-tampering sub-clustering management method and device - Google Patents
A kind of anti-tampering sub-clustering management method and device Download PDFInfo
- Publication number
- CN103997738B CN103997738B CN201410208574.8A CN201410208574A CN103997738B CN 103997738 B CN103997738 B CN 103997738B CN 201410208574 A CN201410208574 A CN 201410208574A CN 103997738 B CN103997738 B CN 103997738B
- Authority
- CN
- China
- Prior art keywords
- cell
- main plot
- candidate
- adjacent cell
- 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
Links
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The present invention relates to the communication technology, a kind of anti-tampering sub-clustering management method and device are disclosed, under large scale network framework, to effectively improve overall edge user throughput.This method is：Edge customer average spectral efficiency (ase) and N number of adjacent cell ID that CCN is reported according to each candidate cell, each candidate cell is chosen successively according to processing priority for main plot, wherein, often choose a main plot, according to setting number of times adjacent cell recurrence selection is carried out for current main plot, and the adjacent cell for choosing current main plot and correspondence is divided into cluster, then respectively in each cluster for the anti-tampering coordinated manipulation of edge customer progress.So, just the possibility that two neighbor cell fringe regions use identical frequency is eliminated, reduce the possibility disturbed between two candidate cells, so as to both improve the edge user throughput that system is overall, the overall performance of the edge customer of all candidate cells is improved, coordinated management expense is reduced again.
Description
Technical field
The present invention relates to the communications field, more particularly to a kind of anti-tampering sub-clustering management method and device.
Background technology
As Long Term Evolution (Long Term Evolution, LTE) technology is extensive commercial extensively, the stream of data service
Amount demand hypervelocity increases, the bearer network also continuous extended network scale during business development.Network size is huge, networking
In the case of complexity, network management difficulty increase, the stability of a system declines, and O＆M efficiency reduction, these factors can all have influence on
The normal management of existing network equipment.
OFDM (the Orthogonal Frequency Division that LTE system is used
Multiplexing, OFDM) it is a kind of OFDM+ time division multiple acesses (Time Division Multiple on technological essence
Access, TDMA) technology, i.e., can difference coming with passage time and subcarrier for the different user in same cell
It is distinguish between.In order to reach highest spectrum efficiency, LTE system generally uses identical networking mode, i.e., each neighbor cell
Using identical carrier wave.Now, the different user of neighbor cell, is especially in the user of cell edge, exists with for the moment
Between receive two or more cells identical frequency signal probability, and when the homogenous frequency signal from each cell is stronger, the use
Family will be heavily disturbed, influences communication quality.
In order to lift the performance of edge customer, LTE and long-term evolution upgrading (Long Term Evolution-
Advanced, LTE-A) introduce multipoint cooperative (Coordinated Multiple Points, CoMP) joint transmission (Joint
Transmission, JT)/combine reception (Joint reception, JR) and Inter-Cell Interference Coordination (Inter-Cell
Interference Coordination, ICIC)/enhancing Inter-Cell Interference Coordination (enhanced Inter-Cell
Interference Coordination, eICIC) etc. multiple technologies, the main thoughts of these technologies small is distinguished each
Centered on region (Cell Center) and fringe region (Cell Edge), according to the location of user, for each edge
User distributes different subcarriers respectively, or, the resource of coordinated scheduling different districts is only certain one side within the same period
Edge user service.So, the fringe region for theoretically eliminating two neighbor cells uses the possibility of identical frequency, so as to drop
The possibility disturbed between low two neighbor cells.
The realization mechanism of current industry includes following several：
The first mechanism is：Cell is divided into by multiple clusters, above-mentioned COMP JT/JR and ICIC/ according to disposal ability fixation
A variety of interference coordination/cooperation technologies such as eICIC are only used in cluster, i.e., only control is used not between belonging to the user of same cluster
Same frequency.
However, during using the first mechanism, the user between cluster cannot get interference coordination/cooperation, physical location close to but not
Belong between the user of same cluster there are still co-channel interference, so as to cause the service quality problem of edge customer experience difference.
Second of mechanism is：All cell unified managements, coordination, scheduling.
However, during using second of mechanism, because number of cells is more, the technology realizes difficulty, administration overhead and phase
The time delay that should be brought is bigger, so as to cause edge customer timely response cannot handle, in turn results in edge customer experience
The service quality problem of difference.
The content of the invention
The embodiment of the present invention provides a kind of anti-tampering sub-clustering management method and device, under large scale network framework,
Overall edge user throughput is effectively improved, system service quality is improved.
Concrete technical scheme provided in an embodiment of the present invention is as follows：
First aspect, a kind of anti-tampering sub-clustering management method, including：
Candidate set is determined, edge customer average spectral efficiency (ase) and N that each candidate cell is reported are received respectively
Individual adjacent cell ID, wherein, N is the natural number of setting；
Determine that the processing of each candidate cell is preferential based on the edge customer average spectral efficiency (ase) that each candidate cell is reported
Level；
Processing priority according to each candidate cell chooses each candidate cell for main plot successively, wherein, often select
A main plot is taken, adjacent cell recurrence selection is carried out for current main plot according to setting number of times, and by current main plot
And the adjacent cell that correspondence is chosen is divided into cluster；
In each cluster anti-tampering coordinated manipulation is carried out for edge customer.
So, the possibility that two neighbor cell fringe regions use identical frequency is just eliminated to the full extent, reduction
The possibility disturbed between two candidate cells, so as to both improve the overall edge user throughput of system, improves institute
There is the overall performance of the edge customer of candidate cell, coordinated management expense is reduced again, especially when candidate set is larger
When, performance boost is especially notable.
With reference in a first aspect, in the first possible implementation, receiving N number of neighbour that any one candidate cell is reported
Cell ID, including：
Receive the ID of N number of adjacent cell of (NRSRP-RSRP) maximum that the candidate cell is reported；Or,
Receive the N number of adjacent cell for the adjacent cell group edge customer average spectral efficiency (ase) minimum that the candidate cell is reported
ID；Or,
Receive taking for (∑ (NRSRP-RSRP)/∑ adjacent cell group edge customer spectrum efficiency) that the candidate cell is reported
It is worth the ID of maximum N number of adjacent cell.
With reference in a first aspect, in second of possible implementation, the edge customer reported based on each candidate cell
Average spectral efficiency (ase) determines the processing priority of each candidate cell, including：
The order of the edge customer average spectral efficiency (ase) reported according to each candidate cell from small to large is to each candidate cell
Priority ranking is carried out, wherein, the smaller candidate cell priority of edge customer average spectral efficiency (ase) is higher；Or,
Priority row by VIP grades of candidate cells is highest, the edge customer average frequency spectrum reported according to each candidate cell
The order of efficiency from small to large carries out priority ranking to each remaining candidate cell, wherein, edge customer average frequency spectrum effect
The smaller candidate cell priority of rate is higher.
With reference to the first or second of possible implementation of first aspect or first aspect, in the third possible reality
In existing mode, a main plot is chosen, adjacent cell recurrence selection is carried out for current main plot according to setting number of times, and ought
The adjacent cell that preceding main plot and correspondence is chosen is divided into cluster, including：
Adjacent cell recurrence selection is carried out based on the current main plot of 2 pairs of number of times of setting, and by current main plot and correspondingly
The adjacent cell of selection is divided into cluster；Or,
Adjacent cell recurrence selection is carried out to current main plot based on setting number of times M, M is infinity, until choose less than
Untill any adjacent cell, then the adjacent cell that current main plot and correspondence are chosen is divided into cluster；So, can naturally keep away
Open interference, it is to avoid the edge customer between cluster cannot be coordinated；Or,
Adjacent cell recurrence selection is carried out to current main plot based on setting number of times M, M is infinity, until current master
The number sum of cell and the adjacent cell correspondingly chosen is reached in default cell cluster untill candidate cell number higher limit, then is incited somebody to action
The adjacent cell that current main plot and correspondence is chosen is divided into cluster.So, can be in the case where edge customer be more, it is to avoid
The scale of cluster is excessive, while the implementation result for reducing treating capacity can also be taken into account, has ensured edge customer experience.
With reference to the third possible implementation of first aspect, in the 4th kind of possible implementation, further wrap
Include：
Cycle according to setting repartitions cell cluster, and continues the pin in each cluster based on the cell cluster repartitioned
Anti-tampering coordinated manipulation is carried out to current edge customer.
So, can with edge customer movement dynamically periodically repartition the cell cluster of cooperation, and based on weight
The cell cluster newly divided continues to carry out anti-tampering coordinated manipulation for current edge customer in each cluster.
Second aspect, a kind of anti-tampering sub-clustering managing device, including：
Communication unit, for determining candidate set, receives the edge customer that each candidate cell reports and puts down respectively
Equal spectrum efficiency and N number of adjacent cell ID；
First processing units, for determining that each is waited based on the edge customer average spectral efficiency (ase) that each candidate cell is reported
Select the processing priority of cell；
Second processing unit, choosing each candidate cell successively for the processing priority according to each candidate cell is
Main plot, wherein, a main plot is often chosen, adjacent cell recurrence selection is carried out for current main plot according to setting number of times,
And the adjacent cell for choosing current main plot and correspondence is divided into cluster；
3rd processing unit, for carrying out anti-tampering coordinated manipulation for edge customer in each cluster.
So, the possibility that two neighbor cell fringe regions use identical frequency is just eliminated to the full extent, reduction
The possibility disturbed between two candidate cells, so as to both improve the overall edge user throughput of system, improves institute
There is the overall performance of the edge customer of candidate cell, coordinated management expense is reduced again, especially when candidate set is larger
When, performance boost is especially notable.
With reference to second aspect, in the first possible implementation, the communication unit specifically for：
Receive the ID of N number of adjacent cell of (NRSRP-RSRP) maximum that the candidate cell is reported；Or,
Receive the N number of adjacent cell for the adjacent cell group edge customer average spectral efficiency (ase) minimum that the candidate cell is reported
ID；Or,
Receive taking for (∑ (NRSRP-RSRP)/∑ adjacent cell group edge customer spectrum efficiency) that the candidate cell is reported
It is worth the ID of maximum N number of adjacent cell.
With reference to second aspect, in second of possible implementation, the edge customer reported based on each candidate cell
When average spectral efficiency (ase) determines the processing priority of each candidate cell, the first processing units specifically for：
The order of the edge customer average spectral efficiency (ase) reported according to each candidate cell from small to large is to each candidate cell
Priority ranking is carried out, wherein, the smaller candidate cell priority of edge customer average spectral efficiency (ase) is higher；Or,
Priority row by VIP grades of candidate cells is highest, the edge customer average frequency spectrum reported according to each candidate cell
The order of efficiency from small to large carries out priority ranking to each remaining candidate cell, wherein, edge customer average frequency spectrum effect
The smaller candidate cell priority of rate is higher.
With reference to the first or second of possible implementation of second aspect or second aspect, in the third possible reality
In existing mode, a main plot is chosen, adjacent cell recurrence selection is carried out for current main plot according to setting number of times, and ought
When the adjacent cell that preceding main plot and correspondence are chosen is divided into cluster, the second processing unit specifically for：
Adjacent cell recurrence selection is carried out based on the current main plot of 2 pairs of number of times of setting, and by current main plot and correspondingly
The adjacent cell of selection is divided into cluster；Or,
Adjacent cell recurrence selection is carried out to current main plot based on setting number of times M, M is infinity, until choose less than
Untill any adjacent cell, then the adjacent cell that current main plot and correspondence are chosen is divided into cluster；So, can naturally keep away
Open interference, it is to avoid the edge customer between cluster cannot be coordinated；Or,
Adjacent cell recurrence selection is carried out to current main plot based on setting number of times M, M is infinity, until current master
The number sum of cell and the adjacent cell correspondingly chosen is reached in default cell cluster untill candidate cell number higher limit, then is incited somebody to action
The adjacent cell that current main plot and correspondence is chosen is divided into cluster.So, can be in the case where edge customer be more, it is to avoid
The scale of cluster is excessive, while the implementation result for reducing treating capacity can also be taken into account, has ensured edge customer experience.
With reference to the third possible implementation of second aspect, in the 4th kind of possible implementation, described second
Processing unit is further used for：Cell cluster is repartitioned according to the cycle of setting；
3rd processing unit is further used for：Continued based on the cell cluster repartitioned in each cluster for working as
Preceding edge customer carries out anti-tampering coordinated manipulation.
So, can with edge customer movement dynamically periodically repartition the cell cluster of cooperation, and based on weight
The cell cluster newly divided continues to carry out anti-tampering coordinated manipulation for current edge customer in each cluster.
The third aspect, a kind of anti-tampering sub-clustering managing device, including：
COM1, for determining candidate set, receives the edge customer that each candidate cell reports and puts down respectively
Equal spectrum efficiency and N number of adjacent cell ID；
Processor, for determining each candidate cell based on the edge customer average spectral efficiency (ase) that each candidate cell is reported
Processing priority；And each candidate cell is chosen successively for main plot according to the processing priority of each candidate cell, its
In, a main plot is often chosen, adjacent cell recurrence selection is carried out for current main plot according to setting number of times, and will be current
The adjacent cell that main plot and correspondence are chosen is divided into cluster；And for the anti-tampering coordination of edge customer progress in each cluster
Operation.
So, the possibility that two neighbor cell fringe regions use identical frequency is just eliminated to the full extent, reduction
The possibility disturbed between two candidate cells, so as to both improve the overall edge user throughput of system, improves institute
There is the overall performance of the edge customer of candidate cell, coordinated management expense is reduced again, especially when candidate set is larger
When, performance boost is especially notable.
With reference to the third aspect, in the first possible implementation, the COM1 specifically for：
Receive the ID of N number of adjacent cell of (NRSRP-RSRP) maximum that the candidate cell is reported；Or,
Receive the N number of adjacent cell for the adjacent cell group edge customer average spectral efficiency (ase) minimum that the candidate cell is reported
ID；Or,
Receive taking for (∑ (NRSRP-RSRP)/∑ adjacent cell group edge customer spectrum efficiency) that the candidate cell is reported
It is worth the ID of maximum N number of adjacent cell.
With reference to the third aspect, in second of possible implementation, the edge customer reported based on each candidate cell
When average spectral efficiency (ase) determines the processing priority of each candidate cell, the processor specifically for：
The order of the edge customer average spectral efficiency (ase) reported according to each candidate cell from small to large is to each candidate cell
Priority ranking is carried out, wherein, the smaller candidate cell priority of edge customer average spectral efficiency (ase) is higher；Or,
Priority row by VIP grades of candidate cells is highest, the edge customer average frequency spectrum reported according to each candidate cell
The order of efficiency from small to large carries out priority ranking to each remaining candidate cell, wherein, edge customer average frequency spectrum effect
The smaller candidate cell priority of rate is higher.
With reference to the first or second of possible implementation of the third aspect or the third aspect, in the third possible reality
In existing mode, a main plot is chosen, adjacent cell recurrence selection is carried out for current main plot according to setting number of times, and ought
When the adjacent cell that preceding main plot and correspondence are chosen is divided into cluster, the processor specifically for：
Adjacent cell recurrence selection is carried out based on the current main plot of 2 pairs of number of times of setting, and by current main plot and correspondingly
The adjacent cell of selection is divided into cluster；Or,
Adjacent cell recurrence selection is carried out to current main plot based on setting number of times M, M is infinity, until choose less than
Untill any adjacent cell, then the adjacent cell that current main plot and correspondence are chosen is divided into cluster；So, can naturally keep away
Open interference, it is to avoid the edge customer between cluster cannot be coordinated；Or,
Adjacent cell recurrence selection is carried out to current main plot based on setting number of times M, M is infinity, until current master
The number sum of cell and the adjacent cell correspondingly chosen is reached in default cell cluster untill candidate cell number higher limit, then is incited somebody to action
The adjacent cell that current main plot and correspondence is chosen is divided into cluster.So, can be in the case where edge customer be more, it is to avoid
The scale of cluster is excessive, while the implementation result for reducing treating capacity can also be taken into account, has ensured edge customer experience.
With reference to the third possible implementation of the third aspect, in the 4th kind of possible implementation, processor enters
One step is used for：Cycle according to setting repartitions cell cluster, and is continued based on the cell cluster repartitioned in each cluster
It is interior to carry out anti-tampering coordinated manipulation for current edge customer.
So, can with edge customer movement dynamically periodically repartition the cell cluster of cooperation, and based on weight
The cell cluster newly divided continues to carry out anti-tampering coordinated manipulation for current edge customer in each cluster.
Brief description of the drawings
Fig. 1 is anti-tampering sub-clustering management flow chart in the embodiment of the present invention；
Fig. 2 is the first structural representation of CCN in the embodiment of the present invention；
Fig. 3 is second of structural representation of CCN in the embodiment of the present invention.
Embodiment
In order under large scale network framework, effectively improve overall edge user throughput, system service matter is improved
Amount.In the embodiment of the present invention, the edge customer distribution situation of monitoring the whole network, and based on this large scale network multidate information in real time
Sub-clustering management is carried out, the possibility that two neighbor cell fringe regions use identical frequency is theoretically eliminated, so as to reduce by two
The possibility disturbed between cell.
Specific method is：Using the mode of step-by-step recursion, first related cell combination is obtained using polling mode first,
After the adjacent strong jamming cell of the cell combination is all excluded, second related cell group is selected in remaining cell set
Close ... and so gradually exclude, suitable combination number of times is formulated according to overall network size.Such as ten several set, 3 left sides of recurrence
It is right just much of that；Commercial network in this way, cell number is a lot, then can take the circumstances into consideration increase recurrence number of times.
The preferred embodiment of the present invention is described in detail below in conjunction with the accompanying drawings.
, it is necessary to which a policymaker grasps all cell informations in practical application, therefore define a center control nodes
(Central control node, CCN) realizes this function.
As shown in fig.1, in the embodiment of the present invention, what CCN carried out anti-tampering sub-clustering management realizes that step is as follows：
Step 100：CCN determines candidate set, and it is small to receive the corresponding candidate that each candidate cell reports respectively
The edge customer average spectral efficiency (ase) in area and N number of adjacent cell ID, wherein, N is default natural number.
In the embodiment of the present invention, so-called edge customer is to be determined according to the neighboring BS information reported by a certain degree of
Same concept is used in interference and the user of spectral efficiency values setting threshold value (i.e. channel quality is poor), subsequent embodiment,
It will not be described in great detail.
In the embodiment of the present invention, CCN can based on the cell distribution situation being pre-configured with, according to the instruction of administrative staff from
In select candidate set, and receive the respective candidate cells that each candidate cell is reported according to the report cycle of setting
Edge customer average spectral efficiency (ase) and setting number destination neighbor cell ID.Wherein, report cycle can be configured voluntarily, preferably, can
To be configured to ms ranks, in report cycle, CCN thinks that the neighbor cell relation of each candidate cell is constant, and each candidate cell
In edge customer position it is constant.On the other hand, the edge customer average spectral efficiency (ase) of a candidate cell refers to this candidate
The average value of the spectrum efficiency of all edge customers in cell, and the setting number destination neighbor cell ID of a candidate cell, refer to
The ID for the setting number destination neighbor cell chosen from all adjacent cells of a candidate cell, e.g., the ID of adjacent cell 1, adjacent cell 2
ID ... adjacent cells N ID, wherein, N for setting natural number.
The selection principle (e.g., by base station selection) of N number of adjacent cell of each candidate cell can be including but not limited to following
Scheme：
The first scheme is：Choose the ID of the maximum N number of adjacent cell of (NRSRP-RSRP) value；Its wherein, NRSRP for neighbour
Area's Reference Signal Received Power, full name Neighbourhood Reference Signal Received Power, RSRP are ginseng
Examine signal reception power, full name Reference Signal Received Power.
So, CCN just receives the N number of adjacent cell for (NRSRP-RSRP) value maximum that each candidate cell is reported respectively
ID, be used as most strong adjacent area (N can configure)；
Second scheme is：Choose the ID of the minimum N number of adjacent cell of adjacent cell group edge customer average spectral efficiency (ase)；
So, CCN just receives adjacent cell group edge customer average spectral efficiency (ase) that each candidate cell reports most respectively
The ID of small N number of adjacent cell.
Wherein, the adjacent cell group edge customer average spectral efficiency (ase) of any one adjacent cell, refers to the adjacent cell and corresponding
Candidate selects the average spectral efficiency (ase) of the edge customer between cell.
For example：There are two adjacent cells in candidate cell X, be referred to as adjacent cell 1 and adjacent cell 2, candidate cell X and neighbour are small
There is edge customer A and edge customer B between area 1, there is edge customer C, edge customer D between adjacent cell 2 and edge is used
Family E, then the customer edge user average spectral efficiency (ase) of candidate cell is edge customer A, edge customer B, edge customer C, side
Edge user D and edge customer E average spectral efficiency (ase), and the adjacent cell group edge customer average spectral efficiency (ase) of adjacent cell 1 is side
Edge user A and edge customer B average spectral efficiency (ase), the adjacent cell group edge customer average spectral efficiency (ase) of adjacent cell 2 is edge
User C, edge customer D and edge customer E average spectral efficiency (ase).
The third scheme is：Choose (∑ (NRSRP-RSRP)/∑ adjacent cell group edge customer spectrum efficiency) value maximum
N number of adjacent cell ID.
So, CCN just receives the (∑ (NRSRP-RSRP)/∑ adjacent cell group edge that each candidate cell is reported respectively
User's spectrum efficiency) the maximum N number of adjacent cell of value ID.
In practical application, each edge customer can report a spectral efficiency values and the ID of several adjacent cells and this is several
Individual adjacent cell compares (NRSRP-RSRP) value of the candidate cell of own home, therefore, by taking candidate cell X as an example, formula ∑
(NRSRP-RSRP)/∑ adjacent cell group edge customer spectrum efficiency) refer to " all edge customer institutes for having reported candidate cell X
The spectrum efficiency that (NRSRP-RSRP) value for reporting is cumulative/all to have reported candidate cell X edge customer to be reported adds up ".
Step 110：CCN determines each candidate cell based on the edge customer average spectral efficiency (ase) that each candidate cell is reported
Processing priority.
Have collected in the cycle each candidate cell report information after, CCN needs what is reported based on each candidate cell
Edge customer average spectral efficiency (ase) determines the processing priority of each candidate cell, can specifically use but be not limited to lower section
Method：
First method is：Edge customer average spectral efficiency (ase) that CCN is reported according to each candidate cell is from small to large
Order carries out priority ranking to each candidate cell, as the foundation of priority scheduling, wherein, edge customer average frequency efficiency
Smaller candidate cell priority is higher.
The higher candidate cell of priority obtains anti-tampering coordinated manipulation (also referred to as interference avoids or cooperated), edge first
User's average spectral efficiency (ase) can be increased, and priority can be reduced when next round sorts, therefore, and each is waited using this scheme
Select relatively just for cell.
Second method is：Reserved vip interface, VIP grades of candidate cells can preferentially obtain anti-tampering coordinated manipulation, pass through station
Point common parameter sets VIP websites.Specially：Priority row by VIP grades of candidate cells is highest, then, according to each candidate
The order of the edge customer average spectral efficiency (ase) that cell is reported from small to large carries out priority row to each remaining candidate cell
Sequence, wherein, the smaller candidate cell priority of edge customer average spectral efficiency (ase) is higher.
In addition to above two method, also a kind of method for simplifying：Each candidate can be determined using poll selection mechanism
The random priority of cell, i.e., the processing priority of each candidate cell is random, and CCN uses the current random read take of polling mechanism
To which candidate cell, the priority of this candidate cell is just current highest.
Step 120：CCN chooses small based on each candidate cell successively according to the processing priority of each candidate cell
Area, wherein, a main plot is often chosen, adjacent cell recurrence selection is carried out for current main plot according to setting number of times, and will
The adjacent cell that current main plot and correspondence is chosen is divided into cluster.
In the embodiment of the present invention, by taking any one main plot as an example, the concrete mode for introducing CCN execution steps 120 is as follows：
First way is：Adjacent cell recurrence selection is carried out based on the current main plot of 2 pairs of number of times of setting, and will be current
The adjacent cell of main plot and corresponding selection is divided into cluster；
For example：Assuming that current candidate cell is main plot 1, then CCN first searches each adjacent cell that main plot 1 is reported
(i.e. 1 grade selection), then each adjacent cell (i.e. 2 grades selections) that each adjacent cell of main plot 1 is reported is searched, finally, CCN will be led
The adjacent cell of each adjacent cell of cell 1, each adjacent cell of main plot 1 and main plot 1, is attributed to cluster, is defined as small
Area's cluster 1.
Certainly, in a subsequent step, CCN (can exclude cell cluster 1 to be included in remaining candidate set
All cells) in choose a main plot 2 again, and adopt and select cell cluster 2 in a like fashion；And so on.
Of course, it is possible to be determined to choose the number of times of main plot according to the scale of candidate set, it will not be repeated here.
The second way is：Adjacent cell recurrence selection is carried out to current main plot based on setting number of times M, M is infinity,
Untill choosing less than any adjacent cell, then the adjacent cell that current main plot and correspondence are chosen is divided into cluster.
For example：Assuming that current candidate cell is main plot 1, then CCN first searches each adjacent cell that main plot 1 is reported
(i.e. 1 grade selection), then each adjacent cell (i.e. 2 grades selections) ... ... that each adjacent cell of main plot 1 is reported is searched, so hold
It is continuous to search, (think naturally to disconnect with other candidate cells) untill all candidate cells one closed set of formation of selection；
Finally, each candidate cell selected by main plot 1 and based on main plot 1 is attributed to cluster, is defined as cell cluster 1.It is this
The benefit of cluster-dividing method is naturally to avoid interference, it is to avoid the edge customer between cluster cannot be coordinated.
Certainly, in a subsequent step, CCN (can exclude cell cluster 1 to be included in remaining candidate set
All cells) in choose a main plot 2 again, and adopt and select cell cluster 2 in a like fashion；And so on.
Of course, it is possible to be determined to choose the number of times of main plot according to the scale of candidate set, it will not be repeated here.
The third mode is：Adjacent cell recurrence selection is carried out to current main plot based on setting number of times M, M is infinity,
Until the number sum for the adjacent cell that current main plot and correspondence is chosen is reached in default cell cluster in candidate cell number
Untill limit value, then the adjacent cell that current main plot and correspondence are chosen is divided into cluster.
For example：Assuming that current candidate cell is main plot 1, then CCN first searches each adjacent cell that main plot 1 is reported
(i.e. 1 grade selection), then each adjacent cell (i.e. 2 grades selections) ... ... that each adjacent cell of main plot 1 is reported is searched, so hold
It is continuous to search, until the number of all candidate cells of selection is reached in default cell cluster untill candidate cell number higher limit；
Finally, each candidate cell selected based on main plot 1 and based on main plot 1 is attributed to cluster, is defined as cell cluster 1.
The third mode is the prioritization scheme of the second way, can be in the case where edge customer is more, it is to avoid cluster
Scale is excessive, while the implementation result for reducing treating capacity can also be taken into account, has ensured edge customer experience.
Step 130：CCN carries out anti-tampering coordinated manipulation in each cluster for edge customer.
Specially：CCN coordinates the skill that application makes edge customer experience lifting according to sub-clustering result only in each cell cluster
Art (e.g., the multiple technologies such as COMP JT/JR and ICIC/eICIC).Due to the result after sub-clustering avoided it is two adjacent small
Area edge region uses the possibility of identical frequency, therefore, it can the possibility disturbed between effectively two cells of reduction.
In the above-described embodiments, coordination mode is adjusted at any time for the mobility of matched edges user, preferably, CCN
According to setting cycle perform step 100- steps 130 so that with edge customer movement dynamically periodically repartition
The cell cluster of cooperation, and anti-do is carried out for current edge customer in each cluster based on the cell cluster continuation repartitioned
Disturb coordinated manipulation.
Based on above-described embodiment, as shown in fig.2, in the embodiment of the present invention, CCN includes the processing of communication unit 20, first
Unit 21, the processing unit 23 of second processing unit 22 and the 3rd, wherein,
Communication unit 20, for determining candidate set, receives the edge customer that each candidate cell is reported respectively
Average spectral efficiency (ase) and N number of adjacent cell ID；
First processing units 21, for determining each based on the edge customer average spectral efficiency (ase) that each candidate cell is reported
The processing priority of candidate cell；
Second processing unit 22, each candidate cell is chosen for the processing priority according to each candidate cell successively
For main plot, wherein, a main plot is often chosen, adjacent cell recurrence choosing is carried out for current main plot according to setting number of times
Take, and the adjacent cell that current main plot and correspondence are chosen is divided into cluster；
3rd processing unit 23, for carrying out anti-tampering coordinated manipulation for edge customer in each cluster.
Communication unit 20 specifically for：
Receive the ID of N number of adjacent cell of (NRSRP-RSRP) maximum that candidate cell is reported；Or,
Receive the ID of the N number of adjacent cell for the adjacent cell group edge customer average spectral efficiency (ase) minimum that candidate cell is reported；Or
Person,
Receive the value of (∑ (NRSRP-RSRP)/∑ adjacent cell group edge customer spectrum efficiency) that candidate cell is reported most
The ID of big N number of adjacent cell.
Determine that the processing of each candidate cell is preferential based on the edge customer average spectral efficiency (ase) that each candidate cell is reported
Level when, first processing units 21 specifically for：
The order of the edge customer average spectral efficiency (ase) reported according to each candidate cell from small to large is to each candidate cell
Priority ranking is carried out, wherein, the smaller candidate cell priority of edge customer average spectral efficiency (ase) is higher；Or,
Priority row by VIP grades of candidate cells is highest, the edge customer average frequency spectrum reported according to each candidate cell
The order of efficiency from small to large carries out priority ranking to each remaining candidate cell, wherein, edge customer average frequency spectrum effect
The smaller candidate cell priority of rate is higher.
A main plot is chosen, adjacent cell recurrence selection is carried out for current main plot according to setting number of times, and ought
When the adjacent cell that preceding main plot and correspondence are chosen is divided into cluster, second processing unit 22 specifically for：
Adjacent cell recurrence selection is carried out based on the current main plot of 2 pairs of number of times of setting, and by current main plot and correspondingly
The adjacent cell of selection is divided into cluster；Or,
Adjacent cell recurrence selection is carried out to current main plot based on setting number of times M, M is infinity, until choose less than
Untill any adjacent cell, then the adjacent cell that current main plot and correspondence are chosen is divided into cluster；Or,
Adjacent cell recurrence selection is carried out to current main plot based on setting number of times M, M is infinity, until current master
The number sum of cell and the adjacent cell correspondingly chosen is reached in default cell cluster untill candidate cell number higher limit, then is incited somebody to action
The adjacent cell that current main plot and correspondence is chosen is divided into cluster.
Second processing unit 22 is further used for：Cell cluster is repartitioned according to the cycle of setting；
3rd processing unit 23 is further used for：Continued based on the cell cluster repartitioned in each cluster for current
Edge customer carry out anti-tampering coordinated manipulation.
As shown in fig.3, in the embodiment of the present invention, CCN includes communication unit 30 and processor 31, wherein,
COM1 30, for determining candidate set, receives the edge customer that each candidate cell is reported respectively
Average spectral efficiency (ase) and N number of adjacent cell ID；
Processor 31, for determining that each candidate is small based on the edge customer average spectral efficiency (ase) that each candidate cell is reported
The processing priority in area；And each candidate cell is chosen successively for main plot according to the processing priority of each candidate cell,
Wherein, a main plot is often chosen, adjacent cell recurrence selection is carried out for current main plot according to setting number of times, and will be current
Main plot and correspondence choose adjacent cell be divided into cluster；And for the anti-tampering association of edge customer progress in each cluster
Adjust operation.
COM1 30 specifically for：
Receive the ID of N number of adjacent cell of (NRSRP-RSRP) maximum that candidate cell is reported；Or,
Receive the ID of the N number of adjacent cell for the adjacent cell group edge customer average spectral efficiency (ase) minimum that candidate cell is reported；Or
Person,
Receive the value of (∑ (NRSRP-RSRP)/∑ adjacent cell group edge customer spectrum efficiency) that candidate cell is reported most
The ID of big N number of adjacent cell.
Determine that the processing of each candidate cell is preferential based on the edge customer average spectral efficiency (ase) that each candidate cell is reported
Level when, processor 31 specifically for：
The order of the edge customer average spectral efficiency (ase) reported according to each candidate cell from small to large is to each candidate cell
Priority ranking is carried out, wherein, the smaller candidate cell priority of edge customer average spectral efficiency (ase) is higher；Or,
Priority row by VIP grades of candidate cells is highest, the edge customer average frequency spectrum reported according to each candidate cell
The order of efficiency from small to large carries out priority ranking to each remaining candidate cell, wherein, edge customer average frequency spectrum effect
The smaller candidate cell priority of rate is higher.
A main plot is chosen, adjacent cell recurrence selection is carried out for current main plot according to setting number of times, and ought
When the adjacent cell that preceding main plot and correspondence are chosen is divided into cluster, processor 31 specifically for：
Adjacent cell recurrence selection is carried out based on the current main plot of 2 pairs of number of times of setting, and by current main plot and correspondingly
The adjacent cell of selection is divided into cluster；Or,
Adjacent cell recurrence selection is carried out to current main plot based on setting number of times M, M is infinity, until choose less than
Untill any adjacent cell, then the adjacent cell that current main plot and correspondence are chosen is divided into cluster；Or,
Adjacent cell recurrence selection is carried out to current main plot based on setting number of times M, M is infinity, until current master
The number sum of cell and the adjacent cell correspondingly chosen is reached in default cell cluster untill candidate cell number higher limit, then is incited somebody to action
The adjacent cell that current main plot and correspondence is chosen is divided into cluster.
Processor 31 is further used for：Cycle according to setting repartitions cell cluster, and small based on what is repartitioned
Area's cluster continues to carry out anti-tampering coordinated manipulation for current edge customer in each cluster.
In summary, in the embodiment of the present invention, on the premise of interference is not introduced, form multigroup cell dependent coordination and close
System, specifically, edge customer average spectral efficiency (ase) and N number of adjacent cell ID that CCN is reported according to each candidate cell, are first determined
The processing priority of each candidate cell, each candidate cell is chosen according still further to processing priority for main plot successively, its
In, a main plot is often chosen, adjacent cell recurrence selection is carried out for current main plot according to setting number of times, and will be current
The adjacent cell that main plot and correspondence are chosen is divided into cluster, finally, then is prevented respectively for edge customer in each cluster
Interference coordination is operated.
So, the possibility that two neighbor cell fringe regions use identical frequency is just eliminated to the full extent, reduction
The possibility disturbed between two candidate cells, so as to both improve the overall edge user throughput of system, improves institute
There is the overall performance of the edge customer of candidate cell, coordinated management expense is reduced again, especially when candidate set is larger
When, performance boost is especially notable.
Further, when edge customer is moved to other cell edge regions, using what is provided in the embodiment of the present invention
Technical scheme may also enough correct cooperation cell cluster in time, so as to adjust coordination mode at any time.
It should be understood by those skilled in the art that, embodiments of the invention can be provided as method, system or computer program
Product.Therefore, the present invention can be using the reality in terms of complete hardware embodiment, complete software embodiment or combination software and hardware
Apply the form of example.Moreover, the present invention can be used in one or more computers for wherein including computer usable program code
The computer program production that usable storage medium is implemented on (including but is not limited to magnetic disk storage, CD-ROM, optical memory etc.)
The form of product.
The present invention is the flow with reference to method according to embodiments of the present invention, equipment (system) and computer program product
Figure and/or block diagram are described.It should be understood that can be by every first-class in computer program instructions implementation process figure and/or block diagram
Journey and/or the flow in square frame and flow chart and/or block diagram and/or the combination of square frame.These computer programs can be provided
The processor of all-purpose computer, special-purpose computer, Embedded Processor or other programmable data processing devices is instructed to produce
A raw machine so that produced by the instruction of computer or the computing device of other programmable data processing devices for real
The device for the function of being specified in present one flow of flow chart or one square frame of multiple flows and/or block diagram or multiple square frames.
These computer program instructions, which may be alternatively stored in, can guide computer or other programmable data processing devices with spy
Determine in the computer-readable memory that mode works so that the instruction being stored in the computer-readable memory, which is produced, to be included referring to
Make the manufacture of device, the command device realize in one flow of flow chart or multiple flows and/or one square frame of block diagram or
The function of being specified in multiple square frames.
These computer program instructions can be also loaded into computer or other programmable data processing devices so that in meter
Series of operation steps is performed on calculation machine or other programmable devices to produce computer implemented processing, thus in computer or
The instruction performed on other programmable devices is provided for realizing in one flow of flow chart or multiple flows and/or block diagram one
The step of function of being specified in individual square frame or multiple square frames.
, but those skilled in the art once know basic creation although preferred embodiments of the present invention have been described
Property concept, then can make other change and modification to these embodiments.So, appended claims are intended to be construed to include excellent
Select embodiment and fall into having altered and changing for the scope of the invention.
Obviously, those skilled in the art can carry out various changes and modification without departing from this hair to the embodiment of the present invention
The spirit and scope of bright embodiment.So, if these modifications and variations of the embodiment of the present invention belong to the claims in the present invention
And its within the scope of equivalent technologies, then the present invention is also intended to comprising including these changes and modification.
Claims (10)
1. a kind of anti-tampering sub-clustering management method, it is characterised in that including：
Candidate set is determined, edge customer average spectral efficiency (ase) and N number of neighbour that each candidate cell is reported are received respectively
Cell ID, wherein, N is the natural number of setting；
The processing priority of each candidate cell is determined based on the edge customer average spectral efficiency (ase) that each candidate cell is reported；
Processing priority according to each candidate cell chooses each candidate cell for main plot successively, wherein, often choose one
Individual main plot, adjacent cell recurrence selection is carried out according to setting number of times for current main plot, and by current main plot and right
The adjacent cell that should be chosen is divided into cluster；
In each cluster anti-tampering coordinated manipulation is carried out for edge customer.
2. the method as described in claim 1, it is characterised in that receive N number of adjacent cell ID that any one candidate cell is reported,
Including：
Receive (adjacent area Reference Signal Received Power NRSRP- Reference Signal Received Power RSRP) that the candidate cell reports most
The ID of big N number of adjacent cell；Or,
Receive the ID of the N number of adjacent cell for the adjacent cell group edge customer average spectral efficiency (ase) minimum that the candidate cell is reported；Or
Person,
Receive the value of (∑ (NRSRP-RSRP)/∑ adjacent cell group edge customer spectrum efficiency) that the candidate cell is reported most
The ID of big N number of adjacent cell.
3. the method as described in claim 1, it is characterised in that the edge customer average frequency spectrum reported based on each candidate cell
Efficiency determines the processing priority of each candidate cell, including：
The order of the edge customer average spectral efficiency (ase) reported according to each candidate cell from small to large is carried out to each candidate cell
Priority ranking, wherein, the smaller candidate cell priority of edge customer average spectral efficiency (ase) is higher；Or,
Priority row by VIP grades of candidate cells is highest, the edge customer average spectral efficiency (ase) reported according to each candidate cell
Order from small to large carries out priority ranking to each remaining candidate cell, wherein, edge customer average spectral efficiency (ase) is got over
Small candidate cell priority is higher.
4. the method as described in claim 1,2 or 3, it is characterised in that choose a main plot, according to setting number of times for working as
Preceding main plot carries out adjacent cell recurrence selection, and the adjacent cell that current main plot and correspondence are chosen is divided into cluster, wraps
Include：
Adjacent cell recurrence selection is carried out based on the current main plot of 2 pairs of number of times of setting, and current main plot and correspondence are chosen
Adjacent cell be divided into cluster；Or,
Adjacent cell recurrence selection is carried out to current main plot based on setting number of times M, M is infinity, until choosing less than any
Untill adjacent cell, then the adjacent cell that current main plot and correspondence are chosen is divided into cluster；Or,
Adjacent cell recurrence selection is carried out to current main plot based on setting number of times M, M is infinity, until current main plot
And the number sum of the adjacent cell of correspondence selection is reached in default cell cluster untill candidate cell number higher limit, then will be current
Main plot and correspondence choose adjacent cell be divided into cluster.
5. method as claimed in claim 4, it is characterised in that further comprise：
Cycle according to setting repartitions cell cluster, and is continued based on the cell cluster repartitioned in each cluster for working as
Preceding edge customer carries out anti-tampering coordinated manipulation.
6. a kind of anti-tampering sub-clustering managing device, it is characterised in that including：
Communication unit, for determining candidate set, receives the edge customer averagely frequency that each candidate cell is reported respectively
Spectrum efficiency and N number of adjacent cell ID, wherein, N is the natural number of setting；
First processing units, for determining that each candidate is small based on the edge customer average spectral efficiency (ase) that each candidate cell is reported
The processing priority in area；
Second processing unit, chooses small based on each candidate cell successively for the processing priority according to each candidate cell
Area, wherein, a main plot is often chosen, adjacent cell recurrence selection is carried out for current main plot according to setting number of times, and will
The adjacent cell that current main plot and correspondence is chosen is divided into cluster；
3rd processing unit, for carrying out anti-tampering coordinated manipulation for edge customer in each cluster.
7. device as claimed in claim 6, it is characterised in that receive N number of adjacent cell ID that any one candidate cell is reported
When, the communication unit specifically for：
Receive (adjacent area Reference Signal Received Power NRSRP- Reference Signal Received Power RSRP) that the candidate cell reports most
The ID of big N number of adjacent cell；Or,
Receive the ID of the N number of adjacent cell for the adjacent cell group edge customer average spectral efficiency (ase) minimum that the candidate cell is reported；Or
Person,
Receive the value of (∑ (NRSRP-RSRP)/∑ adjacent cell group edge customer spectrum efficiency) that the candidate cell is reported most
The ID of big N number of adjacent cell.
8. device as claimed in claim 6, it is characterised in that the edge customer average frequency spectrum reported based on each candidate cell
When efficiency determines the processing priority of each candidate cell, the first processing units specifically for：
The order of the edge customer average spectral efficiency (ase) reported according to each candidate cell from small to large is carried out to each candidate cell
Priority ranking, wherein, the smaller candidate cell priority of edge customer average spectral efficiency (ase) is higher；Or,
Priority row by VIP grades of candidate cells is highest, the edge customer average spectral efficiency (ase) reported according to each candidate cell
Order from small to large carries out priority ranking to each remaining candidate cell, wherein, edge customer average spectral efficiency (ase) is got over
Small candidate cell priority is higher.
9. the device as described in claim 6,7 or 8, it is characterised in that choose a main plot, according to setting number of times for working as
Preceding main plot carries out adjacent cell recurrence selection, and when the adjacent cell of current main plot and correspondence selection is divided into cluster,
The second processing unit specifically for：
Adjacent cell recurrence selection is carried out based on the current main plot of 2 pairs of number of times of setting, and current main plot and correspondence are chosen
Adjacent cell be divided into cluster；Or,
Adjacent cell recurrence selection is carried out to current main plot based on setting number of times M, M is infinity, until choosing less than any
Untill adjacent cell, then the adjacent cell that current main plot and correspondence are chosen is divided into cluster；Or,
Adjacent cell recurrence selection is carried out to current main plot based on setting number of times M, M is infinity, until current main plot
And the number sum of the adjacent cell of correspondence selection is reached in default cell cluster untill candidate cell number higher limit, then will be current
Main plot and correspondence choose adjacent cell be divided into cluster.
10. device as claimed in claim 9, it is characterised in that the second processing unit is further used for：According to setting
Cycle repartitions cell cluster；
3rd processing unit is further used for：Continue to be directed to currently in each cluster based on the cell cluster repartitioned
Edge customer carries out anti-tampering coordinated manipulation.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410208574.8A CN103997738B (en) | 2014-05-16 | 2014-05-16 | A kind of anti-tampering sub-clustering management method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410208574.8A CN103997738B (en) | 2014-05-16 | 2014-05-16 | A kind of anti-tampering sub-clustering management method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103997738A CN103997738A (en) | 2014-08-20 |
| CN103997738B true CN103997738B (en) | 2017-09-15 |
Family
ID=51311714
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410208574.8A Active CN103997738B (en) | 2014-05-16 | 2014-05-16 | A kind of anti-tampering sub-clustering management method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103997738B (en) |
Families Citing this family (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105636066B (en) * | 2014-10-31 | 2019-04-26 | 杭州华为数字技术有限公司 | The method of cell sub-clustering and base station |
| CN104640193A (en) * | 2015-01-30 | 2015-05-20 | 中国联合网络通信集团有限公司 | Interference coordination method and device |
| CN104734830B (en) * | 2015-03-05 | 2017-12-26 | 京信通信技术(广州)有限公司 | A kind of method and apparatus for configuring frequency range |
| CN109996238B (en) * | 2017-12-29 | 2022-04-01 | 中国移动通信集团上海有限公司 | C-RAN network planning method and device |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101827383A (en) * | 2009-03-06 | 2010-09-08 | 大唐移动通信设备有限公司 | Method and base station for predicting time-frequency resources |
| CN101827445A (en) * | 2010-03-02 | 2010-09-08 | 北京邮电大学 | Inter-station interference coordinating and pre-coding scheme for multi-antenna OFDMA system |
| CN102006599A (en) * | 2010-11-05 | 2011-04-06 | 北京邮电大学 | Interference suppression method of hybrid network of macrocell and Femtocell |
| CN102111779A (en) * | 2011-03-16 | 2011-06-29 | 北京邮电大学 | Shared method and system of uplink frequency spectrum |
-
2014
- 2014-05-16 CN CN201410208574.8A patent/CN103997738B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101827383A (en) * | 2009-03-06 | 2010-09-08 | 大唐移动通信设备有限公司 | Method and base station for predicting time-frequency resources |
| CN101827445A (en) * | 2010-03-02 | 2010-09-08 | 北京邮电大学 | Inter-station interference coordinating and pre-coding scheme for multi-antenna OFDMA system |
| CN102006599A (en) * | 2010-11-05 | 2011-04-06 | 北京邮电大学 | Interference suppression method of hybrid network of macrocell and Femtocell |
| CN102111779A (en) * | 2011-03-16 | 2011-06-29 | 北京邮电大学 | Shared method and system of uplink frequency spectrum |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103997738A (en) | 2014-08-20 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Li et al. | Multi-armed-bandit-based spectrum scheduling algorithms in wireless networks: A survey | |
| Liu et al. | Joint clustering and inter-cell resource allocation for CoMP in ultra dense cellular networks | |
| CN104955077B (en) | A kind of heterogeneous network cell cluster-dividing method and device based on user experience speed | |
| CN104335628B (en) | Wireless multi-site capacity is coordinated | |
| CN103997738B (en) | A kind of anti-tampering sub-clustering management method and device | |
| CN101600212A (en) | Improving one's methods of a kind of soft-frequency reuse that is used for ofdm system | |
| CN104717755A (en) | Downlink frequency spectrum resource distribution method with D2D technology introduced in cellular network | |
| CN103826306B (en) | A kind of descending dynamic interference coordination method in highly dense set network based on game | |
| EP3451731A1 (en) | Cell clustering method, spectrum overlapping multiplexing method based on method, and device thereof | |
| CN103209472B (en) | A kind of method and system for carrying out cooperative scheduling inter-cell uplink interference coordination | |
| CN104918256B (en) | A kind of transmission dispatching method and device | |
| CN114423028B (en) | CoMP-NOMA cooperative clustering and power distribution method based on multi-agent deep reinforcement learning | |
| CN104581974B (en) | Dynamic base-station collaboration method based on orthogonal resource in super-intensive network | |
| CN105517179A (en) | Wireless resource scheduling method and scheduler | |
| CN104378785B (en) | The ascending-descending subframes method for reconfiguration and device of a kind of Microcell | |
| CN103428702A (en) | Resource allocation method for controlling inter-cell interference | |
| CN108882379A (en) | Electric power wireless private network uplink scheduling method and device | |
| Wu et al. | A joint resource allocation scheme for OFDMA-based wireless networks with carrier aggregation | |
| CN107277924A (en) | Dynamic frequency multiplexing method based on type of service in a kind of LTE system | |
| CN104618912B (en) | Isomery cognition wireless network resource allocation methods based on frequency spectrum perception | |
| Huang et al. | Geometric approach based resource allocation in heterogeneous cellular networks | |
| CN108738028B (en) | Clustering method under ultra-dense networking | |
| CN106060945A (en) | LTE resource scheduling algorithm based on RB feedback | |
| CN102480734B (en) | Time-frequency resource distributing method and device | |
| CN104734830B (en) | A kind of method and apparatus for configuring frequency range |
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 |