p³(1 − p)−3 k₁< k2 < k3; [p³ - Pk(k) = k₁ € {1,2...}, otherwise.

A First Course in Probability (10th Edition)
10th Edition
ISBN:9780134753119
Author:Sheldon Ross
Publisher:Sheldon Ross
Chapter1: Combinatorial Analysis
Section: Chapter Questions
Problem 1.1P: a. How many different 7-place license plates are possible if the first 2 places are for letters and...
icon
Related questions
Question
100%
A wireless data terminal has three messages waiting for transmission. After sending a message, it expects an acknowledgement from the receiver. When it receives the acknowledgment, it transmits the next message. If the acknowledgment does not arrive, it sends the message again. The possibility of successful transmission of a message is 'p' independent of other transmissions. Let K = [K1 K2 K3]^T be the three dimensional random vector in which Ki the phone ring is the total number of transmissions when a message i is received successfully. The PMF for the number of transmissions when message i is received successfully is below. Let J3 = K3-K2, the number of transmissions of message 3; J2 =K2-K1, the number of transmissions of message 2; and J1 = K1, the number of transmissions of message one. Derive a formula for PJ(j), the PMF of the number of transmissions of individual messages.
p³(1 − p)−3 k₁< k2 < k3;
[p³ -
Pk(k) =
k₁ € {1,2...},
otherwise.
Transcribed Image Text:p³(1 − p)−3 k₁< k2 < k3; [p³ - Pk(k) = k₁ € {1,2...}, otherwise.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps with 1 images

Blurred answer
Recommended textbooks for you
A First Course in Probability (10th Edition)
A First Course in Probability (10th Edition)
Probability
ISBN:
9780134753119
Author:
Sheldon Ross
Publisher:
PEARSON
A First Course in Probability
A First Course in Probability
Probability
ISBN:
9780321794772
Author:
Sheldon Ross
Publisher:
PEARSON