Convergence in the calculation of the handoff arrival rate: a log-time iterative algorithm

Authors:
Dilip Sarkar;Theodore Jewell;S. Ramakrishnan
Affiliations:
Department of Computer Science, University of Miami, Coral Gables, FL;The Taft School, Watertown, CT;Department of Mathematics, University of Miami, Coral Gables, FL
Venue:
EURASIP Journal on Wireless Communications and Networking
Year:
2006

Citing 3
Cited 0

On optimal call admission control in cellular networks

Wireless Networks
Modeling PCS networks under general call holding time and cell residence time distributions

IEEE/ACM Transactions on Networking (TON)
Wireless Communications: Principles and Practice

Wireless Communications: Principles and Practice

Quantified Score

Hi-index	0.00

Visualization

Abstract

Modeling to study the performance of wireless networks in recent years has produced sets of nonlinear equations with interrelated parameters. Because these nonlinear equations have no closed-form solution, the numerical values of the parameters are calculated by iterative algorithms. In a Markov chain model of a wireless cellular network, one commonly used expression for calculating the handoff arrival rate can lead to a sequence of oscillating iterative values that fail to converge. We present an algorithm that generates a monotonic sequence, and we prove that the monotonic sequences always converges. Lastly, we give a further algorithm that converges logarithmically, thereby permitting the handoff arrival rate to be calculated very quickly to any desired degree of accuracy.