Dynamic hierarchical database architecture for location management in PCS networks
IEEE/ACM Transactions on Networking (TON)
Location management in cellular networks
Handbook of wireless networks and mobile computing
IEEE Transactions on Knowledge and Data Engineering
A Fully Distributed Location Management Scheme for Large PCS
ISCC '00 Proceedings of the Fifth IEEE Symposium on Computers and Communications (ISCC 2000)
The study of dynamic multi-channel scheme with channel de-allocation in wireless networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
On location management for personal communications networks
IEEE Communications Magazine
| Hi-index | 0.00 |
Integration of WLAN hotspots into next generation cellular networks requires considerations on location management, resource allocation, handoff algorithms and their sensitivity to mobility related features such as velocity of the mobile and the handoff delay. This article presents architecture for seamless location-aware integration of WLAN hotspots into cellular networks and provides an analysis for an optimal handoff decision in moving in and out of a hotspot. For a mobile station, it may be beneficial to know the whereabouts of the hotspots in order to facilitate optimal handoff between the two access networks. In an integrated cellular-WLAN environment, one has to consider location management as part of mobility management due to differences in the cell sizes of the two overlapping technologies. In this paper, we present a new handoff and call admission strategy for cellular networks in downtown areas. The new strategy is based on predictive dynamic reservation mechanism for which the location management involves two processes: find the current cell of a mobile node, and, update location information of a mobile node. During the find and update processes, we use two new methods for location management based on replication of location information in a dominating set and in a hierarchical dominating set. Our hierarchical dominating set using the greedy algorithm had the least update cost followed by the hierarchical scheme then the dominating set scheme respectively.