z-logo
open-access-imgOpen Access
Performance Evaluation and Optimal Management of Distance-Based Registration Using a Semi-Markov Process
Author(s) -
Jae Joon Suh,
Kyeongtaek Kim,
HeeSeon Jang,
Jang Hyun Baek
Publication year - 2017
Publication title -
modelling and simulation in engineering
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.264
H-Index - 20
eISSN - 1687-5591
pISSN - 1687-5605
DOI - 10.1155/2017/1432586
Subject(s) - computer science , base station , scheme (mathematics) , process (computing) , markov process , markov chain , point (geometry) , real time computing , base (topology) , data mining , computer network , machine learning , mathematics , statistics , operating system , mathematical analysis , geometry
We consider the distance-based registration (DBR) which is a kind of dynamic location registration scheme in a mobile communication network. In the DBR, the location of a mobile station (MS) is updated when it enters a base station more than or equal to a specified distance away from the base station where the location registration for the MS was done last. In this study, we first investigate the existing performance-evaluation methods on the DBR with implicit registration (DBIR) presented to improve the performance of the DBR and point out some problems of the evaluation methods. We propose a new performance-evaluation method for the DBIR scheme using a semi-Markov process (SMP) which can resolve the controversial issues of the existing methods. The numerical results obtained with the proposed SMP model are compared with those from previous models. It is shown that the SMP model should be considered to get an accurate performance of the DBIR scheme

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom