ABSTRACTIn this study, we consider distance-based registration (DBR) and propose a DBR with implicit registration (DBIR) in order to improve the performance of the DBR. With analytical models based on a 2-dimensional random walk in a hexagonal cell configuration, we analyzed the performance of the DBR and DBIR. Our results showed that the DBIR always outperforms the DBR.

No abstract

No abstract

No abstract

A single-server queueing system with a marked Markovian arrival process of heterogeneous customers is considered. Type-1 customers have limited preemptive priority over type-2 customers. There is an infinite buffer for type-2 customers and no buffer for type-1 customers. There is also a finite buffer (stock) for consumable additional items (semi-products, half-stocks, etc.) which arrive according to the Markovian arrival process. Service of a customer requires a fixed number of consumable additional items depending on the type of the customer. The service time has a phase-type distribution depending on the type of the customer. Customers in the buffer are impatient and may leave the system without service after an exponentially distributed amount of waiting time. Aiming to minimize the loss probability of type-1 customers and maximize throughput of the system, a threshold strategy of admission to service of type-2 customers is offered. Service of type-2 customer can start only if the server is idle and the number of consumable additional items in the stock exceeds the fixed threshold. Stationary distributions of the system states and the waiting time are computed. In the numerical example, we show some interesting effects and illustrate a possibility of application of the presented results for solution of optimization problems.

This study considers zone‐based registration (ZBR), which is adopted by most mobile cellular networks. In ZBR, a user equipment (UE) registers its location area (or zone) in a network database (DB) whenever it enters a new zone. Even though ZBR is implemented in most networks for a UE to keep only one zone (1ZR), it is also possible for a UE to keep multiple zones. Therefore, a ZBR with two zones (2ZR) is investigated, and some mathematical models for 2ZR are presented. With respect to ZBR with three zones (3ZR), several studies have been reported, but these employed computer simulations owing to the complexity of the cases, and there have been no reports on a mathematical 3ZR model to analyze its performance. In this study, we propose a new mathematical model for 3ZR for the first time, and analyze the performance of 3ZR using this model. The numerical results for various scenarios show that, as the UE frequently enters zones, the proposed 3ZR model outperforms 1ZR and 2ZR. Our results help determine the optimal number of zones that a UE keeps, and minimize the signaling cost for radio channels in mobile cellular networks.

In this study, we deal with a Distance-Based Registration with Implicit Registration, which is an enhanced scheme of the Distance-Based Registration in mobile-cellular networks. In comparisons with other Location Registration schemes, various studies on the Distance-Based Registration scheme and performance have been performed. However, a real network hierarchy has not been properly reflected in the performance evaluation of the Distance-Based Registration. To accurately evaluate the registration and paging costs of the Distance-Based Registration, a real network hierarchy should reflect that a mobile network is made up of many Visitor Location Register areas. Furthermore, we use an embedded Markov-Chain model in the Visitor Location Register hierarchy, which can reflect not only the Implicit Registration effect of the outgoing calls of user equipment but also cell staying time of the user equipment that may follow a general distribution. Without consideration of the Visitor Location Register, the paging cost decreases due to a small paging area, but the location registration cost rises because of frequent inter Visitor Location Register. The numerical results according to the various conditions show an accurate evaluation of the Distance-Based Registration performance in a real network hierarchy and the general cell staying time. Generally, the total signaling cost will increase when we consider the Visitor Location Register. However, for more appropriate evaluation of the Distance-Based Registration performance, it is necessary to consider the Visitor Location Register hierarchy.

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.