Bengal College Of Engineering And
Technology
Technical Report On Aloha Acess control mechanism
Abhishek Mishra
Computer Science And Engineering
3rd Year 6th Semester
Roll no. : 162002016
University Roll no.: 12500116123
Instructor : Dr Vivek Shrivastav
Aashish Rao
Computer Science And Engineering
3rd Year 6th Semester
Roll no. : 162026016
University Roll no.: 12500116103
Instructor : Dr Vivek Shrivastav
Page 1 of 13
Acknowledgement
We would like to express our gratitude towards Dr. Vivek
Kumar Shrivatsav , Our faculty for computer networks class ,
for providing us this opportunity as well as valuable insights
towards our goal of completion of project, and above all sharing
with us his knowledge and expertise in practical demonstrations.
we also thank other dignified members of the faculty and
andministratation who gave us this opportunity to work on
this project topic , which helped us in expanding our
knowledge as well as helped in personal and professional growth.
Page 2 of 13
Table of Contents
Abstract
History
What is aloha
Aloha rules
Working of Pure Aloha Protocol
Basic Idea Behind Aloha
Procedures In Pure Aloha
Flow Chart In Aloha
Analysis Of Pure Aloha
Application of Aloha
Adavantage and disadvantage of aloha
Conclusion
References
Page 3 of 13
Abstract
ALOHA is one of the random access protocol implemented at link layer. Chances
of collisions are more in pure ALOHA as compared to Slotted ALOHA , but still it
is least efficient as compared to other random access protocol such as
CSMA(CD/CA).These protocols works efficiently when there are less active
[Link] versions of ALOHA are being used in some services such as
Mobile Slotted ALOHA
Page 4 of 13
Introduction
History of aloha
Development of the ALOHA network was begun in1968 at the University of
Hawaii under the leadership of Norman [Link] goal was to use low-cost
commercial radio equipment to connectusers on Oahu(an island of Hawaii) and the
other Hawaiian islands with a
central time-sharing computer on the main Oahu [Link] became
operational in June, 1971, providingthe first public demonstration of a wireless
packet data [Link] ALOHAnet was designed for wireless
communication, there were two other media available for the application of an
ALOHA channel –
cables and satellites.
In the 1970s ALOHA random access was employed in the widely usedEthernet
cable based network and then in the satellite network
What is Aloha?
ALOHA is a simple random access protocol that was developed at the University
of Hawaii in the early 1970. ALOHA’s main purpose is to determine which
competing station must get the next chance of accessing the multi-access channel
at MAC Layer
Aloha Rules
Any station could transmit data anytime.
There is no carrier sensing.
Collisions are possible.
Acknowledgements exist in aloha. Hence, there is no need of collision
detection.
Retransmission occurs after some random amount of time. Thus, probability of
collision is less since packet is transmitted after random amount of time. This is
called back-off time.
Page 5 of 13
The ALOHA initially developed by the University of Hawaii was called Pure
ALOHA
Working of Pure Aloha Protocol
Fig 1 : working of aloha
here,
– Dark Block represents data being transferred.
– light Block represents data being transferred at the same time or in the same
block.
If a station starts transmitting data at any point of time, It is transmitted for TT
time.
During this time, if any other station starts transmitting data, then, there can be a
collision. Thus, TT is vulnerable time.
If collision occurs in the frame, then, the stations wait for a random amount of
time. Then, they retransmit the frame until all the data are successfully transmitted.
The waiting time of each station must be random and not same in order to avoid
the collision of frames again and again. Thus, the throughput of Pure ALOHA is
Page 6 of 13
maximized when the frames are of uniform length.
Basic Idea Behind ALOHA
Use of two distinct frequencies in a hub/star configuration.
The hub machine broadcasting packets to everyone on the "outbound"
channel.
Various client machines sending data packets to the hub on the "inbound"
channel.
If data was received correctly at the hub, a short acknowledgment
packet was sent to the client.
if an acknowledgment was not received by a client machine after a short
wait time, it would automatically retransmit the data packet after waiting
a randomly selected time interval.
This acknowledgment mechanism was used to detect and correct for
"collisions" created when two client machines both attempted to send a
packet at the same time.
PROCEDURES IN PURE ALOHA
1. Start
2. bckvar = 0
3. [Link](packet,broadcast>)
4. [Link](1)
5. if [Link](buffsize) : return
6. else increment bckvar
7. if limittimer <= bckvar : return
8. else wait(bckvar)
9. repeat from 3
Page 7 of 13
FLOW CHART FOR ALOHA
fig 2 ; aloha flow chart
Page 8 of 13
Analysis Of Pure Aloha
Notation:
– T f : Frame time (processing, transmission, propagation)
– S : Average number of successful transmissions per T f ;
that is, the throughput or efficiency.
– G : Average number of total frames transmitted per T f
– D : Average delay between the time a packet is ready for
transmission and the completion of successful
transmission.
We will make the following assumptions:
1. All frames are of constant length
2. The channel is noise-free; the errors are only due to collisions.
3. Frames do not queue at individual stations
4. The channel acts as a Poisson process.
Since S represents the number of “good” or “succeed”
transmissions per frame time, and G represents the total number
of attempted transmissions per frame time, then we have:
S = G * (Probability of good transmission)
Page 9 of 13
Efficiency of Pure Aloha (η) = G x e-2G
where G = Number of stations willing to transmit data
For maximum efficiency,
We put dη / dG = 0
Maximum value of η occurs at G = 1/2
Substituting G = 1/2 in the above expression, we get
Maximum Efficiency of Pure Aloha (η) = 18.4%
This result is also evident from the fact that the Back off time , if one station
should transfer in two
transfer time; Half should transfer in 1 Tt time
APPLICATION OF ALOHA
The ALOHA concept is very commonly used in modern wireless communication
systems. The call set-up procedure of almost any (analog or digital) cellular
telephone system uses some kind of ALOHA random access. But the performance
differs from what one would expect in a wireline network.
If the transmitter-to-receiver propagation time is large and unknown, the slot time
must be equal to the packet length plus a sufficiently large guard time. In the call
Page 10 of 13
set-up of GSM, random access packets are substantially shorter than normal
telephone speech blocks: During call set-up the propagation time is still unknown
because the subscriber can be anywhere in the cell. During the call, the
propagation times are measured and the terminal transmitter will compensate for it,
by sending all blocks a bit in advance. A closed-loop control circuit, sending
adaptive timing advance/delay feedback information, is used to ensure that the
timing remains correct even if the subscribers moves in the cell.
Advantage Of Aloha
» Superior to fixed assignment when there are large number of bursty stations.
» Adapts to varying number of stations.
Dis Advantage Of Aloha
Theoretically proven throughput maximum of 18.4%.
Requires queuing buffers for retransmission of packets
Page 11 of 13
CONCLUSION
We derive to the conclusion that Pure Aloha Despite Being a Very Easy Technique
to
impement suffers from huge optimisation issues.
Also we realise that being the oldest wireless protocol it was more of a proof of
concept
Another thing that we cometo know is that in presence of more effective
algorithms
Aloha has become obselete
Page 12 of 13
References
[1] Wikipedia
[2] [Link]
[3] Data Communication and Networking by Behrouz A Forouzan
[4] computer networks and the internet by Ross & Kurose
Page 13 of 13