Effective Paging Schemes with Delay Bounds as QoS Constraints in Wireless Systems |
| |
Authors: | Wang Wenye Akyildiz Ian F Stüber Gordon L Chung Boo-Young |
| |
Affiliation: | (1) School of Electrical and Computer Engineering, Georgia Institute of Technology, Atlanta, GA 30332, USA;(2) Korea Telecom Access Network Laboratory, 17 Woomyun-Dong, Seocho-Gu, Seoul, 137792, Korea |
| |
Abstract: | In this paper new paging schemes are presented for locating mobile users in wireless networks. Paging costs and delay bounds are considered since paging costs are 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 costs, three new paging schemes, reverse, semi-reverse and uniform, are introduced to provide a simple way of partitioning the service areas and decrease the paging costs based on each mobile terminal's location probability distribution. Numerical results demonstrate that our approaches significantly reduce the paging costs for various probability distributions such as uniform, truncated discrete Gaussian, and irregular distributions. |
| |
Keywords: | wireless networks delay bounds paging costs QoS paging areas |
本文献已被 SpringerLink 等数据库收录! |
|