Scribd
Upload
13 views55 pages

Moduel 2

The document discusses various topics related to physical layer and data link layer communication protocols: - It describes different types of transmission media including twisted pair cables, coaxial cables, fiber optic cables, and unguided transmission media like radio waves, infrared, and microwaves. - For the data link layer, it covers error detection and correction codes, elementary data link protocols like stop-and-wait and sliding window, framing, and flow control. - It also discusses medium access control issues and protocols like ALOHA, CSMA, CSMA/CD, and dynamic channel allocation for handling channel access problems in wireless networks.

Uploaded by

The Creators
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
13 views55 pages

Moduel 2

The document discusses various topics related to physical layer and data link layer communication protocols: - It describes different types of transmission media including twisted pair cables, coaxial cables, fiber optic cables, and unguided transmission media like radio waves, infrared, and microwaves. - For the data link layer, it covers error detection and correction codes, elementary data link protocols like stop-and-wait and sliding window, framing, and flow control. - It also discusses medium access control issues and protocols like ALOHA, CSMA, CSMA/CD, and dynamic channel allocation for handling channel access problems in wireless networks.

Uploaded by

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

Module 2

2 Physical Layer

2.1 Introduction to Communication


Electromagnetic Spectrum
2.2 Guided Transmission Media: Twisted
pair, Coaxial, Fiber optics.
• Guided Media and
• Unguided media

Guided Media-Twisted Pair Cable


Coaxial Cable
Fiber Optic cable
Unguided Media-Radio Waves
Infrared
Microwaves
Twisted Pair Cable

Unshielded TPC
Sheilded TPC
Coaxial Cable
Fibre Optic Cable
Data Link Layer
DLL Design Issues- Services, Framing, Error Control, Flow Control

Error Detection and Correction(Hamming Code, CRC, Checksum)

Elementary Data Link protocols

Stop and Wait

Sliding Window(Go Back N, Selective Repeat)


Figure. Relationship between packets and frames
Services
Framing
Error Control
Flow Control
Types of Services offered by Data Link Layer

1. Unacknowledge Connectionless Service


2. Acknowledge Connectionless Service
3. Acknowledge Connection Oriented Service
Acknowledge Connectionless Service
Framing
Methods
1. Byte count/Character count.
2. Flag bytes with byte stuffing.
3. Flag bits with bit Stuffing.
4. Physical layer coding violations.
•a

•b

Figure. A character stream. (a) Without errors. (b) With


one error.
Figure. (a) A frame delimited by flag bytes. (b) Four examples of byte
sequences before and after byte stuffing.
Figure. Bit stuffing
Error Control
Flow Control
Error correcting Code
• Hamming Code
Binary Convolutional Code
Memory-Previous
-1V(Viterbi)-Logical 0 level
+1V-Logical 1 level

0.9V-1
-0.1-0
Soft Decision decoding-uncertinaty
Hard Decision decoding-Decided
Reed Solomon Code
• Polynomial(2‸m-1)
n+1
• Convolutional code
• Upto 255 bytes
Low Density Parity Check
Matrix Represention
Error Detection Code

• Parity
• CheckSums
• Cyclic Redundancy Check
Cyclic Redundancy Check
The algorithm for computing the checksum is as
follows:
1. Let r be the degree of G(x). Append r zero bits to
the low-order end of the frame so it now contains
m + r bits and corresponds to the polynomial
xrM(x).
2. Divide the bit string corresponding to G(x) into
the bit string corresponding to xrM(x), using
modulo 2 division.
3. Subtract the remainder (which is always r or
fewer bits) from the bit string corresponding to
xrM(x) using modulo 2 subtraction. The result is
the checksummed frame to be transmitted. Call
its polynomial T(x).
Elementary Data Link protocols
• Stop and Wait
• Sliding Window
* Go Back N
*Selective Repeat
•Elementary Protocol
•Noiseless Channel
•Simplex Protocol

•Stop and Wait

•Noisy Channel
•Sliding Window
•Go Back N
•Selective Repeat

Figure.Data Link Layer Elementary Protocol


(Utopian) Simplex Protocol
• One direction
• Always ready for sending and receiving data
• Processing time ignored
• Infinite number of space is available
• No error
Stop and Wait Protocol
• One direction, but bidirectional line
• Finite space is available in buffer
• Sender sends one frame and then waits for
acknowledgement.
• Drawback
- Data Loss
- Acknowledgement Loss.
Stop and Wait Protocol for Noisy
Channel( ARQ/PAR)
• One direction
• Finite processing capacity and speed at the
receiver
• Error in frame and ACK is expected
• Every frame has unique frame number
• Timer is used
Simplex Protocol
Sender Receiver
Stop and Wait Protocol
Sender Receiver
Stop and Wait Protocol( ARQ/PAR)
Sender Receiver
Go back N(ARQ)
Selective Repeat ARQ
Medium Access Control sublayer
• Channel Allocation problem
• Multiple access Protocol( Aloha, Carrier Sense
Multiple Access (CSMA/CD)
Channel Allocation problem

• Static Channel Allocation


• Dynamic Channel Allocation
Dynamic Channel Allocation

• Assumptions for Dynamic Channel Allocation


- Independent Traffic
-Single Channel
-Observable Collision
-Continuous or Slotted Time
-Carrier Sense or No Carrier sense
Random Access Protocols

• The Random access protocols consist of the


following characteristics:
-no time restriction for sending the data
-fixed sequence of stations
• The Random-Access Protocol is further divided into
four categories
-ALOHA
-CSMA
-CSMA/CD
-CSMA/CA
•ALOHA
•Pure ALOHA
•Slotted ALOHA
Pure ALOHA

Figure.Pure ALOHA, frames are transmitted at completely arbitrary times


Pure ALOHA

Figure. Pure ALOHA


Figure. Vulnerable period for the Frame

The maximum throughput occurs at G = 0.5, with


S = 1/2e, which is about 0.184
Slotted Aloha

Figure. Slotted ALOHA


CSMA(Carrier Sense Multiple Access)
Versions of the carrier sense protocols are as
follows:
• 1-persistent CSMA
• Non persistent CSMA
• p-persistent CSMA
CSMA
• Sense before Transmit ”listen before Talk”
1-persistent

• Continiously sense the channel


• The station transmits with a probability of 1
when it finds the channel idle.
Non Persistent CSMA
• The station does not continually sense.
• Detecting the end of the previous
transmission.
• It waits for a random period of time.
p-persistent CSMA
• It applies to slotted channels
CSMA/CD(Carrier Sense Multiple Access/Collision
Detection)

Figure.CSMA/CD can be in one of three states: contention, transmission, or idle.


CSMA/CA(Carrier Sense Multiple
Access/Collision Avoidance)

You might also like