Iterative algorithms for performance evaluation of wireless networks with guard channels

Dmitry Fedyanin, Dilip Sarkar

Research output: Contribution to journalReview articlepeer-review

1 Scopus citations


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, pb, and forced termination probability, pft, at any desired level of accuracy. We then used this algorithm to numerically show that for a given pair of values of pb and pft, there is an optimal number of guard channels that supports a maximal new-call arrival rate.

Original languageEnglish (US)
Pages (from-to)239-245
Number of pages7
JournalInternational Journal of Wireless Information Networks
Issue number4
StatePublished - 2001


  • Cellular systems
  • Guard channels
  • Iterative algorithms
  • Markov process
  • Performance evaluation

ASJC Scopus subject areas

  • Hardware and Architecture
  • Computer Networks and Communications
  • Electrical and Electronic Engineering


Dive into the research topics of 'Iterative algorithms for performance evaluation of wireless networks with guard channels'. Together they form a unique fingerprint.

Cite this