| Summary: | 碩士 === 國立中正大學 === 通訊工程研究所 === 99 === 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 User Equipment (UE), a Paging Request (PR) is put in a queue. PRs are served in an FIFO manner. When a PR is served, a paging process is carried out to find the corresponding UE in a Location Area (LA). Most schemes study how to achieve a better performance in terms of cost with delay constraints per PR, and totally ignore other PRs in the queue until the UE is found or all the cells in the LA have been paged.
In this paper, we provide a paging scheduling called two-stage paging scheduling in LTE Access Network. Base station uses Sequential Paging in the first stage to reduce paging cost of wireless access network, and uses Blanket Paging in the second stage to guarantee UE against all loss. Besides, only then MME didn’t find the target UE in the first stage, MME will implement the second stage. Our study shows that the proposed scheme outperforms both the sequential paging scheme and the blanket paging scheme in terms of discovery rate and the total delay.
|
|---|
