In this paper, we present analytical models for the pipeline paging (PP) scheme, the blanket paging (BP) scheme, and the sequential paging (SP) scheme. In the PP scheme, multiple paging requests can be served in a pipeline manner in different paging areas. Discovery rate, total delay, paging delay, and cost are derived analytically as functions of traffic load. Extensive simulations are carried out to verify our analytical results. Our study shows that the PP scheme outperforms both the BP and SP schemes
['Yang Xiao', 'Hui Chen', 'Mohsen Guizani']
Analytically modeling pipeline paging for wireless systems