Convergence in the calculation of the handoff arrival rate

A log-time iterative algorithm

Research output: Contribution to journalArticle

4 Citations (Scopus)

Abstract

Modeling to study the performance of wireless networks in recentyears has produced sets of nonlinear equations with interrelatedparameters. Because these nonlinear equations have no closed-formsolution, the numerical values of the parameters are calculated byiterative algorithms. In a Markov chain model of a wirelesscellular network, one commonly used expression for calculating thehandoff arrival rate can lead to a sequence of oscillatingiterative values that fail to converge. We present an algorithmthat generates a monotonic sequence, and we prove that themonotonic sequence always converges. Lastly, we give a furtheralgorithm that converges logarithmically, thereby permitting thehandoff arrival rate to be calculated very quickly to any desireddegree of accuracy.

Original language English (US) 1-11 11 Eurasip Journal on Wireless Communications and Networking 2006 https://doi.org/10.1155/WCN/2006/15876 Published - Apr 14 2006

Fingerprint

Nonlinear equations
Markov processes
Wireless networks

ASJC Scopus subject areas

• Signal Processing
• Computer Science Applications
• Computer Networks and Communications

Cite this

In: Eurasip Journal on Wireless Communications and Networking, Vol. 2006, 14.04.2006, p. 1-11.

Research output: Contribution to journalArticle

@article{323066cf9e3c4ef3895e4e795aa54d4a,
title = "Convergence in the calculation of the handoff arrival rate: A log-time iterative algorithm",
abstract = "Modeling to study the performance of wireless networks in recentyears has produced sets of nonlinear equations with interrelatedparameters. Because these nonlinear equations have no closed-formsolution, the numerical values of the parameters are calculated byiterative algorithms. In a Markov chain model of a wirelesscellular network, one commonly used expression for calculating thehandoff arrival rate can lead to a sequence of oscillatingiterative values that fail to converge. We present an algorithmthat generates a monotonic sequence, and we prove that themonotonic sequence always converges. Lastly, we give a furtheralgorithm that converges logarithmically, thereby permitting thehandoff arrival rate to be calculated very quickly to any desireddegree of accuracy.",
author = "Dilip Sarkar and Theodore Jewell and Subramanian Ramakrishnan",
year = "2006",
month = "4",
day = "14",
doi = "10.1155/WCN/2006/15876",
language = "English (US)",
volume = "2006",
pages = "1--11",
journal = "Eurasip Journal on Wireless Communications and Networking",
issn = "1687-1472",
publisher = "Springer Publishing Company",

}

TY - JOUR

T1 - Convergence in the calculation of the handoff arrival rate

T2 - A log-time iterative algorithm

AU - Sarkar, Dilip

AU - Jewell, Theodore

AU - Ramakrishnan, Subramanian

PY - 2006/4/14

Y1 - 2006/4/14

N2 - Modeling to study the performance of wireless networks in recentyears has produced sets of nonlinear equations with interrelatedparameters. Because these nonlinear equations have no closed-formsolution, the numerical values of the parameters are calculated byiterative algorithms. In a Markov chain model of a wirelesscellular network, one commonly used expression for calculating thehandoff arrival rate can lead to a sequence of oscillatingiterative values that fail to converge. We present an algorithmthat generates a monotonic sequence, and we prove that themonotonic sequence always converges. Lastly, we give a furtheralgorithm that converges logarithmically, thereby permitting thehandoff arrival rate to be calculated very quickly to any desireddegree of accuracy.

AB - Modeling to study the performance of wireless networks in recentyears has produced sets of nonlinear equations with interrelatedparameters. Because these nonlinear equations have no closed-formsolution, the numerical values of the parameters are calculated byiterative algorithms. In a Markov chain model of a wirelesscellular network, one commonly used expression for calculating thehandoff arrival rate can lead to a sequence of oscillatingiterative values that fail to converge. We present an algorithmthat generates a monotonic sequence, and we prove that themonotonic sequence always converges. Lastly, we give a furtheralgorithm that converges logarithmically, thereby permitting thehandoff arrival rate to be calculated very quickly to any desireddegree of accuracy.

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

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

U2 - 10.1155/WCN/2006/15876

DO - 10.1155/WCN/2006/15876

M3 - Article

VL - 2006

SP - 1

EP - 11

JO - Eurasip Journal on Wireless Communications and Networking

JF - Eurasip Journal on Wireless Communications and Networking

SN - 1687-1472

ER -