• Title/Summary/Keyword: Call arrival history

Search Result 2, Processing Time 0.016 seconds

Performance Analysis of Cal1 Arrival History-Based Location Update Algorithm (호도착기록에 기반한 위치갱신 알고리즘의 성능 분석)

  • Lee, Jong-Min;Kwon, Bo-seob;Maeng, Seung-Ryoul
    • The KIPS Transactions:PartA
    • /
    • v.10A no.4
    • /
    • pp.381-388
    • /
    • 2003
  • Location tracking is used to keep track of the location information of a mobile terminal in an idle state for a cail setup between mobile terminals. In this paper, we introduce a location update algorithm based on the call arrival history, which is appropriate for a variable call arrival rate over time. The location tracking strategy which uses the proposed algorithm can find changes in the call arrival rate by maintaining a call arrival history of a mobile terminal, from which a mobile terminal can calculate an appropriate timeout interval for a variable call arrival rate. We show that the proposed scheme is appropriate for a variable call arrival rate by presenting a simple analytical model and analytical results to investigate its performance for both a fixed and a variable call arrival rate.

Predictive Location Management Strategy Using Two Directional Consecutive LAs in a Cellular Network (이동 통신망에서 방향성을 지닌 2개의 연속적 위치영역을 이용한 예측 위치 관리 전략)

  • Chang, I.K.;Hong, J.S.;Kim, J.P.;Lie, C.H.
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.33 no.3
    • /
    • pp.43-58
    • /
    • 2008
  • In this paper, we have presented a dynamic, predictive location update scheme that takes into account each user's mobility patterns. A user's past movement history is used to create two-dimensional transition probability matrix which makes use of two directional consecutive location areas. A mobile terminal utilizes the transition probability to develop a predictive path which consists of several predictive nodes and then the location update is saved as long as a mobile user follows the predictive path. Using continuous-time Markov chain, cost functions of location update and paging are derived and it is shown that the number of predictive nodes can be determined optimally. To evaluate the proposed scheme, simulations are designed and the numerical analysis is carried out. The numerical analysis features user's mobility patterns and regularity, call arrival rates, and cost ratio of location update to paging. Results show that the proposed scheme gives lower total location management cost, compared to the other location update schemes.