Non-blocking pipeline paging with known location probabilities for wireless systems

作者：Xiao Yang^*; Chen Hui; Guizani Mohsen

来源：IEEE Transactions on Wireless Communications, 2007, 6(10): 3632-3640.

DOI：10.1109/TWC.2007.060048

• parallel
• pipeline
• concurrent
• paging
• wireless systems

Paging schemes for wireless systems have been well studied in the literature. However, most schemes are considered on per user basis. In these schemes, when an incoming call arrives at a Mobile Terminal (MT), a Paging Request (PR) is put in a queue. PRs are served in an FIFO manner. When a PR is served, a search process is carried out to find the corresponding NIT in a Location Area (LA). Most schemes study how to achieve a better performance in terms of cost with/without delay constraints per PR, and totally ignore other PRs in the queue until the MT is found or all the cells in the LA have been paged. In this paper, we propose a non-blocking pipeline probability paging scheme, which assumes known knowledge on location probabilities of individual MTs, under a paging delay constraint, where the location probability of an NIT in a cell is the probability that the MT is in the cell. The proposed scheme is independent of the number of PRs in the queue and the arrival rate of PRs. Our study shows that the proposed scheme outperforms both the sequential probability paging scheme with known knowledge on location probabilities of individual MTs and the blanket paging scheme in terms of discovery rate and the total delay. Finally, we study several optimization problems with quality of service constraint for the pipeline probability paging scheme.

• 出版日期2007-10
• 单位常州工学院