By Topic

Performance Analysis of Blanket Paging, Sequential Probability Paging, and Pipeline Probability Paging for Wireless Systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Yang Xiao ; Zhejiang Univ., Hangzhou ; Hui Chen ; Xiaojiang Du ; Mohsen Guizani

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.

Published in:

IEEE Transactions on Vehicular Technology  (Volume:56 ,  Issue: 5 )