Skip to Main Content
Most paging schemes are considered on a per-user basis, i.e., when an incoming call arrives to a mobile terminal (MT), a paging request (PR) is put in a queue in mobile switching center, and PRs are served in a first-in first-out manner. In this paper, we propose a simplified pipeline probability paging (PPP) scheme, which handles PRs in a pipeline manner with a paging delay constraint under the condition of known knowledge on location probabilities of individual MTs. We then provide a performance evaluation and comparison for blanket paging scheme, sequential probability paging, and PPP in wireless networks. Both analytical models and extensive simulations are adopted to study these schemes.