• Journal of Industrial Technology
• /
• v.26 no.B
• /
• pp.191-198
• /
• 2006

In this paper, we focus on a question. Which is better between time-based location update method and movement-based location update method? Or, does any other method combining the two methods show better performance? For the question, we propose a hybrid location update scheme, which integrates the time-based and the movement-based methods. In the proposed scheme, a mobile terminal updates its location after n cell boundary crossing and a time interval of T, or the inverse. We derive an analytical solution for the performance of the hybrid scheme with exponential cell resident time. From the numerical analysis, we conclude that the movement-based method seems to have better performance than the time-based and hybrid methods, that is the optimal costs occur at T=0.

• Journal of the Korea Society for Simulation
• /
• v.10 no.2
• /
• pp.47-60
• /
• 2001

In mobile wireless network efficient location management for tracking and finding mobile users is a critical issue. The traffic for location update can be excessive, especially at the base stations that are near to the location area (LA) boundaries. In this paper we propose a new location update scheme which can significantly reduce the signaling traffic for location update. It is based on the virtual layer approach employing SubMSCs. The virtual layer is laid upon the original layer of LAs such that the mobile terminals moving around the boundary cells of adjacent LAs become to move within a virtual LA. As a result, the location update traffic is substantially reduced compared to overlapping scheme which is the most recent and efficient location update scheme.

• 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.

• Journal of Electrical Engineering and Technology
• /
• v.12 no.1
• /
• pp.335-345
• /
• 2017

Recently, location systems using RFID technology have been studied in indoor environments. However, the existing techniques require high computational cost to compute the location of a moving object because they compare the location proximity of all reference tags and objects. In this paper, we propose an RFID based location positioning scheme using event filtering, which reduces the computation cost of calculating the locations of moving objects while maintaining the accuracy of location estimation. In addition, we propose an incremental location update policy to reduce the location update cost for moving objects. We also compare the proposed scheme with one of the localization schemes, LANDMARC using a performance evaluation. As a result, the proposed scheme outperforms LANDMARC in terms of the computational cost of location estimation. The proposed scheme also reduces the cost of location update by using the RFID-based update policy.

• Proceedings of the IEEK Conference
• /
• 2002.07b
• /
• pp.1090-1093
• /
• 2002

Location management schemes dealing with location information of moving terminals play an important role in the personal communications systems (PCS). Since the location management involves heavy signaling traffics to update the location information, reducing the location update cost becomes a critical research issue. This paper proposes a location management scheme which reduces the location update cost by employing the hierarchical structure in PCS environment. The paper also develops analytical models to evaluate the performance of the proposed scheme. The results obtained from the performance evaluation shows that the proposed scheme outperforms the conventional schemes in terms of the location update rates. Also, the difference in the performance becomes larger as the size of the location area (LA) becomes smaller and as the residual time of the mobile user becomes smaller.

• Journal of Industrial Technology
• /
• v.21 no.B
• /
• pp.85-89
• /
• 2001

In this paper, we analyze a time-based update method in location management and calculate the optimal time-interval. The probability that an MT is j rings away from the center cell is obtained by computer programming. And using these values, an exact analysis is made for the time-based location management cost. From the result, when the time-based method is applied to location update, we can get the optimal time-interval which minimizes the location management cost.

• Proceedings of the IEEK Conference
• /
• 1999.06a
• /
• pp.25-28
• /
• 1999

Consider connection-oriented wireless cellular net-works. To establish a circuit or virtual circuit in such a network, a paging message is broadcast over a region at which the destined mobile station is presumed to reside, (identified as a paging area). For an effective paging mechanism, it is desirable to provide the location information of mobile stations to the network. In this paper, we consider a mobile controlled location update scheme under which each mobile station periodically reports its current location information to the network by using an inherent timer (without measuring the power of signals transmitted from base stations). Based on the latest information about a mobile station's location, a paging area is selected to page the mobile station. Note that under this scheme, a mobile station may not yet have reported its location change while sojourning out of the current paging area. In such situation, the mobile station can not receive a paging message destined to it. Frequent location updates can reduce the paging failure rate incurred by mobile stations'sojourning out of the paging area. However, larger bandwidth is needed for location update as the location update rate is increased. On the other hand, as the size of the paging area is increased, the paging failure rate is decreased, while larger bandwidth is required for paging. Thus, we first present a model for mobility, paging and location update processes, and secondly investigate the effect of network parameters on the paging failure rate and the amount of bandwidth used for paging and location update. Finally, we formulate problems to find proper values for the location update rate and paging area size under the constraints on the bandwidth usage levels for location update and paging.

• ETRI Journal
• /
• v.27 no.4
• /
• pp.457-460
• /
• 2005

In this study, we consider a location-based location update (LU) scheme. We propose an enhanced LU (ELU) scheme that can store more cells to reduce the location update cost of the LU scheme and show that the ELU scheme always outperforms the LU scheme. Our scheme can be easily implemented in actual cellular systems.

• Journal of Korea Multimedia Society
• /
• v.24 no.6
• /
• pp.789-795
• /
• 2021

In order to provide useful Internet of Things (IoT) services, the locations of IoT devices should be well managed. However, frequent location updates of lots of IoT devices result in signaling overhead in networks. To solve this problem, this paper utilizes the opportunistic fog node (OFN) which is opportunistically available according to the mobility to perform the location updates as a representative of IoT devices. Therefore, the location updates through OFN can reduce the signaling loads of networks. To show the performance of the proposed scheme, we develop an analytic model for the opportunistic location update offloading probability that the location update can be offloaded to OFN from the IoT device. Then, the extensive simulation results are given to validate the analytic model and to assess the performance of the proposed scheme in terms of the opportunistic location update offloading probability.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.33 no.3
• /
• pp.43-58
• /
• 2008

In this paper, we have presented a dynamic, predictive location update scheme that takes into account each user's mobility patterns. A user's past movement history is used to create two-dimensional transition probability matrix which makes use of two directional consecutive location areas. A mobile terminal utilizes the transition probability to develop a predictive path which consists of several predictive nodes and then the location update is saved as long as a mobile user follows the predictive path. Using continuous-time Markov chain, cost functions of location update and paging are derived and it is shown that the number of predictive nodes can be determined optimally. To evaluate the proposed scheme, simulations are designed and the numerical analysis is carried out. The numerical analysis features user's mobility patterns and regularity, call arrival rates, and cost ratio of location update to paging. Results show that the proposed scheme gives lower total location management cost, compared to the other location update schemes.