Fundamentals of queueing theory (2nd ed.).
Fundamentals of queueing theory (2nd ed.).
A signaling architecture for wireless ATM access networks
Wireless Networks
Real-time prioritized call admission control in a base station scheduler
WOWMOM '00 Proceedings of the 3rd ACM international workshop on Wireless mobile multimedia
Connection admission control for capacity-varying networks with stochastic capacity change times
IEEE/ACM Transactions on Networking (TON)
Call admission control for wireless personal communications
Computer Communications
| Hi-index | 0.01 |
We consider a packet switched wireless network where each cell's communication channel is shared among packet voice sources. In this paper, we present a method for the design and analysis of wireless cells using a reservation random access (RRA) scheme for packet access control. This scheme is integrated with a call admission control procedure. We model the state process of a single cell as a vector Markov chain. We compute the steady state distribution of the Markov chain. This result is used to calculate the packet dropping probability and the call blocking probability. By setting limits on maximum permissible levels for the call blocking probability and the packet dropping probability, we obtain the Erlang capacity of a single cell, with and without hand-off traffic. For an illustrative RRA scheme, the Erlang capacity of a single cell is shown to be about twice that attained by a comparable fixed assigned TDMA scheme. We show that a cellular network using this RRA scheme and which applies can be no blocking of hand-off calls, exhibits similar call capacity levels.