Scribd
Upload
5 views

Computer Network Note-3 (5L)

Uploaded by

manab
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
5 views

Computer Network Note-3 (5L)

Uploaded by

manab
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/ 10

1.

Error Detection using Hamming Code:


This method corrects the error by finding the state at which the error has occurred.
For example If 7 bit Data transmits the required redundant bit will be 4 on the basis of following
formula.
• 2r > m + r + 1 Where m=No. of bits in Data word and r= No of redundant bit.
• 24> 7 + 4 + 1
Redundant bits add on following position on the basis power of 2 (i.e 20=1,21=2,22=4,23=8 )

• r1 : bits 1,3,5, 7, 9, 11 (r1 take the bits one after another)


• r2 : bits 2, 3, 6, 7, 10, 11 (r2 takes consecutive 2 bits and then 2 bits after 2 bits)
• r4 : bits 4, 5, 6, 7 (r4 takes 4 bits starting from r4)
• r8 : bits 8, 9, 10, 11 ( r8 takes 8 bits starting from r8)

For example If we want to transmit the data word 1001101. How we add the 4 redundant bits.

Data word =

Add r1=

Add r2 =

Add r4 =

Add r8=

Code Word
Sent Data = 1 0 0 1 1 1 0 0 1 0 1

Received data= 1 0 0 1 0 1 0 0 1 0 1

Error detection methods in receiver side :


• r1 : bits 1,3,5, 7, 9, 11
• r2 : bits 2, 3, 6, 7, 10, 11
• r4 : bits 4, 5, 6, 7
• r8 : bits 8, 9, 10, 11
2. Flow Control

Flow control occur when a data frame (Layer-2 data) is sent from one host to another over a single
medium, it is required that the sender and receiver should work at the same speed. That is, sender
sends at a speed on which the receiver can process and accept the data.

i. Stop and Wait (Normal Condition for Noise less channel)

ii. Stop and Wait ARQ (Automatic Repeat Requests) for Noise channel:
Lost ACK
Lost Frame

Delay ACK
iii. Go-Back-N ARQ

Normal Operation Go-Back-N ARQ


Lost ACK in Go-Back-N ARQ

3. Time Division Multiple Access

Suppose the channel supports N nodes and the transmission rate of the channel is R bps , TDM divides
time into time slot for N nodes. Each time slot is then assigned to one of the N nodes. Each node gets a
dedicated transmission rate of R/N bps during each frame time.

TDM

1 2 3 4 1 2 3 4 1 2 3 4

Time Slot Frame


i. Pure ALOHA

Systems in which multiple users share a common channel and pure ALOHA allows users to transmit
data whenever they want. Hence possibility of the collision occurred can be high. If collision occurs,
each station involved waits a random amount of time.

ii. Slotted ALOHA

Slotted ALOHA was invented to improve the efficiency of pure ALOHA as chances of collision in pure
ALOHA are very high. In slotted ALOHA, the time of the shared channel is divided into fixed intervals
slots. The stations can send a frame only at the beginning of the slot and only one frame is sent in each
slot. Here if any station is not able to place the frame onto the channel at the beginning of the slot, the
station has to wait until the beginning of the next time slot.
iii. Carrier Sense Multiple Access (CSMA)

Here if any station want to transmit the data to other station, it first listens to the channel to see if anyone
else is transmitting at that moment. If the channel is busy, the station waits until it become free. Here a
station detect the channel is idle or not, if idle it transmits a frame. If a collision occurs, the station waits a
random amount of time and starts all over again.

CSMA

In CSMA When a station has data to send, it first listens to the channel to see if anyone else is
transmitting at that moment, If the channel is busy, the station waits until it become free. If the station
detects an idle channel, it transmits a frame. If a collision occurs, the station waits a random amount of
time. Here 1-persistent protocol which monitor the channel and transmit the frame to check the idle
condition of the channel. However, if it finds the channel is busy, it continuously senses the channel until
it become free. The performance of this protocol is affected by propagation delay.

• CSMA/CD

The basic idea behind CSMA/CD is that a station needs to be able to receive while transmitting to detect a
collision. When there is no collision, the station receives one signal: its own signal. When there is a
collision, the station receives two signals: its own signal and the signal transmitted by a second station.
• CSMA/CA

Here the station uses any of the persistent method to sense the channel. If the channel is busy , it again
sense the channel. The station continues to do so until it finds the station idle. After the station has found
the channel idle it does not send the frame immediately rather it waits for random amount of time which
known as Inter Frame Space (IFS). The station is required to wait for IFS time because it may happen that
some station has already started the transmission of the frame.

You might also like