Dynamic hierarchical database architecture for location management in PCS networks
IEEE/ACM Transactions on Networking (TON)
An efficient hierarchical scheme for locating highly mobile users
Proceedings of the seventh international conference on Information and knowledge management
Locating Objects in Mobile Computing
IEEE Transactions on Knowledge and Data Engineering
A Presetting Location Strategy for Personal Communication Using Hierarchical Location Database
ICPADS '00 Proceedings of the Seventh International Conference on Parallel and Distributed Systems: Workshops
A Track-Presetting strategy in PCS using hierarchical location databases
Computer Communications
Tracking highly mobile users using replicated databases
Computer Communications
A location-based mobility tracking scheme for PCS networks
Computer Communications
Locating strategies for personal communication networks, a novel tracking strategy
IEEE Journal on Selected Areas in Communications
One-step pointer forwarding strategy for location tracking in distributed HLR environment
IEEE Journal on Selected Areas in Communications
A fully distributed location registration strategy for universal personal communication systems
IEEE Journal on Selected Areas in Communications
A caching strategy to reduce network impacts of PCS
IEEE Journal on Selected Areas in Communications
IEEE Journal on Selected Areas in Communications
Mobility management in current and future communications networks
IEEE Network: The Magazine of Global Internetworking
Hi-index | 0.24 |
It is possible to continually receive large numbers of calls in their movements for hot mobile subscribers who are the valued clients in Personal Communications Services (PCS). This paper introduces an efficient location strategy for those hot subscribers in PCS with hierarchical database architecture. The proposed strategy can dynamically adjust the positions of bypass pointers according to the mobility and calling pattern of each user. When a callee moves out of his/her current registration area (RA), our strategy is to calculate a new appropriate position for the caching databases. Then we may adjust the caching databases to the appropriate positions instead of just deleting them, as what is done in Eager-Caching strategy. Simulation results are provided to demonstrate the cost effectiveness of the proposed strategy for hot subscribers under various parameters in comparison with the Basic and Eager-Caching strategies.