Modeling Wireless Local with General Call Holding Times and Finite Number of Subscribers

This paper proposes an analytic model to compute the loss probability for wireless local loop (WLL) with a finite number of subscribers. The number of trunks between the WLL concentrator and the base station controller is less than the total number of radio links in the WLL. This model is validated against the simulation results. The execution of our model is efficient compared with simulation. However, its time complexity is higher than several existing analytic models that approximate the loss probability for WLL. Therefore, we design an efficient WLL network planning procedure (in terms of time complexity and accuracy) that utilizes the approximate analytic models to provide small ranges for selecting the values of system parameters. Our model is then used to accurately search the operation points of WLL within the small ranges of the system parameter values. This paper proves that the performance of WLL with limited trunk capacity and finite subscriber population is not affected by the call holding time distributions. Based on our model, we illustrate WLL design guidelines with several numerical examples.

[1]  S. Zachary.  On blocking in loss networks , 1991, Advances in Applied Probability.

[2]  Yi-Bing Lin,et al.  Design and implementation of an OA&M system for WLL network , 2000, Journal of Communications and Networks.

[3]  Yi-Bing Lin,et al.  Resource Planning for Wireless PBX Systems , 1998, Int. J. Wirel. Inf. Networks.

[4]  J. Lehoczky,et al.  Insensitivity of blocking probabilities in a circuit-switching network , 1984 .

[5]  Yi-Bing Lin,et al.  Wireless and Mobile Network Architectures , 2000 .

[6]  W. R. Buckland,et al.  Introduction to congestion theory in telephone systems , 1962 .

[7]  D. Burman.  Insensitivity in queueing systems , 1980, Advances in Applied Probability.

[8]  Wei Liu,et al.  Blocking formulae for the Engset model , 1994, IEEE Trans. Commun..

[9]  Mischa Schwartz,et al.  Telecommunication networks: protocols, modeling and analysis , 1986 .

[10]  R. Syski,et al.  Introduction to congestion theory in telephone systems , 1962 .

[11]  Frank Kelly,et al.  Reversibility and Stochastic Networks , 1979 .

[12]  Yuguang Fang,et al.  Teletraffic analysis and mobility modeling of PCS networks , 1999, IEEE Trans. Commun..

[13]  Yi-Bing Lin,et al.  Performance modeling of wireless PBX systems , 1999, Wirel. Networks.

[14]  Mischa Schwartz,et al.  Telecommunication networks , 1987 .

[15]  Zbigniew Dziong,et al.  Congestion Probabilities in a Circuit-Switched Integrated Services Network , 1987, Perform. Evaluation.

[16]  Leonard Kleinrock,et al.  Queueing Systems: Volume I-Theory , 1975 .

[17]  Yi-Bing Lin,et al.  Wireless local loop: architecture, technologies and services , 1998, IEEE Wirel. Commun..

[18]  F. Kelly.  Blocking probabilities in large circuit-switched networks , 1986, Advances in Applied Probability.

[19]  Leonard Kleinrock,et al.  Theory, Volume 1, Queueing Systems , 1975 .