You are on page 1of 3

Communication Technology Laboratory Wireless Communication Group Eidgenssische Technische Hochschule Zrich Swiss Federal Institute of Technology Zurich

Prof. Dr.-Ing. A. Wittneben

Communication Systems Solutions Problem Set 12


Problem 12.1 (Tanenbaum Problem 4.5)
Measurements of a slotted ALOHA channel with an innite number of users show that 10 percent of the slots are idle. It is assumed that the probability of generating L frames in a given time interval corresponds to a Poisson distribution. 1. What is the trafc load, G? 2. What is the throughput? 3. Is the channel underloaded or overloaded?

Solution
1. 10% of all slots are idle = P0 = 10% eG = 0.1 = G = ln 0.1 G = 2.3 2. Throughput in a slotted ALOHA system: S = GeG = S = 2.3e2.3 S = 0.23 3. Since G is larger than 1 the channel is overloaded. In general if G < 1 the network is underloaded and there are too many unused slots and if G > 1 the network is overloaded and there are too many collisions.

Problem 12.2 (Tanenbaum Problem 4.4)


A large population of slotted ALOHA users manages to generate 50 frames/sec, including both originals and retransmissions. Time is slotted in units of 40 msec. It is assumed that the probability of generating L frames in a given time interval corresponds to a Poisson distribution. 1. What is the chance of a successful transmission on the rst attempt? 2. What is the probability of exactly k collisions and then a successful transmission? 3. How often must a user retransmit a frame on average, such that the frame is delivered without collision?

Solution
1. G = g D = G = 50 40 103 = 2 requests per time slot Probability of Success: Psuc = P r[k = 0 | D] = eG , Psuc = 0.1353 2. Pk : probability of exactly k collisions and then a success Pk = (1 eG )k eG = P = 0.8647k 0.1353
Date: December 16, 2010

3. Average number of retransmission:


E [k ] =
k=1

kPk =
k=1

keG (1 eG )k

= eG (1 eG )
k=1

k (1 eG )k1

We know:

i = 1/(1 ) for all || < 1


i=0

1+
i=1

(i ) = 1/(1 )
i=1

(i ) = /(1 )

Derivative with respect to :

(ii1 ) = 1/(1 )2
i=1

The substitution = 1 eG yields E [k ] = eG (1 eG ) = 6.3891. (1)

Problem 12.3 (Tanenbaum Problem 4.1)


A group of N stations shares a 56-kbps ALOHA channel. Each station outputs a 1000-bit frame on an average of once every 100 sec. Assuming that the system can achieve its maximum throughput what maximum number of stations can be supported?

Solution
As each frame consists of 1000 bit and each station generates one frame every 100 sec, each station will require a data rate r of: r = 1000/100 = 10 bps In a pure ALOHA network: Smax = 1/(2e) = 0.1839 The maximum data rate in the system will be: R = 0.1839 56 = 10.2984 kbps Maximum number of users which can be supported is: N = R/r = 1029.84 1030

Problem 12.4
Consider a pure ALOHA system with a large number of stations. The transmission data rate over the channel is R = 10 Mbps. Assume frames of size 1000 bits and a Poisson arrival rate of g = 2500 frames per second. 1. Calculate the throughput S in [frames per frame duration] and in [bps].

2. How large should the frame size be to obtain the maximum throughput achievable by pure ALOHA for the same data rate R and the same g as before? 3. What is the required frame size to obtain the same throughput as in 2. with slotted ALOHA? R and g have the same values as before.

Solution
1. G = g D = G = 2500 1000/(10 106 ) = 0.25 S = Ge2G S = 0.25e0.5 = 0.1516 frame per frame duration = r = 0.1516 10 106 = 1.516M bps 2. G = 0.5 = (x/(10 106 )) 2500 = 0.5 = x = 2000bits 3. SSlottedALOHA = SALOHA = 0.1839 = G = 0.2319 (x/(10 106 )) 2500 = 0.2319 = x = 927.6 928bits

You might also like