• 专利附录
  • 专利说明
  • 权利要求
  • 类似技术
  • 同族专利
  • 引用文献
  • 法律状态
  • 优先权
    • 专利摘要:
    PURPOSE: A method for registering a position of a mobile communication system is provided to optimize a position registration point by deciding the next position registration time and updating a position registration using a movement distance and a call reaching rate of a terminal. CONSTITUTION: An MS(Mobile Station) monitors an SID(System Identification) and NID(Network Identification) in an idle status through a paging channel(S200) periodically and monitors position information including a latitude and a longitude of a BS(Base Station) periodically(S202). If an initial call delivery or a position registration is generated and a predetermined time passes, the MS calculates a distance between a cell currently possessed in the MS and the lastly registered cell possessed in the MS in accordance with monitored time information and position information(S204). It is checked as to a variation of the number of cells in accordance with a distance data variation and calculates the sum of the number of cells to be paged until a cell number at a call delivery(S206). The sum of the number of cells being calculated and a call delivery rate in accordance with a call delivery interval distribution function are calculated(S208), and the next position registration time is discriminated(S210). A position registration of the MS is updated in a VLR(Visited Location Register) according to the position registration discrimination result(S212).
    公开号:KR20020039484A
    申请号:KR1020000069317
    申请日:2000-11-21
    公开日:2002-05-27
    发明作者:류시훈；한정표；김형섭
    申请人:조정남；에스케이 텔레콤주식회사；
    IPC主号:
    专利说明:

    METHOD FOR UPDATING A LOCATION IN A MOBILE SYSTEM}
    [11] The present invention relates to a location registration method of a mobile communication system, and more particularly, to a location registration method of a mobile communication system for determining a call arrival rate of a terminal and updating location registration.
    [12] Recent developments in mobile communication services have led to rapid miniaturization of cells, such as micro or pico cells, which have resulted in increased frequency reuse and subscriber capacity. .
    [13] As the frequency reuse rate and subscriber capacity increase in wireless mobile communication networks, handoff (or handover) and location registration become more frequent, which raises the problem of cost increase due to frequent location registration. As a large area needs to be paging, there is a problem that the paging cost may increase. That is, since the location registration cost and the paging cost are trade-off, there is an urgent need for a technique that can compensate for these costs.
    [14] On the other hand, in determining the location registration time, it is generally divided into zone-based, time-based, distance-based, and movement-based methods. have. The area reference method is a technology for setting an area composed of a plurality of cells and performing location registration only when the terminal moves to a new area, and the time reference method is a technology for registering a location every certain period (T). . In addition, the distance reference method is a technique for performing location registration whenever the distance from the most recently registered cell becomes the D cell, and the movement reference method is a position every time passing a certain number of cells. Refers to techniques that enable registration.
    [15] Among these methods, the distance-based method is evaluated as having the best performance, but all four methods have some problems.
    [16] That is, the location registration time determination method applied to the conventional mobile communication system does not consider the speed of the terminal or the call arrival rate at all, and performs location registration only when a predetermined time, a certain distance, or a certain area is changed. The conventional system mainly adopts an area reference location registration method, which causes a ping-pong effect that causes unnecessary location registration when the mobile terminal frequently crosses an area boundary, and when a call is requested. Using the paging channel of all cells in the area has resulted in unnecessary waste of wireless bandwidth.
    [17] In order to solve such a problem, a method of optimizing the area size according to the correlation between the location registration and the paging cost according to the size of the registration area and the paging area, and the multi-layer registration method for solving the vibration effect are various angles. Was researched and developed. In addition, a method of simultaneously reducing the location registration cost and the paging cost has been proposed by differently allocating the area size of each mobile terminal according to the characteristics of the mobile object.
    [18] However, this method also did not specifically indicate how much the terminal's moving speed and call arrival rate were quantified and transferred.
    [19] That is, in the case of time-based location registration, since the moving speed and direction of the terminal change every time, since the moving distance during the registration period T is very variable, the moving distance per unit time increases as the speed increases, so that the paging cost increases rapidly. In addition, in the case of the movement reference and the distance reference method, the time required for moving the same distance or the same number of cells is different, and thus there is a problem that the call arrival rate per unit time that varies according to the speed cannot be sufficiently reflected. . In the case of distance-based location registration, the speed is corrected to some extent to show good performance, but the optimal location registration distance itself changes according to the speed and call arrival rate. In addition, there is a problem that it is not easy to determine the optimum distance because the movement characteristics are different for each terminal. Therefore, a variety of terminals having different speeds are simultaneously supported in one system, and a method that can adapt to the speed of the terminal in an environment in which characteristics such as a moving speed and a moving path change from time to time is urgently needed.
    [20] Accordingly, the present invention has been made in accordance with the above-described requirements, and the location registration of the mobile communication system to optimize the location registration time point by updating the location registration after determining the next location registration time using the movement distance and the call arrival rate of the terminal. The purpose is to provide a method.
    [21] In order to achieve the above object, the present invention provides a location registration method of a mobile communication system for real-time monitoring of SID and NID through a paging channel, time information of a mobile communication system, and location information of a base station. Calculating a distance D between a cell to which the current terminal belongs and a cell to which a recently registered terminal belongs according to the monitored time information and location information when the predetermined time τ d elapses; Calculating the total sum S (i) of the number of cells to be paged up to the number of cells upon arrival of the call by checking whether or not the number of cells r (i) changes according to the calculated distance data change; Calculating a next position registration time tau u by calculating a total sum S (i) of the calculated number of cells and a call arrival rate P ca according to a call arrival interval distribution function; It provides a location registration method of a mobile communication system comprising the step of updating the location registration of the terminal according to the location registration determination result.
    [1] 1 is a schematic structural block diagram of a mobile communication system for implementing a location registration method according to a preferred embodiment of the present invention;
    [2] 2 is a detailed flowchart of a location registration process of a mobile communication system according to a preferred embodiment of the present invention.
    [3] <Description of the code | symbol about the principal part of drawing>
    [4] 100: MS
    [5] 120: BS
    [6] 122: BTS
    [7] 124: BSC
    [8] 130: MSC
    [9] 140: HLR
    [10] 150: VLR
    [22] Hereinafter, with reference to the accompanying drawings will be described in detail a preferred embodiment of the present invention.
    [23] Prior to the description, the location registration method according to the present invention is characterized in that the registration period is changed according to the movement characteristics of the terminal on the basis of time-based position registration, and the movement distance (D) and the parameters to determine the movement characteristics. Call arrival rate (P ca ) was assumed. That is, the present invention determines that the next location registration time is determined by using the moving distance (D) and the call arrival probability (P ca ) up to a time after a predetermined time has elapsed since the time of call arrival and location registration. It is characterized by.
    [24] 1 is a schematic block diagram of a mobile communication system for implementing a location registration method according to a preferred embodiment of the present invention. In the drawing, reference numeral 100 denotes a mobile station (MS), and a subscriber can wirelessly connect to a network using the MS 100. The base station (BS) 120 mediates between the MS 100 and the mobile switch center (MSC) 130. The base station (BS) 120 is a base transceiver system (BTS) 122 and a base station controller (BSC). (124). Here, the BTS 122 is composed of one or more transceivers located in predetermined places to perform wireless communication with the MS 100. The BSC 124 exchanges messages between the BTS 122 and the MSC 130 as a device for controlling the BTSs 122. The BS 120 may be connected in plural in one MSC 130.
    [25] The MSC 130 refers to an automatic system that interfaces user communication from a wireless network to a wired network or a wireless network.
    [26] The home location register (HLR) 140 refers to a functional device that stores subscriber information (eg, user file, current location) to manage mobile subscribers. The HLR 140 may be located integrated with the MSC 130 or may be located independently of the MSC 130, and one HLR 140 may provide a service to a plurality of MSCs 130.
    [27] The Visited Location Register (VLR) 150 is connected to one or more MSCs 130 and when the subscriber is located in an area (local station) covered by the VLR 150, the HLR ( It refers to a functional device for storing subscriber information obtained from the 140. When the MS 100 enters a new service area encompassed by the MSC 130, the MSC 130 requests and reads information about the MS 100 from the HLR 140 to the relevant VLR 150. Save it.
    [28] Hereinafter, with reference to the above-described configuration, with reference to the flowchart of Figure 2 attached to the location registration process of the mobile communication system according to a preferred embodiment of the present invention will be described in detail.
    [29] Prior to the description of FIG. 2, the location registration process of the present invention is assumed to occur in an excited state. In general, the call processing state of the MS 100 may be classified into four types: an initialization state, an excitation state, a system access state, and a traffic channel state. The channel may be monitored to receive several messages from BS 120 and, if necessary, perform location registration and Idle Hand-off. This process is based on the assumption that location registration is performed based on location information and status information received from the BS 120.
    [30] First, in step S200, the MS 100 periodically monitors the SID and NID through the paging channel in the excited state, and in step S202, periodically monitors the position information including the latitude and longitude of the BS 102. do.
    [31] In step S204, when the first call arrival or location registration occurs and a predetermined time τ d elapses, the MS 100 registers with the cell to which the current MS 100 belongs and recently registered according to the monitored time information and location information. The distance D between cells to which the MS 100 belongs is calculated. That is, the MS 100 stores the location information and system time of the BS 120 most recently registered, and when the predetermined time τ d elapses after the call arrives or location registration occurs, previously received location information The distance D between the most recently registered cell and the current cell is calculated using.
    [32] Assuming that the latitude and longitude of the current cell are LATc and LONGc respectively, and the latitude and longitude of the most recently registered cell are LATp and LONGp respectively, and the system time and the current system time at the time of the last location registration are Tp and Tc, respectively. The distance D between the recently registered cell and the current cell may be expressed by Equation 1 below.
    [33]
    [34] On the other hand, in step S206, it is checked whether there is a variation in the number of cells r (i) according to the change in the distance data D calculated in Equation 1, and the total number of cells to be paged up to the number of cells upon arrival of the call. The sum S (i) is calculated. That is, if the calculated distance (D) increases or decreases by more than a certain value, it can be estimated that the value of r (i) has changed, and by using this, the number of cells to be paged to r (i) upon arrival of the call. S (i) can be obtained.
    [35] In step S208, the total sum S (i) of the calculated number of cells and the call arrival rate P ca according to the call arrival interval distribution function are calculated, and the process proceeds to step S210, where the next position registration time τ is obtained. u ) is determined.
    [36] In this case, when the cumulative distribution function of the arrival interval of the call has F T (t) and t e has elapsed from the time when the call arrived recently, the probability that the call arrives for the remaining time τ from the time of determination to the position registration (P ca ) can be obtained as in Equation 2 below.
    [37]
    [38] Where t e only depends on the arrival time of the previous call. T e has the same value as τ d when the location of the MS 100 is determined due to the arrival of the call, but t e and τ d are different values when the location registration occurs and the location of the MS 100 is known. Will have
    [39] As can be seen in Equation 2, according to time, so the arc arrives who increase the distribution, the probability (P ca) call arrives while τ is large as t e increases. That is, in the present invention, the call arrival rate P ca is used to compensate for the disadvantage that the time function cannot be reflected at all, as in the case of distance-based location registration. The arrival probability information of such a call may be performed through a network, stored in a database, and transmitted according to the information request of the MS 100, and the MS 100 may calculate its own call arrival probability. As a matter of fact, those skilled in the art will readily appreciate, and a detailed description thereof will be omitted.
    [40] On the other hand, assuming that the signaling cost required for paging one cell is Cp and the signaling cost at the time of location registration is Cu, the paging cost α = Cu / Cp may be defined, and the distance D calculated in Equation 1 described above may be defined. ) To estimate the relative position information r (i) between the current position information and the recently registered cell and calculate the number of cells S (i) to be paged up to r (i) upon arrival of the call. You can get it. After the predetermined time (τ d ) has elapsed since the call arrived or the location registration occurred, the MS 100 registers the next location by using a discriminant expression reflecting the call arrival rate P ca during the moving distance and time T during this time. Determine the time τ u . This discriminant can be expressed as Equation 3 below.
    [41] P_ca (τ_u & t_e) S (i) = α
    [42] Here, since paging cost α = Cu / Cp, if Cp is binarized to the left side, the left side is expressed in the form of the product of paging cost and call arrival rate P ca when the call arrives, and the right side is the location registration cost. Therefore, when the location registration time is determined using the discriminant equation, location registration occurs when the location registration cost and the call arrival rate P ca equal to the weighted paging cost. Thus, the total cost, which is the sum of location registration and paging costs, is minimized.
    [43] Since P ca (τ u , t e ) does not exceed 1 in the above-described discriminant expression, τ can be obtained only when S (i) ≥α. As a result, location registration is not performed when S (i) falls below a predetermined value. This means that location registration is not performed when the number of cells to be paged at the call arrival is below a certain value. If the paging cost is relatively less than the location registration cost, it may be desirable to determine the location of the terminal through paging rather than location registration. When the registration time is determined using the above-described discriminant of Equation 3, if the paging cost is less than or equal to a certain value, it can be seen that there is a characteristic that location registration is not automatically performed. As the moving distance changes, the ring value and the number of cells to be paged change, and the location registration interval is adjusted accordingly. If S (i) &lt; alpha, τ becomes infinity and no position registration occurs. In this case, the registration time is determined by calculating the discriminant again after waiting for the determination time τ d .
    [44] Finally, in step S212, the location registration of the MS 100 according to the above location registration determination result is updated to the VLR 150, and the process ends.
    [45] As described above, according to the present invention, after the location registration of the MS 100 occurs or the call arrives, when the determination time τ d elapses, the MS 100 determines whether the SID, NID and the base station are broadcasted through the BS 102. Search for location information including latitude and longitude, and store stored values and location information such as the latitude (LATp) and longitude (LONGp) of the most recently registered cell, the system time (Tp), and the current system time (Tc). Calculate the distance by using, and calculate the number of cells in the current ring r (i) and the number of cells to be paged S (i) by using the discriminant The location registration time tau u is determined, and the location registration is performed after the location registration time tau u has elapsed.
    [46] Therefore, the present invention has the effect of optimizing the location registration of the MS by adapting to the speed and call arrival rate of the MS while reducing the paging cost in the mobile communication system.
    权利要求:
    Claims (3)
    [1" claim-type="Currently amended] A location registration method of a mobile communication system for real-time monitoring of system identification (SID) and network identification (NID), time information of a mobile communication system, and location information of a base station through a paging channel,
    When a first call arrival or location registration occurs and a predetermined time τ d elapses, a distance D between a cell to which the current terminal belongs and a cell to which a recently registered terminal belongs is calculated according to the monitored time information and location information. Steps;
    Calculating the total sum S (i) of the number of cells to be paged up to the number of cells upon arrival of the call by checking whether or not the number of cells r (i) changes according to the calculated distance data change;
    Calculating a total position S (i) of the calculated cells and a call arrival rate P ca according to a call arrival interval distribution function to determine a next location registration time tau u ;
    Updating the location registration of the terminal according to the location registration determination result.
    [2" claim-type="Currently amended] The method of claim 1,
    The time information is the current system time (Tc) and the system time (Tp) at the time of the last location registration, and the location information is the latitude (LATc) / longitude (LONGc) of the current cell and the latitude (LATp) of the cell at the last location registration. / Longitude (LONGp) location registration method of the mobile communication system characterized in that.
    [3" claim-type="Currently amended] The method of claim 1,
    The call arrival rate P ca is a call arrival rate for the remaining time from the predetermined time t e to the next location registration when a predetermined time t e has elapsed since the first call arrival time. How to register your system's location.
    类似技术:
    公开号 | 公开日 | 专利标题
    DE69930309T2|2006-11-09|System and method for providing position services simultaneous to existing services in the gprs general packet radio services architecture
    ES2343834T3|2010-08-11|Procedure to perform the radio resource level record in a wireless communication system.
    JP3757374B2|2006-03-22|Inter-system handover
    US7212818B2|2007-05-01|Method, device and system for adjusting mobility management
    EP2512171B1|2014-08-13|Method for managing the state of micro base stations by following the variations of traffic requirements, and associated controller device
    US5490203A|1996-02-06|Method and system utilizing a location caching strategy to locate nomadic users in a communication services system
    ES2212366T3|2004-07-16|Method and search control device.
    FI97932C|1997-03-10|Cellular radio network, subscriber equipment for a cellular radio network and a method for performing a location update in a cellular radio network
    US6119006A|2000-09-12|System and method for calendar-based cellular smart switching
    US6584314B1|2003-06-24|Location management in a mobile telecommunication system
    US7801533B2|2010-09-21|Location request control
    ES2236964T3|2005-07-16|System and method for positioning a mobile terminal.
    KR100459183B1|2004-12-03|combinatorial mobile IP system and method for managing mobility using the same
    AU751129B2|2002-08-08|Method for applying different charge rates and for indicating location of mobile station in cellular mobile telecommunication system
    US7236786B2|2007-06-26|Method and system for providing fast handoff in a WLAN-like communication system using active neighboring sets
    KR100800883B1|2008-02-04|Method and apparatus for controlling measurement of frequency of forbidden registration area in mobile telecommunications system
    EP0679321B1|2000-02-02|Location updating in a cellular radio system
    US7127249B2|2006-10-24|System and method for selecting a wireless serving mode
    US6119012A|2000-09-12|Method and system for dynamically and periodically updating mobile station location data in a telecommunications network
    CN101411225B|2010-12-08|Method for transitioning communications of a mobile subscriber station from a serving base station to a target base station
    EP1471665B1|2012-05-02|Seamless switching in a combined long and short distance wireless communication system
    CN1322763C|2007-06-20|Method for limiting simultaneous calling transfer trial quantity in cellular communication system
    CN101068370B|2011-06-15|User equipment calling method and system
    JP3982604B2|2007-09-26|Location registration method, location registration system, mobile terminal, location registration area setting device, location registration area setting program
    US7321775B2|2008-01-22|Method for obtaining location related information allowing to locate a terminal attached to a communication network
    同族专利:
    公开号 | 公开日
    KR100367439B1|2003-01-10|
    引用文献:
    公开号 | 申请日 | 公开日 | 申请人 | 专利标题
    法律状态:
    2000-11-21|Application filed by 조정남, 에스케이 텔레콤주식회사
    2000-11-21|Priority to KR20000069317A
    2002-05-27|Publication of KR20020039484A
    2003-01-10|Application granted
    2003-01-10|Publication of KR100367439B1
    优先权:
    申请号 | 申请日 | 专利标题
    KR20000069317A|KR100367439B1|2000-11-21|2000-11-21|Method for updating a location in a mobile system|
    [返回顶部]