Random Access ALOHA Protocol

In this document, we conduct a simulation of the random access ALOHA protocol and evaluate its throughput and delay performance. Our implementation uses a discrete-event simulation model that tracks packet transmission attempts, collisions, and retransmissions. Through MATLAB/Python code, we simulate various network parameters and scenarios, including different network loads (packet arrival rates following Poisson distribution) and interference levels. The performance metrics are calculated using formulas such as throughput S = G * e^(-2G) for pure ALOHA and S = G * e^(-G) for slotted ALOHA, where G represents the offered load. Additionally, we explore optimization techniques for ALOHA protocol, including backoff algorithms implementation (e.g., binary exponential backoff) and slot synchronization mechanisms. These improvements aim to enhance protocol efficiency and scalability for broader network applications. We believe this research provides valuable insights into understanding and utilizing ALOHA protocol, contributing to the advancement of network communication technologies.