Improvement and Performance Evaluation When Implementing a Distance-Based Registration

Abstract

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.

Mobility Management Scheme with Mobility Prediction in Wireless Communication Networks

“…To calculate m' = P[T c > R m ], let us consider R m . The density function of R m , f r (t) is from a random observer property [20,21]:…”

“…Various results on mobility management schemes to minimize the total signaling cost have been proposed, such as zone-based registration [14][15][16], movement-based registration [5,17], distance-based registration [18][19][20][21], TAL-based registration [11,22], and so on. Among them, Grigoreva et al [10] have proposed a registration scheme with flexible TAL forming to reduce total signaling cost for automotive users in LTE-advanced communication network using information of UE's moving direction.…”

“…In addition, a simulation study was performed using RAPTOR [23] to validate the analytical results. Its performance was compared with those of distance-based [20,21] and TAL-based registration schemes [11,22] previously proposed in LTE networks.…”

Modeling and Evaluation for Distance-based Registration Scheme under Different Moving Direction Probability

“…Conversely, the number of cells included in RA is small, the paging cost decreases but registration cost increases since UE tends to cross the RA's boundary more frequently. So far, various algorithms have been proposed to efficiently handle registration and paging process [3,5,8]. Among them, in distance-based registration (DBR) method, an algorithm that requests and processes registration only when the UE moves a certain threshold (D, the optimal value for most parameters is known to be D=2) has been proven to ourperform the existing zone-based registration scheme [3,5].…”

“…So far, various algorithms have been proposed to efficiently handle registration and paging process [3,5,8]. Among them, in distance-based registration (DBR) method, an algorithm that requests and processes registration only when the UE moves a certain threshold (D, the optimal value for most parameters is known to be D=2) has been proven to ourperform the existing zone-based registration scheme [3,5]. However, most performance analyses of DBR have been conducted assuming that the probability of moving from any cell to another is the same.…”