Fall 2014 Computer Communication Networks

HW#6_sol (Due date: 2014/11/14)

Question 1:
Consider the CRC-8 polynomial, answer the following questions:
a. Does it detect a single error? Defend your answer.
b. Does it detect a burst error of size 6? Defend your answer.
c. What is the probability of detecting a burst error of size 9?
d. What is the probability of detecting a burst error of size 15?
CRC-8 generator is x8 + x2 + x + 1.
a. It has more than one term and the coefficient of x0 is 1. It can detect
a single-bit error.
b. The polynomial is of degree 8, which means that the number of
checkbits (remainder) r = 8. It will detect all burst errors of size 8 or
less.
c. Burst errors of size 9 are detected most of the time, but they slip by
with probability (1/2)r1 or (1/2)81 0.008. This means 8 out of 1000
burst errors of size 9 are left undetected.
d. Burst errors of size 15 are detected most of the time, but they slip by
with probability (1/2)r or (1/2)8 0.004. This means 4 out of 1000
burst errors of size 15 are left undetected.
Question 2:
A system uses the Stop-and-Wait ARQ Protocol. If each packet carries
1000 bits of data, how long does it take to send 1 million bits of data if
the distance between the sender and receiver is 5000 Km and the
propagation speed is 2 108 m/s? Ignore transmission, waiting, and
processing delays. We assume no data or control frame is lost or
damaged.
We need to send 1000 frames. We ignore the overhead due to the
header and trailer.
Data frame trip time = 5000 km / 200,000 km = 25 ms
ACK trip time = 5000 km / 200,000 km = 25 ms
Delay for 1 frame = 25 + 25 = 50 ms.
Total delay = 1000 50 = 50 s

Question 3:
What is the Hamming distance for each of the following cases:
a. d (10000, 00000)
b. d (10101, 10000)
c. d (11111, 11111)
d. d (000, 000)
a. d (10000, 00000) = 1
b. d (10101, 10000) = 2
c. d (1111, 1111) = 0
d. d (000, 000) = 0
Comment: Part c and d show that the distance between a codeword and
itself is 0.