Question: Problem 2 [ 2 0 points ] A terminal ( A ) wants to transmit ( N ) frames of length

Problem 2[20 points]
A terminal \( A \) wants to transmit \( N \) frames of length \( P \) bits per frame, to a terminal \( B \) via a direct link. The link corrupts each frame independently with probability \( q \). Terminal \( A \) can choose between two strategies for the transmission of the \( N \) frames: (1) apply an error correcting code that will increase the length of each frame from \( P \) to \( P+C \), where \( C>0\), but guarantee that corrupted frames can be recovered at \( B \), or (2) keep the frame length equal to \( P \) and retransmit the corrupted frame.
(a)[5 points]: Calculate the delay for successfully receiving the \( N \) frames at \( B \) using the first strategy. Ignore the propagation delay and any delay in transmitting ACKs (instant feedback).
(b)[\(\mathbf{5}\) points]: Calculate the average delay for successfully receiving the \( N \) frames at \( B \) using the second strategy. You can find this average by looking at the average number of attempts per packet for successful reception. Ignore the propagation delay and any delay in transmitting ACKs (instant feedback).
(c)[5 points]: For what probability value \( q \), does strategy (2) incur the same average delay as strategy (1)?
(d)[5 points]: Sketch \( q \) as a function of \( C \) for a range of \( C \) from 0 to \(\infty \) and label the areas of \( q \) for which strategy (1) is preferred to strategy (2). You do not need an exact plot, just an approximate sketch and some sample values and lines drawn between them (e.g. at \( C=0, C=1\), and \( q \rightarrow \infty)\).
Problem 2 [ 2 0 points ] A terminal \ ( A \ )

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Programming Questions!