Problem 2.126 Suppose that in Example 2.43, computer A sends each message to com

Question

Problem 2.126 Suppose that in Example 2.43, computer A sends each message to computer B simultaneously over two unreliable radio links. Computer B can detect when errors have occurred in either link. Let the probability of message transmission error in link 1 and link 2 be q1 and q2 respectively. Computer B requests retransmissions until it receives an error-free message on either link. (a) Find the probability that more than k transmissions are required. (b) Find the probability that in the last transmission, the message on link 2 is received free of errors.

Explanation / Answer

Computer A sends a message to the computer B over the unreliable radio link.

The message is encoded so that B can always detact whenever errors have been introduced into the message during transmission.

So solution for :

(a) P[{m > k}] = (q1 q2)k

(b) P[b is error free] = (1- q2)

                               1- Q1 q2

Hope it helps.

Related Questions

Navigate

• Browse (All)
• Browse P
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.