Implicit deregistration in a PCS network

Yi-Bing Lin*, Anthony Noerpel

*Corresponding author for this work

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

Abstract

Registration/deregistration is required in a PCS network when a portable moves between registration areas. Several schemes were proposed to deregister a portable after it moves out of a registration area. A simple scheme called implicit deregistration totally eliminates network traffic due to deregistration. However, this scheme may delete valid registration records. Thus, the size of a registration database must be sufficiently large to ensure low probability that a valid registration record is deleted. This paper describes an analytic model to determine the size k of the registration database for an RA in the implicit deregistration scheme. If the expected number of portables in an RA is N, then our study indicates that good performance can be achieved if k ≈ 5N.

Original languageEnglish
Title of host publicationConference Record - International Conference on Communications
PublisherPubl by IEEE
Pages187-191
Number of pages5
ISBN (Print)0780318269
DOIs
StatePublished - 1 Jan 1994
EventProceedings of the 1994 IEEE International Conference on Communications - New Orleans, LA, USA
Duration: 1 May 19945 May 1994

Publication series

NameConference Record - International Conference on Communications
Volume1
ISSN (Print)0536-1486

Conference

ConferenceProceedings of the 1994 IEEE International Conference on Communications
CityNew Orleans, LA, USA
Period1/05/945/05/94

Cite this

Lin, Y-B., & Noerpel, A. (1994). Implicit deregistration in a PCS network. In Conference Record - International Conference on Communications (pp. 187-191). (Conference Record - International Conference on Communications; Vol. 1). Publ by IEEE. https://doi.org/10.1109/ICC.1994.368998