Mumbai university > Comp > SEM 8 > Mobile Communication

Marks: 10M

Year: Revised 2012

Trunking theory is based on the concept of allowing a large number of users to share the relatively small number of channels in a cell by providing access to each user on demand from a pool of available channels. In trunked radio system each user is allocated a channel on per call basis and upon termination of the call the previously occupied channel is immediately returned to the pool of available channels. There are two types of trunked systems which are commonly used-blocked calls delayed and blocked calls cleared system.

A. Blocked Calls Delayed:

• This system does not offer queuing for call request. It is a memory less system.

• For every user who requests service, it is assumed there is no setup time and the user is given immediate access to a channel if one is available. If no channels are available, the requesting user is blocked without access and is free to try again later. This type of system is called as Blocked Calls Delayed or Erlang B system.

• Calls arrive as determined by poisons distribution. It is assumed that there are an infinite number of users. This system is based on following assumptions.

  • Call requests are memory less implying that all users including blocked users may request for channel at any time.

  • The probability of users occupying a channel is exponentially distributed. That means longer calls are less likely to happen.

  • There are a finite number of channels available in pool.

  • In arrival times all call requests are independent of each other.

• This system uses M/M/m queue and leads to the derivation of the Erlang B formula. The Erlang B formula determines the probability that a call is blocked and is a measure of the GOS for a trunked system which provides no queuing for blocked calls.

  $$pb \ \ (blocking) = \frac{\frac{A^c}{C!}}{Σ_{k = 0}^c \frac{A^k}{K!}}$$

  Where,

  A= Traffic intensity

  C=Total number of channels

  K= kth channel

• Erlang B formula gives a conservative estimate of GOS as the finite users always predict smaller likelihood of blocking.

B. Blocked Calls Cleared:

• In this a queue is provided to hold calls which are blocked. If a channel is not available immediately, the call request is delayed until a channel becomes available. This type of trunking system is called as Blocked Calls Cleared or Erlang C system.

• Its measure of GOS is defined as the probability that a call is blocked after waiting a specific length of time in the queue. To find the GOS it is necessary to find the likelihood that a call is initially denied access to the system.

• The likelihood of a call not having immediate access to a channel is determined by the Erlang c formula.

$$Pb \ (delay \gt 0) = \frac{A^c}{A^c + c!( 1 - \frac{A}{C}) Σ_{k = 0}^{C - 1} \frac{A^k}{k!}}$$

• If no channels are immediately available the call is delayed and the probability that the delayed call is forced to wait more than t seconds is given by the probability that a call is delayed multiplied by the conditional probability that the delay is greater than t seconds. The GOS of a trunked system where blocked calls are delayed is hence given by Pb (delay > t) = Pb (delay > 0) Pb (delay > t | delay >0)

  = Pb (delay > 0) exp (-(C-A) t / H)

  H= Holding Time.

  The average delay D for all calls in a queued system is given by,

  $$D = Pb (delay \gt 0) \ \frac{H}{C-A}$$

  The average delay D for those calls which are queued is given by,

  $$ D = \frac{H}{C-A}$$