CN103997738A - Anti-interference clustering management method and device - Google Patents
Anti-interference clustering management method and device Download PDFInfo
- Publication number
- CN103997738A CN103997738A CN201410208574.8A CN201410208574A CN103997738A CN 103997738 A CN103997738 A CN 103997738A CN 201410208574 A CN201410208574 A CN 201410208574A CN 103997738 A CN103997738 A CN 103997738A
- Authority
- CN
- China
- Prior art keywords
- cell
- adjacent cell
- main plot
- candidate
- edge customer
- 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.)
- Granted
Links
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention relates to the communication technology and discloses an anti-interference clustering management method and device which are used for effectively improving the overall throughput of edge users in large-scale network architecture. The method includes the steps that according to the average spectrum efficiency of the edge users and IDs of N neighboring cells reported by each candidate cell, all the candidate cells are selected as primary cells sequentially by a CCN according to the processing priority, wherein every time one primary cell is selected, a set number of times of neighboring cell recursive selection is performed on the current primary cell, the current primary cell and the correspondingly selected neighboring cells are grouped into a cluster, and then anti-interference coordination operation is performed on the edge users in each cluster. Thus, the probability that the same frequency is used in the edge regions of two adjacent cells is eliminated, the probability of interference between two candidate cells is reduced, and thus the overall throughput of the edge users of the system is improved, the overall performance of the edge users of al the candidate cells is promoted, and coordinated management expenditure is reduced.
Description
Technical field
The present invention relates to the communications field, particularly a kind of anti-tampering sub-clustering management method and device.
Background technology
Along with Long Term Evolution (Long Term Evolution, LTE) technology is extensive extensive commercial, the traffic demand hypervelocity of data service increases, and bearer network is continuous extended network scale in business development process also.Under, networking complicated situation huge in network size, network management difficulty increases, and the stability of a system declines, O&M Efficiency Decreasing, and these factors all can have influence on the normal management of existing network equipment.
OFDM (the Orthogonal Frequency Division Multiplexing that LTE system adopts, OFDM) on technological essence, be a kind of OFDM+ time division multiple access (Time Division Multiple Access, TDMA) technology, for the different user in same community, can be distinguished by the difference of time and subcarrier.In order to reach the highest spectrum efficiency, LTE system adopts identical networking mode conventionally, and each neighbor cell adopts identical carrier wave.Now, the different user of neighbor cell, the particularly user in cell edge, there is the probability of the same frequency signal of receiving at one time two or more communities, and in the time that the homogenous frequency signal from each community is stronger, this user will be subject to severe jamming, affect communication quality.
In order to promote the performance of edge customer, LTE and long-term evolution upgrading (Long Term Evolution-Advanced, LTE-A) introduced multipoint cooperative (Coordinated Multiple Points, CoMP) combine transmission (Joint transmission, JT)/combine reception (Joint reception, and Inter-Cell Interference Coordination (Inter-Cell Interference Coordination JR), ICIC)/enhancing Inter-Cell Interference Coordination (enhanced Inter-Cell Interference Coordination, the multiple technologies such as eICIC), the main thought of these technology is all that each community is divided into central area (Cell Center) and fringe region (Cell Edge), according to the residing position of user, distribute respectively different subcarriers for each edge customer, or, in section, the resource of coordinated scheduling different districts is only a certain edge customer service at one time.Like this, the fringe region of having eliminated theoretically two neighbor cells uses the possibility of same frequency, thereby reduces the possibility of disturbing between two neighbor cells.
The realization mechanism of industry comprises following several at present:
The first mechanism is: according to disposal ability is fixing, microzonation is divided into multiple bunches, the multiple interference coordination/cooperation technologies such as above-mentioned COMP JT/JR and ICIC/eICIC only bunch in use, only control between the user who belongs to same cluster and use different frequencies.
But, adopt the first when mechanism, the user between bunch can not get interference coordination/cooperation, physical location near but do not belong between the user of same cluster and still have co-channel interference, thereby cause edge customer to experience poor service quality problem.
The second mechanism is: the unified management of all communities, coordination, scheduling.
But, adopt the second when mechanism, because number of cells is many, this technology to realize difficulty, administration overhead and the corresponding time delay of bringing just larger, thereby cause edge customer to can not get responding timely processing, and then cause edge customer to experience poor service quality problem.
Summary of the invention
The embodiment of the present invention provides a kind of anti-tampering sub-clustering management method and device, in order under large scale network framework, effectively improves overall edge customer throughput, improves system service quality.
The concrete technical scheme that the embodiment of the present invention provides is as follows:
First aspect, a kind of anti-tampering sub-clustering management method, comprising:
Determine candidate set, receive respectively edge customer average spectral efficiency (ase) and N adjacent cell ID that each candidate cell reports, wherein, N is the natural number of setting;
The edge customer average spectral efficiency (ase) reporting based on each candidate cell is determined the processing priority of each candidate cell;
Choosing successively each candidate cell according to the processing priority of each candidate cell is main plot, wherein, often choose a main plot, carry out adjacent cell recurrence according to set point number for current main plot and choose, and current main plot and the corresponding adjacent cell of choosing are divided into cluster;
In each bunch, carry out anti-tampering coordinated manipulation for edge customer.
Like this, just eliminated to the full extent the possibility of two neighbor cell fringe region use same frequencys, reduce the possibility of disturbing between two candidate cells, thereby both improved the edge customer throughput of entire system, promote the overall performance of the edge customer of all candidate cells, reduced again coordinated management expense, especially, in the time that candidate set is larger, performance boost is especially remarkable.
In conjunction with first aspect, in the possible implementation of the first, receive N the adjacent cell ID that any one candidate cell reports, comprising:
Receive the ID of N maximum adjacent cell of (NRSRP-RSRP) that described candidate cell reports; Or,
Receive the ID of N adjacent cell of the adjacent cell group edge customer average spectral efficiency (ase) minimum that described candidate cell reports; Or,
Receive the ID of N adjacent cell of the value maximum of (∑ (NRSRP-RSRP)/∑ adjacent cell group edge customer spectrum efficiency) that described candidate cell reports.
In conjunction with first aspect, in the possible implementation of the second, the edge customer average spectral efficiency (ase) reporting based on each candidate cell is determined the processing priority of each candidate cell, comprising:
The edge customer average spectral efficiency (ase) reporting according to each candidate cell order is from small to large carried out prioritization to each candidate cell, and wherein, the candidate cell priority that edge customer average spectral efficiency (ase) is less is higher; Or,
The priority of VIP level candidate cell is arranged as the highest, the edge customer average spectral efficiency (ase) reporting according to each candidate cell order is from small to large carried out prioritization to remaining each candidate cell, wherein, the candidate cell priority that edge customer average spectral efficiency (ase) is less is higher.
In conjunction with the first or the possible implementation of the second of first aspect or first aspect, in the third possible implementation, choose a main plot, carrying out adjacent cell recurrence according to set point number for current main plot chooses, and current main plot and the corresponding adjacent cell of choosing are divided into cluster, comprising:
Based on set point number 2, adjacent cell recurrence is carried out in current main plot and choose, and current main plot and the corresponding adjacent cell of choosing are divided into cluster; Or,
Based on set point number M, adjacent cell recurrence is carried out in current main plot and choose, M is infinitely great, until choose less than any adjacent cell, more current main plot and the corresponding adjacent cell of choosing are divided into cluster; Like this, can be natural avoid interference, the edge customer between having avoided bunch can not get coordinating; Or,
Based on set point number M, adjacent cell recurrence being carried out in current main plot chooses, M is infinitely great, until the number sum of current main plot and the corresponding adjacent cell of choosing reaches candidate cell number higher limit in default cell cluster, more current main plot and the corresponding adjacent cell of choosing are divided into cluster.Like this, can be in the situation that edge customer to be more, the scale of avoiding bunch is excessive, also can take into account the implementation result that reduces treating capacity simultaneously, has ensured edge customer experience.
In conjunction with the third possible implementation of first aspect, in the 4th kind of possible implementation, further comprise:
Cycle according to setting is repartitioned cell cluster, and continues to carry out anti-tampering coordinated manipulation for current edge customer in each bunch based on the cell cluster of repartitioning.
Like this, can dynamically periodically repartition with the movement of edge customer the cell cluster of cooperation, and continue to carry out anti-tampering coordinated manipulation for current edge customer in each bunch based on the cell cluster of repartitioning.
Second aspect, a kind of anti-tampering sub-clustering management devices, comprising:
Communication unit, for determining candidate set, receives respectively edge customer average spectral efficiency (ase) and N adjacent cell ID that each candidate cell reports;
The first processing unit, determines the processing priority of each candidate cell for the edge customer average spectral efficiency (ase) reporting based on each candidate cell;
The second processing unit, be main plot for choosing successively each candidate cell according to the processing priority of each candidate cell, wherein, often choose a main plot, carry out adjacent cell recurrence according to set point number for current main plot and choose, and current main plot and the corresponding adjacent cell of choosing are divided into cluster;
The 3rd processing unit, for carrying out anti-tampering coordinated manipulation for edge customer in each bunch.
Like this, just eliminated to the full extent the possibility of two neighbor cell fringe region use same frequencys, reduce the possibility of disturbing between two candidate cells, thereby both improved the edge customer throughput of entire system, promote the overall performance of the edge customer of all candidate cells, reduced again coordinated management expense, especially, in the time that candidate set is larger, performance boost is especially remarkable.
In conjunction with second aspect, in the possible implementation of the first, described communication unit specifically for:
Receive the ID of N maximum adjacent cell of (NRSRP-RSRP) that described candidate cell reports; Or,
Receive the ID of N adjacent cell of the adjacent cell group edge customer average spectral efficiency (ase) minimum that described candidate cell reports; Or,
Receive the ID of N adjacent cell of the value maximum of (∑ (NRSRP-RSRP)/∑ adjacent cell group edge customer spectrum efficiency) that described candidate cell reports.
In conjunction with second aspect, in the possible implementation of the second, when the edge customer average spectral efficiency (ase) reporting based on each candidate cell is determined the processing priority of each candidate cell, described the first processing unit specifically for:
The edge customer average spectral efficiency (ase) reporting according to each candidate cell order is from small to large carried out prioritization to each candidate cell, and wherein, the candidate cell priority that edge customer average spectral efficiency (ase) is less is higher; Or,
The priority of VIP level candidate cell is arranged as the highest, the edge customer average spectral efficiency (ase) reporting according to each candidate cell order is from small to large carried out prioritization to remaining each candidate cell, wherein, the candidate cell priority that edge customer average spectral efficiency (ase) is less is higher.
In conjunction with the first or the possible implementation of the second of second aspect or second aspect, in the third possible implementation, choose a main plot, carrying out adjacent cell recurrence according to set point number for current main plot chooses, and when current main plot and the corresponding adjacent cell of choosing are divided into cluster, described the second processing unit specifically for:
Based on set point number 2, adjacent cell recurrence is carried out in current main plot and choose, and current main plot and the corresponding adjacent cell of choosing are divided into cluster; Or,
Based on set point number M, adjacent cell recurrence is carried out in current main plot and choose, M is infinitely great, until choose less than any adjacent cell, more current main plot and the corresponding adjacent cell of choosing are divided into cluster; Like this, can be natural avoid interference, the edge customer between having avoided bunch can not get coordinating; Or,
Based on set point number M, adjacent cell recurrence being carried out in current main plot chooses, M is infinitely great, until the number sum of current main plot and the corresponding adjacent cell of choosing reaches candidate cell number higher limit in default cell cluster, more current main plot and the corresponding adjacent cell of choosing are divided into cluster.Like this, can be in the situation that edge customer to be more, the scale of avoiding bunch is excessive, also can take into account the implementation result that reduces treating capacity simultaneously, has ensured edge customer experience.
In conjunction with the third possible implementation of second aspect, in the 4th kind of possible implementation, described the second processing unit is further used for: the cycle according to setting is repartitioned cell cluster;
Described the 3rd processing unit is further used for: continue to carry out anti-tampering coordinated manipulation for current edge customer in each bunch based on the cell cluster of repartitioning.
Like this, can dynamically periodically repartition with the movement of edge customer the cell cluster of cooperation, and continue to carry out anti-tampering coordinated manipulation for current edge customer in each bunch based on the cell cluster of repartitioning.
The third aspect, a kind of anti-tampering sub-clustering management devices, comprising:
Communication port, for determining candidate set, receives respectively edge customer average spectral efficiency (ase) and N adjacent cell ID that each candidate cell reports;
Processor, determines the processing priority of each candidate cell for the edge customer average spectral efficiency (ase) reporting based on each candidate cell; And to choose successively each candidate cell according to the processing priority of each candidate cell be main plot, wherein, often choose a main plot, carry out adjacent cell recurrence according to set point number for current main plot and choose, and current main plot and the corresponding adjacent cell of choosing are divided into cluster; And carry out anti-tampering coordinated manipulation for edge customer in each bunch.
Like this, just eliminated to the full extent the possibility of two neighbor cell fringe region use same frequencys, reduce the possibility of disturbing between two candidate cells, thereby both improved the edge customer throughput of entire system, promote the overall performance of the edge customer of all candidate cells, reduced again coordinated management expense, especially, in the time that candidate set is larger, performance boost is especially remarkable.
In conjunction with the third aspect, in the possible implementation of the first, described communication port specifically for:
Receive the ID of N maximum adjacent cell of (NRSRP-RSRP) that described candidate cell reports; Or,
Receive the ID of N adjacent cell of the adjacent cell group edge customer average spectral efficiency (ase) minimum that described candidate cell reports; Or,
Receive the ID of N adjacent cell of the value maximum of (∑ (NRSRP-RSRP)/∑ adjacent cell group edge customer spectrum efficiency) that described candidate cell reports.
In conjunction with the third aspect, in the possible implementation of the second, when the edge customer average spectral efficiency (ase) reporting based on each candidate cell is determined the processing priority of each candidate cell, described processor specifically for:
The edge customer average spectral efficiency (ase) reporting according to each candidate cell order is from small to large carried out prioritization to each candidate cell, and wherein, the candidate cell priority that edge customer average spectral efficiency (ase) is less is higher; Or,
The priority of VIP level candidate cell is arranged as the highest, the edge customer average spectral efficiency (ase) reporting according to each candidate cell order is from small to large carried out prioritization to remaining each candidate cell, wherein, the candidate cell priority that edge customer average spectral efficiency (ase) is less is higher.
In conjunction with the first or the possible implementation of the second of the third aspect or the third aspect, in the third possible implementation, choose a main plot, carrying out adjacent cell recurrence according to set point number for current main plot chooses, and when current main plot and the corresponding adjacent cell of choosing are divided into cluster, described processor specifically for:
Based on set point number 2, adjacent cell recurrence is carried out in current main plot and choose, and current main plot and the corresponding adjacent cell of choosing are divided into cluster; Or,
Based on set point number M, adjacent cell recurrence is carried out in current main plot and choose, M is infinitely great, until choose less than any adjacent cell, more current main plot and the corresponding adjacent cell of choosing are divided into cluster; Like this, can be natural avoid interference, the edge customer between having avoided bunch can not get coordinating; Or,
Based on set point number M, adjacent cell recurrence being carried out in current main plot chooses, M is infinitely great, until the number sum of current main plot and the corresponding adjacent cell of choosing reaches candidate cell number higher limit in default cell cluster, more current main plot and the corresponding adjacent cell of choosing are divided into cluster.Like this, can be in the situation that edge customer to be more, the scale of avoiding bunch is excessive, also can take into account the implementation result that reduces treating capacity simultaneously, has ensured edge customer experience.
In conjunction with the third possible implementation of the third aspect, in the 4th kind of possible implementation, processor is further used for: the cycle according to setting is repartitioned cell cluster, and continues to carry out anti-tampering coordinated manipulation for current edge customer in each bunch based on the cell cluster of repartitioning.
Like this, can dynamically periodically repartition with the movement of edge customer the cell cluster of cooperation, and continue to carry out anti-tampering coordinated manipulation for current edge customer in each bunch based on the cell cluster of repartitioning.
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 CCN the first structural representation in the embodiment of the present invention;
Fig. 3 is CCN the second structural representation in the embodiment of the present invention.
Embodiment
For under large scale network framework, effectively improve overall edge customer throughput, improve system service quality.In the embodiment of the present invention, the edge customer distribution situation of Real-Time Monitoring the whole network, and divide cluster management based on this large scale network multidate information, eliminate theoretically two neighbor cell fringe regions and use the possibility of same frequency, thereby reduce the possibility of disturbing between Liang Ge community.
Concrete grammar is: the mode that uses step-by-step recursion, first adopt polling mode to obtain first related cell combination, after the adjacent strong jamming community of this cell combination is all got rid of, in residue cell set, select second related cell combination ... so successively get rid of, formulate suitable combination number of times according to overall network size.As ten several set, 3 left and right of recurrence are just much of that; Commercial network in this way, community number is a lot, can increase as one sees fit recurrence number of times.
Below in conjunction with accompanying drawing, the preferred embodiment of the present invention is elaborated.
In practical application, need a policymaker to grasp all cell informations, therefore define a center control nodes (Central control node, CCN) and realize this function.
Consult shown in Fig. 1, in the embodiment of the present invention, it is as follows that CCN carries out the performing step of anti-tampering point of cluster management:
Step 100:CCN determines candidate set, and receives respectively edge customer average spectral efficiency (ase) and N the adjacent cell ID of the respective candidate cells that each candidate cell reports, and wherein, N is default natural number.
In the embodiment of the present invention, so-called edge customer is to determine according to the neighboring BS information reporting the user who is subject to interference to a certain extent and spectral efficiency values to set threshold value (being that channel quality is poor), in subsequent embodiment, all adopt same concept, will repeat no more.
In the embodiment of the present invention, CCN can be based on pre-configured community distribution situation, according to therefrom selected candidate set of administrative staff's instruction, and receive the edge customer average spectral efficiency (ase) of the respective candidate cells that each candidate cell reports and set number destination neighbor cell ID according to the report cycle of setting.Wherein, report cycle can configure voluntarily, preferably, can be configured to ms rank, and in report cycle, CCN thinks that the adjacent cell relation of each candidate cell is constant, and edge customer invariant position in each candidate cell.On the other hand, the edge customer average spectral efficiency (ase) of a candidate cell refers to the mean value of the spectrum efficiency of all edge customers in this candidate cell, and destination neighbor cell ID is counted in the setting of a candidate cell, refer to that the setting of choosing counts the ID of destination neighbor cell from all adjacent cells of a candidate cell, as, the ID of adjacent cell 1, the ID of adjacent cell 2 ... the ID of adjacent cell N, wherein, N is the natural number of setting.
The selection principle of the N of each a candidate cell adjacent cell (as, by base station selection) can be including but not limited to following scheme:
The first scheme is: the ID that chooses N adjacent cell of (NRSRP-RSRP) value maximum; Its wherein, NRSRP is adjacent area Reference Signal Received Power, full name Neighbourhood Reference Signal Received Power, RSRP is Reference Signal Received Power, full name Reference Signal Received Power.
So, CCN just receives respectively the ID of N adjacent cell of (NRSRP-RSRP) value maximum that each candidate cell reports, as the strongest adjacent area (N is configurable);
First scheme is: the ID that chooses N adjacent cell of adjacent cell group edge customer average spectral efficiency (ase) minimum;
So, CCN just receives respectively the ID of N adjacent cell of the adjacent cell group edge customer average spectral efficiency (ase) minimum that each candidate cell reports.
Wherein, the adjacent cell group edge customer average spectral efficiency (ase) of any one adjacent cell, refers to that this adjacent cell and corresponding candidate select the average spectral efficiency (ase) of the edge customer between community.
For example: candidate cell X exists two adjacent cells, be called adjacent cell 1 and adjacent cell 2, between candidate cell X and adjacent cell 1, there is edge customer A and edge customer B, and between adjacent cell 2, there is edge customer C, edge customer D and edge customer E, the customer edge user average spectral efficiency (ase) of candidate cell is edge customer A so, edge customer B, edge customer C, the average spectral efficiency (ase) of edge customer D and edge customer E, and the adjacent cell group edge customer average spectral efficiency (ase) of adjacent cell 1 is the average spectral efficiency (ase) of edge customer A and edge customer B, the adjacent cell group edge customer average spectral efficiency (ase) of adjacent cell 2 is edge customer C, the average spectral efficiency (ase) of edge customer D and edge customer E.
The third scheme is: the ID that chooses N the adjacent cell of (∑ (NRSRP-RSRP)/∑ adjacent cell group edge customer spectrum efficiency) value maximum.
So, CCN just receives respectively the ID of N adjacent cell of the value maximum of (∑ (NRSRP-RSRP)/∑ adjacent cell group edge customer spectrum efficiency) that each candidate cell reports.
In practical application, each edge customer can report the ID of a spectral efficiency values and several adjacent cells and these adjacent cells to compare (NRSRP-RSRP) value of the candidate cell self belonging to, therefore, taking candidate cell X as example, formula ∑ (NRSRP-RSRP)/∑ adjacent cell group edge customer spectrum efficiency) refer to " cumulative/all spectrum efficiencies that reported the edge customer of candidate cell X to report of all (NRSRP-RSRP) values that reported the edge customer of candidate cell X to report are cumulative ".
The edge customer average spectral efficiency (ase) that step 110:CCN reports based on each candidate cell is determined the processing priority of each candidate cell.
After having collected the reporting information of each candidate cell in the cycle, the edge customer average spectral efficiency (ase) that CCN need to report based on each candidate cell is determined the processing priority of each candidate cell, specifically can adopt but be not limited to following methods:
First method is: the edge customer average spectral efficiency (ase) that CCN reports according to each candidate cell order is from small to large carried out prioritization to each candidate cell, as the foundation of priority scheduling, wherein, the candidate cell priority that edge customer average frequency efficiency is less is higher.
First the candidate cell that priority is higher obtains anti-tampering coordinated manipulation (also claiming to disturb avoid or cooperate), edge customer average spectral efficiency (ase) can increase, when next round sequence, priority can reduce, and therefore, adopts this scheme relatively just for each candidate cell.
Second method is: reserved vip interface, VIP level candidate cell can preferentially obtain anti-tampering coordinated manipulation, by website common parameter, VIP website is set.Be specially: the priority of VIP level candidate cell is arranged as the highest, then, the edge customer average spectral efficiency (ase) reporting according to each candidate cell order is from small to large carried out prioritization to remaining each candidate cell, wherein, the candidate cell priority that edge customer average spectral efficiency (ase) is less is higher.
Except above-mentioned two kinds of methods, also has a kind of method for simplifying: can adopt poll selection mechanism to determine the random priority of each candidate cell, the processing priority that is each candidate cell is random, CCN adopts current which candidate cell that reads at random of polling mechanism, and the priority of this candidate cell is just current the highest.
It is main plot that step 120:CCN chooses each candidate cell successively according to the processing priority of each candidate cell, wherein, often choose a main plot, carry out adjacent cell recurrence according to set point number for current main plot and choose, and current main plot and the corresponding adjacent cell of choosing are divided into cluster.
In the embodiment of the present invention, taking any one main plot as example, the concrete mode of introducing CCN execution step 120 is as follows:
First kind of way is: based on set point number 2, adjacent cell recurrence is carried out in current main plot and choose, and current main plot and the corresponding adjacent cell of choosing are divided into cluster;
For example: suppose that current candidate cell is main plot 1, CCN first searches each adjacent cell (choosing for 1 grade) that main plot 1 reports, search again each adjacent cell (choosing for 2 grades) that each adjacent cell of main plot 1 reports, finally, CCN is by the adjacent cell of each adjacent cell of each adjacent cell of main plot 1, main plot 1 and main plot 1, be attributed to cluster, be defined as cell cluster 1.
Certainly,, in following step, CCN can again choose a main plot 2 in remaining candidate set (having got rid of all communities that cell cluster 1 comprises), and adopts and select in a like fashion cell cluster 2; And so forth.
Certainly, can decide the number of times of choosing main plot according to the scale of candidate set, not repeat them here.
The second way is: based on set point number M, adjacent cell recurrence is carried out in current main plot and choose, M is infinitely great, until choose less than any adjacent cell, more current main plot and the corresponding adjacent cell of choosing are divided into cluster.
For example: suppose that current candidate cell is main plot 1, CCN first searches each adjacent cell (choosing for 1 grade) that main plot 1 reports, search again each adjacent cell (choosing for 2 grades) that each adjacent cell of main plot 1 reports, so continue to search, until all candidate cells of choosing form a closed set (thinking natural disconnects with other candidate cells); Finally, each candidate cell selecting by main plot 1 and based on main plot 1 is attributed to cluster, is defined as cell cluster 1.The benefit of this cluster-dividing method is natural avoid interference, and the edge customer between having avoided bunch can not get coordinating.
Certainly,, in following step, CCN can again choose a main plot 2 in remaining candidate set (having got rid of all communities that cell cluster 1 comprises), and adopts and select in a like fashion cell cluster 2; And so forth.
Certainly, can decide the number of times of choosing main plot according to the scale of candidate set, not repeat them here.
The third mode is: based on set point number M, adjacent cell recurrence is carried out in current main plot and choose, M is infinitely great, until the number sum of current main plot and the corresponding adjacent cell of choosing reaches candidate cell number higher limit in default cell cluster, more current main plot and the corresponding adjacent cell of choosing are divided into cluster.
For example: suppose that current candidate cell is main plot 1, CCN first searches each adjacent cell (choosing for 1 grade) that main plot 1 reports, search again each adjacent cell (choosing for 2 grades) that each adjacent cell of main plot 1 reports, so continue to search, until the number of all candidate cells of choosing reaches candidate cell number higher limit in default cell cluster; Finally, each candidate cell selecting 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 situation that edge customer be more, and the scale of avoiding bunch is excessive, also can take into account the implementation result that reduces treating capacity simultaneously, has ensured edge customer experience.
Step 130:CCN carries out anti-tampering coordinated manipulation for edge customer in each bunch.
Be specially: CCN is according to sub-clustering result, only in each cell cluster, coordinate the technology that application makes edge customer experience promoting (as, multiple technologies such as COMP JT/JR and ICIC/eICIC).Because the result after sub-clustering has been avoided the possible of two neighbor cell fringe regions use same frequencys, therefore, can effectively reduce the possibility of disturbing between Liang Ge community.
In the above-described embodiments, adjust at any time coordination mode for matched edges user's mobility, preferably, CCN is according to the cycle execution step 100-step 130 of setting, thereby dynamically periodically repartition the cell cluster of cooperation with the movement of edge customer, and continue to carry out anti-tampering coordinated manipulation for current edge customer in each bunch based on the cell cluster of repartitioning.
Based on above-described embodiment, to consult shown in Fig. 2, in the embodiment of the present invention, CCN comprises communication unit 20, the first processing unit 21, the second processing unit 22 and the 3rd processing unit 23, wherein,
Communication unit 20, for determining candidate set, receives respectively edge customer average spectral efficiency (ase) and N adjacent cell ID that each candidate cell reports;
The first processing unit 21, determines the processing priority of each candidate cell for the edge customer average spectral efficiency (ase) reporting based on each candidate cell;
The second processing unit 22, be main plot for choosing successively each candidate cell according to the processing priority of each candidate cell, wherein, often choose a main plot, carry out adjacent cell recurrence according to set point number for current main plot and choose, and current main plot and the corresponding adjacent cell of choosing are divided into cluster;
The 3rd processing unit 23, for carrying out anti-tampering coordinated manipulation for edge customer in each bunch.
Communication unit 20 specifically for:
The ID of N the adjacent cell of (NRSRP-RSRP) maximum that reception candidate cell reports; Or,
The ID of N adjacent cell of the adjacent cell group edge customer average spectral efficiency (ase) minimum that reception candidate cell reports; Or,
The ID of N adjacent cell of the value maximum of (∑ (NRSRP-RSRP)/∑ adjacent cell group edge customer spectrum efficiency) that reception candidate cell reports.
When the edge customer average spectral efficiency (ase) reporting based on each candidate cell is determined the processing priority of each candidate cell, the first processing unit 21 specifically for:
The edge customer average spectral efficiency (ase) reporting according to each candidate cell order is from small to large carried out prioritization to each candidate cell, and wherein, the candidate cell priority that edge customer average spectral efficiency (ase) is less is higher; Or,
The priority of VIP level candidate cell is arranged as the highest, the edge customer average spectral efficiency (ase) reporting according to each candidate cell order is from small to large carried out prioritization to remaining each candidate cell, wherein, the candidate cell priority that edge customer average spectral efficiency (ase) is less is higher.
Choose a main plot, carry out adjacent cell recurrence according to set point number for current main plot and choose, and when current main plot and the corresponding adjacent cell of choosing are divided into cluster, the second processing unit 22 specifically for:
Based on set point number 2, adjacent cell recurrence is carried out in current main plot and choose, and current main plot and the corresponding adjacent cell of choosing are divided into cluster; Or,
Based on set point number M, adjacent cell recurrence is carried out in current main plot and choose, M is infinitely great, until choose less than any adjacent cell, more current main plot and the corresponding adjacent cell of choosing are divided into cluster; Or,
Based on set point number M, adjacent cell recurrence being carried out in current main plot chooses, M is infinitely great, until the number sum of current main plot and the corresponding adjacent cell of choosing reaches candidate cell number higher limit in default cell cluster, more current main plot and the corresponding adjacent cell of choosing are divided into cluster.
The second processing unit 22 is further used for: the cycle according to setting is repartitioned cell cluster;
The 3rd processing unit 23 is further used for: continue to carry out anti-tampering coordinated manipulation for current edge customer in each bunch based on the cell cluster of repartitioning.
Consult shown in Fig. 3, in the embodiment of the present invention, CCN comprises communication unit 30 and processor 31, wherein,
Communication port 30, for determining candidate set, receives respectively edge customer average spectral efficiency (ase) and N adjacent cell ID that each candidate cell reports;
Processor 31, determines the processing priority of each candidate cell for the edge customer average spectral efficiency (ase) reporting based on each candidate cell; And to choose successively each candidate cell according to the processing priority of each candidate cell be main plot, wherein, often choose a main plot, carry out adjacent cell recurrence according to set point number for current main plot and choose, and current main plot and the corresponding adjacent cell of choosing are divided into cluster; And carry out anti-tampering coordinated manipulation for edge customer in each bunch.
Communication port 30 specifically for:
The ID of N the adjacent cell of (NRSRP-RSRP) maximum that reception candidate cell reports; Or,
The ID of N adjacent cell of the adjacent cell group edge customer average spectral efficiency (ase) minimum that reception candidate cell reports; Or,
The ID of N adjacent cell of the value maximum of (∑ (NRSRP-RSRP)/∑ adjacent cell group edge customer spectrum efficiency) that reception candidate cell reports.
When the edge customer average spectral efficiency (ase) reporting based on each candidate cell is determined the processing priority of each candidate cell, processor 31 specifically for:
The edge customer average spectral efficiency (ase) reporting according to each candidate cell order is from small to large carried out prioritization to each candidate cell, and wherein, the candidate cell priority that edge customer average spectral efficiency (ase) is less is higher; Or,
The priority of VIP level candidate cell is arranged as the highest, the edge customer average spectral efficiency (ase) reporting according to each candidate cell order is from small to large carried out prioritization to remaining each candidate cell, wherein, the candidate cell priority that edge customer average spectral efficiency (ase) is less is higher.
Choose a main plot, carry out adjacent cell recurrence according to set point number for current main plot and choose, and when current main plot and the corresponding adjacent cell of choosing are divided into cluster, processor 31 specifically for:
Based on set point number 2, adjacent cell recurrence is carried out in current main plot and choose, and current main plot and the corresponding adjacent cell of choosing are divided into cluster; Or,
Based on set point number M, adjacent cell recurrence is carried out in current main plot and choose, M is infinitely great, until choose less than any adjacent cell, more current main plot and the corresponding adjacent cell of choosing are divided into cluster; Or,
Based on set point number M, adjacent cell recurrence being carried out in current main plot chooses, M is infinitely great, until the number sum of current main plot and the corresponding adjacent cell of choosing reaches candidate cell number higher limit in default cell cluster, more current main plot and the corresponding adjacent cell of choosing are divided into cluster.
Processor 31 is further used for: the cycle according to setting is repartitioned cell cluster, and continues to carry out anti-tampering coordinated manipulation for current edge customer in each bunch based on the cell cluster of repartitioning.
In sum, in the embodiment of the present invention, do not introducing under the prerequisite of interference, form the relevant cooperation relation in Duo Zu community, be specially, the edge customer average spectral efficiency (ase) that CCN reports according to each candidate cell and N adjacent cell ID, first determine the processing priority of each candidate cell, choosing successively each candidate cell according to processing priority is again main plot, wherein, often choose a main plot, carrying out adjacent cell recurrence according to set point number for current main plot chooses, and current main plot and the corresponding adjacent cell of choosing are divided into cluster, finally, in each bunch, carry out anti-tampering coordinated manipulation for edge customer respectively again.
Like this, just eliminated to the full extent the possibility of two neighbor cell fringe region use same frequencys, reduce the possibility of disturbing between two candidate cells, thereby both improved the edge customer throughput of entire system, promote the overall performance of the edge customer of all candidate cells, reduced again coordinated management expense, especially, in the time that candidate set is larger, performance boost is especially remarkable.
Further, in the time that edge customer moves to other cell edge region, adopt the technical scheme providing in the embodiment of the present invention also can revise in time cooperation cell bunch, thereby adjust at any time coordination mode.
Those skilled in the art should understand, embodiments of the invention can be provided as method, system or computer program.Therefore, the present invention can adopt complete hardware implementation example, completely implement software example or the form in conjunction with the embodiment of software and hardware aspect.And the present invention can adopt the form at one or more upper computer programs of implementing of computer-usable storage medium (including but not limited to magnetic disc store, CD-ROM, optical memory etc.) that wherein include computer usable program code.
The present invention is with reference to describing according to flow chart and/or the block diagram of the method for the embodiment of the present invention, equipment (system) and computer program.Should understand can be by the flow process in each flow process in computer program instructions realization flow figure and/or block diagram and/or square frame and flow chart and/or block diagram and/or the combination of square frame.Can provide these computer program instructions to the processor of all-purpose computer, special-purpose computer, Embedded Processor or other programmable data processing device to produce a machine, the instruction that makes to carry out by the processor of computer or other programmable data processing device produces the device for realizing the function of specifying at flow process of flow chart or multiple flow process and/or square frame of block diagram or multiple square frame.
These computer program instructions also can be stored in energy vectoring computer or the computer-readable memory of other programmable data processing device with ad hoc fashion work, the instruction that makes to be stored in this computer-readable memory produces the manufacture that comprises command device, and this command device is realized the function of specifying in flow process of flow chart or multiple flow process and/or square frame of block diagram or multiple square frame.
These computer program instructions also can be loaded in computer or other programmable data processing device, make to carry out sequence of operations step to produce computer implemented processing on computer or other programmable devices, thereby the instruction of carrying out is provided for realizing the step of the function of specifying in flow process of flow chart or multiple flow process and/or square frame of block diagram or multiple square frame on computer or other programmable devices.
Although described the preferred embodiments of the present invention, once those skilled in the art obtain the basic creative concept of cicada, can make other change and amendment to these embodiment.So claims are intended to be interpreted as comprising preferred embodiment and fall into all changes and the amendment of the scope of the invention.
Obviously, those skilled in the art can carry out various changes and modification and not depart from the spirit and scope of the embodiment of the present invention the embodiment of the present invention.Like this, if these amendments of the embodiment of the present invention and within modification belongs to the scope of the claims in the present invention and equivalent technologies thereof, the present invention is also intended to comprise these changes and modification interior.
Claims (10)
1. an anti-tampering sub-clustering management method, is characterized in that, comprising:
Determine candidate set, receive respectively edge customer average spectral efficiency (ase) and N adjacent cell ID that each candidate cell reports, wherein, N is the natural number of setting;
The edge customer average spectral efficiency (ase) reporting based on each candidate cell is determined the processing priority of each candidate cell;
Choosing successively each candidate cell according to the processing priority of each candidate cell is main plot, wherein, often choose a main plot, carry out adjacent cell recurrence according to set point number for current main plot and choose, and current main plot and the corresponding adjacent cell of choosing are divided into cluster;
In each bunch, carry out anti-tampering coordinated manipulation for edge customer.
2. the method for claim 1, is characterized in that, receives N the adjacent cell ID that any one candidate cell reports, and comprising:
Receive the ID of N maximum adjacent cell of (adjacent area Reference Signal Received Power NRSRP-Reference Signal Received Power RSRP) that described candidate cell reports; Or,
Receive the ID of N adjacent cell of the adjacent cell group edge customer average spectral efficiency (ase) minimum that described candidate cell reports; Or,
Receive the ID of N adjacent cell of the value maximum of (∑ (NRSRP-RSRP)/∑ adjacent cell group edge customer spectrum efficiency) that described candidate cell reports.
3. the method for claim 1, is characterized in that, the edge customer average spectral efficiency (ase) reporting based on each candidate cell is determined the processing priority of each candidate cell, comprising:
The edge customer average spectral efficiency (ase) reporting according to each candidate cell order is from small to large carried out prioritization to each candidate cell, and wherein, the candidate cell priority that edge customer average spectral efficiency (ase) is less is higher; Or,
The priority of VIP level candidate cell is arranged as the highest, the edge customer average spectral efficiency (ase) reporting according to each candidate cell order is from small to large carried out prioritization to remaining each candidate cell, wherein, the candidate cell priority that edge customer average spectral efficiency (ase) is less is higher.
4. the method as described in claim 1,2 or 3, is characterized in that, chooses a main plot, carries out adjacent cell recurrence and chooses, and current main plot and the corresponding adjacent cell of choosing are divided into cluster according to set point number for current main plot, comprising:
Based on set point number 2, adjacent cell recurrence is carried out in current main plot and choose, and current main plot and the corresponding adjacent cell of choosing are divided into cluster; Or,
Based on set point number M, adjacent cell recurrence is carried out in current main plot and choose, M is infinitely great, until choose less than any adjacent cell, more current main plot and the corresponding adjacent cell of choosing are divided into cluster; Or,
Based on set point number M, adjacent cell recurrence being carried out in current main plot chooses, M is infinitely great, until the number sum of current main plot and the corresponding adjacent cell of choosing reaches candidate cell number higher limit in default cell cluster, more current main plot and the corresponding adjacent cell of choosing are divided into cluster.
5. method as claimed in claim 4, is characterized in that, further comprises:
Cycle according to setting is repartitioned cell cluster, and continues to carry out anti-tampering coordinated manipulation for current edge customer in each bunch based on the cell cluster of repartitioning.
6. an anti-tampering sub-clustering management devices, is characterized in that, comprising:
Communication unit, for determining candidate set, receives respectively edge customer average spectral efficiency (ase) and N adjacent cell ID that each candidate cell reports, and wherein, N is the natural number of setting;
The first processing unit, determines the processing priority of each candidate cell for the edge customer average spectral efficiency (ase) reporting based on each candidate cell;
The second processing unit, be main plot for choosing successively each candidate cell according to the processing priority of each candidate cell, wherein, often choose a main plot, carry out adjacent cell recurrence according to set point number for current main plot and choose, and current main plot and the corresponding adjacent cell of choosing are divided into cluster;
The 3rd processing unit, for carrying out anti-tampering coordinated manipulation for edge customer in each bunch.
7. device as claimed in claim 6, is characterized in that, while receiving N the adjacent cell ID that any one candidate cell reports, described communication unit specifically for:
Receive the ID of N maximum adjacent cell of (adjacent area Reference Signal Received Power NRSRP-Reference Signal Received Power RSRP) that described candidate cell reports; Or,
Receive the ID of N adjacent cell of the adjacent cell group edge customer average spectral efficiency (ase) minimum that described candidate cell reports; Or,
Receive the ID of N adjacent cell of the value maximum of (∑ (NRSRP-RSRP)/∑ adjacent cell group edge customer spectrum efficiency) that described candidate cell reports.
8. device as claimed in claim 6, is characterized in that, when the edge customer average spectral efficiency (ase) reporting based on each candidate cell is determined the processing priority of each candidate cell, described the first processing unit specifically for:
The edge customer average spectral efficiency (ase) reporting according to each candidate cell order is from small to large carried out prioritization to each candidate cell, and wherein, the candidate cell priority that edge customer average spectral efficiency (ase) is less is higher; Or,
The priority of VIP level candidate cell is arranged as the highest, the edge customer average spectral efficiency (ase) reporting according to each candidate cell order is from small to large carried out prioritization to remaining each candidate cell, wherein, the candidate cell priority that edge customer average spectral efficiency (ase) is less is higher.
9. the device as described in claim 6,7 or 8, it is characterized in that, choose a main plot, carry out adjacent cell recurrence according to set point number for current main plot and choose, and when current main plot and the corresponding adjacent cell of choosing are divided into cluster, described the second processing unit specifically for:
Based on set point number 2, adjacent cell recurrence is carried out in current main plot and choose, and current main plot and the corresponding adjacent cell of choosing are divided into cluster; Or,
Based on set point number M, adjacent cell recurrence is carried out in current main plot and choose, M is infinitely great, until choose less than any adjacent cell, more current main plot and the corresponding adjacent cell of choosing are divided into cluster; Or,
Based on set point number M, adjacent cell recurrence being carried out in current main plot chooses, M is infinitely great, until the number sum of current main plot and the corresponding adjacent cell of choosing reaches candidate cell number higher limit in default cell cluster, more current main plot and the corresponding adjacent cell of choosing are divided into cluster.
10. device as claimed in claim 9, is characterized in that, described the second processing unit is further used for: the cycle according to setting is repartitioned cell cluster;
Described the 3rd processing unit is further used for: continue to carry out anti-tampering coordinated manipulation for current edge customer in each bunch based on the cell cluster of repartitioning.
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 true CN103997738A (en) | 2014-08-20 |
| CN103997738B 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) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104640193A (en) * | 2015-01-30 | 2015-05-20 | 中国联合网络通信集团有限公司 | Interference coordination method and device |
| CN104734830A (en) * | 2015-03-05 | 2015-06-24 | 京信通信技术(广州)有限公司 | Frequency band configuration method and device |
| WO2016065911A1 (en) * | 2014-10-31 | 2016-05-06 | 华为技术有限公司 | Method and base station for cell clustering |
| CN109996238A (en) * | 2017-12-29 | 2019-07-09 | 中国移动通信集团上海有限公司 | A kind of C-RAN network plan method and device |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101827445A (en) * | 2010-03-02 | 2010-09-08 | 北京邮电大学 | Inter-station interference coordinating and pre-coding scheme for multi-antenna OFDMA system |
| CN101827383A (en) * | 2009-03-06 | 2010-09-08 | 大唐移动通信设备有限公司 | Method and base station for predicting time-frequency resources |
| 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 |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2016065911A1 (en) * | 2014-10-31 | 2016-05-06 | 华为技术有限公司 | Method and base station for cell clustering |
| CN104640193A (en) * | 2015-01-30 | 2015-05-20 | 中国联合网络通信集团有限公司 | Interference coordination method and device |
| CN104734830A (en) * | 2015-03-05 | 2015-06-24 | 京信通信技术(广州)有限公司 | Frequency band configuration method and device |
| CN104734830B (en) * | 2015-03-05 | 2017-12-26 | 京信通信技术(广州)有限公司 | A kind of method and apparatus for configuring frequency range |
| CN109996238A (en) * | 2017-12-29 | 2019-07-09 | 中国移动通信集团上海有限公司 | A kind of C-RAN network plan method and device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103997738B (en) | 2017-09-15 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| WO2015127880A1 (en) | Base station frequency resource allocation method and network device | |
| Liu et al. | Joint clustering and inter-cell resource allocation for CoMP in ultra dense cellular networks | |
| CN1992962B (en) | Inter-cell interference coordination method based on evolution network architecture of 3G system | |
| CN109391426A (en) | Instruction, method of reseptance and the device of resource location | |
| CN102017682B (en) | Downlink inter-cell interference coordination method and base station | |
| CN102075947B (en) | Cell identification (ID) planning method and device for improving physical downlink control channel PDCCH performance | |
| CN105636056B (en) | Energy-saving method, device and system for optimizing spectrum resources | |
| CN104955077A (en) | Heterogeneous network cell clustering method and device based on user experience speed | |
| CN109996238B (en) | C-RAN network planning method and device | |
| CN103826306B (en) | A kind of descending dynamic interference coordination method in highly dense set network based on game | |
| CN104335628A (en) | Wireless multi-site capacity coordination | |
| CN101754383B (en) | Structuring method of CoMP cell cluster | |
| CN104168656A (en) | Detection reference signal SRS resource allocation method and device | |
| CN106888506A (en) | A kind of minizone of LTE is disturbed degree information and determines method and system | |
| CN103997738A (en) | Anti-interference clustering management method and device | |
| CN109788485B (en) | Method for cluster optimization to help solve boundary problems in communication systems | |
| CN103079207B (en) | The collocation method of Physical Cell Identifier PCI and equipment | |
| WO2016058448A1 (en) | Frequency band allocation method and device | |
| CN105764150A (en) | Method and device for allocating resources | |
| CN103517441B (en) | Method of interference coordination among cells and system thereof | |
| CN103428702A (en) | Resource allocation method for controlling inter-cell interference | |
| CN103889005A (en) | Coordinated multi-point transmission scheduling method and device | |
| CN104378785A (en) | Uplink and downlink subframe reconfiguration method and devices for small cells | |
| US9344913B2 (en) | Wireless network encoding management method and system | |
| CN102480734B (en) | Time-frequency resource distributing method and device |
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 |