On finding optimal registrations in presence of overlapping registration areas

Authors:
Georgios Varsamopoulos;Sandeep K. S. Gupta
Affiliations:
Department of Computer Science and Engineering, Arizona State University, Tempe, AZ;Department of Computer Science and Engineering, Arizona State University, Tempe, AZ
Venue:
DIALM '01 Proceedings of the 5th international workshop on Discrete algorithms and methods for mobile computing and communications
Year:
2001

Citing 6
Cited 3

An adaptive location management strategy for mobile IP

MobiCom '95 Proceedings of the 1st annual international conference on Mobile computing and networking
Dynamic hierarchical database architecture for location management in PCS networks

IEEE/ACM Transactions on Networking (TON)
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
Intersystem location update and paging schemes for multitier wireless networks

MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
On Dynamically Adapting Registration Areas to User Mobility Patterns in PCS Networks

ICPP '99 Proceedings of the 1999 International Workshops on Parallel Processing
An Algorithm for Distributed Location Management in Networks of Mobile Computers

An Algorithm for Distributed Location Management in Networks of Mobile Computers

A theoretical study of optimization techniques used in registration area based location management: models and online algorithms

DIALM '02 Proceedings of the 6th international workshop on Discrete algorithms and methods for mobile computing and communications
Dynamically adapting registration areas to user mobility and call patterns for efficient location management in PCS networks

IEEE/ACM Transactions on Networking (TON)
Optimal Offline and Online Registration Techniques for Location Management with Overlapping Registration Areas

IEEE Transactions on Mobile Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Personal Communication Services (PCS) standards such as IS-41 and GSM use a location management scheme which is based on registration areas (RA). Overlapping of registration areas has been proposed to reduce the overhead of location updates in such systems (4]. Overlapping RAs form regions in which a mobile has a choice in selecting which RA to register to. The choice of current RA has implication on the number of registrations a mobile may require in the future. In this paper we investigate the problem of finding the best (or optimal) registration for a user in a cellular PCS environment with overlapping Registration Areas (RAs). We study two versions of the problem: (i) the deterministic version, where the entire trajectory of the mobile is known a-priori, and (ii) the stochastic version, where the trajectory of the mobile is not known a-priori but the system has the knowledge of mobility pattern of the mobile. The mobility pattern is modeled as a stochastic random walk across regions. In the deterministic case the method presented computes an optimal solution to the registration problem. In the stochastic case we present a method which determines the registration which minimizes the expected number of registrations by looking ahead at the probable paths which may be traversed by the mobile in future. The paper also proposes a preemptive and a non-preemptive version of the stochastic method which incur different numbers of hard and soft registration operations.