• Title/Summary/Keyword: 선택적 페이징

Search Result 12, Processing Time 0.028 seconds

Design and Evaluation of a Fuzzy Logic-based Selective Paging Method for Wireless Mobile Networks (무선 이동망을 위한 퍼지 논리 기반 선택적 페이징 방법의 설계 및 평가)

  • 배인한
    • Journal of KIISE:Information Networking
    • /
    • v.31 no.3
    • /
    • pp.289-297
    • /
    • 2004
  • State-of-the-art wireless communication networks allow dynamic relocation of mobile terminals. A location management mechanism is required to keep track of a mobile terminal for delivering incoming calls. In this paper, we propose a fuzzy logic-based selective paging method to reduce paging cost. In the proposed fuzzy logic-based location management method, the location update uses the area-based method that uses direction-based together with movement-based methods, and the location search uses the fuzzy logic-based selective paging method based on the mobility information of mobile terminals. A partial candidate paging area is selected by fuzzy control rules, then the fuzzy logic-based selective paging method pages only the cells within the partial candidate paging area. The performance of proposed fuzzy logic-based location management method is to be evaluated by both an analytical model and a simulation, and is compared with those of LA and BVP methods. From these evaluation results, we know that the proposed fuzzy logic-based location management method provide better performance than other location management methods.

A Cost-Effective IP Paging Scheme for Hierarchical Mobile IP Networks (계층적 이동 IP 네트워크에서의 비용 효율적인 IP 페이징 기법)

  • Kong, Ki-Sik
    • Journal of Satellite, Information and Communications
    • /
    • v.6 no.2
    • /
    • pp.84-90
    • /
    • 2011
  • Handling paging mechanism at the IP layer (i.e., IP paging) makes it possible to support heterogeneous wireless access technologies, providing energy-saving and reduced location registration signaling overhead over IP-based mobile networks. However, IP paging may rather cause adverse effects under active communication environments because of significant paging signaling overhead and frequent paging delay. Therefore, in order to solve these problems, a cost-effective IP paging scheme is proposed in this paper, which enables a mobile node to perform selective registration and paging based on its profile information. Numerical results indicate that the proposed scheme has apparent potential to mitigate considerable paging signaling overhead and frequent paging delay in IP-based hierarchical mobile networks.

Performance of Movement-based Registration and Selective Paging in PCS Network (PCS망에서 이동기준 위치등록 및 선택적 페이징 방법의 성능)

  • 백장현;류병한;임순용
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 1998.11a
    • /
    • pp.234-237
    • /
    • 1998
  • PCS망에서는 가입자의 이동성으로 인하여 가입자가 휴대하고 있는 MS(Mobile Station)의 위치가 계속적으로 변하므로, 착신호 연결을 위해 시스템에서는 가입자의 위치에 대한 정보를 관리해야만 한다. 위치등록(location registration)이란, 가입자의 위치정보가 변하는 경우 시스템의 데이터베이스에 있는 가입자의 위치정보를 갱신해 주는 일련의 과정을 말한다. 본 연구에서는, MS가 일정 개수 이상의 셀을 통과하면 위치등록을 수행하는 이동기준 위치등록(movement-based registration, MBR) 방법을 고려한다. 또한 전체 페이징 영역을 몇 단계에 걸쳐 페이징할 수 있는 선택적 페이징 (selective paging) 방법을 고려한다. 본 연구에서는, 사각형 셀 환경을 가정하여, 기존의 방법과는 다른 페이징 영역을 제시하고 이 경우 무선 채널에서의 신호 트래픽 관점에서 기존의 방법에 비하여 우수함을 보이고자 한다.

  • PDF

Performance enhancement of movement-based registration using cache (캐시를 이용한 이동기준 위치등록의 성능개선)

  • 황광신;유병한;김경수;백장현
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2000.04a
    • /
    • pp.683-686
    • /
    • 2000
  • 본 연구에서는 이동기준 위치등록(Movement-Based Registration, MBR)과 선택적 페이징(Selective Paging, SP)을 근간으로 하여 무선 채널에서의 신호 트래픽을 최소화할 수 있는 방법을 제안하고 성능을 분석하였다. 먼저, 사각형 셀 환경에서 선택적 페이징 방법을 적용할 경우 페이징 영역을 적절히 선택함으로써 기존 방법보다 페이징 부하를 줄일 수 있는 방안을 제시하고 성능을 분석하였다. 또한 이동국이 이미 통과한 셀들의 ID를 캐시에 유지함으로써 위치등록 횟수를 줄일 수 있는 개선된 이동기준 위치등록(Improved MBR, IMBR) 방법을 제시하고 성능을 분석하였다. 본 연구의 결과는, 시스템의 운용환경에 따라 적절한 위치등록 방법을 선택, 운용하는 데에 효과적으로 이용될 수 있다.

  • PDF

A Selective Paging Scheme based on Handoff Probability considering Local Environment on HMIPv6 (HMIPv6에서 지역적인 환경을 고려한 핸드오프 확률기반의 선택적 Paging 기법)

  • Park, Si-Yong;Lee, Bong-Hwan
    • Journal of Internet Computing and Services
    • /
    • v.10 no.3
    • /
    • pp.71-83
    • /
    • 2009
  • In this paper, we propose a paging scheme considering local environment and moving patterns of mobile hosts on HMIPv6. The proposed paging scheme can adaptively construct a paging domain according to handoff probability of mobile hosts and local environment, and process a paging based on handoff probability stage by stage. For analysis of the proposed paging scheme, we simulate our scheme in two different experiment environments: an open environment like a square and a restricted environment like downtown. In experiment results, the proposed scheme shows superior performance to that of compared scheme all over. Particularly, in case of high call request rate and a restricted environment, the proposed scheme shows better performance.

  • PDF

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

  • Lim Seog-Ku
    • The Journal of the Korea Contents Association
    • /
    • v.4 no.4
    • /
    • pp.153-161
    • /
    • 2004
  • An efficient mobility management for mobile stations plays an important role in mobile communication networks. In this paper, we intend to improve the performance of the movement-based location update scheme which is simple to implement and shows good performance. The basic idea used in the proposed location update scheme is to avoid the location update if the mobile subscriber moves around the cell where the last location update was performed. This Is made possible by utilizing the simple movement history information. The performance of the proposed scheme is evaluated and compared with the movement-based location update scheme through simulation. The simulation results show that the proposed location update scheme provides the better performance compared with the movement-based location update scheme by minimizing the unnecessary location updates.

  • PDF

Channel Variation Tracking based Effective Preferred BS Selection Scheme of Idle Mode Mobile device for Mobile WiMAX System (Mobile WiMAX시스템에서 채널품질 변동추적을 이용한 유휴모드 이동단말의 효율적인 선호기지국 선택 방안)

  • Lee, Kang-Gyu;Youn, Hee-Yong
    • The KIPS Transactions:PartC
    • /
    • v.17C no.6
    • /
    • pp.471-484
    • /
    • 2010
  • In the wireless communication systems, the power consumption of a mobile device is very important issue due to its battery limitations. Hence most of the standards for wireless networks including a mobile WiMAX system are supporting their own power saving mode in way that a mobile device is able to reduce its energy usage while in the mode. However, those standards just define the arrangement of special time intervals, called a paging listening interval, during which the device needs to receive the paging-related control messages, and they do not specify how to effectively reduce the power in many different network environments. This means the amount of power spent by the device is very dependent on the implementations of individual device-vendors, and undesirable paging loss may happen according to the channel conditions. To reduce unnecessary power usage and the risk of paging loss, this paper proposes the effective frequency/BS selection algorithm applicable to a mobile device operating in the power saving mode, which serves the device with better BS based on the tracking for channel variation. This algorithm consists of the channel estimation phase during each paging listening interval, the tracking phase for the measured results, the frequency reselection phase based on the tracking activity, and the preferred BS reselection phase. Thus the proposed method can improve the paging performance while the device is moving in the network. Also the simulation result shows that the presented scheme is superior to other candidates in energy efficiency due to the channel-adaptive frequency/BS selection.

Effective resource selection and mobility management scheme in mobile grid computing (모바일 그리드 컴퓨팅에서 효율적인 자원 확보와 이동성 관리 기법)

  • Lee, Dae-Won
    • The Journal of Korean Association of Computer Education
    • /
    • v.13 no.1
    • /
    • pp.53-64
    • /
    • 2010
  • In this paper, we tried to enable a mobile device as a resource to access to mobile grid networks. By advanced Internet techniques, the use of mobile devices has been rapidly increased. Some researches in mobile grid computing tried to combine grid computing with mobile devices. However, according to intrinsic properties of mobile environments, mobile devices have many considerations, such as mobility management, disconnected operation, device heterogeneity, service discovery, resource sharing, security, and so on. To solve these problems, there are two trends for mobile grid computing: a proxy-based mobile grid architecture and an agent-based mobile grid architecture. We focus on a proxy-based mobile grid architecture with IP-paging, which can easily manage idle mobile devices and grid resource status information. Also, we use SIP(Session Initiation Protocol)to support mobility management, mobile grid services. We manage variation of mobile device state and power by paging cache. Finally, using the candidate set and the reservation set of resources, we perform task migration. The performance evaluation by simulation, shows improvement of efficiency and stability during execution.

  • PDF

Performance Analysis of Distance-Based Registration and Selective Paging in IMT-2000 Network (IMT-2000 망에서 거리기준 위치등록 및 선택적 페이징의 성능분석)

  • 유병한;최대우;백장현
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.26 no.3
    • /
    • pp.53-63
    • /
    • 2001
  • An efficient mobility management for mobile stations plays an important role in mobile communication network. This paper studies the mobility management scheme that combines a distance-based registration(DBR) and a selective paging (SP). We introduce an analytical model based on 2-dimensional random walk mobility model and evaluate the performance of the proposed mobility management scheme using the model to determine the optimal size of location area that results in the minimum signaling traffic on radio channels. Numerical results are provided to demonstrate the performance of the proposed mobility management scheme under various circumstances. These results can be used effectively in design and evaluation of registration methods considering the system circumstances.

  • PDF

A Study on Demand Paging For NAND Flash Memory Storages (NAND 플래시 메모리 저장장치를 위한 요구 페이징 기법 연구)

  • Yoo, Yoon-Suk;Ryu, Yeon-Seung
    • Journal of Korea Multimedia Society
    • /
    • v.10 no.5
    • /
    • pp.583-593
    • /
    • 2007
  • We study the page replacement algorithms for demand paging, called CFLRU/C, CFLRU/E and DL-CFLRU/E, that reduce the number of erase operations and improve the wear-leveling degree of flash memory. Under the CFLRU/C and CFLRU/E algorithms, the victim page is the least recently used dean page within the pre-specified window. However, when there is not any dean page within the window, the CFLRU/C evicts the dirty page with the lowest frequency while the CFLRU/E evicts the dirty page with the highest number of erase operations. The DL-CFLRU/E algorithm maintains two page lists called the dean page list and the dirty page list, and first finds the page within the dean page list when it selects a victim. However, when it can not find any dean page within the dean page list, it evicts the dirty page with the highest number of erase operations within the window of the dirty page list. In this thesis, we show through simulation that the proposed schemes reduce the number of erase operations and improve the wear-leveling than the existing schemes like LRU.

  • PDF