Iterative algorithms for performance evaluation of wireless networks with guard channels

Dmitry Fedyanin, Dilip Sarkar

Research output: Contribution to journalReview article

1 Citation (Scopus)

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, 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 language English (US) 239-245 7 International Journal of Wireless Information Networks 8 4 Published - Dec 1 2001

Fingerprint

Wireless networks
Nonlinear equations
Blocking probability

Keywords

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

ASJC Scopus subject areas

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

Cite this

In: International Journal of Wireless Information Networks, Vol. 8, No. 4, 01.12.2001, p. 239-245.

Research output: Contribution to journalReview article

@article{7d99428a7f9942a6b15aa18c85d7965b,
title = "Iterative algorithms for performance evaluation of wireless networks with guard channels",
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, 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.",
keywords = "Cellular systems, Guard channels, Iterative algorithms, Markov process, Performance evaluation",
author = "Dmitry Fedyanin and Dilip Sarkar",
year = "2001",
month = "12",
day = "1",
language = "English (US)",
volume = "8",
pages = "239--245",
journal = "International Journal of Wireless Information Networks",
issn = "1068-9605",
publisher = "Springer New York",
number = "4",

}

TY - JOUR

T1 - Iterative algorithms for performance evaluation of wireless networks with guard channels

AU - Fedyanin, Dmitry

AU - Sarkar, Dilip

PY - 2001/12/1

Y1 - 2001/12/1

N2 - 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.

AB - 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.

KW - Cellular systems

KW - Guard channels

KW - Iterative algorithms

KW - Markov process

KW - Performance evaluation

UR - http://www.scopus.com/inward/record.url?scp=10844278329&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=10844278329&partnerID=8YFLogxK

M3 - Review article

VL - 8

SP - 239

EP - 245

JO - International Journal of Wireless Information Networks

JF - International Journal of Wireless Information Networks

SN - 1068-9605

IS - 4

ER -