Flexible and effective multi-step IP paging schemes

Abstract

This paper proposes and evaluates several dynamic multi-step paging schemes with aggregate mechanism to meet the requirements on paging cost and paging latency of wireless mobile communication systems. Based on the desirable properties of these schemes, an adaptive paging agent, which operates flexibly under the constraints of the paging cost and latency, can be implemented. We show that the balanced partitions of subnets or cells posses some essential properties, and thus, they can be employed to design efficient paging schemes. Our performance analysis demonstrates that the proposed schemes are simple but satisfactory in paging cost and paging latency. In the presence of hot spots, we propose some variant schemes to further improve the average paging cost of the network system. For more efficient performance with varying location probability distributions of subnets, distribution-aware paging strategies are proposed. Moreover, the use of both individual location probability and aggregate location probability in the schemes is thoroughly investigated and contrasted. All the schemes proposed in this paper can operate in both PCSs and wireless IP network systems.