Documente Academic
Documente Profesional
Documente Cultură
Abstract. The random access channels and traffic channels are utilized, respectively, for call establishment and
information transmission in the uplink direction (from mobile to base station) of the Global System for Mobile
communications (GSM) networks. A call is either rejected or blocked depending on its inability to succeed either
in the random access channels or in the traffic channels. The optimum number of random access slots is directly
proportional to the average call arrival rate, being independent of the average channel holding time and the
number of traffic channels. The number of slots occupied by a given call can be changed dynamically in the
newly developed General Packet Radio Service (GPRS) systems. A complete analysis is executed for the traffic
channel utilization and call blocking probability with the exact number of random access slots that provide almost
zero call rejection probability. The overall call success probability is derived considering call rejection and call
blocking probabilities.
Keywords: call blocking, call rejection, GPRS, GSM, random access, traffic channel, overall call success.
1. Introduction
The core network of the Universal Mobile Communication Systems (UMTS) will be at least
partly based on Global System for Mobile (GSM) [1]. The initial implementation of GSM
was for voice communications. Like several other technologies the second-generation system
GSM is evolving via General Packet Radio Services (GPRS), High Speed Circuit Switched
Data (HSCSD) and Enhanced Data Rates for GSM Evolution (EDGE) towards UMTS [2].
Currently, the EDGE radio interface is being standardized by European Telecommunications
Standard Institute (ETSI) and by TIA TR45.3 as a GSM Phase 2+ work item. The new EDGE
radio interface deploys 8-PSK modulation instead of GMSK, thus enabling a higher data
throughput per slot [3].
In GSM, a fixed number of radio carriers are allocated in each base station. Precisely, the
central frequencies of the carriers are positioned every 200 kHz within the system frequency
band (FDMA aspect). Each carrier is divided into time frames of duration 60/13 ms and again
each time frame is divided into 8 parts along the time axis called slots (TDMA aspect). A
traffic channel has a single slot in every time frame (or 60/13 ms). In a given base station the
number of traffic channels is limited. In the existing GSM system, free traffic channels are
given to a circuit-mode voice call on a reserved basis for the whole conversation period on a
one traffic channel for one voice call basis. A voice call is blocked when all traffic channels
in a base station are occupied.
A talker of a voice call does not talk continuously. The slots of a traffic channel are occupied when the talker is active and unoccupied (gaps) when the talker is silent. The circuit
mode voice calls (with a given blocking probability in a base station) keep some unused traffic
channel(s) and the dynamic silence gap(s) and thus waste some radio resources. The packet-
Gn
exp(G) ,
n!
(2)
where G is the average aggregate traffic (1st time call arrival and a certain number of
retransmissions arrival) generation rate from all active calls per access slot.
Therefore, the unconditional probability of successful capture of an access test packet is
PC (Su) =
I (n)PC (Su/n)
(3)
n=0
(4)
8
1 1 exp G
,
(5)
S = [1 {1 PC (Su)} ] =
x
x
1+z
where the relation between the new packet arrival rate per random access slot /x and the
aggregate arrival rate in each access slot G is
z
G exp G
1+z
(6)
/x =
8 .
z
1 1 exp G
1+z
[1 {1 exp(G)}8 ] ,
x
(8)
where /x is the call (new packet) arrival rate per random access slot and the aggregate packet
arrival rate per slot Gis related to
/x =
G exp(G)
.
1 {1 exp(G)}8
(9)
As a matter of fact, Equation (9) is the fundamental relationship between the aggregate
packet generation rate G and the average call arrival rate/slot /x.
Figure 2. Random access throughput per slot S vs. average call arrival rate for different values of capture ratio
z and number of slots x: (a) Number of slots x equal to one. (b) System without capture.
Figure 3. The optimum number of random access slots x for different capture ratios.
1 k 8.
(10)
Obviously, Equation (10) is not the absolute geometric distribution for the access attempt
k (1 k 8). Therefore, the modified distribution is
Qk =
k=1
Qk 8
Qk
Qk
k=1
{1 P (Su)}k1 P (Su)
.
1 {1 P (Su)}8
(11)
8
kQk =
k=1
8
P (Su)
k{1 P (Su)}k1
1 {1 P (Su)}8 k=1
D =
(12)
where the relationship between aggregate packet arrival rate G per time slot and average call
arrival rate /x per time slot can be obtained from Equation (6).
The average number of transmissions without capture is obtained from Equation (12) using
z
Dno capture =
(13)
where the relation between /x and G is shown in Equation (9). The average number of
transmissions of an access packet for a successful call arrival is depicted in Figure 4. Note that
the formula includes only the successful call arrival (packets), but not those packets that are
finally rejected.
3.3. C ALL R EJECTION P ROBABILITY
Another interesting parameter in the random access channels is the call rejection probability.
It defines the probability that an access packet is rejected. If an access packet is rejected,
a mobile terminal cannot inform the network of its desire for service. For this reason, the
network or base station cannot inform the mobile terminal of its access failure. This parameter
can be calculated in the following way. The probability that an access packet is successfully
transmitted after the first transmission is P (Su). The probability of failure after the first
transmission is {1 P (Su)}. The failure probability in each transmission time is assumed
to be independent in nature. Since the transmission takes place 8 times (maximum limit), the
call rejection probability is
8
z
.
(14)
R = 1 exp G
1+z
The numerical representation of the call rejection probability is shown in Figure 5.
4. Fractional Channel Occupied Voice Transmission System
Consider only voice calls in a base station, where a voice call uses the random access channels to inform the network that it needs a traffic channel for speech burst transmission. The
Figure 4. Average number of transmissions needed for a successful call arrival: (a) Number of access slots x = 1.
(b) System without capture.
Figure 5. Call rejection probability: (a) Number of access slots x = 1. (b) System without capture.
(15)
i=0
Therefore, there are m talkers in that network. It is well known that a talker does not talk
continuously. Talker activity can be modeled with a two state Markov model. Let the slot
duration be sec. The talk spurts are assumed to be exponentially distributed with mean 1/
and the distribution is = exp( ). The transition probability from a talk spurt to the next
silence period is 2 = 1 = 1 exp( ). The silence periods are also assumed to be
exponentially distributed with mean 1/ and the distribution is = exp( ). The transition
from a silence period to the next talk spurt is 2 = 1 = 1exp( ) [26]. It can be shown
that a multiple number of exponential voice calls can be modeled as a binomial distribution
[27].
Assume that the speech active states and silence states of each voice call are uncorrelated
over the GSM slot periods. Defining the states as the situation, where m traffic channels are
used for speech transmission, i of these in the speech active state and (m i) in the silence
state, whereby the probability of that can be expressed as [27]
m
(2 /2 )i
i
p(i|m) = m
m
(2 /2 )j
(16)
j
j =0
m
=
a i (1 a)mi ,
i
where a is the voice traffic activity factor and given by
a=
2
.
2 + 2
(17)
Considering the voice activity factor, the probability that i traffic channels are occupied by
all M voice calls can be written as
p(i) =
M
m=i
p(i|m)p(m)
(18)
(19)
where p(M) is the probability that a voice call is blocked because of traffic channel saturation
and is given by:
p(M) =
(20)
(Sv x/v )i / i!
i=0
The traffic channel utilization with the variation of average call arrival rate is shown in
Figure 6. Figure 6(a) shows that the channel utilization increases linearly up to a certain limit
of the call arrival rate and later on decreases drastically. The steepness of the linearly increasing curve is proportional to the average channel holding time 1/v . Figure 6(b) illustrates
that by increasing the number of random access slots x, one can augment the transition point
of the average call arrival rate (where channel utilization decreases abruptly). On one hand,
the increased number of random access slots decreases the call rejection probability and the
channel utilization can achieve its saturation level (Figure 6(b)). On the other hand, the call
blocking probability also increases as shown in Figure 7(b).
5. Multislot GPRS Transmission System
Consider a base station where only the GPRS data calls are present. The call arrival at that
base station has a negative exponential distribution with mean D . The base station allocates
y random access slots for GPRS calls. If the output of each random access slot is Sd , then the
average GPRS call arrival rate to the traffic channels is Sd y. Assume that the data transmission
time of each GPRS call is independent and exponentially distributed with a mean 1/D . If a
maximum of D GPRS calls are allowed to transmit multislot GPRS calls then the probability
that n GPRS calls are in that base station is
p(n) =
(21)
i=0
A GPRS call can occupy a maximum of 8 slots in a time frame and the number of slots
occupied in the next time frames can be changed dynamically. Consider the general analytical
case where one GPRS call can occupy a maximum of q (practically 8) slots. Therefore, n
data calls occupy a maximum of nq slots within a time frame duration. Assume that the
occupation of each slot is independent of each other and the probability of occupying a slot is
b. Consequently, the probability that n GPRS calls occupy k slots is given by
nq
(22)
p(k|n) =
bk (1 b)nqk .
k
Figure 6. Traffic channel utilization vs. average call arrival rate. (a) For different call holding times 1/. (b) For
different numbers of random access slots x.
Figure 7. Call blocking probability versus average call arrival rate: (a) For different call holding times 1/. (b)
For different numbers of random access slots x.
p(k) =
p(k|n)p(n)
(23)
n=k/q
D
(24)
k=0
where p(D) defines the probability that the maximum number of data calls are in the network
and can be written from Equation (21) as
p(D) =
(25)
i=0
The discontinuous multislot occupied GPRS calls show the similar result to that of discontinuous single slot occupied voice calls. The average channel occupied by the multislot GPRS
calls as in Equation (24) is q times larger than that of single slot occupied voice calls (i.e.,
Equation (19)). The channel occupation probabilities for discontinuous voice and GPRS calls
are already defined as a and b, respectively. Therefore, the numerical results of discontinuous
multislot occupied GPRS calls resemble the discontinuous single slot occupied voice calls.
6. Call Success Probability
The following derivation is based on call rejection probability, which is important in the
random access channel analysis and on blocking probability which is important when analyzing the traffic channel performance. Considering that a call is rejected in the random access
channels with a probability R, the input probability of the traffic channels is (1 R). A call
is blocked in the traffic channels with a probability B. Therefore, the probability that a call is
successfully transferred (neither rejected nor blocked) is given by
T = (1 R)(1 B) .
(26)
A numerical representation of Equation (26) is depicted in Figure 8 for a few sets of specific
values of different parameters that constitute two separate regions:
1. If < x(1 + 1/z)e1 {1 (1 e1 )8 }1 :
(a) The call rejection probability is almost zero.
(b) The call blocking probability increases linearly and thus the call success probability
decreases linearly. The steepness of these two curves is proportional to the average
traffic channel holding time 1/, and inversely proportional to the number of traffic
channel M.
2. If x(1 + 1/z)e1 {1 (1 e1 )8 }1 :
(a) The call rejection probability increases abruptly. Thus, most of the calls are rejected
in the random access channels.
(b) The arrivals to the traffic channels decreases and thus the call blocking probability
also decreases.
(c) The overall call success probability T , declines abruptly because of a sharp increase
in call rejection probability R.
Finally, it must be emphasized that the overall call success probability can definitely be
calculated using the traditional Erlang formula if and only if the number of random access
slots is more than e{1 (1 e1 )8 }(1 + 1/z)1
.
7. Conclusions
We have derived a closed form expression to compute the optimum number of random access
slots. The transfer probability (inverse of rejection probability) of the random access channels
depends on the number of random access slots. A capture effect is inserted in the random
access scheme. The required number of random access slots is directly proportional to the
average call arrival rate. This can be reduced by an increase of the capture effect (capture
effect increases with the decrease of capture ratio z and a receiver works without capture if the
value of z tends to infinity). The number of random access slots is proportional to (1 + 1/z)1 .
The anticipated number of random access slots x is obtained by adjusting the optimum
aggregate traffic generation rate per time slot G (Equation (7)). The reasons are as follows.
The retransmission cut-off is strongly recommended for the stable operation of random access
if the average call arrival rate per time slot /x, is more than (1 + 1/z)e1 , otherwise throughput decreases abruptly [16]. This transition point is obtained from the optimum aggregate
12.
13.
P. Chaudhury, W. Mohr and S. Onoe, The 3GPP Proposal for IMT-2000, IEEE Communications Magazine,
Vol. 37, No. 12, pp. 7281, 1999.
W. Mohr, Development of Mobile Communications Systems Beyond Third Generation, Wireless Personal
Communications, Vol. 17, Nos. 23, pp. 191207, 2001.
S. Nanda, K. Balachandran and S. Kumar, Adaptation Techniques in Wireless Packet Data Services, IEEE
Communications Magazine, Vol. 38, No. 1, pp. 5464, 2000.
S. Faccin, Hsu. Liangchi, R. Koodli, Le. Khiem and R. Purnadi, GPRS and IS-136 Integration for Flexible
Network and Services Evolution, IEEE Personal Communications, Vol. 6, No. 3, pp. 4854, 1999.
C. Jain and D.J. Goodman, General Packet Radio Service in GSM, IEEE Communications Magazine,
Vol. 35, No. 10, pp. 122131, 1997.
G. Brasche and B. Walke, Concepts, Services, and Protocols of the New GSM Phase 2+ General Packet
Radio Service, IEEE Communications Magazine, Vol. 35, No. 8, pp. 94104, 1997.
J.H. Sarker and S.J. Halme, Efficiency of the GSM-GPRS Air Interface for Real-Time IP Traffic Flows With
and Without Packet Dropping, Wireless Personal Communications, Vol. 21, No. 1, pp. 125140, 2002.
C.-C. Lee and R. Steele, Signal-to-Interference Calculations for Modern TDMA Cellular Communication
Systems, IEE Proceedings- Communications, Vol. 142, No. 1, pp. 2130, 1995.
GSM 02.34, V5.1.0, Digital Cellular Telecommunication System (Phase 2+); High Speed Circuit Switched
Data (HSCSD)-Stage 1, March 1997.
J. Dunlop, Potential for Compressed Video Transmission over the GSM HSCSD Service, Electronics
Letters, Vol. 33, No. 2, pp. 121122, 1997.
J.H. Sarker, S.H. Halme and M. Rinne, Performance Analysis of GSM Traffic Channel Capacity With(out)
High Speed Circuit Switched Data, in IEEE VTC2000 Fall, Boston, U.S.A., Sept. 2428, 2000, pp. 1603
1609.
S.W. Kim, Frequency-Hopped Speed-Spectrum Random Access with Retransmission Cutoff and Code Rate
Adjustment, IEEE Journal of Selected Areas in Communications, Vol. 10, No. 2, pp. 344349, 1992.
K. Sakakibara, H. Muta and Y. Yuba, The Effect of Limiting the Number of Retransmission Trials on
the Stability of Slotted ALOHA Systems, IEEE Transactions on Vehicular Technology, Vol. 47, No. 4,
pp. 14491453, 2000.
16.
17.
18.
19.
20.
21.
22.
23.
24.
25.
26.
27.
C. Luders and R. Haferbeck, The Performance of the GSM Random Access Procedure, in IEEE 44th Veh.
Tech. Conf. 94 (VTC 94), Stockholm, Sweden, June 810, 1994, pp. 11651169.
J.H. Sarker and S.J. Halme, The Prudence Transmission Method I (PTM I): A Retransmission Cut-Off
Method for Contention Based Multiple-Access Communication Systems, in IEEE 47th Veh. Tech. Conf. 97
(VTC 97), Phoenix, AZ, U.S.A., May 47, 1997, pp. 397401.
J.H. Sarker and S.J. Halme, An Optimum Retransmission Cut-Off Scheme for Slotted ALOHA, Wireless
Personal Communications, Vol. 13, Nos. 12, pp. 185202, 2000.
GSM 02.60, Digital Cellular Telecommunications System (Phase 2+); General Packet Radio Service
(GPRS); Service Description; Stage 1, ETSI.
M. Pecen and A. Howell, Simultaneous Voice and Data Operation for GPRS/EDGE: Class A Dual Transfer
Mode, IEEE Personal Communications, Vol. 8, No. 2, pp. 1429, 2001.
M. Mouly and M.-B. Pautet, The GSM System for Mobile Communications, published by authors, 1992.
H. Takagi and L. Kleinrock, Output Process in Contention Packet Broadcasting Systems, IEEE Transactions on Communications, Vol. COM-33, No. 11, pp. 11911199, 1985.
J.C. Arnbak and van Blitterswijk, Capacity of Slotted ALOHA in Rayleigh-Fading Channels, IEEE
Journal of Selected Area on Communications, pp. 261269, 1987.
ETSI-GSM Technical Specification, GSM 04.08, Version 4.4.0, Mobile Radio Interface-Layer 3 Specification, April 1993.
ETSI EN 300 940, GSM 04.08 Version 7.1.2, Digital Cellular Telecommunications System (Phase 2+);
Mobile Radio Interface Layer 3 Specification, 1998.
ETSI-GSM Technical Specification, GSM 05.02, Version 4.2.0, Physical Layer on the Radio Path,
Multiplexing and Multiple Access on the Radio Path, April 1993.
EN 300 908, GSM 05.02 Version 6.4.1, Digital Cellular Telecommunications System (Phase 2+);
Multiplexing and Multiple Access on the Radio Path, 1997.
S. Nanda, Stability Evaluation and Design of the PRMA Joint Voice Data System, IEEE Transactions on
Communications, Vol. 42, No. 5, pp. 20922104, 1994.
J.H. Sarker, Voice and Data Transmission over the TDMA Based Networks, Masters thesis, Helsinki
University of Technology, Finland, 1996.
U =
ip(i)
i=0
M
M
M
1
i
p(i/m)p(m)
=
M i=1 m=i
M
M
1 (Sv x/v )m /m!
m
a i (1 a)mi
i
M
i
M i=1 m=i
(Sv x/v )m /m!
m=0
(m 1)!
(Sv x/v )m1
M
M
(Sv x/v )a
(m 1)!
(m i)!(i 1)! i1
a (1 a)mi .
=
M
M
1
i=1 m=i
(Sv x/v )m /m!
m=0
(Sv x/v )a
M
M1
M1
i=0 m =i
m !
(Sv x/v )m
(m i)!i! i
m !
a (1 a)m i
M
1
(Sv x/v )m /m!
m=0
m !
)m
(Sv x/v )a
=
M
)M
(Sv x/v
(Sv x/v
M M
i)!i!
(m
m!
M!
a i (1 a)m i
M
M
1
(Sv x/v )k
i=0 m =i
(Sv x/v )m /m!
k!
m=0
k=0
The first term inside the third bracket is equal to 1 and the second term is call blocking
probability as in Equation (20). Thus,
U=
(Sv x/v )a
[1 p(M)] .
M
The average number of channel occupied by all D numbers of GPRS data calls is
UD =
Dq
kp(k)
k=0
Dq
D
p(k|n)p(n)
k=1
n=k/q
Dq
D
k=1
D
n=k/q
nq
k
bk (1 b)nqk
n=0
q(nq 1)!
(Sd y/d )n
(nq k)!(k 1)! k
(n 1)!
b (1 b)nqq .
=
D
1
k=1 n=k/q
(Sd y/d )n /n!
Dq
D
n=0
(D1)q
k=0
(n q)!
(Sd y/d )n
(n q k)!k! k
n !
b (1 b)n qk
D
1
n =k/q
(Sd y/d )n /n!
D1
n=0
n
(n q)!
(Sd y/d )
(Sd y/d )D
Dq
D
(n q k)!k! k
n!
D!
b (1 b)n qk
= (Sd y/d )bq
D
D
1
n
(Sd y/d )
k=0 n =k/q
n
(Sd y/d ) /n!
n!
n=0
n=0
The first term inside the third bracket is equal to 1 and the second term is the GPRS call
blocking probability given in Equation (25). Therefore,
UD = (Sd y/d )bq[1 p(D)] .
Jahangir H. Sarker received B.Sc. degree in electrical and electronics engineering from
Bangladesh University of Engineering and Technology, Dhaka, Bangladesh, in 1991, and
M.Tech. and Licentiate Tech. degrees in electrical and communication engineering from
Helsinki University of Technology, Finland in 1996 and 2000 respectively.
From July 1994 to September 1996, he was a research assistant in communication laboratory of Helsinki University of Technology. Since October 1996, he is serving as a research
scientist in communication laboratory of Helsinki University of Technology. Mr. Sarker received Qualcomm Inc., research award in 1997, for his contribution to the IEEE International
Conference on Personal Wireless Communications (ICPWC97). His research interests include packet access, radio resource allocation, and queueing theory. He is a member of
IEEE.
Seppo J. Halme was born in Ruokolahti, Finland, on May 17, 1938. He received the degree
of Diploma Engineer (Honors) in 1962, and the degree of Licentiate in Engineering in 1966,
both in electrical engineering, from the Helsinki University of Technology, Helsinki, Finland,
and the Ph.D. degree in communications from the Massachusetts Institute of Technology,
Cambridge, in 1970.
He was nominated assistant professor in 1970 and professor of communication engineering in 1972. He has also served as dean of Electrical Engineering Department in Helsinki
University of Technology. Dr. Halme has published over 500 scientific articles, reports, and
books.