Dynamically adapting registration areas to user mobility and call patterns for efficient location management in PCS networks

Authors:
Georgios Varsamopoulos;Sandeep K. S. Gupta
Affiliations:
Department of Computer Science and Engineering, Ira A. Fulton School of Engineering, Arizona State University, Tempe, AZ;Department of Computer Science and Engineering, Ira A. Fulton School of Engineering, Arizona State University, Tempe, AZ
Venue:
IEEE/ACM Transactions on Networking (TON)
Year:
2004

Citing 12
Cited 5

Evaluation of location area planning scenarios in future mobile telecommunication systems

Wireless Networks
An adaptive location management strategy for mobile IP

MobiCom '95 Proceedings of the 1st annual international conference on Mobile computing and networking
Optimal Partitioning of Heterogeneous Traffic Sources in Mobile Communications Networks

IEEE Transactions on Computers - Special issue on mobile computing
Dynamic hierarchical database architecture for location management in PCS networks

IEEE/ACM Transactions on Networking (TON)
Mobile users: to update or not to update?

Wireless Networks
An efficient mobility management strategy for personal communication systems

MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Optimal location management algorithms for mobile networks

MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
On finding optimal registrations in presence of overlapping registration areas

DIALM '01 Proceedings of the 5th international workshop on Discrete algorithms and methods for mobile computing and communications
P-MIP: paging extensions for mobile IP

Mobile Networks and Applications - Analysis and Design of Multi-Service Wireless Networks
Optimal Location Area Design to Minimize Registration Signaling Traffic in Wireless Systems

IEEE Transactions on Mobile Computing
On Dynamically Adapting Registration Areas to User Mobility Patterns in PCS Networks

ICPP '99 Proceedings of the 1999 International Workshops on Parallel Processing
Application of dynamic channel allocation strategies to the GSM cellular network

IEEE Journal on Selected Areas in Communications

Optimal Offline and Online Registration Techniques for Location Management with Overlapping Registration Areas

IEEE Transactions on Mobile Computing
Performance analyses of three geography-based location strategies for PCS networks

Computer Communications
Performance analysis of movements detection with RA beaconing in wireless IP networks

International Journal of Wireless and Mobile Computing
Optimal aggregation factor and clustering under delay constraints in aggregate sequential group paging schemes

Wireless Networks
Distributed cell-centric neighborhood-related location area planning for PCS networks

Computer Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we propose an extension to the personal communication services (PCS) location management protocol which uses dynamically overlapped registration areas. The scheme is based on monitoring the aggregate mobility and call pattern of the users during each reconfiguration period and adapting to the mobility and call patterns by either expanding or shrinking registration areas at the end of each reconfiguration period. We analytically characterize the trade-off resulting from the inclusion or exclusion of a cell in a registration area in terms of expected change in aggregate database access cost and signaling overhead. This characterization is used to guide the registration area adaption in a manner in which the signaling and database access load on any given location register (LR) does not exceed a specified limit. Our simulation results show that it is useful to dynamically adapt the registration areas to the aggregate mobility and call patterns of the mobile units when the mobility pattern exhibits locality. For such mobility and call patterns, the proposed scheme can greatly reduce the average signaling and database access load on LRs. Further, the cost of adapting the registration areas is shown to be low in terms of memory and communication requirements.