CN101170816A - Method and system for dynamic update and synchronization of registration area - Google Patents

Abstract

The invention discloses a method for dynamically updating and synchronizing a registration area. When a preset condition is met, the current location information of a UE is obtained, and the associated member group in the current side TA list is changed according to the location information; the changed TA list is applied. Replace the original TA list on the opposite side. Wherein, the members may be TA/RA/LA, and when a paging response event occurs for the UE, the network side performs paging within the member range of the current TA list. Also disclosed is a system for dynamically updating and synchronizing the registration area, which includes a TAlist updating module and a TA list synchronizing module connected with it. Through the method and system disclosed in the present invention, the timely update and adjustment of TA list is realized, and a smaller paging area is ensured; the occurrence frequency of paging object conversion caused by TAU/RAU/LAU is reduced; frequent network registration is avoided; System signaling is saved and system performance is improved.

Description

Method and system for dynamic update and synchronization of registration area

technical field

The present invention relates to a method and system for dynamic update and synchronization of a registration area, in particular to a dynamic update of the registration area through the dynamic change of the elements of the Tracking Area list (TA list) in an evolving network, and to maintain network A method and a system for synchronizing registration area information between a side and a user equipment (User Equipment, referred to as UE) side.

Background technique

In the existing 2G/3G network, the Serving GPRS Supporting Node (SGSN for short) passes through the Location Area (LA for short) for circuit domain services and the Routing Area (Routing Area for short) for packet domain services. RA) or User Registration Area (User Registration Area, URA) level saves the location information of the UE for mobility management. Wherein, for a 2G network, the URA is an LA, and for a 3G network, the URA is an RA. Correspondingly, when the UE is in the idle state, LA/RA/URA is the smallest unit for the network to know the location information of the UE. When the network side has a downlink service calling for the UE, the network side will perform paging in all cells . Therefore, when a UE moves from one area to another, if its LA, RA or URA changes, it needs to initiate a location update (LA Update, referred to as LAU) and a routing update (RA Update, referred to as RAU) accordingly. , that is, the registration area update (URA Update, referred to as URAU), the network side saves the new LA/RA, so as to ensure that the network side can find the UE when the downlink service arrives. Therefore, every time the UE changes the LA/RA, the network side will undergo a process of changing the stored LA/RA.

With the development of the current 3GPP network towards low latency, high speed and packetization, the Long Term Evolution (LTE for short)/System Architecture Evolution (SAE for short) network, also known as the evolved network, has become a mobile The development direction of communication network. In the LTE/SAE network, the functions of the user plane and the control plane are separated, and the mobility management function of the control plane is abstracted into a logical functional entity called a Mobility Management Entity (MME for short). It is abstracted into a logical functional entity called User Plane Entity (UPE for short). The MME is located in the core network and performs the mobility management function of the UE. It tracks the user's location information through the Tracking Area (TA for short), which is equivalent to LA and RA in the existing 2G/3G network. Therefore, when the UE moves within the same TA area, Tracking Area Update (TAU for short) will not occur; and when the UE moves from one TA to another, TAU needs to be initiated. From the perspective of saving signaling, on the one hand, the network hopes that the number of TAU occurrences of the UE will not be too frequent. Therefore, based on the mobile characteristics of the UE, the larger the division of the TA area, the better; on the other hand, when there is a downlink service call in the IDLE state When the UE is connected to the UE, since the network will page all the cells in the TA registered by the UE, the smaller the division of the TA area, the better. To sum up, in network planning, the above factors should be considered comprehensively for TA division to determine a fixed TA area with an appropriate size. But the problem caused by this is that when the UE moves back and forth between different TAs, it will cause frequent TAUs, causing the network to constantly change the TAs to be called, which is the so-called "Ping-Pang" effect.

In addition, when the UE moves between different Radio Access Technologies (RAT) networks, such as moving between 2G/3G networks and evolved networks, the UE will also cause a network registration process due to changes in the access network.

It can be seen that when a dual-mode or multi-mode UE is in use, frequent LAU/RAU and TAU may cause the network to frequently change paging objects and network registration problems. Referring to Fig. 1, it is an example of this possible situation, wherein RA1 and RA2 are existing 2G/3G routing areas, and TA1, TA2, TA3 and TA4 are tracking areas of the evolved network. When a dual-mode or multi-mode UE enters RA1 or RA2, it needs to register with the 2G/3G SGSN, and the network side must change accordingly every time the RA is changed; when it enters TA1, TA2, TA3 or TA4, it needs to register with the 2G/3G SGSN The MME/UPE of the evolved network registers, and every time the TA is changed, the network side also needs to change accordingly.

Therefore, how to achieve signaling saving, that is, how to reduce the frequency of changing the paging object on the network side when the LA/RA and TA change, and reduce the frequency of system registration between different RAT networks, is crucial to improving the performance of the evolved network and saving the system. It is of great significance to promote the transition and integration of evolution network and 2G/3G network.

There are two main solutions to this problem:

The first technical solution is the partial overlapping method of TA regions, as shown in FIG. 2 . In the process of network planning, a fixed overlapping area is defined. In Figure 2, TA1 and TA2 partially overlap, and TA2 overlaps with TA3. In this way, for a UE with a low moving speed, it moves at the boundary between TA1 and TA3 When , since it is within the range of TA2, there is no need to initiate TAU, thus solving the "Ping-Pang" effect problem. However, for UEs that cross TA overlapping areas back and forth at high speed, such as UEs used on intercity trains, the "Ping-Pang" effect problem still exists. Specifically, when the train crosses the boundary between TA1 and TA2, the All UEs must perform TAU, and the network side must perform a paging target change for all UEs; when the train crosses the boundary between TA2 and TA3, the network side must perform a paging target change for all UEs , and the same goes for the return journey. When the UE traverses multiple TA areas back and forth, frequent paging object changes will occur. It can be seen that the technical solution of partially overlapping TA areas does not properly solve the "Ping-Pang" effect caused by the UE crossing the overlapping area back and forth. The solution to the frequent network registration problem caused by moving between different RAT networks also has the defects of a large waste of system resources and a decrease in system performance.

The second technical solution is the hierarchical TA method, as shown in FIG. 3 . In the process of network planning, TA levels are divided according to the UE's movement characteristics, such as UE moving speed, standby time, etc.; UEs accessing the mobile communication network select appropriate TA levels according to their own movement characteristics, for example, fast UEs select high TA levels (indicated by level 3 "level 3" in FIG. 3), slow or stationary UEs select a low TA level (indicated by level 1 "level 1" in Figure 3). Further, the TA level can be set in two ways, one is to segment the TA level to represent different levels, as shown in Figure 3, 3rd level "level3", 2nd level "level2" and 1st level "level1"; It is a 9-digit binary method to set the TA level to xxx-xxx-xxx. Every 3 bits represent a level. For example, setting "001-001-010" represents the level "1-1-2". At this level, you can know all the levels that the community belongs to, including the highest level as District 1, the middle level as District 1, and the lowest level as District 2. However, this technical solution puts forward higher requirements on how to divide TA areas during network planning. For example, for UEs that perform traversal activities at the boundaries of higher-level TA areas, even if their traversal speed is low, they must be allocated a TA area. Higher-level TAs increase the paging area; as shown in Figure 3, when a UE crosses the boundary between TA1-1-2 and TA1-2-1 at a low speed, in order to avoid the "Ping-Pang" effect, it must be given It allocates TA1, so the paging area will be the entire TA1 area, resulting in a waste of signaling. At the same time, it is necessary to constantly judge the movement characteristics of the UE, determine the adjustment of the TA level of the UE, and share the adjustment results between the UE and the core network. side to synchronize, so it is very complicated to implement. At the same time, this technical solution does not solve the problem of repeated switching of paging objects on the network side caused by the LAU/RAU and the problem of frequent network registration caused by the UE moving between different RAT networks.

To sum up, there is no technical solution in the prior art to properly solve the problem of repeated transformation of paging objects on the network side caused by TAU/LAU/RAU and the problem of frequent network registration caused by UE moving between different RAT networks. For this reason, the idea of a TA list (list) is proposed: the UE is registered in an area, which is called the registration area of the UE. Different from the existing 2G/3G URA, the registration area can be a TA area or a combination of multiple TA areas, represented by TA list, when the UE moves in the registration area, the range of the network paging the UE is The entire registration area, therefore, the TAU that occurs in the registration area will not cause frequent changes of network paging objects. In this way, different TAs are dynamically selected for the UE to form a TA list according to the UE's motion state and location, which can eliminate the "Ping-Pang" effect, reduce the paging area, and save signaling. For example, in Figure 3, if the UE crosses the boundary between TA1-1-2 and TA1-2-1 at a low speed, if TA1-1-2 and TA1-2-1 are selected to form a TA list, the problem of too large paging area will be avoided. Avoid the "Ping-Pang" effect problem while keeping the paging area small. However, the TA list method is only an idea at present, and there is no practical solution to how to update the TA list, how to adjust the TA list according to the UE's motion state, and how to synchronize the TA list on the UE side and the network side. Therefore, a practical TA list solution is not provided in the prior art.

Contents of the invention

The purpose of the present invention is to provide a method and system for dynamic update and synchronization of the registration area, which solves the problem of repeated transformation of paging objects on the network side and the problem of network registration caused by frequent TAU/LAU/RAU, thereby improving the performance of the evolved network, Save system resources.

In order to achieve the above object, the present invention provides a method for dynamic update synchronization of the registration area, comprising the following steps:

Step 1. When the preset conditions are met, obtain the current location information of a UE, and change the associated member group in the current side TA list according to the location information;

Step 2. Apply the changed TA list to replace the original TA list on the opposite side.

In the above technical solution, before step 1, it also includes setting a preset condition that triggers a tracking area list change, the preset condition includes but is not limited to the occurrence of a network attachment event of the UE, reaching the periodic location update time of the UE, The UE generates a TAU event, a paging response event occurs, and/or the UE initiates a service request event.

Obtaining the current area information of the UE in the step 1 is to obtain the current area information of the UE by the core network side or the UE side according to the network agreement:

When the network agrees to be performed by the core network side, obtaining the current area information of the UE is specifically: the UE sends a request message to the MME on the core network side through the access network entity; the access network entity attaches the UE to the request message current location information;

When the network agrees to be performed by the UE side, obtaining the current area information of the UE is specifically: the UE obtains the area information carried in the system message broadcast by the base station;

Wherein, the area where the UE is currently located is the TA, RA, LA and/or mobile cell where the UE is currently located, and the area information includes the identity of the TA, LA and/or RA where the UE is currently located.

The information of the area where the UE is located may also include an identifier of the current neighboring area of the UE, the adjacent area is a TA adjacent to the area where the UE is located, and optionally includes an LA and/or RA adjacent to the area where the UE is located.

In the step 1, changing the associated member group in the current tracking area list according to the location information is specifically changing the member group in the current side tracking area list, and the members in the member group are related to each other by their life value.

In order to reduce unnecessary system or terminal resource occupation, a better technical solution is: the step 2 further includes: the opposite side only retains members of the changed tracking area list.

Alternatively, changing the associated member group in the current side tracking area list according to the area information in the step 1 is specifically changing the member group in the current side tracking area list, and the members in the member group are based on the area corresponding to the area information. Center, Adjacent Association.

Further, the step 2 specifically includes carrying the changed tracking area list in the communication signaling between the current side and the opposite side, and sending the changed tracking area list from the current side to the opposite side.

After the step 2, it also includes: when a paging response event occurs for the UE, the network side performs paging within the member range of the current TA list. Therefore, the paging area is effectively reduced, and signaling resources are saved.

The present invention also provides a system for dynamic update and synchronization of the registration area, including:

The TA list update module is used to obtain the current area information of the UE that meets the preset conditions, and change the associated member group in the TA list on the current side of the TA list update module according to the area information;

The TA list synchronization module is connected with the TA list update module, and is used to replace the original TA list on the opposite side of the TA list update module with the changed TA list.

The TA list update module can be located at the core network side or at each UE terminal side.

It may also include an information storage module, which is used to provide the area information of the UE to the TA list update module; the information is the identity of the UE's/adjacent TA and the identity of the/adjacent routing area and location area, or, the The above-mentioned identification is the identification of the UE's location/neighboring tracking area, and the identification of any tracking area includes the identification information of the current tracking area and the identification information of the routing area and the location area where it is located.

It can be seen from the above technical solution that the present invention implements update synchronization by adopting member changes through the TA list, and has the following beneficial effects:

1. The TA list is updated and adjusted in time according to the call status and location changes of each UE, ensuring a smaller paging area;

2. The registration area includes most of the UE's active areas in the evolved network, which reduces the frequency of paging object changes on the network side caused by TAU;

3. The registration area further includes most of the UE's activity areas under different RAT networks, which reduces the frequency of paging object change on the network side caused by RAU/LAU, and also avoids frequent network registration;

4. In general, there is no need to make large-scale changes to the mobile communication system, and system signaling is saved, and system performance is improved.

The technical solutions of the present invention will be described in further detail below with reference to the accompanying drawings and embodiments.

Description of drawings

Figure 1 is an example of LAU/RAU/TAU and network registration problems existing in current dual-mode/multi-mode UEs;

Fig. 2 is an example of the partial overlapping method of the TA region in the prior art;

Fig. 3 is an example of the hierarchical TA method in the prior art;

Fig. 4 is the basic flowchart of the method for dynamic update synchronization of the registration area provided by the present invention;

Fig. 5 is the flowchart of an embodiment of updating TA list provided by the present invention;

Fig. 6 is the flowchart of an embodiment of the convergence TA list provided by the present invention;

Fig. 7 is a schematic diagram of another method for updating TA list provided by the present invention;

Fig. 8 is the flowchart of embodiment 1 of the method provided by the present invention;

Fig. 9 is a flow chart of Embodiment 2 of the method provided by the present invention;

Fig. 10 is a flowchart of Embodiment 3 of the method provided by the present invention;

Figure 11 is a flow chart of Embodiment 4 of the method provided by the present invention;

FIG. 12 is a flow chart of instant synchronization in Embodiment 5 of the method provided by the present invention;

FIG. 13 is a flow chart of different time synchronization in Embodiment 5 of the method provided by the present invention;

Fig. 14 is a flowchart of Embodiment 6 of the method provided by the present invention.

Detailed ways

In order to overcome the problem of repeated transformation of paging objects on the network side caused by frequent TAU/RAU/LAU in the prior art and the frequent network registration problem in the prior art, the present invention provides a set of practical TA list solutions, The TA list of each UE constitutes the UE's registration area, and the network side performs paging in the registration area, which will be described in detail below.

The method for dynamic update synchronization of the registration area provided by the present invention, referring to Fig. 4, comprises the following steps:

Step 1. When the preset conditions are met, obtain the current area information of a UE, and change the associated member group in the current side TA list according to the area information. The members are tracking areas, and optionally include location areas and/or or routing area;

Step 2. Apply the changed TA list to replace the original TA list on the opposite side.

Among them, the size and location of the TA are determined during network planning, and the members in the TA list are dynamically adjusted by querying the current area of the UE when the preset conditions are met. Therefore, before step 1, it also includes setting a preset condition that triggers the change of the TA list. The preset condition is an event accompanied by UE location information update during signaling or service interaction between the UE and the core network, including but not limited to the UE A network attach event occurs, a periodic location update time of the UE is reached, a TAU event occurs on the UE, a paging response event occurs, and/or a service request event is initiated by the UE. For example, when a TAU event occurs, only when the updated area is not included in the TA list members, the members will be changed. Compared with the prior art, every time a TAU event occurs, the paging object on the network side will be changed. Obviously, The frequency of changes is greatly reduced.

In order to further overcome the frequent changes of paging objects and network registration problems caused by RAU/LAU, before the step 1, it also includes setting TA, LA and RA, and setting any TA and the RA and RA overlapped by the TA LA logo. In this way, the UE registration area composed of members in the TA list is a multi-access technology network element including RA, LA and TA. As shown in Figure 1, when it is learned that the UE has entered TA1 or TA2, RA1 also becomes a member of the TA list as the area where the UE is located. At TA3, RA2 also becomes a member of the TA list as the area where the UE is located; when it is learned that the UE enters TA4, RA1 and RA2 become members of the TA list as the area where the UE is located at the same time, then when entering RA2 from RA1, the occurrence of RAU will no longer occur. Causes the change of the paging object on the network side.

However, although the above settings can overcome the frequent changes of paging objects and network registration problems caused by TAU/RAU/LAU, the LA, RA, and TA identifiers are all used as TA list members, which will increase the length of the TA list and increase resource overhead. Therefore, referring to the idea of TA division in the hierarchical TA method, when planning TA division in the network, one RA/LA is divided into one or several TA areas. LA's identification information, the members in the TA list only include TAs, but the system can identify the RA and LA it belongs to based on the TA's identification. Still taking Figure 1 as an example, the identification information of RA1 is included in the identification of TA1, TA2 and TA4, and the identification information of RA2 is included in the identification of TA3 and TA4. When TA4 is used as the TA list, the UE moves in it The resulting RAU will not bring any change to the paging object, avoiding unnecessary resource expenditure of the system. In the above solution, TAs, RAs, and LAs can overlap, but if the above elements are set to non-overlapping relationships during network planning, that is, the RAs that make up one LA cannot be superimposed on another LA, the TA that constitutes a certain RA cannot be superimposed on another RA, so the change of RA and LA must be accompanied by the change of TA, and one-time processing of TA can meet the requirements, so the system performance can be further improved. Through the above steps, the operator or network manager can choose whether to use LA and RA as members of the TA list during planning. Therefore, the members of the TA list selectively include LA and/or RA.

In step 1, the core network side or the UE side obtains the current area information of the UE according to the network agreement:

When the network agrees that the acquisition is performed by the core network side, obtaining the current area information of the UE specifically includes: the UE sends a request message to the MME on the core network side through the access network entity; the access network entity appends the above information to the request message UE's current location information; then the MME on the core network side can determine the current physical area of the UE according to the location information;

When the network stipulates that the acquisition is performed by the UE side, obtaining the current area information of the UE is specifically: the UE acquires the area information carried in the system message broadcast by the base station; then the UE can determine the current physical area according to the area information . The aforementioned physical areas include TA, RA, and LA.

The access network entity varies with the actual access network. For an evolved network, the access network entity is an ENodeB (Evolved NodeB, i.e. an evolved NodeB), also called a base station; for a 3G network, it can be a base station, or It may be a radio network controller (Radio Network Controller, RNC for short).

Wherein, the area where the UE is currently located may be TA, RA, LA, or a cell cell containing TA, RA, and LA identities; the area information includes the TA, RA, and/or LA identification of the UE currently located, or It may further include an identifier of a current neighboring area of the UE, where the adjacent area is a TA adjacent to the area where the UE is located, and optionally includes an LA and/or RA adjacent to the area where the UE is located.

After knowing the area of the UE, in step 1, changing the associated member group in the current side tracking area list according to the area identifier is specifically changing the member group in the current side tracking area list. Associated, one of the methods includes:

Step 11, judging whether the area TA _k corresponding to the area information of the current UE is a member of the current side TAlist, if yes, perform step 12, otherwise perform step 13;

Step 12, set the member to have the maximum life value LV _MAX agreed by the system, and execute step 14;

Step 13. Add the area TA _k of the UE as a new member to the current side TA list, and set the member to have the maximum life value LV _MAX agreed by the system;

Step 14, judging whether the member TA _k is adjacent to a certain member in the current side TA list, if so, perform step 15 on the member, otherwise, if it is not adjacent or cannot determine whether it is adjacent, perform step 16;

Step 15. Subtract a threshold V _n from the life value of the adjacent member, and execute Step 17;

Step 16. Subtract a threshold value V _m from the health values of the non-adjacent or undetermined adjacent members, and execute step 17;

Step 17. Determine whether the TA list on the current side has been traversed, and if so, end; otherwise, execute step 14 for members that have not been traversed.

Wherein, V _m >V _n >0.

In this way, by defining the life value of members, the dynamic update of the registration area is realized.

There are two ways to change the members and their health values in the TA list on the current side. One is before step 17, which also includes:

Step 1701, judging whether the life value of the member is less than the minimum life value LV _MIN agreed by the system, if yes, go to step 1702, otherwise go to step 17;

Step 1702, delete the member from the current TA list, and execute step 17.

In this way, the dynamic update of TA list members is maintained, which is called the TA list update method, see Figure 5.

The other before step 17, also includes:

Step 1711, judging whether the life value of the member is less than the minimum life value LV _MIN agreed by the system, then execute step 1712, otherwise execute step 17;

Step 1712: Assign the member to the system agreed minimum life value LV _MIN , and execute step 17.

In this way, the dynamic sorting of TA list members is maintained, which is called the TA list convergence method, see Figure 6.

It can be seen that the difference between the TA list update method and the TA list convergence method is that the TA list convergence method does not delete members of the TA list, but only accelerates convergence. Wherein, in step 11, judging the area corresponding to the area information of the current UE location may be specifically, extracting the TA, RA, and/or LA identifier contained in the cell information and judging the corresponding TA, RA, and/or LA, or directly according to the TA, RA, and/or LA The identification of the RA and/or LA determines the corresponding TA, RA and/or LA.

In step 1, changing the associated member group in the current side tracking area list according to the location information is specifically changing the member group in the current side tracking area list, and another method for members in the member group to be related to each other by their life value includes :

Step 11', judging whether the area TA _k corresponding to the area information of the current UE is a member of the current side TA list, if yes, perform step 12', otherwise perform step 13';

Step 12', set the member to have the minimum life value LV _MIN agreed by the system, and execute step 14';

Step 13', add the area TA _k of the UE as a new member to the current side TA list, and set the member to have the minimum life value LV _MIN agreed by the system;

Step 14', judging whether the member TA _k is adjacent to a certain member in the current side TA list, if yes, execute step 15' for the member, otherwise, it is not adjacent or it is impossible to determine whether it is adjacent, Execute step 16';

Step 15', adding a threshold value V _n to the life value of the adjacent member, and performing step 17';

Step 16', adding a threshold value V _m to the life values of the members who are not adjacent or cannot be determined to be adjacent, and execute step 17';

Step 17', judging whether the TA list on the current side has been traversed, and if so, end; otherwise, execute step 14' for members that have not been traversed.

Wherein, V _m >V _n >0.

In this way, by defining the life value of members, the dynamic update of the registration area is also realized.

The above-mentioned method of changing the members and their life values in the TA list on the current side can also be divided into two types, one is before step 17′, and also includes:

Step 1701', judging whether the life value of the member is greater than the maximum life value LV _MAX agreed by the system, if yes, execute step 1702', otherwise execute step 17';

Step 1702', delete the member from the current TA list, and execute step 17'.

That is, the TA list update method.

Another method also includes before step 17':

Step 1711', judging whether the life value of the member is greater than the minimum life value LV _MAX agreed by the system, then execute step 1712', otherwise execute step 17';

Step 1712', grant the member the system agreed maximum life value LV _MAX , and execute step 17'.

That is, the TA list convergence method.

Wherein, in step 11', judging the area corresponding to the area information of the current UE can be specifically, extracting the TA, RA, and/or LA identifier contained in the cell information and judging the corresponding TA, RA, and/or LA, or directly according to the TA , RA and/or LA identifiers to determine the corresponding TA, RA and/or LA.

Whether it is using the increment/decrement TA list change method or the convergent/update TA list change method, in order to ensure that the length of the TA list is within a certain range, thereby ensuring that the area of the paging area is effective and does not cause waste of signaling, The maximum length of the TA list can be preset. When the number of members reaches the maximum length and new members are added, the member with the smallest or largest life value will be deleted from the list

In order to reduce unnecessary system or terminal resource occupation, the step 2 further includes: the opposite side only retains members of the changed tracking area list. The list that only retains members is called a synchronous TAlist, while the list that retains members and their life values at the same time is called a calculation-type TA list. The following is an example of a calculation-type TA list and a corresponding synchronization-type TA list (X _i = 1, 2, ...n):

Computational TA list Synchronous TA list

Member Member Health Points Member

TA ₁ X ₁ TA ₁

TA ₂ X ₂ TA ₂

... ... ... ...

TA _n X _n TA _n

In the multi-access technology, the members of the TA list can also be RA/LA, but when the identification information of the RA/LA is included in the TA identification, the members still only include the TA.

Since the calculation of the TA list change can be performed on the core network side or on the UE side, the use of the calculation type TA list and the synchronization type TA list is as follows: If the calculation of the TA list is performed on the core network side, the core network The calculation type TA list is used on the UE side, and the synchronous type TA list is used on the UE side; if the calculation of the TA list is performed on the UE side, the calculation type TA list is used on the UE side, and the synchronous type TA list is used on the core network side. Specifically, whether the core network side or the UE side performs the calculation can be set by the operator according to actual needs.

Another method of changing the associated member group in the current side tracking area list according to the area information in the step 1 is to change the member group in the current side tracking area list, and the members in the member group identify the corresponding The area is the center and adjacent associations include:

Step 1a, judging whether the area corresponding to the area information of the UE is a member of the current side tracking area list, if yes, no change occurs, and ends; otherwise, perform step 1b;

Step 1b, using the area of the UE and areas spatially adjacent to the area of the UE as members to form a new current tracking area list.

For example, TA is preset to be changed to 3*3 each time, and RA and LA may also be included for convenience of representation. As shown in Figure 7. When the UE is in TA22 after the last change, it is equivalent to 9 TA areas in the TA list including TA11→TA13, TA21→TA23 and TA31→TA33; when the UE moves to TA23, TAU occurs, but it is still in the above 9 TA areas Within the range, no update occurs; when the UE moves to TA24, the TA list is reset with TA24 as the center; the updated TA list includes 9 TA areas, which are TA13→TA15, TA23→TA25 and TA33→TA35 . It can be seen that the above technical solution does not update the TA list every time a key event such as TAU occurs in the system, which saves system resources. At the same time, multiple TA areas are associated, which optimizes the Ping-Pang effect caused by frequent registration and updates.

Wherein, in step 1a, judging the area corresponding to the area information of the current UE location may be specifically, extracting the TA, RA, and/or LA identifier contained in the cell information and judging the corresponding TA, RA, and/or LA, or directly according to the TA, RA, and/or LA The identification of the RA and/or LA determines the corresponding TA, RA and/or LA.

Obviously, except for the method of changing the TA list introduced above, those skilled in the art can also use any other known method without affecting the implementation of the technical solution of the present invention.

In step 2, apply the changed tracking area list to replace the original tracking area list on the opposite side, so that the new TA list obtained after calculation ensures the consistency between the UE side and the core network side, that is, the synchronization of the TAlist is guaranteed . But this synchronization can happen immediately after the update/convergence process, or after the update/convergence, when a trigger event is generated. For example, for the case of calculation on the network side, after the update/convergence process is performed on the network side, when the UE is paged, the updated TA list can be sent to the UE together with the paging signaling to achieve synchronization; another example, For the calculation on the UE side, after the update/convergence process is performed on the UE side, when the UE generates a paging response or initiates a service request, it can be sent to the MME along with the request signaling to achieve synchronization. The implementation of synchronization is specifically that the step 2 is specifically carrying the changed tracking area list in the communication signaling between the current side and the opposite side, and sending the changed tracking area list from the current side to the opposite side. When the current side is the core network side, the tracking area update acceptance message initiated by the core network side to the UE side carries the changed tracking area list. When the current side is the UE side, the changed tracking area list is carried in the request message initiated by the UE side to the core network side.

Based on the above description, the UE side or the core network side where the TA list change occurs is different, and the preset conditions for the TA list change are different, and the timing of the synchronization is different. Therefore, there may be multiple synchronization schemes. The following three examples are given. illustrate:

1. Synchronization scheme for key event-driven calculation on the core network side: the calculation side is the core network side, and the UE or ENodeB reports the location of the current TA area where the UE is located to the core network; the preset conditions are network attachment time occurrence, TAU occurrence and/or TA list update/convergence is performed when a business request occurs; real-time synchronization. For example, a network attachment event, such as when a UE accesses the core network event, the MME queries the UE's current area identification to determine the area, adds the member to the TA list and assigns the maximum life value, and then synchronizes it to the UE side to complete the core network side. And the initialization process on the UE side; when a TAU occurs, the MME starts the TA list update algorithm process, obtains a new TA list, sends a TA update acceptance message carrying the updated TA list to the UE, and updates the TA list on the UE side to achieve the purpose of synchronization ; When a service request occurs, the MME starts the TA list update/convergence algorithm process according to the received service request message.

2. The key event drives the synchronization scheme of the UE side calculation: the calculation side is the UE side, and the UE knows the current location of the TA area through the system message; the preset conditions are when the network attachment time occurs, when the TAU occurs, and when the periodicity of the UE is reached TA list update/convergence is performed when the location is updated and/or when the UE performs a paging response; and instant synchronization. For example, when a network attachment event occurs, the UE side calculates a new TA list, and carries the new TA list in the request message sent to the MME to complete the initialization process of the core network side and the UE side; when a TAU occurs, the UE starts the TA list update Algorithm process, obtain a new TA list, and then carry the new TA list in the request message initiated by the MME to replace the old TA list on the core network side to achieve the purpose of synchronization; when the network side pages the UE according to the existing TA list , the UE responds to paging, starts the TA list update algorithm process, obtains the new TA list, and then carries the new TA list in the response message sent to the MME to replace the old TA list on the core network side to achieve the purpose of synchronization.

3. The UE side calculates the synchronization scheme driven by key events: the calculation side is the UE side, and the UE knows the current location of the TA area through the system message; the preset conditions are when the network attachment time occurs, the TAU occurs, and the UE responds with paging TA list update/convergence is performed when the UE's periodic location update time is reached and/or when the UE's periodic location update time is reached; when the UE requests synchronization. For example, when a network attachment event occurs, the UE side calculates a new TA list, and carries the new TA list in the request message sent to the MME to complete the initialization process of the core network side and the UE side; when a TAU occurs, the UE starts the TA list update Algorithm flow, obtain a new TA list, and then carry the new TA list in the request message initiated by the MME to replace the old TA list on the core network side to achieve synchronization; a TA list periodic calculation timer is set on the UE side , when the timer expires, start the TA list update algorithm process to obtain a new TA list, and then carry the new TA list in the request message to the MME to replace the old TA list on the core network side to achieve the purpose of synchronization.

After the synchronization is updated, when a paging response event occurs for the UE, the network side performs paging within the member range of the current tracking area list. It can be seen that the paging range at this time has been limited to a relatively suitable area.

Example 1:

Referring to Figure 8, the UE moves within the same MME and performs the process of updating and synchronizing the TA list. When the UE enters a new TA area (not in the TA list), or the periodic TA area update timer expires, or the UE transfers from one access technology network to another, the TAlist is performed by the network side Update algorithm and synchronization process:

Step 101. When the UE determines that the preset conditions such as TAU/timeout/network registration are satisfied, the ENodeB sends a TA update request to the MME, and the ENodeB adds the identifier of the TA area where the UE is currently located to the request message;

Step 102, the MME determines that the current area of the UE is TA _k according to the area identifier, and at the same time completes the updating of the location and security functions of the TA;

Step 103: According to the current TA _k of the UE and the existing TA list stored in the MME, the MME starts the TA list update algorithm process, adds TA _k to the list, thereby obtaining a new TA list, and uses it to update and replace the original TA list on the core network side. There is a TA list, TA _k in the new TA list has the maximum life value LV _MAX ;

Step 104, the MME sends a TA update message to the UE, carrying a new TA list in the message, and using it to update and replace the original TA list on the UE side, so as to achieve the purpose of synchronizing the TA list on the UE side and the core network side;

Step 105, the UE sends a TA update completion confirmation message to the MME.

Then thereafter, when a paging response event occurs for the UE, the network side performs paging within the member range of the current TA list.

Example 2:

Referring to Figure 9, the UE moves within different MMEs and performs the process of updating and synchronizing the TA list. When the UE enters a new TA area (not in the TA list), the network side performs the TA list update algorithm and synchronization process:

Step 201. When the UE determines that the preset conditions such as TAU are satisfied, the ENodeB sends a TA update request to the MME, and the ENodeB adds the location identifier of the TA area where the UE is currently located to the request message;

Step 202, the current MME determines that the area where the UE is currently located is TA _k according to the area identifier, and sends a context request of the UE to the MME before the UE moves;

Step 203, the MME before moving returns the context of the UE to the current MME, and the context includes the TA list of the UE;

Step 204, the current MME removes irrelevant TAs from the list, and at the same time completes updating of TA locations, security functions, etc.;

Step 205, according to the current TA _k of the UE and the existing TA list stored in the current MME, the MME starts the TA list update algorithm process, adds TA _k to the list, thereby obtaining a new TA list, and uses it to update and replace the core network side In the original TA list, TA _k in the new TA list has the maximum life value LV _MAX ;

Step 206, the current MME sends an acceptance TA update message to the UE, the message carries a new TA list, and uses it to update and replace the original TA list on the UE side, so as to achieve the purpose of synchronizing the TA list on the UE side and the core network side;

In step 207, the UE sends a TA update completion confirmation message to the MME.

Example 3:

Referring to Figure 10, when the UE in the idle (LTE Idle) state initiates a service (the current TA is in the TA list), the UE initiates a service request process to the core network, and the network side performs the TA list update algorithm and synchronization process, so that the TA The health value of the elements in the list quickly converges to the minimum value, so that these elements with the smallest health value can be quickly deleted from the TA list in the next update process.

Step 301, the UE sends a service request to the MME, and the message carries the identifier of the TA area where the UE is currently located;

Step 302, the MME determines that the area where the UE is currently located is TA _k according to the registration area identifier, and at the same time completes the updating of the location and security functions of the TA;

Step 303: According to the current TA _k of the UE and the existing TA list stored in the MME, the MME starts the TA list convergence algorithm process, obtains a new tracking area list, and uses it to update and replace the original TA list on the core network side. TA _k in the new TA list has the maximum life value LV _MAX ;

Step 304. When paging the UE, the MME sends the updated TA list together with the paging signaling to complete the synchronization.

Example 4:

Referring to Figure 11, when the UE enters a new TA area (in or not in the current TA list), or the periodic TA area update timer expires, or the UE switches from one access technology to another access technology system, update algorithm and synchronization process by UE TA list:

Step 401, when the UE judges that the preset conditions such as TAU/timeout/network registration are met, obtain the area identification carried in the system message broadcast by the base station, and determine the area where the UE is currently located as TA _k according to the area identification;

Step 402, the UE starts the TA list update algorithm process, obtains a new TA list, and uses it to update and replace the original TA list on the UE side, and TA _k in the new TA list has the maximum life value LV _MAX ;

Step 403, the UE sends a TA update request to the MME, the request message carries a new TA list, and uses it to update and replace the original TA list on the core network side, so as to achieve the purpose of synchronizing the tracking area list.

Example 5:

Referring to Figure 12, when the UE enters a new TA area (in or not in the TA list), or the periodic TA area update timer expires, or the UE switches from one access technology to another access technology access system , the UE performs the TA list update algorithm and synchronization process:

Step 501, when the UE determines that the preset conditions such as TAU/timeout/network registration are satisfied, send a TA update request to the MME;

Step 502, the MME sends a TA update message to the UE;

Step 503, the UE acquires the area identifier carried in the system message broadcast by the base station, and determines that the area where the UE is currently located is TA _k according to the area identifier; according to the current TA and the existing TA list stored in the UE, the UE starts TA list update algorithm process, obtain a new TA list, and use it to update and replace the original TA list on the UE side, and TA _k in the new TA list has the maximum life value LV _MAX ;

Step 504, the UE sends a TA update completion confirmation message to the MME, and the message carries a new TA list, which is used to update and replace the original TA list on the core network side, so as to achieve the purpose of synchronizing the TA list on the UE side and the core network side.

Or do not execute the step 504, but execute the step 504': when the UE in the LTE Idle state initiates a service/paging response, it initiates a service request process to the core network side, and at this time performs TA list synchronization, as shown in Figure 13.

Embodiment 6:

Referring to Figure 14, when the UE in the LTE Idle state actively initiates services and a paging response event occurs, the UE performs the TA list convergence algorithm process and synchronization process:

Step 601, the UE confirms that it will initiate a service request or paging response to the MME, start the TA list convergence algorithm process, obtain a new TA list, and use it to update and replace the original TA list on the UE side;

Step 602, the UE sends a service request/paging response to the MME, the request/response message carries a new TA list, and uses it to update and replace the original TA list on the core network side, so as to achieve the purpose of synchronization.

The present invention also provides a system for dynamic update and synchronization of the registration area, including:

The TA list update module is used to obtain the current area information of the UE that meets the preset conditions, and change the members and member life values in the TA list on the current side of the TA list update module according to the area information, and the members is a Tracking Area and optionally includes a Location Area and/or Routing Area;

The TA list synchronization module is connected with the TA list update module, and is used to replace the original TA list on the opposite side of the TA list update module with the changed TA list.

The TA list updating module is located at the core network side or at each UE terminal side. The specific side to be set on can be determined by the operator according to actual needs. The TA list synchronization module can be divided into two parts, which are respectively located on the core network side and the terminal side, and are used to send synchronization messages and complete the reception and replacement of TA list; but from the perspective of the system, if the TA list Update is regarded as a system function, so the TA list synchronization module can also be set only on the current side to issue the updated TA list, and the system on the opposite side will automatically complete the update and replacement.

The system provided by the present invention further includes a special information storage module, which is used to provide the TAlist update module with information about the area where the UE is located; the information is the identity of the TA where the UE is located and the identities of the RA and LA where the UE is located, and can also provide information about the area where the UE is located. The identification of neighboring TAs and the identifications of neighboring RAs and LAs.

However, in order to avoid the increase in the length of the TA list and the increase in resource overhead caused by LA, RA, and TA being members of the TA list, the identification can be used as the identification of the TA where the UE is located, and the identification of any TA includes this TA The identification information of the RA and the identification information of the LA where it is located. Then the area information of the UE provided to the TA list update module is the identification of the TA where the UE is located, and the identification of the adjacent TA of the UE can also be provided.

In order to use the TA identifier to indicate the identifier information of the RA and LA where it resides, any RA/LA in the system consists of at least one TA.

Further, if the TAs, the LAs, and the RAs do not overlap, effective coverage of the entire area can be achieved.

The information storage module is located in the access network entity of each tracking area. Information is added by the access network entity during message transmission between the network side and the UE side.

Finally, it should be noted that the above embodiments are only used to illustrate the technical solutions of the present invention and not to limit them. Although the present invention has been described in detail with reference to the preferred embodiments, those of ordinary skill in the art should understand that: it still Modifications or equivalent replacements can be made to the technical solutions of the present invention, and these modifications or equivalent replacements cannot make the modified technical solutions deviate from the spirit and scope of the technical solutions of the present invention.

Claims (19)

1. method that dynamic registration area update is synchronous is characterized in that may further comprise the steps:

Step 1, satisfy when pre-conditioned, obtain the current location information of a UE, according to related member's group of described location information-change in the tabulation of front side tracking area;

The original tracking area tabulation of opposite side is replaced in step 2, the described tracking area tabulation after changing of application.

2. method according to claim 1, it is characterized in that also comprising before the described step 1 being provided with and trigger the pre-conditioned of tracking area tabulation change, describedly pre-conditionedly include but not limited to that described UE network attachment incident, the periodic location update time that reaches described UE, described UE takes place the tracing section updating incident takes place, the page response incident takes place and/or described UE initiates the service request incident.

3. method according to claim 1, it is characterized in that obtaining in the described step 1 the current location information of UE is according to network convention, to obtain the current location of UE information by core-network side or UE side:

When network convention was undertaken by core-network side, obtain the current location information of UE and be specially: UE sent a request message by the mobile management entity of access network entity to core-network side; Described access network entity is the additional current location information of described UE in request message;

When network convention was undertaken by the UE side, obtain the current location information of UE and be specially: UE obtained the location information of carrying in the system message of base station broadcast;

Wherein, the location is tracking area, route district, lane place and/or the mobile cell at the current place of UE, comprises the sign of tracking area, route district and/or the lane place at the current place of UE in the information of described location.

4. method according to claim 3 is characterized in that also comprising in the information of location the sign of the current adjacent region of UE, and described adjacent region is the tracking area adjacent with the UE location, and selectivity comprises and position adjacent district, UE location and/or route district.

5. method according to claim 1 is characterized in that described step 2 also comprises: opposite side only keeps the member of tracking area tabulation after changing.

6. according to the arbitrary described method of claim 1-5, it is characterized in that being specially the member group of change in the tabulation of front side tracking area according to location sign change when the related member in the tabulation of front side tracking area organizes in the described step 1, member in described member's group is interrelated with member's vital values, comprising:

Step 11, judging that whether the zone of described UE location information correspondence is described member when the tabulation of front side tracking area, is that maximum vital values and the execution in step 13 that described member has system's agreement then is set, otherwise execution in step 12;

Step 12, the zone of described UE is joined described in the tabulation of front side tracking area as the newcomer, and the maximum vital values that described member has system's agreement is set;

Step 13, judge that whether described member exists adjacent situation with described member in the tabulation of front side tracking area, be then, successively to each adjacent member's execution in step 14, otherwise, non-conterminously maybe can't judge whether adjacent member's execution in step 15 to each successively;

Step 14, described adjacent member's vital values is deducted a threshold value V _n, finish;

Step 15, described non-conterminous adjacent member's the vital values that maybe can't judge whether is deducted a threshold value V _m, finish;

Wherein, V _m＞V _n＞0.

7. method according to claim 6, it is characterized in that also comprising after the described step 15: travel through the described vital values of working as whole members in the tracking area tabulation of front side, the member who vital values is arranged minimum vital values less than system deletes when the tabulation of front side tracking area from described.

8. method according to claim 6, it is characterized in that also comprising after the described step 15: travel through the described vital values of working as whole members in the tracking area tabulation of front side, vital values is arranged minimum vital values less than member's imparting system that system arranges minimum vital values.

9. according to the arbitrary described method of claim 1-5, it is characterized in that being specially the member group of change in the tabulation of front side tracking area according to the location information-change when the related member in the tabulation of front side tracking area organizes in the described step 1, member in described member's group is interrelated with member's vital values, comprising:

Step 11 ', judge that whether the zone of described UE location information correspondence is described member when the tabulation of front side tracking area, be then be provided with described member have the minimum vital values of system's agreement and execution in step 13 ', otherwise execution in step 12 ';

Step 12 ', the zone of described UE is joined described in the tabulation of front side tracking area as the newcomer, and the minimum vital values that described member has system's agreement is set;

Step 13 ', judge that whether described member exists adjacent situation with described member in the tabulation of front side tracking area, be then, successively to each adjacent member's execution in step 14 ', otherwise, successively to each non-conterminous maybe can't judge whether adjacent member's execution in step 15 ';

Step 14 ', described adjacent member's vital values is added a threshold value V _n, finish;

Step 15 ', described non-conterminous adjacent member's the vital values that maybe can't judge whether is added a threshold value V _m, finish;

Wherein, V _m＞V _n＞0.

10. method according to claim 9, it is characterized in that described step 15 ' also comprise afterwards: travel through described in the tabulation of front side tracking area whole vital values of members, the member who vital values is arranged maximum vital values greater than system is from described deletion when the tabulation of front side tracking area.

11. method according to claim 9, it is characterized in that described step 15 ' also comprise afterwards: travel through described in the tabulation of front side tracking area whole vital values of members, vital values is arranged maximum vital values greater than member's imparting system that system arranges maximum vital values.

12. according to the arbitrary described method of claim 1-5, it is characterized in that being specially the member group of change in the tabulation of front side tracking area according to the location information-change when the related member in the tabulation of front side tracking area organizes in the described step 1, member in described member's group is the center with the zone of location information correspondence, adjacent association comprises:

Step 1a, judging that whether the zone of described UE location information correspondence is described member when the tabulation of front side tracking area, is then not change, and finishes; Otherwise execution in step 1b;

Step 1b, with the zone of described UE and with the regional space adjacent areas of described UE as member composition new when the tabulation of front side tracking area.

13., it is characterized in that described step 2 is specially carrying described tracking area tabulation after changing in the communication signaling of front side and opposite side, sends to opposite side with described tracking area tabulation after changing from working as the front side according to the arbitrary described method of claim 1-5.

14. method according to claim 13 is characterized in that when the front side is core-network side, accepts to carry in the message described tracking area tabulation after changing at the tracing section updating that core-network side is initiated to the UE side.

15. method according to claim 13 is characterized in that when the front side is the UE side, carries described tracking area tabulation after changing in the request message that UE side direction core-network side is initiated.

16. the system that dynamic registration area update is synchronous is characterized in that comprising:

Tracking area list update module is used to obtain and satisfies the current location information of pre-conditioned UE, and according to the related member group of the described tracking area list update of described location information-change module in the tracking area tabulation of front side;

Tracking area tabulation synchronization module is connected with described tracking area list update module, and the original tracking area tabulation of described tracking area list update module opposite side is replaced in the tracking area tabulation that is used to use after changing.

17. system according to claim 16 is characterized in that described tracking area list update module is positioned at core-network side or UE side.

18. according to claim 16 or 17 described systems, it is characterized in that also comprising information storage module, be used for providing UE location information to described tracking area list update module; Described information is the sign in UE place/neighbor tracking district and the sign of place/adjacent route district and lane place, perhaps, described information is the sign in UE place/neighbor tracking district, and comprises the identification information of this tracking area and the identification information of place route district and lane place in the sign of arbitrary tracking area.

19. system according to claim 17 is characterized in that described information storage module is arranged in access network entity.

Images