Skip to main content

Performance Evaluation and Comparison of Two Random Walk Models in the PCS Network

  • Conference paper
Information Networking. Advances in Data Communications and Wireless Networks (ICOIN 2006)

Part of the book series: Lecture Notes in Computer Science ((LNCCN,volume 3961))

Included in the following conference series:

  • 802 Accesses

Abstract

In this paper, we evaluate the performance of the MBR (movement–based registration) scheme using a modified one-dimensional random walk model and a two–dimensional random walk model to compare the accuracy of two random walk models. The difference between these two models is identified and the performance difference in a mathematical approach is presented to support it. Analytical results are provided to demonstrate that the modified one–dimensional random walk always overestimates the performance of the MBR and that the two–dimensional random walk model should be used to obtain the exact performance of the MBR, and other registration schemes.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Akyildiz, I.F., Ho, J.S.M., Lin, Y.B.: Movement–based location update and selective paging for PCS networks. IEEE/ACM Trans. Networking 4, 629–638 (1996)

    Article  Google Scholar 

  2. Baek, J.H., Ryu, B.H.: An improved movement–based registration in personal communication system networks. IEICE Trans. Comm., E83-B(7), 1509–1516 (2000)

    Google Scholar 

  3. Tseng, Y.C., Hung, W.N.: An improved cell type classification for random walk modeling in cellular networks. IEEE Comm. Letters 5(8), 337–339 (2001)

    Article  Google Scholar 

  4. Ho, J.S.M., Akyildiz, I.F.: Mobile user location update and paging under delay constraints. ACM-Baltzer J. Wireless Networks 1(4), 413–425 (1995)

    Article  Google Scholar 

  5. Rose, C., Yates, R.: Paging cost minimization under delay constrains ACM–Baltzer J. Wireless Networks 1(4), 211–220 (1995)

    Article  Google Scholar 

  6. Chung, Y.W., Sung, D.K., Aghavami, A.H.: Effect of uncertainty of the position of mobile terminals on the paging cost of an improved movement–based registration scheme. IEEE Trans. Comm. E86-B(2), 859–861 (2003)

    Google Scholar 

  7. Baek, J.H., Seo, J.Y.: Modeling and performance evaluation of unidirection-based registration with line–paging for cellular networks. International journal of industrial engineering–theory applications and practice 10(4), 519–524 (2003)

    Google Scholar 

  8. Tung, T., Jamalipour, A.: A novel sectional paging strategy for location tracking in cellular networks. IEEE Comm. Letters 8(1), 24–26 (2004)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Baek, J.H., Seo, J.Y., Kim, K.H. (2006). Performance Evaluation and Comparison of Two Random Walk Models in the PCS Network. In: Chong, I., Kawahara, K. (eds) Information Networking. Advances in Data Communications and Wireless Networks. ICOIN 2006. Lecture Notes in Computer Science, vol 3961. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11919568_58

Download citation

  • DOI: https://doi.org/10.1007/11919568_58

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-48563-6

  • Online ISBN: 978-3-540-48564-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics