Scribd
Upload
12 views18 pages

Unit 3

Computer Networks-3

Uploaded by

Aswathy V S
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
12 views18 pages

Unit 3

Computer Networks-3

Uploaded by

Aswathy V S
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 18

UNIT-3

Syllabus
• Data link layer: Error Detection and Correction,
• Framing, flow and error control,
• Protocols - Noiseless channels (Simplest, Stop and Wait) and
• Noisy channels (Stop and Wait and Piggy Backing).
• Multiple Access Protocols.
• Random Access-ALOHA, CSMA.
• Wired LANs-IEEE standards,
• wireless LANs-Bluetooth,
• Cellular Telephony
Types of Errors
• Data can be corrupted during transmission. Some applications require
that errors be detected and corrected.
• In a single-bit error, only 1 bit in the data unit has changed

• Burst Error The term burst error means that 2 or more bits in the data
unit have changed from 1 to 0 or from 0 to 1.
Detection Versus Correction

• The correction of errors is more difficult than the detection.

• In error detection, we are looking only to see if any error has occurred.

• The answer is a simple yes or no. We are not even interested in the
number of errors.

• In error correction, we need to know the exact number of bits that are
corrupted and more importantly, their location in the message
Redundancy
• The central concept in detecting or correcting errors is redundancy.

• Redundancy is achieved through various coding schemes.

• The sender adds redundant bits through a process that creates a relationship
between the redundant bits and the actual data bits.

• The receiver checks the relationships between the two sets of bits to detect or
correct the errors

• We can divide coding schemes into two broad categories: block coding and
convolution coding
Block Coding
• Since n > k, the number of
possible codewords is larger
than the number of possible
data words.
Example- 4B/5B block coding

• In this coding scheme, k =4 and n =5.

• That is 2k =16 data words and 2n =32 codewords.

• 16 out of 32 codewords are used for message transfer; the rest are
either used for other purposes or unused.
Error Detection- using block coding

• If the following two conditions are met, the receiver can detect a
change in the original codeword.

• 1. The receiver has (or can find) a list of valid codewords.

• 2. The original codeword has changed to an invalid one.


Error Correction

• In error correction, the receiver must find (or guess) the original codeword
sent.

• We can say that we need more redundant bits for error correction than for
error detection

• Example-Let us add more redundant bits to previous example ,if the receiver
can correct an error without knowing what was actually sent.

• We add 3 redundant bits to the 2-bit dataword to make 5-bit codewords


• Assume the dataword is 01. The sender uses an
algorithm to create the codeword 01011.
• The codeword is corrupted during transmission,
and 01001 is received (error in the second bit
from the right).
• First, the receiver finds that the received
codeword is not in the table.
• This means an error has occurred. (Detection
must come before correction.)
• The receiver, assuming that there is only 1 bit
corrupted, uses the following strategy to guess
the correct data word.
Hamming Distance
Minimum Hamming Distance

You might also like