Deregistration strategies for PCS networks

Abstract

This paper studies three deregistration strategies (explicit, implicit, and timeout (TO) deregistration) for personal communication service (PCS) networks to determine the network conditions under which each strategy gives the best performance, Two performance measures are considered: 1) the probability alpha that a portable cannot register (and receive service) and 2) the number of deregistration messages sent in a strategy, For the same database size, alpha is smaller for explicit deregistration (ED) than it is for TO or implicit deregistration (ID)). On the other hand, ID does not create any deregistration message traffic, With an appropriate TO period, the deregistration message traffic for TO deregistration is much smaller than the traffic for ED, Suppose that there are N portables in a registration area (RA) on the average, To ensure that alpha < 10(-3), our study indicates that if the database size is larger than 4N, then the implicit scheme should be selected (to eliminate deregistration traffic), If the database size is smaller than 1.5N, then the explicit scheme should be selected, Otherwise, the TO scheme should be selected to achieve the best performance.