CN112601262A - Method for reducing ping-pong handover between adjacent cells - Google Patents
Method for reducing ping-pong handover between adjacent cells Download PDFInfo
- Publication number
- CN112601262A CN112601262A CN202011419220.XA CN202011419220A CN112601262A CN 112601262 A CN112601262 A CN 112601262A CN 202011419220 A CN202011419220 A CN 202011419220A CN 112601262 A CN112601262 A CN 112601262A
- Authority
- CN
- China
- Prior art keywords
- state
- current
- handover
- switching
- ping
- 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.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 38
- 238000007405 data analysis Methods 0.000 claims abstract description 21
- 230000007704 transition Effects 0.000 claims description 118
- 238000004458 analytical method Methods 0.000 claims description 3
- 230000000977 initiatory effect Effects 0.000 claims description 2
- 238000007689 inspection Methods 0.000 abstract description 3
- 238000001514 detection method Methods 0.000 description 10
- 238000004364 calculation method Methods 0.000 description 4
- 238000005457 optimization Methods 0.000 description 4
- 230000003247 decreasing effect Effects 0.000 description 3
- 238000010586 diagram Methods 0.000 description 3
- 238000005259 measurement Methods 0.000 description 2
- 238000005065 mining Methods 0.000 description 2
- 238000010295 mobile communication Methods 0.000 description 2
- 238000012545 processing Methods 0.000 description 2
- 238000012360 testing method Methods 0.000 description 2
- 230000001960 triggered effect Effects 0.000 description 2
- 230000002159 abnormal effect Effects 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000013480 data collection Methods 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 238000012423 maintenance Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000012544 monitoring process Methods 0.000 description 1
- 230000008447 perception Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W36/00—Hand-off or reselection arrangements
- H04W36/0005—Control or signalling for completing the hand-off
- H04W36/0083—Determination of parameters used for hand-off, e.g. generation or modification of neighbour cell lists
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W36/00—Hand-off or reselection arrangements
- H04W36/0005—Control or signalling for completing the hand-off
- H04W36/0055—Transmission or use of information for re-establishing the radio link
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W36/00—Hand-off or reselection arrangements
- H04W36/16—Performing reselection for specific purposes
- H04W36/165—Performing reselection for specific purposes for reducing network power consumption
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses a method for reducing ping-pong handover between adjacent cells, which comprises the following steps: starting; collecting switching data in each BBU according to a preset format; the acquired switching data is uploaded to the O & M periodically or aperiodically; analyzing switching data; judging whether the user-defined ping-pong switching is met or not; if the self-defined ping-pong switching is met, counting counters of a source cell and an adjacent cell which are switched respectively, and then counting counters of ping-pong switching of corresponding cells; judging that the current or historical data is analyzed; if the switching is not consistent with the self-defined ping-pong switching, respectively counting counters of a source cell and an adjacent cell which are switched; judging that the current or historical data is analyzed; if the current or historical data is analyzed, ending; and returning to the switching data analysis if the current or historical data is not analyzed completely. The method for reducing ping-pong switching between adjacent cells provided by the invention has the advantages of fixed point inspection, flexibility, convenience and the like.
Description
Technical Field
The invention relates to the technical field of mobile communication network optimization, in particular to a method for reducing ping-pong handover between adjacent cells.
Background
Most of the existing methods for preventing or detecting ping-pong handover include monitoring or counting cell handover events, finding out neighboring cells which are easy to generate ping-pong handover, further optimizing series parameters of a handover process to reduce ping-pong handover frequency, or collecting handover subject data of a certain time period in a certain area by a telecom operator or a mobile communication operation and maintenance company, and then detecting neighboring cells which frequently generate ping-pong handover by using a big data technology, thereby solving the problem point to point.
The technical scheme has the defects that data collection needs close matching among a plurality of devices (a large number of base stations and a core network of an access network), the implementation process is inflexible and has no real-time performance, the detection range is limited in the sites which report specific statistical data, and the detection range is limited.
Disclosure of Invention
The invention provides a method for reducing ping-pong handover between adjacent cells, and aims to solve the problems of the existing method for preventing or detecting ping-pong handover.
According to the embodiment of the application, a method for reducing ping-pong handover between adjacent cells is provided, which comprises the following steps:
starting;
collecting switching data in each BBU according to a preset format;
the acquired switching data is uploaded to the O & M periodically or aperiodically;
analyzing switching data;
judging whether the user-defined ping-pong switching is met or not;
if the self-defined ping-pong switching is met, counting counters of a source cell and an adjacent cell which are switched respectively, and then counting counters of ping-pong switching of corresponding cells; judging whether the current or historical data is analyzed;
if the switching is not consistent with the self-defined ping-pong switching, respectively counting counters of a source cell and an adjacent cell which are switched;
judging whether the current or historical data is analyzed;
if the current or historical data is analyzed, ending;
and returning to the switching data analysis if the current or historical data is not analyzed completely.
Preferably, the statistical data obtained by analyzing the handover data can be used for mining the handover data of each cell under each BBU to obtain the handover record and the handover reason statistics of a specific cell, and the method comprises the following steps:
starting;
initializing parameters to be counted;
extracting the count related to the parameter to be counted in the current CallID and accumulating the count;
judging whether all the CallIDs are traversed or not;
if the traversal is finished, recording the current statistical result, and finishing;
and if the traversal is not finished, returning to the step of extracting the count of the parameter to be counted in the current CallID and accumulating the count.
Preferably, the handover data analysis comprises the steps of:
initial state C1 of the newly detected call id;
judging whether state transition can be carried out or not;
if the current session fails to satisfy the transition condition, the critical parameters are updated with the current session state, after which the state machine remains resident in the C1 state.
If the current session meets the transition condition, updating the state transition key parameter by using the current session parameter, and then transitioning the state machine to an intermediate state C2;
the key parameters include SrcCell _ C1, DstCell _ C1, and HOTime _ C1.
Preferably, the handover data analysis comprises the steps of:
the state machine for the current CallID is in intermediate state C2;
judging whether state transition can be continued;
if the current session can not be in state transition;
the current session parameters update the state transition key parameters, and thereafter the state machine is re-resident to the C1 state;
if the current session satisfies the transition condition, the state transition key parameters are updated with the current session parameters, after which the state machine transitions to intermediate state C3.
Preferably, the handover data analysis comprises the steps of:
the state machine for the current CallID is in intermediate state C3;
judging whether state transition can be continued;
if the current session can not be in state transition;
the current session parameters update the state transition key parameters, and thereafter the state machine is re-resident to the C1 state;
if the current session satisfies the transition condition, the state transition key parameters are updated with the current session parameters, after which the state machine transitions to the intermediate state C4.
Preferably, the handover data analysis comprises the steps of:
the state machine for the current CallID is in intermediate state C4;
judging whether state transition can be continued;
if the current session can not be in state transition;
the current session parameters update the state transition key parameters, and thereafter the state machine is re-resident to the C1 state;
if the current session meets the transition condition, updating the state transition key parameter with the current session parameter, and then the state machine transitions to a closed state C5;
the closed state C5 is that the currently preset ping-pong handover condition is satisfied, and the UE under the current call id undergoes ping-pong handover between the cells corresponding to the current call id.
Preferably, the handover data analysis comprises the steps of:
the state machine for the current CallID is in closed state C5;
judging whether the internal circulation can be continued in a closed state;
if the current session meets the closed state inner loop condition;
update the close state C5 key parameters with the current session parameters, after which the state machine remains resident to the close state C5;
if the current session does not satisfy the closed state inner loop condition, the state transition key parameter is updated with the current session parameter, and thereafter the state machine is re-resident to the C1 state.
Preferably, when the initial state C1, the intermediate state C2, the intermediate state C3, the intermediate state C4 or the closed state C5 detects that the StopFlag value is true or the traversal of the collected data about the call id in the current database is completed, the current session ends, exiting the state machine about the call id;
the SrcCell _ C1 includes a source cell initiating an initial handover in a new call id, the DstCell _ C1 includes a target cell to which the handover is to be performed in the new call id, and the HOTime _ C1 includes a time at which the handover is detected in the new call id, which is a time at which the handover is completed.
The technical scheme provided by the embodiment of the application can have the following beneficial effects: compared with the traditional scheme, the scheme has the advantages that data are collected on the BBU side of the base station, the data structure is designed only by using visible relevant parameters of the BBU, the collected data are uploaded to the O & M system associated with the BBU regularly or irregularly, fixed-point inspection can be effectively carried out on the series BBUs deployed in a certain place, and convenience and flexibility are achieved. The detection step is suitable for single or multiple BBUs, and is also suitable for detection after processing of a preset data structure on related data derived from a core network, and the detection method is flexible in application and can be quickly converged. Meanwhile, the scheme can be used for rapidly detecting ping-pong switching on a single base station BBU side, can also be used for multi-base station joint detection, and effectively solves the problem of overhigh ping-pong switching frequency.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings needed to be used in the description of the embodiments are briefly introduced below, and it is obvious that the drawings in the following description are some embodiments of the present invention, and it is obvious for those skilled in the art to obtain other drawings based on these drawings without creative efforts.
FIG. 1 is a flow chart illustrating a method for reducing ping-pong handover between neighboring cells in accordance with the present invention;
FIG. 2 is a state transition diagram of a method of reducing ping-pong handovers between neighboring cells in accordance with the present invention;
fig. 3 is a schematic flow chart of S4 in the method for reducing ping-pong handover between neighboring cells according to the present invention;
fig. 4 is a schematic flow chart of S4 in the method for reducing ping-pong handover between neighboring cells according to the present invention;
fig. 5 is a schematic flow chart of S4 in the method for reducing ping-pong handover between neighboring cells according to the present invention;
fig. 6 is a schematic flow chart of S4 in the method for reducing ping-pong handover between neighboring cells according to the present invention;
fig. 7 is a flowchart illustrating S4 in the method for reducing ping-pong handover between neighboring cells according to the present invention.
Description of reference numerals:
10. a method for reducing ping-pong handovers between adjacent cells.
Detailed Description
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are some, not all, embodiments of the present invention. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
It is also to be understood that the terminology used in the description of the invention herein is for the purpose of describing particular embodiments only and is not intended to be limiting of the invention. As used in this specification and the appended claims, the singular forms "a", "an", and "the" are intended to include the plural forms as well, unless the context clearly indicates otherwise.
It should be further understood that the term "and/or" as used in this specification and the appended claims refers to and includes any and all possible combinations of one or more of the associated listed items.
Referring to fig. 1, the present invention discloses a method 10 for reducing ping-pong handover between adjacent cells, comprising the following steps:
step S1: starting;
step S2: collecting switching data in each BBU according to a preset format;
step S3: the acquired switching data is uploaded to the O & M periodically or aperiodically;
step S4: analyzing switching data;
step S5: judging whether the user-defined ping-pong switching is met or not;
step S6: if the self-defined ping-pong switching is met, counting counters of a source cell and an adjacent cell which are switched respectively, and then counting counters of ping-pong switching of corresponding cells;
step S7: judging whether the current or historical data is analyzed;
step S8: if the switching is not consistent with the self-defined ping-pong switching, respectively counting counters of a source cell and an adjacent cell which are switched;
step S7: judging whether the current or historical data is analyzed;
if the current or historical data analysis is finished, the step S9 is performed: finishing;
and returning to the switching data analysis if the current or historical data is not analyzed completely.
The BBU of the base station collects switching data according to a preset format, and the switching data collected by the preset format is a switching event data structure. The base station BBU uploads the acquired data to the O & M entity in real time or periodically, the uploading time can be freely set according to the actual situation, the O & M entity can collect the data of each base station BBU periodically or aperiodically, the received data are accumulated and superposed into the same file or database form during collection, the data are collected according to the time sequence of the received data, no additional operation such as sorting is needed, and the method is simple and feasible. Through the switching data analysis, all cells which are switched can be counted, switching events which trigger switching can be counted, and frequent switching cells which meet ping-pong switching preset conditions can be found.
Compared with the traditional scheme, the scheme has the advantages that data are collected on the BBU side of the base station, the data structure is designed only by using visible relevant parameters of the BBU, the collected data are uploaded to the O & M system associated with the BBU regularly or irregularly, fixed-point inspection can be effectively carried out on the series BBUs deployed in a certain place, and convenience and flexibility are achieved. The detection step is suitable for single or multiple BBUs, and is also suitable for detection after processing of a preset data structure on related data derived from a core network, and the detection method is flexible in application and can be quickly converged. Meanwhile, the scheme can be used for rapidly detecting ping-pong switching on a single base station BBU side, can also be used for multi-base station joint detection, and effectively solves the problem of overhigh ping-pong switching frequency.
The handover event data structure consists of the fields in table 1.1, which are the key fields for the ping-pong handover data analysis, either periodically or aperiodically thereafter. Wherein the CallID is a key field for identifying a session between a base station and a UE. If a UE continuously switches back and forth between a cell and a neighboring cell of the cell (the neighboring cells are not necessarily the same) within a certain period of time, the handover events are triggered, and the callids corresponding to the handover events are the same. The design of the CallID data structure is the key for performing ping-pong handover data analysis, and all data analysis is initiated by the CallID.
Table 1.1: switching event data structure recorded by base station gNB side
| CallID | SrcCell | DstCell | HOTime | HOEvent | StopFlag |
Table 1.2 the structure of the fields in table 1.1 are split and explained in detail as follows:
table 1.2: composition and specific meaning of fields of switching event data structure
Due to the importance of the CallID, table 1.3 lists this field separately and further details its multilevel structure as follows:
table 1.3: multi-stage structure of CallID field and definitions of parameters at each stage
The call ID is combined by the NCGI and the UE ID to identify the ongoing session by the base station and a certain UE for a certain period of time.
NCGI: NR Cell Global identity (NR Cell Global identity), which consists of three parameters MCC, MNC, NCI, where NCI in turn consists of gNB ID and Cell ID.
C-RNTI: Cell-Radio Network Temporary Identifier (Cell Radio Network Temporary Identifier).
After a handover event occurs, the field hovevent records the type of event that triggered the current handover event, i.e. the reason for the handover, as shown in table 1.4. If one or more ping-pong switching is excavated by recording data, specific parameters triggering frequent switching can be found by checking the switching reasons, so that problem parameters are quickly positioned, and the problem is adjusted, optimized and solved.
Table 1.4: definition of enumeration parameter HOEvent
typedef enum{
A1＝1,A2＝2,A3＝3,A4＝4,A5＝5,A6＝6,B1＝7,B2＝8
}HOEVENT；
Table 1.5 further details the current configuration parameters that need to be recorded for different event types when a handover event occurs and event statistics are performed. Different handover events can generally determine the cause of handover, and the configuration parameters of a specific handover event can be used to locate the cause of real-time handover.
Table 1.5: configuration parameters that need to be derived for different events
Wherein:
off represents the offset of the measurement result, step size 0.5 db;
hys represents the amplitude hysteresis of the measurement result, step size 0.5 db;
ofs represents the frequency offset of the serving cell;
ocs denotes serving cell specific bias;
thresh is the relevant parameter threshold configured for the event.
For statistical convenience, table 1.6 defines the handover statistics count that occurs for a certain CallID. The statistical calculation does not need to be carried out in real time under the current BBU, and can be carried out in a background database according to the statistical calculation, so that the calculation resources of the BBU are not occupied.
TABLE 1.6 handover cell statistics counter for a certain CallID
| CallID | SrcCellHOCnt | DstCellHOCnt | PingPongCnt |
Table 1.7 is a description of the fields of Table 1.6, as explained below:
table 1.7: interpretation of the fields in Table 1.6
When counting the cells where the handover event occurs, the handover reasons may also be counted together. Table 1.8 defines the handover reason statistics count for which a handover occurs for a certain CallID.
TABLE 1.8 Handover event statistics counter for a CallID
| CallID | A1Cnt | A2Cnt | A3Cnt | A4Cnt | A5Cnt | A6Cnt | B1Cnt | B2Cnt |
The fields CallID and hovent in the table above are described in table 1.2, the records of the CallID in the database are traversed, and the statistical count of each handover trigger event is respectively counted according to the hovent field in table 1.2. A1Cnt to A6Cnt, B1Cnt, B2Cnt respectively represent the statistical counts of the respective handover enumeration events defined in table 1.4. These statistics can be used for analysis of the cause of the abnormal handover. And the statistical process can be calculated in a background database according to the statistics as required, and the calculation resources of the BBU are not occupied.
Ping-pong handover is the process of switching back and forth between two neighboring cells by the same UE for a certain period of time and during the course of a service. For convenience of explanation, it is assumed that the minimum number of handovers required between two cells in which ping-pong handovers occur is 5, and the maximum time interval between every two adjacent handovers is 7 seconds. Defined as constants "MinHandoverNum" and "MaxTimeInterval", respectively. The two constant values can be adjusted instantly according to the requirements of operators or the perception of users, and are flexible and convenient. Increasing the constant MinHandoverNum increases the requirements on the trigger conditions, and the statistical results are correspondingly reduced; decreasing the constant MinHandoverNum relaxes the requirements on the trigger conditions and the statistical result increases accordingly. Similarly, decreasing the constant MaxTimeInterval increases the requirement for the trigger condition, and the statistical result is correspondingly decreased; increasing the constant MinHandoverNum relaxes the requirements on the trigger conditions and the statistical result increases accordingly.
#define MinHandoverNum 5
#define MaxTimeInterval 7
Fig. 2 is a state transition diagram for different states for the same calld made for the constant "MinHandoverNum" of 5. In this transition diagram 5 states are defined (corresponding to the constant MinHandoverNum), C1, C2, C3, C4, C5, respectively. An End state is also defined for exiting the state machine for the call id when the call associated with the current call id has ended or when the record for the call id has been detected. Where C1 is the initial state of the newly detected call id and C5 is the end state of the currently detected call id. The state machine of this CallID can only converge when it transitions to the C5 state, i.e. a ping-pong handover occurrence is detected. Of course, the state machine for callld can also loop through this state after reaching C5 (as shown by state transition line9 in fig. 2), and transition to the End state via state transition line10 when the loop condition is no longer satisfied, thus terminating the state machine for this callld.
Referring to fig. 2 and fig. 3, the step S4: analyzing switching data; the method comprises the following steps:
step S41: initial state C1 of the newly detected call id;
step S42: judging whether state transition can be carried out or not;
step S43: if the current session fails to satisfy the transition condition, the critical parameters are updated with the current session state, after which the state machine remains resident in the C1 state.
Step S44: if the current session meets the transition condition, updating the state transition key parameter by using the current session parameter, and then transitioning the state machine to an intermediate state C2;
wherein the key parameters include SrcCell _ C1, DstCell _ C1, and HOTime _ C1.
Preferably, in this embodiment, a new switching data is received by the initial state C1 of the newly detected call id through the state transition line0, a state machine related to the call id is started, and initialization is performed. The state transition line0 is illustrated in Table 2.0.
Table 2.0: line0 definition of State transition line
Preferably, in the present embodiment, step S43 is represented by state transition line1, and the interpretation of state transition line1 is shown in table 2.1.
Table 2.1: line1 definition of State transition line
Preferably, in the present embodiment, step S44 is represented by state transition line2, and the interpretation of state transition line2 is shown in table 2.2. The state transition line is one of the critical paths for determining ping-pong switching.
Table 2.2: line2 definition of State transition line
Referring to fig. 2 and 4, the step S4: analyzing switching data; the method comprises the following steps:
step S45: the state machine for the current CallID is in intermediate state C2;
step S46: judging whether state transition can be continued;
step S47: if the current session can not be in state transition; the current session parameters update the state transition key parameters, and thereafter the state machine is re-resident to the C1 state;
step S48: if the current session satisfies the transition condition, the state transition key parameters are updated with the current session parameters, after which the state machine transitions to intermediate state C3.
Preferably, in the present embodiment, step S47 is represented by state transition line3, and the interpretation of state transition line3 is shown in table 2.3.
Table 2.3: line3 definition of State transition line
Preferably, in the present embodiment, step S48 is represented by state transition line4, and the interpretation of state transition line4 is shown in table 2.4. The state transition line is one of the critical paths for determining ping-pong switching.
Table 2.4: line4 definition of State transition line
Referring to fig. 2 and 5, the step S4: analyzing switching data; the method comprises the following steps:
s49: the state machine for the current CallID is in intermediate state C3;
s50: judging whether state transition can be continued;
s51: if the current session can not be in state transition; the current session parameters update the state transition key parameters, and thereafter the state machine is re-resident to the C1 state;
s52: if the current session satisfies the transition condition, the state transition key parameters are updated with the current session parameters, after which the state machine transitions to the intermediate state C4.
Preferably, in the present embodiment, step S51 is represented by state transition line5, and the interpretation of state transition line5 is shown in table 2.5.
Table 2.5: line5 definition of State transition line
Preferably, in the present embodiment, step S52 is represented by a state transition line6, and the interpretation of the state transition line6 is shown in table 2.6. The state transition line is one of the critical paths for determining ping-pong switching.
Table 2.6: line6 definition of State transition line
Referring to fig. 2 and fig. 6, the step S4: analyzing switching data; the method comprises the following steps:
step S53: the state machine for the current CallID is in intermediate state C4;
step S54: judging whether state transition can be continued;
step S55: if the current session can not be in state transition; the current session parameters update the state transition key parameters, and thereafter the state machine is re-resident to the C1 state;
step S56: if the current session meets the transition condition, updating the state transition key parameter with the current session parameter, and then the state machine transitions to a closed state C5;
preferably, in the present embodiment, step S55 is represented by a state transition line7, and the interpretation of the state transition line7 is shown in table 2.7.
Table 2.7: line7 definition of State transition line
Preferably, in the present embodiment, step S56 is represented by state transition line8, and the interpretation of state transition line8 is shown in table 2.8. The transition line is one of the critical paths for determining ping-pong handover. The closed state C5 is that the currently preset ping-pong handover condition is satisfied, and the UE under the current call id undergoes ping-pong handover between the cells corresponding to the current call id.
Table 2.8: line8 definition of State transition line
Referring to fig. 2 and fig. 7, in step S4: analyzing switching data; the method comprises the following steps:
step S57: the state machine for the current CallID is in closed state C5;
step S58: judging whether the internal circulation can be continued in a closed state;
step S59: if the current session meets the closed state inner loop condition; update the close state C5 key parameters with the current session parameters, after which the state machine remains resident to the close state C5;
step S60: if the current session does not satisfy the closed state inner loop condition, the state transition key parameter is updated with the current session parameter, and thereafter the state machine is re-resident to the C1 state.
Preferably, in the present embodiment, step S59 is represented by a state transition line9, and the interpretation of the state transition line9 is shown in table 2.9. The state transition line9 is a closed state continuation after the ping-pong switching preset condition is met, which indicates that the ping-pong switching is still in progress at the present moment.
Table 2.9: line9 definition of State transition line
Preferably, in the present embodiment, step S60 is represented by a state transition line11, and the interpretation of the state transition line11 is shown in table 2.10. This state transition line11 is a process by which the newly arriving switching data no longer satisfies the ping-pong switching condition after the ping-pong switching occurs, thereby adjusting the current CallID state machine state.
Table 2.10: line11 definition of State transition line
Referring to fig. 2, preferably, in this embodiment, when the initial state C1, the intermediate state C2, the intermediate state C3, the intermediate state C4 or the closed state C5 detects that the StopFlag value is true or the collected data in the current database about the call id has been traversed completely, the current session is ended, and the state machine about the call id is exited; this step is represented by a state transition line10, and the state machine for the current CallID may be in any of the 5 states described above. The state transition line10 is explained in table 2.11.
Table 2.11: line10 definition of transition line
And (3) obtaining statistical data through switching data analysis, then deeply mining the switching data of each cell under each BBU, and obtaining the switching record of a specific cell, the switching reason statistics and the like. Summary statistics for specific parameters are extracted from the piecemeal statistics for each CallID, and their flow is similar.
Obtaining the total switching times of a certain cell in the test record
A specific cell in the base station BBU is uniquely identified by the NCGI, and it can be known from table 1.3 that:
the overall algorithm for counting the total number of handovers of this Cell in the current record, which is NCGI MCC + MNC + gNB ID + Cell ID, is as follows (where SrcCellHOCnt is defined in table 1.7):
and the total switching number of the CellA in a specific cell is counted.
Obtaining total ping-pong switching times of a cell in a test record
Similar to the above total handover statistics, the total ping-pong handover statistics algorithm for a specific cell is summarized as follows (where pingpong cnt is defined in table 1.7):
the proportion of ping-pong handover occurring in the cell in the total handover can be calculated by obtaining the total handover statistics and the total ping-pong handover statistics of the specific cell, thereby providing a reference for network optimization.
And searching an event triggering frequent ping-pong switching and corresponding cell configuration parameters.
If the ping-pong handover ratio of a cell exceeds the network optimization threshold, the current cell configuration needs to be optimized. How to find the parameters to be optimized can be started from the event triggering ping-pong handover (the event to be counted is shown in table 1.8), after finding the large-proportion event triggering frequent ping-pong handover, the configuration parameters of the large-proportion event in the current cell are derived according to the parameters defined in table 1.5, so as to provide a landing point for the network optimization.
After obtaining the large rate event of triggering the handover of the specific cell with frequent ping-pong handover through the algorithm, the frequent handover reasons are analyzed based on the configuration parameters of the specific event defined in table 1.5. For example, the current cell of the a5 event that we need to be concerned with is configured with RSRP/RSRQ/SINR Thresh1&2, Hys, etc., from which the analysis of handover reasons can be started.
While the invention has been described with reference to specific embodiments, the invention is not limited thereto, and various equivalent modifications and substitutions can be easily made by those skilled in the art within the technical scope of the invention. Therefore, the protection scope of the present invention shall be subject to the protection scope of the claims.
Claims (8)
1. A method for reducing ping-pong handovers between adjacent cells, comprising the steps of:
starting;
collecting switching data in each BBU according to a preset format;
the acquired switching data is uploaded to the O & M periodically or aperiodically;
analyzing switching data;
judging whether the user-defined ping-pong switching is met or not;
if the self-defined ping-pong switching is met, counting counters of a source cell and an adjacent cell which are switched respectively, and then counting counters of ping-pong switching of corresponding cells; judging whether the current or historical data analysis is finished;
if the switching is not consistent with the self-defined ping-pong switching, respectively counting counters of a source cell and an adjacent cell which are switched; judging whether the current or historical data is analyzed;
if the current or historical data is analyzed, ending;
and returning to the switching data analysis if the current or historical data is not analyzed completely.
2. The method of claim 1, wherein the statistical data obtained through the analysis of handover data can mine handover data of each cell under each BBU to obtain handover records and handover reason statistics of a specific cell, comprising the steps of:
starting;
initializing parameters to be counted;
extracting the count related to the parameter to be counted in the current CallID and accumulating the count;
judging whether all the CallIDs are traversed or not;
if the traversal is finished, recording the current statistical result, and finishing;
and if the traversal is not finished, returning to the step of extracting the count of the parameter to be counted in the current CallID and accumulating the count.
3. The method of claim 1, wherein the handover data analysis comprises the steps of:
initial state C1 of the newly detected call id;
judging whether state transition can be carried out or not;
if the current session fails to satisfy the transition condition, the critical parameters are updated with the current session state, after which the state machine remains resident in the C1 state.
If the current session meets the transition condition, updating the state transition key parameter by using the current session parameter, and then transitioning the state machine to an intermediate state C2;
the key parameters include SrcCell _ C1, DstCell _ C1, and HOTime _ C1.
4. The method of claim 3, wherein the handover data analysis comprises the steps of:
the state machine for the current CallID is in intermediate state C2;
judging whether state transition can be continued;
if the current session can not be in state transition;
the current session parameters update the state transition key parameters, and thereafter the state machine is re-resident to the C1 state;
if the current session satisfies the transition condition, the state transition key parameters are updated with the current session parameters, after which the state machine transitions to intermediate state C3.
5. The method of claim 4, wherein the handover data analysis comprises the steps of:
the state machine for the current CallID is in intermediate state C3;
judging whether state transition can be continued;
if the current session can not be in state transition;
the current session parameters update the state transition key parameters, and thereafter the state machine is re-resident to the C1 state;
if the current session satisfies the transition condition, the state transition key parameters are updated with the current session parameters, after which the state machine transitions to the intermediate state C4.
6. The method of claim 5, wherein the handover data analysis comprises the steps of:
the state machine for the current CallID is in intermediate state C4;
judging whether state transition can be continued;
if the current session can not be in state transition;
the current session parameters update the state transition key parameters, and thereafter the state machine is re-resident to the C1 state;
if the current session meets the transition condition, updating the state transition key parameter with the current session parameter, and then the state machine transitions to a closed state C5;
the closed state C5 is that the currently preset ping-pong handover condition is satisfied, and the UE under the current call id undergoes ping-pong handover between the cells corresponding to the current call id.
7. The method of claim 6, wherein the handover data analysis comprises the steps of:
the state machine for the current CallID is in closed state C5;
judging whether the internal circulation can be continued in a closed state;
if the current session meets the closed state inner loop condition;
update the close state C5 key parameters with the current session parameters, after which the state machine remains resident to the close state C5;
if the current session does not satisfy the closed state inner loop condition, the state transition key parameter is updated with the current session parameter, and thereafter the state machine is re-resident to the C1 state.
8. The method of any of claim 7, wherein the first cell is a neighbor cell,
when the initial state C1, the intermediate state C2, the intermediate state C3, the intermediate state C4 or the closed state C5 detect that the StopFlag value is true or the collected data in the current database about the CallID is completely traversed, the current session is ended, and the state machine about the CallID is exited;
the SrcCell _ S1 includes a source cell initiating an initial handover in a new call id, the DstCell _ C1 includes a target cell to which the handover is to be performed in the new call id, and the HOTime _ C1 includes a time at which the handover is detected in the new call id, which is a time at which the handover is completed.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011419220.XA CN112601262A (en) | 2020-12-07 | 2020-12-07 | Method for reducing ping-pong handover between adjacent cells |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011419220.XA CN112601262A (en) | 2020-12-07 | 2020-12-07 | Method for reducing ping-pong handover between adjacent cells |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN112601262A true CN112601262A (en) | 2021-04-02 |
Family
ID=75188691
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011419220.XA Pending CN112601262A (en) | 2020-12-07 | 2020-12-07 | Method for reducing ping-pong handover between adjacent cells |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112601262A (en) |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102123418A (en) * | 2011-03-17 | 2011-07-13 | 北京拓明科技有限公司 | Ping-pong handover positioning method based on A-interface signaling |
| CN103228018A (en) * | 2013-05-08 | 2013-07-31 | 大唐移动通信设备有限公司 | Ping-pong switching detection device and equipment |
| CN108200622A (en) * | 2018-02-09 | 2018-06-22 | 维沃移动通信有限公司 | A kind of residence reselecting and mobile terminal |
| CN108260152A (en) * | 2016-12-29 | 2018-07-06 | 中国移动通信集团浙江有限公司 | The method of discrimination and device of pingpang handoff problem cells are divided in room |
-
2020
- 2020-12-07 CN CN202011419220.XA patent/CN112601262A/en active Pending
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102123418A (en) * | 2011-03-17 | 2011-07-13 | 北京拓明科技有限公司 | Ping-pong handover positioning method based on A-interface signaling |
| CN103228018A (en) * | 2013-05-08 | 2013-07-31 | 大唐移动通信设备有限公司 | Ping-pong switching detection device and equipment |
| CN108260152A (en) * | 2016-12-29 | 2018-07-06 | 中国移动通信集团浙江有限公司 | The method of discrimination and device of pingpang handoff problem cells are divided in room |
| CN108200622A (en) * | 2018-02-09 | 2018-06-22 | 维沃移动通信有限公司 | A kind of residence reselecting and mobile terminal |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US6233449B1 (en) | Operation and maintenance control point and method of managing a self-engineering telecommunications network | |
| CN108990078B (en) | Method, system, equipment and storage medium for optimizing downlink interference of LTE (Long term evolution) network | |
| CN107567030B (en) | Method and system for checking and avoiding pseudo base station interference | |
| US20030190916A1 (en) | Method and system for optimizing cell-neighbor lists | |
| EP2536197A1 (en) | Method and system for reporting neighbor cell information | |
| CN108540330A (en) | A kind of network fault diagnosis method based on deep learning under heterogeneous network environment | |
| CN102638831B (en) | Handover parameter optimization method and system | |
| CN105704734A (en) | Specified type cell detection method, device and communication terminal | |
| CN110913425A (en) | Wireless network index analysis method and system based on MR and xDR | |
| WO2021151503A1 (en) | Analytics node and method thereof | |
| CN110267277B (en) | MDT-based cell equalization degree evaluation method | |
| CN107094309B (en) | Method and system for configuring neighbor cell | |
| Soldani et al. | Self-optimizing neighbor cell list for UTRA FDD networks using detected set reporting | |
| EP3861785B1 (en) | Method of controlling traffic in a cellular network and system thereof | |
| CN108235389A (en) | A kind of method and apparatus of dynamic configuration adjacent cell | |
| EP3598789A1 (en) | Optimized determination method and device for pci confusion | |
| US20230292156A1 (en) | Trajectory based performance monitoring in a wireless communication network | |
| de la Bandera et al. | Improving cell outage management through data analysis | |
| CN112601262A (en) | Method for reducing ping-pong handover between adjacent cells | |
| CN106470464A (en) | The method of end message of collection destination object, device and video camera | |
| WO2011140886A1 (en) | Method and apparatus for inter-system reselection frequency statistics | |
| CN109982373B (en) | LTE frequent fallback point analysis method and device, computing device and storage medium | |
| WO2016065759A1 (en) | Method and apparatus for optimizing neighbour cell list | |
| Wang et al. | An improved TCM-based approach for cell outage detection for self-healing in LTE hetnets | |
| CN106878948B (en) | Signal blind spot positioning method and system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20210402 |