Scribd
Upload
23 views5 pages

Slotted ALOHA Scheme

The document compares the performance of slotted ALOHA and pure ALOHA schemes through theoretical analysis and simulation. Slotted ALOHA improves efficiency over pure ALOHA by reducing collisions through synchronizing transmissions to time slots. Both theoretical and simulation results show that slotted ALOHA achieves higher throughput than pure ALOHA, especially at optimal load levels, though practical factors can reduce throughput below theoretical maximums.

Uploaded by

choi180327
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
23 views5 pages

Slotted ALOHA Scheme

The document compares the performance of slotted ALOHA and pure ALOHA schemes through theoretical analysis and simulation. Slotted ALOHA improves efficiency over pure ALOHA by reducing collisions through synchronizing transmissions to time slots. Both theoretical and simulation results show that slotted ALOHA achieves higher throughput than pure ALOHA, especially at optimal load levels, though practical factors can reduce throughput below theoretical maximums.

Uploaded by

choi180327
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/ 5

Comparison between Simulation and Theory for

Slotted ALOHA Scheme

1. Introduction
Random multiple access protocols have found widespread application in
wireless telecommunications, enabling the accommodation of many users
with minimal coordination [1], [2]. Users can freely join and leave the
channel without interaction, irrespective of the channel state. However, the
drawback lies in the interference caused by transmission collisions,
potentially resulting in packet loss at the receiver side. Managing packet
contention constitutes a fundamental challenge in multiple access schemes.
The ALOHA protocol was initially proposed with users sending single data
packets as they are generated, without prior time synchronization [3]. In
the event of packet collisions and unrecoverable data at the receiver side,
re-transmission becomes necessary, posing system stability as a primary
concern. Subsequently, Slotted ALOHA (SA) was introduced, assigning
specific slots for packet transmissions to mitigate partial packet collisions
prevalent in ALOHA and enhance transmission efficiency [4]. This report
aims to compare the performance of ALOHA and SA schemes through both
simulation and theoretical analysis.

2. Theoretical Analysis
ALOHA, developed at the University of Hawaii in the early 1970s, stands
as a pioneering random-access protocol. It operates within LAN
environments, where the likelihood of collisions during data transmission
from source to destination is relatively high. ALOHA encompasses two
primary variants: Pure ALOHA (PA) and Slotted ALOHA (SA).
Pure ALOHA (PA), often referred to as the main or original ALOHA,
operates by stations sending frames whenever they become available. Since
there's only one communication channel, collisions can occur. In PA, a user
transmits a frame and waits for the receiver to acknowledge it. If no
acknowledgment is received, the sender assumes the frame was lost and
retransmits it. This process is illustrated in Fig. 1.
Fig. 1. Pure ALOHA procedure

Slotted ALOHA (SA) represents an enhanced iteration of the Pure


ALOHA protocol, designed to optimize communication networks for
improved efficiency. Unlike its predecessor, SA introduces a structured
approach by dividing the channel into small, fixed-length time slots. Users
are permitted to transmit data exclusively at the onset of each time slot.
This synchronization of transmissions serves to significantly reduce the
likelihood of collisions between devices, thereby enhancing the overall
network efficiency.
In SA, the channel time is segmented into discrete time slots, each
precisely aligned with the duration required for packet transmission. All
stations are synchronized to these time slots, ensuring that whenever a user
initiates a transmission, it aligns precisely with the next available channel
slot. Consequently, the inefficiencies resulting from collisions are mitigated
to a single packet time or even halved, depending on the implementation.
When a user intends to transmit a frame in SA, it patiently awaits the
commencement of the next designated time slot before sending the frame.
Upon successful reception, the receiver promptly dispatches an
acknowledgment. However, if the acknowledgment fails to materialize
within a predefined time-out period, the sender assumes the frame was not
received and initiates a retransmission during the subsequent time slot.
SA indeed enhances channel utilization by mitigating the occurrence of
collisions. Nevertheless, this improvement comes at the expense of
increased transmission delay for users, as they must wait for the next
designated time slot to transmit their frames. This process is illustrated in
Fig. 2.
Fig. 2. Transmission attempts and random retransmission delay for colliding
packets in Slotted ALOHA

The throughput of the SA protocol is determined by the number of


successful transmissions at each time slot. However, the protocol's
maximum throughput is typically around 18.4%. This limitation arises from
the significant risk of collisions when multiple nodes attempt to transmit
simultaneously, resulting in missed packets and a reduction in overall
throughput. The maximum throughput is achieved when the network's
active nodes transmitting data amount to less than or equal to 37% of the
total nodes.
In practical scenarios, the throughput of SA is often much lower than 18.4%
due to frequent collisions. Consequently, it is not extensively utilized in
contemporary networks.
The maximum throughput of a SA channel can be calculated using the
formula:
𝑆 = 𝐺 ∙ 𝑒 −𝐺
where 𝑆 represents the throughput, and 𝐺 denotes the offered load (i.e.,
the number of packets being transmitted per time slot).
The throughput varies from 0 to 1 as the offered load increases (see Fig.
3). With higher offered loads, more collisions occur, leading to fewer
successful transmissions and a decrease in throughput. The maximum
throughput occurs when the offered load equals 0.37, approximately
yielding a value of 0.184.
Fig. 3. Comparison of the throughput as a function of offered load for Pure and
Slotted ALOHA

However, it's essential to note that the provided equation assumes


uniform packet lengths and an error-free channel. In reality, the throughput
tends to be significantly lower due to factors such as packet errors, channel
noise, and the overhead associated with retransmissions.

3. Simulation Methodology
For simulation, we developed a discrete-event simulation of both Pure
ALOHA (PA) and Slotted ALOHA (SA) using the Python programming
language. Our simulation incorporates realistic factors including packet
arrival processes, transmission durations, and collision detection
mechanisms. We meticulously varied parameters such as the number of
users, packet arrival rate, and slot duration to comprehensively analyze
their influence on system performance. This approach allowed us to explore
a wide range of scenarios and obtain insights into the behavior and
efficiency of both PA and SA protocols under different conditions. The
results obtained under optimal theoretical conditions are summarized in
Table 1.
Table 1. Comparison of the throughput under optimal theoretical conditions for Pure
and Slotted ALOHA
𝑺 under 𝑮𝑷𝑨 = 𝟎. 𝟓 or 𝑮𝑺𝑨 = 𝟏
Pure
0.158 0.102 0.112 0.136 0.124 0.11 0.136 0.156 0.116 0.114
ALOHA
Slotted
0.331 0.325 0.338 0.347 0.341 0.319 0.345 0.351 0.329 0.365
ALOHA
4. Results and Analysis
Theoretical analysis and simulation results generally exhibited close
alignment, particularly for moderate (optimal) loads. Both methodologies
underscored the critical influence of offered load on system stability.
Discrepancies between simulation and theory primarily stemmed from
practical factors like implementation overhead, packet buffering, and finite
system size effects. However, despite these variations, the overarching
trends and performance metrics observed in simulation closely mirrored
theoretical expectations, affirming the efficacy of Slotted ALOHA as a
random-access protocol.

5. Conclusion
In summary, the combination of simulation and theoretical analysis
furnishes valuable insights into Slotted ALOHA's performance. While
theoretical analysis furnishes mathematical precision and predictive
capabilities, simulation facilitates exploration of real-world scenarios and
practical nuances. By synergistically leveraging both approaches,
researchers and engineers can cultivate a holistic understanding of Slotted
ALOHA and its utility in wireless communication systems.

6. References
[1] N. Abramson, “Multiple access in wireless digital networks,”
Proceedings of the IEEE, vol. 82, no. 9, pp. 1360–1370, 1994.
[2] C. Morlet, A. B. Alamanac, G. Gallinaro, L. Erup, P. Takats, and A.
Ginesi, “Introduction of mobility aspects for DVB-S2/RCS broadband
systems,” Space Communications, vol. 21, no. 1-2, pp. 5–17, 2007.
[3] N. Abramson, “The ALOHA system: Another alternative for computer
communications,” in Proceedings of 1970 Fall Joint Computer Conference,
ser. AFIPS, 1970, pp. 281–285.
[4] I. Gitman, “On the capacity of slotted ALOHA networks and some design
problems,” IEEE Trans. Commun., vol. 23(3), pp. 305–317, 1975.

You might also like