DOI QR코드

DOI QR Code

Exact Modeling and Performance Analysis of Paging Schemes Using Paging Agents

페이징 에이전트를 이용한 페이징 방법의 정확한 모델링 및 성능 분석

  • Moon, Yu-Ri (Dept. of Industrial and Information Systems Engineering, Chonbuk National University) ;
  • Lee, Tae-Han (Dept. of Industrial and Information Systems Engineering, Chonbuk National University) ;
  • Baek, Jang-Hyun (Dept. of Industrial and Information Systems Engineering, Chonbuk National University)
  • 문유리 (전북대학교 산업정보시스템공학과) ;
  • 이태한 (전북대학교 산업정보시스템공학과) ;
  • 백장현 (전북대학교 산업정보시스템공학과)
  • Received : 2010.11.24
  • Accepted : 2011.02.07
  • Published : 2011.03.01

Abstract

This study considers paging schemes that can page some cells or only one cell within the location area to reduce paging cost by using PAs (Paging Agents) and compares their performances by using a new analytic method. There are three ways of paging schemes using PAs; BSPA (Base Staton Paging Agent), 2SPA (2-Step Paging Agent), LAPA (Location Area Paging Agent). This study proposes exact performance of BSPA and 2SPA using a new analytic method based on Markov chain modeling to find the most efficient paging scheme. Numerical results for various circumstances are presented by using proposed analytic method to select a proper paging scheme in mobile communication networks.

Keywords

References

  1. Akyildiz, I. F., Ho, J. S. M., and Lin, Y. B. (1996), Movement-based location update and selective paging for PCS networks, IEEE/ACM Tr. on Networking, 4(4), 629-638. https://doi.org/10.1109/90.532871
  2. Akyildiz, I. F., Lin, Y. B., Lai, W. R., and Chen, R. J. (2000), A new random walk model for PCS networks, IEEE J. on Selected Areas in Communications, 18(7).
  3. Baek, J. H. and Ryu, B. H. (2004), An Efficient 2-Step Paging Strategy Using Paging Agents of Base Stations in Mobile Communication Networks, ETRI Journal, 26(4).
  4. Chung, Y. W., Sung, D. K., and Aghvami, A. H. (2003), Effect of uncertainty of the position of mobile terminals on the paging cost of an improved movement- based registration scheme, IEICE Tr. on Communications, E86-B(2), 859-8602.
  5. Ho, J. S. M. and Akyildiz, I. F. (1995), Mobile user location update and paging under delay Constraints, ACM-Baltzer J. Wireless Networks, 1(4).
  6. Kim, K. H., Lim, T. J., Kang, K. H., and Baek, J. H. (2006), Performance improvement of paging scheme using paging agent, Journal of Information Technology Applications and Management, 13(2), 87-97.
  7. Li, J., Kameda, H., and Li, K. (2000), Optimal dynamic mobility management for PCS networks, IEEE/ACM Tr. on Networking, 8(3), 319-327. https://doi.org/10.1109/90.851978
  8. Mao, Z. and Douligeris, C. (2000), A location-based mobility tracking scheme for PCS networks, Computer Communications, 23, 1729-1739. https://doi.org/10.1016/S0140-3664(00)00202-4
  9. Mao, Z. (2002), An Intra-LA Location Update Strategy for Reducing Paging Cost, IEEE Commun. Lett., 6(8), 334-336. https://doi.org/10.1109/LCOMM.2002.802042
  10. Rose, C. and Yates, R. (1997), Location uncertainty in mobile networks : a theoretical framework, IEEE Communications Magazine.
  11. Rose, C. and Yates, R. (1995), Paging Cost Minimization under delay Constraints, ACM-Baltzer J. Wireless Networks, 1(4), 211-220. https://doi.org/10.1007/BF01202543
  12. Rose, C. (1999), State-Based Paging/Registration : a Greedy Technique, IEEE Trans. Veh. Technol., 48(1), 166-173. https://doi.org/10.1109/25.740083
  13. Ross, S. (1996), Stochastic Processes, John Wiley and Sons.
  14. Ryu, B. H., Ahn, J. H., and Baek, J. H. (2003), Comparative performance evaluation of movement-based registration and distance-based registration, IEICE Tr. on Communications, E86-B(3), 1177-1180.
  15. Suh, B. S., Choi, J. S., and Choi, S. I. (2003), An Efficient Paging Strategy Based on Paging Agents of Base stations in Cellular Mobile Networks, ETRI Journal, 25(1), 55-58. https://doi.org/10.4218/etrij.03.0203.0104
  16. Wan, G. and Lin, E. (1999), Cost Reduction in Location Management Using Semi- Realtime Movement Information, ACM-Baltzer J. Wireless Networks, 5(4), 245-256. https://doi.org/10.1023/A:1019155212541