By Topic

Reducing the paging costs under delay bounds for PCS networks

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
$31 $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

3 Author(s)
Wenye Wang ; Sch. of Electr. & Comput. Eng., Georgia Inst. of Technol., Atlanta, GA, USA ; Akyildiz, I.F. ; Stuber, G.L.

New paging schemes are presented for locating mobile users in wireless networks. Paging costs and delay bounds are considered since the paging cost is associated with bandwidth utilization and delay bounds influence call setup time. In general, location tracking schemes require intensive computation to search for a mobile terminal in current PCS networks. To reduce the paging cost, three new paging schemes-reverse, semi-reverse and uniform-are introduced to provide a simple way of partitioning the service areas and accordingly minimizing the paging cost based on each mobile terminal's location probability distribution. Numerical results demonstrate that our approaches significantly reduce the paging cost for various location probability distributions such as uniform, truncated discrete Gaussian, and irregular distributions

Published in:

Wireless Communications and Networking Confernce, 2000. WCNC. 2000 IEEE  (Volume:1 )

Date of Conference:

2000