UCLA Electrical Engineering Department
EE132B
HW Set #8
Professor Izhak Rubin
Problem 1
Consider a communication system which queues arriving messages and then transmits them on a first
come first served basis across a single outing link.
Messages arrive
UCLA Electrical Engineering Department
EE132B
HW Set #6
Professor Izhak Rubin
Problem 1
Consider a Markov chain X = cfw_Xk, k = 0,1, with state space S = cfw_a, b, c and the transition matrix
as follows:
1
2
2
P=
3
3
5
1
4
0
2
5
1
4
1
.
3
0
Compute
1. ste
UCLA Electrical Engineering Department
EE132B
HW Set #5
Professor Izhak Rubin
Problem 1
Consider a selective-repeat ARQ in which the window size N is equal to 4. Assume that the originating
node wishes to transmit 10 data frames which are labeled D1, D2,
UCLA Electrical Engineering Department
EE132B
HW Set #4
Professor Izhak Rubin
Problem 1
Consider a ARQ stop-and-wait communication session between to stations A and B.
1. If station A intends to transmit a single data frame, what is the average number of
UCLA Electrical Engineering Department
EE132B
HW Set #3
Professor Izhak Rubin
Problem 1
Consider a broadcasting bus system. Attaching to the bus are N stations, and they share the channel
under pure ALOHA scheme. Suppose that the transmission rate is R (b
UCLA Electrical Engineering Department
EE132B
HW Set #2
Professor Izhak Rubin
Problem 1
For the Gaussian distribution with mean
and variance
2 , find the moment generating function.
Using the moment generating function, calculate the mean and the varianc
UCLA Electrical Engineering Department
EE132B
HW Set #1
Professor Izhak Rubin
Problem 1
Let X denote a geometric random variable with parameter
P ( X = n ) = p (1 p )
1 p ( 0,1) such that
n
for n = 0, 1,
1) Calculate the mean directly.
2) Calculate the va