This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Performance Evaluation of Pipeline Paging under Paging Delay Constraint for Wireless Systems
January 2006 (vol. 5 no. 1)
pp. 64-76
ASCII Text
x 
 
Yang Xiao, Hui Chen, Mohsen Guizani, "Performance Evaluation of Pipeline Paging under Paging Delay Constraint for Wireless Systems," IEEE Transactions on Mobile Computing, vol. 5, no. 1, pp. 64-76, January, 2006.
 
 
BibTex
x
 
@article{ 10.1109/TMC.2006.14,
author = {Yang Xiao and Hui Chen and Mohsen Guizani},
title = {Performance Evaluation of Pipeline Paging under Paging Delay Constraint for Wireless Systems},
journal ={IEEE Transactions on Mobile Computing},
volume = {5},
number = {1},
issn = {1536-1233},
year = {2006},
pages = {64-76},
doi = {http://doi.ieeecomputersociety.org/10.1109/TMC.2006.14},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - JOUR
JO - IEEE Transactions on Mobile Computing
TI - Performance Evaluation of Pipeline Paging under Paging Delay Constraint for Wireless Systems
IS - 1
SN - 1536-1233
SP64
EP76
EPD - 64-76
A1 - Yang Xiao,
A1 - Hui Chen,
A1 - Mohsen Guizani,
PY - 2006
KW - Index Terms- Parallel
KW - pipeline
KW - paging
KW - wireless systems.
VL - 5
JA - IEEE Transactions on Mobile Computing
ER -
 
In this paper, we present a simple pipeline paging (PP) scheme, in which multiple paging requests (PRs) can be served in a pipeline manner in different paging areas. We analytically model the blanket paging (BP) scheme, the sequential paging (SP) scheme, and the PP scheme so that discovery rate, total delay, paging delay, and cost are derived analytically as functions of traffic load. Extensive simulations are carried out to verify our analytical results. Our study shows that the PP scheme outperforms both the BP and SP schemes in terms of discover rate while maintaining the same cost as the SP scheme. The PP scheme outperforms the SP scheme in terms of total delay and has a lower total delay than the BP scheme when traffic load is high. We also show that, when the paging delay constraint D is large enough, the PP scheme achieves almost 200 percent of discovery rate and 50 percent of cost of the BP scheme, whereas discovery rate of the SP scheme is far less than that of the BP scheme. Furthermore, we solve the following two-optimization problems for the PP scheme: 1) the minimization of discovery rate with a bound on total delay and 2) the minimization of cost with a bound on total delay. In case the cost factor is not considered but total delay is important, we propose an adaptive scheme: When the traffic is lower than a threshold, the BP scheme is adopted; otherwise, the PP scheme is used. In this case, the threshold value is explicitly derived.

[1] I.F. Akyildiz, J.S.M. Ho, and Y.-B. Lin, “Movement-Based Location Update and Selective Paging for PCS Networks,” IEEE/ACM Trans. Networking, vol. 4, no. 4, pp. 629-638, Aug. 1996.
[2] Z. Mao and C. Douligeris, “A Location-Based Mobility Tracking Scheme for PCS Networks,” Computer Comm., pp. 1729-1739, Dec. 2000.
[3] C. Rose and R. Yates, “Minimizing the Average Cost of Paging under Delay Constraints,” ACM/Baltzer Wireless Networks, vol. 1, no. 2, pp. 211-219, 1995.
[4] C. Rose, “Minimizing the Average Cost of Paging and Registration: A Timer-Based Method,” Wireless Networks, vol. 2, no. 2, pp. 109-116, 1996.
[5] C. Rose and R. Yates, “Ensemble Polling Strategies for Increased Paging Capacity in Mobile Communication Networks,” Wireless Networks, vol. 3, no. 2, pp. 159-167, 1997.
[6] S.L. Su and K.T. Chen, “Two-Stage Ensemble Paging Strategy for Cellular Communication Systems,” IEEE Comm. Letters, vol. 6, no. 10, pp. 425-427, Oct. 2002.
[7] W. Wang, I.F. Akyildiz, and G. Stuber, “An Optimal Partition Algorithm for Minimization of Paging Costs,” IEEE Comm. Letters, vol. 5, no. 2, pp. 42-45, Feb. 2001.
[8] A. Abutaleb and V.O.K. Li, “Paging Strategy Optimization in Personal Communication Systems,” ACM/Baltzer Wireless Networks, vol. 3, no. 3, pp. 195-204, 1997.
[9] G.L. Lyberopoulos, J.G. Markoulidakis, D.V. Polymeros, D.F. Tsirkas, and E.D. Sykas, “Intelligent Paging Strategies for Third Generation Mobile Telecommunication Systems,” IEEE Trans. Vehicular Technology, vol. 44, no. 3, pp. 543-553, Aug. 1995.
[10] L. Kleinrock, Queuing Systems, Volume I: Theory. John Wiley & Sons, 1975.
[11] Z. Mao and C. Douligeris, “Group Registration for Location Tracking in Mobile Networks,” IEEE Trans. Mobile Computing, submitted for publication.
[12] A.S. Tanenbaum, Computer Networks, fourth ed. Prentice Hall, 2002.
[13] V.W.S. Wong and V.C.M. Leung, “Location Management for Next Generation Personal Communications Networks,” IEEE Network, vol. 14, no. 5, pp. 18-24, Sept./Oct. 2000.
[14] S. Tabbane, “Location Management Methods for Third-Generation Mobile Systems,” IEEE Comm. Magazine, vol. 35, no. 8, pp. 72-78, Aug. 1997.
[15] I.F. Akyildiz, J. McNair, J.S.M. Ho, H. Uzunalioglu, and W. Wang, “Mobility Management in Next Generation Wireless Systems,” IEEE Proc. J., vol. 87, no. 8, pp. 1347-1385, Aug. 1999.
[16] Y.-B. Lin, “Reducing Location Update Cost in a PCS Network,” IEEE/ACM Trans. Networking, vol. 5, no. 1, pp. 25-33. Feb. 1997.
[17] S.K. Sen, A. Bhattacharya, and S.K. Das, “A Selective Location Update Strategy for PCS Users,” ACM/Baltzer J. Wireless Networks, vol. 5, no. 5, pp. 313-26 Sept. 1999.
[18] G.P. Pollini and C.-L. I, “A Profile-Based Location Strategy and Its Performance,” IEEE J. Selected Areas in Comm., vol. 15, no, 8, pp. 1415-24, Oct. 1997.
[19] S. Tabbane, “An Alternative Strategy for Location Tracking,” IEEE J. Selected Areas in Comm., vol. 13, no. 5, pp. 880-92, 1995.
[20] Y. Xiao, “Optimal Location Management for Two-Tier PCS Networks,” Computer Comm., vol. 26, no. 10, pp. 1047-1055, Elsevier Science, June 2003.
[21] Y. Xiao, “Optimal Fractional Movement-Based Scheme for PCS Location Management,” IEEE Comm. Letters, vol. 7, no. 2, pp. 67-69, Feb. 2003.
[22] Y. Xiao, Y. Pan, and J. Li, “Design and Analysis of Location Management for 3G Cellular Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 15, no. 4, Apr. 2004.
[23] V.W.S. Wong and V.C.M. Leung, “An Adaptive Distance-Based Location Update Algorithm for Next-Generation PCS Networks,” IEEE J. Selected Areas in Comm., vol. 19, no. 10, pp. 1942-1952, Oct. 2001.
[24] B. Liang and Z.J. Haas, “Predictive Distance-Based Mobility Management for Multi-Dimensional PCS Networks,” IEEE/ACM Trans. Networking, vol. 11, no. 5, pp. 718-732, Oct. 2003.
[25] I.F. Akyildiz and W. Wang, “A Dynamic Location Management Scheme for Next Generation Multi-Tier PCS Systems,” IEEE Trans. Wireless Comm., vol. 1, no. 1, pp. 178-189, Jan. 2002.
[26] Y. Bejerano and I. Cidon, “An Anchor Chain Scheme for IP Mobility Management,” Wireless Networks, vol. 9, no. 5, pp 409-420, Sept. 2003.
[27] Y. Bejerano and I. Cidon, “Efficient Location Management Based on Moving Location Areas,” Proc. INFOCOM 2001, pp. 3-12, 2001.
[28] W. Wang, I.F. Akyildiz, G.L. Stuber, and B.-Y. Chung, “Effective Paging Schemes with Delay Bounds as QoS Constraints in Wireless Systems,” Wireless Networks, vol. 7, no. 5, pp. 455-466, 2001.

Index Terms:
Index Terms- Parallel, pipeline, paging, wireless systems.
Citation:
Yang Xiao, Hui Chen, Mohsen Guizani, "Performance Evaluation of Pipeline Paging under Paging Delay Constraint for Wireless Systems," IEEE Transactions on Mobile Computing, vol. 5, no. 1, pp. 64-76, Jan. 2006, doi:10.1109/TMC.2006.14
Usage of this product signifies your acceptance of the Terms of Use.