Skip to main content
Log in

Iterative Algorithms for Performance Evaluation of Wireless Networks with Guard Channels

  • Published:
International Journal of Wireless Information Networks Aims and scope Submit manuscript

Abstract

Analytical and modeling work performed since the late eighties have led to nonlinear equations that relate important parameters used for performance evaluation of wireless networks. These nonlinear equations have no closed-form solution and iterative algorithms are used to find numerical solutions. However, iterative algorithms that are not designed to detect and overcome nonconvergence situations may fail to converge. We present an iterative algorithm that numerically solves six dependent nonlinear equations. The algorithm always converges and obtains values of blocking probability, p b , and forced termination probability, p ft , at any desired level of accuracy. We then used this algorithm to numerically show that for a given pair of values of p b and p ft , there is an optimal number of guard channels that supports a maximal new-call arrival rate.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

REFERENCES

  1. A. S. Acampora and M. Naghshineh, Control and quality of service provisioning in high speed microcellular networks, IEEE Personal Communications, Vol. 1, No. 2, pp. 36–43, 1994.

    Google Scholar 

  2. L. O. Guerrero and A. H. Aghvami, A prioritized handoff dynamic channel allocation strategy for PCS, IEEE Transactions on Vehicular Technology, Vol. 48, No. 4, pp. 1203–1215, 1999.

    Google Scholar 

  3. D. Hong and S. S. Rappaport, Traffic model and performance analysis for cellular mobile radio telephone systems with prioritized and nonprioritized handoff procedures, IEEE Transactions on Vehicular Technology, Vol. 35, No. 3, pp. 77–92, 1986.

    Google Scholar 

  4. Y. C. Kim, D. E. Lee, B. J. Lee, Y. S. Kim, and B. Mukherjee, Dynamic channel reservation based on mobility in wireless atm network, IEEE Communications Magazine, Vol. 37, No. 11, pp. 47–51, 1999.

    Google Scholar 

  5. Y. B. Lin, S. Mohan, and A. Noerpel, PCS channel assignment strategies for hand-off and initial access, IEEE Personal Communications, Vol. 1, No. 3, pp. 47–56, 1994.

    Google Scholar 

  6. Y. B. Lin, S. Mohan, and A. Noerpel, Queuing priority channel assignment strategies for PCS hand-off and initial access, IEEE Transactions on Vehicular Technology, Vol. 43, No. 3, pp. 704–712, 1994.

    Google Scholar 

  7. Y. B. Lin, L. F. Chang, and A. Noerpel, Modeling hierarchical microcell/macrocell PCS architecture. In Proceedings of ICC, pp. 405–409, 1995.

  8. A. D. May, Traffic Flow Fundamentals, Prentice Hall, Upper Saddle River, NJ 07458, 1990.

    Google Scholar 

  9. S.-H. Oh and D.-W. Tcha, Prioritized channel assignment in a cellular radio network, IEEE Transactions on Communications, Vol. 40, No. 7, pp. 1259–1269, 1992.

    Google Scholar 

  10. D. Towsley, R. Ramjee, and R. Nagarajan, On optimal call admission control in cellular networks, Wireless Networks, Vol. 3, pp. 29–41, 1997.

    Google Scholar 

  11. S. Tekinay and B. Jabbari, A measurement-based prioritization scheme for handovers in mobile cellular networks, IEEE Journal on Selected Areas in Communications, Vol. 10, No. 8, pp. 1343–1350, 1992.

    Google Scholar 

  12. O. T. W. Yu and V. C. M. Leung, Adaptive resource allocation for prioritized call admission over an ATM-based wireless-PCN, IEEE Journal on Selected Areas in Communications, Vol. 15, No. 7, pp. 1208–1225, 1997.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Fedyanin, D., Sarkar, D. Iterative Algorithms for Performance Evaluation of Wireless Networks with Guard Channels. International Journal of Wireless Information Networks 8, 239–245 (2001). https://doi.org/10.1023/A:1017981721733

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1017981721733

Navigation