• 제목/요약/키워드: Location Update and Paging

검색결과 33건 처리시간 0.026초

Optimal Design of Mobile Controlled Location Update Subsystem

  • Kang, Hye-Won;Park, Cheon-Won
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 1999년도 하계종합학술대회 논문집
    • /
    • pp.25-28
    • /
    • 1999
  • Consider connection-oriented wireless cellular net-works. To establish a circuit or virtual circuit in such a network, a paging message is broadcast over a region at which the destined mobile station is presumed to reside, (identified as a paging area). For an effective paging mechanism, it is desirable to provide the location information of mobile stations to the network. In this paper, we consider a mobile controlled location update scheme under which each mobile station periodically reports its current location information to the network by using an inherent timer (without measuring the power of signals transmitted from base stations). Based on the latest information about a mobile station's location, a paging area is selected to page the mobile station. Note that under this scheme, a mobile station may not yet have reported its location change while sojourning out of the current paging area. In such situation, the mobile station can not receive a paging message destined to it. Frequent location updates can reduce the paging failure rate incurred by mobile stations'sojourning out of the paging area. However, larger bandwidth is needed for location update as the location update rate is increased. On the other hand, as the size of the paging area is increased, the paging failure rate is decreased, while larger bandwidth is required for paging. Thus, we first present a model for mobility, paging and location update processes, and secondly investigate the effect of network parameters on the paging failure rate and the amount of bandwidth used for paging and location update. Finally, we formulate problems to find proper values for the location update rate and paging area size under the constraints on the bandwidth usage levels for location update and paging.

  • PDF

이동통신망에서 영역분할 방식의 위치관리 기법 (Location Management using LA-Division Scheme in Personal Communication Systems)

  • 박노열;장인갑;홍정완;이창훈
    • 산업공학
    • /
    • 제16권4호
    • /
    • pp.507-514
    • /
    • 2003
  • In personal communication systems location management of mobile terminals is required to connect incoming calls to the mobile terminals. Investigation of effective location update and paging strategies is important to reduce the cost of location management. In this study, we propose a paging strategy considering the mobile terminals' residence patterns. The first paging area is characterized by the set of cells in the location area where mobile terminals usually stay for a significant period of time. The rest of cells in the location area are included into the second paging area. To reduce the paging cost the first paging area is decided by reflecting various residence patterns of mobile terminals. For an incoming call, the sequential paging is performed in the order of the paging area. Thus the paging cost is greatly reduced, especially when the called mobile terminal is located in the first paging area. The proposed strategy is expected to be more effective than an existing strategy that uses the anchor cell in the location area.

이동 통신망에 있어서 새로운 셀 체류시간 모형화에 따른 최적 이동성 관리 (Optimal Mobility Management of PCNs Using Two Types of Cell Residence Time)

  • 홍정식;장인갑;이창훈
    • 한국경영과학회지
    • /
    • 제27권3호
    • /
    • pp.59-74
    • /
    • 2002
  • This study investigates two basic operations of mobility management of PCNs (Personal Communication Networks), i.e., the location update and the paging of the mobile terminal. From the realistic consideration that a user either moves through several cells consecutively or stays in a cell with long time, we model the mobility pattern by introducing two types of CRT (Cell Residence Time). Mobility patterns of the mobile terminal are classified Into various ways by using the ratios of two types of CRT. Cost analysis is performed for distance-based and movement-based location update schemes combined with blanket polling paging and selective paging scheme. It is demonstrated that in a certain condition of mobility pattern and call arrival pattern, 2-state CRT model produces different optimal threshold and so, is more effective than IID ( Independently-Identically-Distributed) CRT model. An analytical model for the new CRT model is compact and easily extendable to the other location update schemes.

거리기반 위치등록 방법을 이용한 IP망에서의 페이징 지원 방안 (IP Paging Architecture Using Distance-based Location Update Scheme)

  • 장인동;박기식
    • 한국통신학회논문지
    • /
    • 제28권6B호
    • /
    • pp.573-587
    • /
    • 2003
  • 이동통신의 발전과 인터넷의 대중화에 힘입어 무선인터넷이 등장하였고, 차세대 유무선 통신망은 IP기반으로 통합 발전될 것이라고 기대하고 있다. 이러한 배경에서 Mobile IP가 등장하였고, 현재 문제점이 많은 기본적인 Mobile IP에 기존의 하위계층에서 사용하던 여러 가지 기술들을 추가하려고 노력하고 있다. 그 중 대표적인 것이 위치등록과 페이징 기법이라고 할 수 있는데, 본 논문은 3계층에서의 이동성 프로토콜인 Mobile IP에 기존의 2계층에서의 거리기반 위치등록 방법을 적용시켜 IP망에서의 효율적인 페이징 방안을 제시하였다. 그리고, 네트워크 시뮬레이션 도구인 OPNET을 이용하여 제시한 방안을 구현하고 검증하였다.

개선된 이동기준 위치등록과 선택적 페이징 방식의 성능분석 (Performance Analysis of Improved Movement-based Location Registration and Selective Paging Scheme)

  • 임석구
    • 한국콘텐츠학회논문지
    • /
    • 제4권4호
    • /
    • pp.153-161
    • /
    • 2004
  • 이동 가입자에 대한 효율적인 이동성 관리는 이동통신망에서 매우 중요한 역할을 한다. 본 논문에서는 이동기준 위치등록(MBR) 방식을 개선한 새로운 위치등록 방식을 제안한다. 기본 아이디어는 위치등록 수행 후 이동국의 이동경로를 내부 메모리에 기억하고 있다가 이동 가입자가 최근에 위치등록을 수행한 셀의 주변에서 이동하는 경우 불필요한 위치등록이 일어나지 않도록 하는 것이다. 제안한 방식의 분석은 이동기준 위치등록 방식과의 비교를 시뮬레이션을 통하여 수행하였다. 시뮬레이션 분석 결과 제안한 방식은 불필요한 위치등록을 최소화함으로써 이동기준 위치등록 방식에 비해 위치등록 회수가 작아서 그 성능이 우수함을 알 수 있었다.

  • PDF

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

  • 장인갑;홍정식;김지표;이창훈
    • 한국경영과학회지
    • /
    • 제33권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.

이동 통신망에서 영역 분할 방식을 이용한 페이지 비용 감소 방안 (Reducing Paging Cost Using LA-Division Scheme in Personal Communication Systems)

  • 박노열;장인갑;홍정완;이창훈
    • 한국경영과학회:학술대회논문집
    • /
    • 한국경영과학회/대한산업공학회 2003년도 춘계공동학술대회
    • /
    • pp.425-432
    • /
    • 2003
  • In personal communication systems, location management of mobile terminals is required to connect incoming calls to the mobile terminals. Investigation of effective location update and paging strategies is important to reduce the cost of location management. In this study, we propose a paging strategy considering the mobile terminals' residence patterns. The first paging area is introduced, which is characterized by the set of cells in the location area where mobile terminals usually stay for a significant period of time. We propose the decision criterion of the first paging area by comparing the cost against zone-based strategy. For an incoming call. we perform the sequential paging by the order of the first paging area and the rest of cells in the location area called by the second paging area. Thus the paging cost is greatly reduced, especially when the called mobile terminal is located in the first paging area. The proposed strategy is expected to be more effective than existing strategy using anchor cell in the location area because it reflects various residence patterns of mobile terminals.

  • PDF

시뮬레이티드어닐링을 이용한 리포팅셀 위치관리시스템 최적 설계 (Optimal Design of Reporting Cell Location Management System using Simulated annealing System)

  • 김성수;문재기
    • 산업기술연구
    • /
    • 제28권B호
    • /
    • pp.9-14
    • /
    • 2008
  • In the Reporting Cell Location Management (RCLM) system, a subset of cells in the network is designated as the reporting cells. Each mobile terminal performs location update only when it enters one of these reporting cells. When a call arrives, the paging is confined to the reporting cell the user last reported and the neighboring bounded non-reporting cells. Frequent location update may result in degradation of quality of service due to interference. Miss on the location of a mobile terminal will necessitate a search operation on the network when a call comes in. We must decide the number of reporting cells and which cell should be reporting cell to balance the registration (location update) and search (paging) operations to minimize the cost of RCLM system. This paper proposes a simulated annealing (SA) for optimization of RCLM system.

  • PDF

랭킹개미군전략을 이용한 리포팅셀 위치관리시스템 최적 설계 (Optimal Design of Reporting Cell Location Management System using Ranking Ant Colony System)

  • 김성수;김근배
    • 산업공학
    • /
    • 제19권2호
    • /
    • pp.168-173
    • /
    • 2006
  • In the Reporting Cell Location Management (RCLM) system, a subset of cells in the network is designated as the reporting cells. Each mobile terminal performs location update only when it enters one of these reporting cells. When a call arrives, the paging is confined to the reporting cell the user last reported and the neighboring bounded non-reporting cells. Frequent location update may result in degradation of quality of service due to interference. Miss on the location of a mobile terminal will necessitate a search operation on the network when a call comes in. We must decide the number of reporting cells and which cell should be reporting cell to balance the registration (location update) and search (paging) operations to minimize the cost of RCLM system. This paper proposes a ranking ant colony system (RACS) for optimization of RCLM system.

마이크로 셀 환경에서의 위치 갱신 오버헤드를 줄이기 위한 동적 페이징 및 위치 관리 알고리즘 (Dynamic Paging and Location Management Algorithm for Reducing Location Update Overhead in A Microcell Environment)

  • 장영상;오삼권;이승룡
    • 정보처리학회논문지C
    • /
    • 제8C권5호
    • /
    • pp.677-682
    • /
    • 2001
  • 가입자의 셀 간 이동이 빈번해지는 마이크로 셀 환경에서는 위치 갱신 등의 처리를 위해 신호 트래픽의 양이 급격히 증가한다. 이러한 오버헤드를 줄이기 위한 한 방법으로서, 본 논문은 각 가입자의 이동 특성에 따라 각 가입자에게 크기 및 모양이 다른 위치영역과 페이징 영역을 동적으로 할당해 주는 알고리즘을 제시한다. 수학적 분석 결과, 이 방식을 사용할 경우 기존 영역 관리 방식의 사용에 비해 영역 관리 비용의 절감을 가져옴을 알 수 있다.

  • PDF