Optimal management of distance-based location registration using embedded Markov chain

2021

J Supercomput

Self Cite

LTE networks consist of tracking areas (TAs) or a group of cells, while several TAs constitute a TA list (TAL). The LTE network adopts TAL-based registration, where, if the user equipment (UE) enters a TA that is not in its current TAL, the UE registers the TA to inform the network of its new location. A central policy for TAL allocation, known as a TA-based central policy, was proposed for TAL-based registration. Under the central policy, the TA in which the UE registers its location becomes the central TA of the new TAL. This policy can lessen the possibility of the UE quickly exiting the new TAL. However, considering the actual network architecture, it makes TAL-based registration a challenge to implement. Thus to mitigate this problem, a cell-based central policy is proposed. This study investigates TAL-based registration with cell-based central policy (TbRcc) for LTE networks. TAL-based registration with cell-based central policy and single-cell TA (TbRcc1c) is also proposed to reduce the registration cost and make up the optimal TAL. Furthermore, an improved analysis model is presented to reflect the effect of the implicit registration of calls and obtain the exact cost. Comparing the performance of the proposed scheme with those of classical TAL-based registration and distance-based registration, the performance of the proposed scheme is shown to improve. The results of this study can help research that addresses the mobility management of next-generation networks, as well as LTE networks.

Section: Tal-based Registration and Central Policymentioning

confidence: 99%

Section: Tal-based Registration and Central Policymentioning

confidence: 99%

Section: Tal-based Registration With Implicit Registrationmentioning

confidence: 99%

“…The probability that a UE enters other cells before a call occurs can be calculated as follows [14]:…”

Section: Semi-markov Process Modelmentioning

confidence: 99%

“…, and p U (1) = 2/3. Assuming the mobile network adopts simultaneous paging [14,15] the paging cost per hour is as follows:…”

Section: Total Cost On Radio Channelsmentioning

confidence: 99%

See 3 more Smart Citations

Optimal TAL-based registration with cell-based central policy in mobile cellular networks: a semi-Markov process approach

Jang

2021

J Supercomput

Self Cite

Analyzing Zone-Based Registration Using a Three Zone System: A Semi-Markov Process Approach

Jung¹,

2020

Applied Sciences

Self Cite

The location of user equipment (UE) should always be maintained in order to connect any incoming calls within a mobile network. While several methods of location registration have been proposed, most mobile networks have adopted zone-based registration due to its superior performance. Even though recommendations from research on these zone-based systems state that multiple zones can be stored in a zone-based registration system, actual current mobile networks only employ a zone-based registration system that stores a single zone. Therefore, some studies have been conducted on zone-based registration using multiple zones. However, most of these studies consider only two zones. In this study, through the development of a semi-Markov process approach, we present a simple but accurate mathematical model for zone-based registration using three zones. In addition, our research results in zone-based registration systems where one, two and three zones are used to suggest the optimal management scheme for zone-based registration. Given that most mobile networks have already adopted some kind of zone-based registration, these results are able to directly enhance the performance of the actual mobile network in the near future with the minimum of effort required for implementation.

Improvement and Performance Evaluation When Implementing a Distance-Based Registration

2021

Applied Sciences

An efficient location registration scheme is essential to continuously accommodate the increasing number of mobile subscribers and to offer a variety of multimedia services with good quality. The objective of this study was to analyze the optimal size for the location area of a distance-based registration (DBR) scheme by varying the number of location areas on a cell-by-cell basis, not on a ring-by-ring basis. Using our proposed cell-by-cell distance-based registration scheme with a random walk mobility model, a variety of circumstances were analyzed to obtain the optimal number of cells for location area for minimizing the total signaling cost on radio channels. Analysis results showed that the optimal number of cells for location area was between 4 and 7 in most cases. Our cell-by-cell distance-based location registration scheme had less signaling cost than an optimal ring-by-ring distance-based location registration scheme with an optimal distance threshold of 2 (the optimal number of cells for location area was 7). Therefore, when DBR is adopted, it must be implemented with an LA increasing on a cell-by-cell basis to achieve optimal performance.