Scribd
Upload
75 views

ALOHA Random Access Protocol

The document discusses the ALOHA random access protocol. ALOHA is designed for wireless LANs and allows any station to transmit data simultaneously when a data frame is available. It operates at the data link layer and proposes how multiple terminals can access a shared medium without interference or collision. ALOHA requires handling collisions that occur when two or more systems attempt to transmit at the same time.

Uploaded by

Aashu Rajput
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
75 views

ALOHA Random Access Protocol

The document discusses the ALOHA random access protocol. ALOHA is designed for wireless LANs and allows any station to transmit data simultaneously when a data frame is available. It operates at the data link layer and proposes how multiple terminals can access a shared medium without interference or collision. ALOHA requires handling collisions that occur when two or more systems attempt to transmit at the same time.

Uploaded by

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

ALOHA Random Access Protocol

It is designed for wireless LAN (Local Area Network) but can also be used in a shared medium to transmit data.
Using this method, any station can transmit data across a network simultaneously when a data frameset is
available for transmission.

ALOHA is a multiple access protocol at the data link layer of OSI model. ALOHA propose how multiple
terminals access the medium without interference ot collision. It is a system for taransmission of data via a
shared communication n/w channel. It was developed in 1970 by NORMAN ABRAMSON and his colleagues at
the university of Hawaii. the original system used for ground based radio broadcasting but the system.

ALOHA requires a method of handling ,collisions that occur when two or more system attempt to transmit on
the channel at the same time. In this system a node transmits whenever data is available to send. Ig another
node transmits at the same time, a collision occurs, and the frames that wete transmitted are lost.

Aloha Rules

1. Any station can transmit data to a channel at any time.


2. It does not require any carrier sensing.
3. Collision and data frames may be lost during the transmission of data through multiple stations.
4. Acknowledgment of the frames exists in Aloha. Hence, there is no collision detection.
5. It requires retransmission of data after some random amount of time.

Pure Aloha

Whenever data is available for sending over a channel at stations, we use Pure Aloha. In pure Aloha, when each
station transmits data to a channel without checking whether the channel is idle or not, the chances of collision
may occur, and the data frame can be lost. When any station transmits the data frame to a channel, the pure
Aloha waits for the receiver's acknowledgment. If it does not acknowledge the receiver end within the specified
time, the station waits for a random amount of time, called the backoff time (Tb). And the station may assume
the frame has been lost or destroyed. Therefore, it retransmits the frame until all the data are successfully
transmitted to the receiver.
1. The total vulnerable time of pure Aloha is 2 * Tfr.
2. Maximum throughput occurs when G = 1/ 2 that is 18.4%.
3. Successful transmission of data frame is S = G * e ^ - 2 G.

Slotted Aloha

The slotted Aloha is designed to overcome the pure Aloha's efficiency because pure Aloha has a very high
possibility of frame hitting. In slotted Aloha, the shared channel is divided into a fixed time interval called  slots.
So that, if a station wants to send a frame to a shared channel, the frame can only be sent at the beginning of
the slot, and only one frame is allowed to be sent to each slot. And if the stations are unable to send data to
the beginning of the slot, the station will have to wait until the beginning of the slot for the next time.
However, the possibility of a collision remains when trying to send a frame at the beginning of two or more
station time slot.

1. Maximum throughput occurs in the slotted Aloha when G = 1 that is 37%.


2. The probability of successfully transmitting the data frame in the slotted Aloha is S = G * e ^ - 2 G.
3. The total vulnerable time required in slotted Aloha is Tfr.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy