Cluster paging for traveling subscribers

Abstract

A general paging problem formulation for mobile subscribers in cellular systems bearing in mind the number of paging signals and elapsed time is presented. Different search strategies are examined in an exponential traveling model. Expressions for mean number of paging signals and searching cost are obtained. Some emphasis is given to hexagonal cell clustering. It is shown that due to mobile traveling patterns, good performance, both in terms of cost and covering area, can be achieved with a small number of paging stages. It is also observed that for cell clustering, a travel model of the form P/sub i/=k alpha /sup i/ is in good agreement with empirical results, and can be used to assess mobile subscriber paging costs.<>