The peril of evaluating location management proposals through simulations
DIALM '99 Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
Wireless Personal Communications: An International Journal
Journal of Computer Science and Technology
ACM SIGMOBILE Mobile Computing and Communications Review
IEEE Transactions on Mobile Computing
A novel location management in IP-based cellular networks
International Journal of Mobile Communications
Location management for wireless networks: issues and directions
International Journal of Mobile Communications
Performance analyses of three geography-based location strategies for PCS networks
Computer Communications
Dynamic location strategy for hot mobile subscribers in personal communications
Computer Communications
A Track-Presetting strategy in PCS using hierarchical location databases
Computer Communications
Reducing database sizes in implicit deregistration for personal communication networks
Computer Communications
Hi-index | 0.07 |
One of the main challenges in personal communication service (PCS) is to locate many mobiles that may move frequently from place to place. Such a system operation is called location tracking. Many network signals flow, and database queries are required to achieve such a task. In addition to the two-level hierarchical strategy in IS-41 and GSM, several strategies have been proposed to improve the efficiency of location tracking. Pointer forwarding was used to reduce the expensive home location register (HLR) accesses. Previously, the distributed HLR scheme was proposed to prevent the HLR from becoming a bottleneck in the signaling network. However, the length of a forwarding pointer chain may be lengthened in a distributed HLR environment. We propose a more efficient strategy to overcome this potential problem. This strategy attempts to migrate the locating chains in a distributed HLR system when a mobile issues a registration operation. As a consequence, the length of any forwarding pointer chain does not exceed one in our strategy. Simulation results indicate that our strategy significantly decreases the locating cost. In fact, this strategy provides an upper bound of location tracking time owing to the fact that the length of any locating path does not exceed one. Furthermore, obsolete entries in local databases visitor location registers can be reclaimed in this strategy