Question

Yet another variation: A better packet switched network employs the concept of acknowledgment. When the end user’s device receives a packet correctly it sends an acknowledgment to the sender. Here too, a packet is received correctly with probability p, but the sender keeps sending copies of a given packet until a copy is correctly received (signaled by acknowledgment). Let random variable N be the number of times the same message packet is sent. a) Find the PMF PN (n).

Answer 1

Answer:

P(N = n) = $(1-P)^{n-1} \times P$  

Step-by-step explanation:

to find out

Find the PMF PN (n)

solution

PN (n)

here N is random variable

and n is the number of times

so here N random variable is denote by the same package that is N (P)

so here

probability of N is

P(N ) = Ф ( N = n)          ..................  1

here n is = 1, 2,3, 4,...................... and so on

so that here P(N = n) will be

P(N = n) = $(1-P)^{n-1} \times P$