On finding optimal registrations in presence of overlapping registration areas

Georgios Varsamopoulos, Sandeep Gupta

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

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.

Original languageEnglish (US)
Title of host publicationProceedings of the 5th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications
Pages77-86
Number of pages10
StatePublished - 2001
EventProceedings of the 4th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications - Rome, Italy
Duration: Jul 21 2001Jul 21 2001

Other

OtherProceedings of the 4th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications
CountryItaly
CityRome
Period7/21/017/21/01

Fingerprint

Personal communication systems
Trajectories
Cellular radio systems
Global system for mobile communications

Keywords

  • Cellular networks
  • Combinatorics
  • Location management
  • Mobile communication networks
  • Optimization

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Varsamopoulos, G., & Gupta, S. (2001). On finding optimal registrations in presence of overlapping registration areas. In Proceedings of the 5th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (pp. 77-86)

On finding optimal registrations in presence of overlapping registration areas. / Varsamopoulos, Georgios; Gupta, Sandeep.

Proceedings of the 5th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications. 2001. p. 77-86.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Varsamopoulos, G & Gupta, S 2001, On finding optimal registrations in presence of overlapping registration areas. in Proceedings of the 5th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications. pp. 77-86, Proceedings of the 4th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, Rome, Italy, 7/21/01.
Varsamopoulos G, Gupta S. On finding optimal registrations in presence of overlapping registration areas. In Proceedings of the 5th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications. 2001. p. 77-86
Varsamopoulos, Georgios ; Gupta, Sandeep. / On finding optimal registrations in presence of overlapping registration areas. Proceedings of the 5th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications. 2001. pp. 77-86
@inproceedings{d041b74fcc0d48b9bb0fdf0c1ace2ccd,
title = "On finding optimal registrations in presence of overlapping registration areas",
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.",
keywords = "Cellular networks, Combinatorics, Location management, Mobile communication networks, Optimization",
author = "Georgios Varsamopoulos and Sandeep Gupta",
year = "2001",
language = "English (US)",
isbn = "1581134215",
pages = "77--86",
booktitle = "Proceedings of the 5th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications",

}

TY - GEN

T1 - On finding optimal registrations in presence of overlapping registration areas

AU - Varsamopoulos, Georgios

AU - Gupta, Sandeep

PY - 2001

Y1 - 2001

N2 - 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.

AB - 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.

KW - Cellular networks

KW - Combinatorics

KW - Location management

KW - Mobile communication networks

KW - Optimization

UR - http://www.scopus.com/inward/record.url?scp=0035790205&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0035790205&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0035790205

SN - 1581134215

SP - 77

EP - 86

BT - Proceedings of the 5th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications

ER -