Performance evaluation of a reservation random access scheme for packetized wireless systems with call control
Izhak Rubin, Shervin Shambayati · 2003
A method for design and analysis of wireless cells using reservation random access (RRA) schemes for packet access control integrated with a call admission control procedure is presented. The state process of the system is modeled as a vector Markov chain. The transition probability function for this process is derived, and its steady-state distribution is computed. This result is used to calculate the packet dropping probability and the call blocking probability. By setting limits on their maximum attained levels, one can derive the Erlang capacity of the system. For a specific RRA scheme, the Erlang capacity of the system is about twice the Erlang capacity attained by a comparable fixed assigned TDMA scheme. It is shown that an optimal level for the call admission threshold can be selected to yield the highest call throughput level.>