The history of the modern internet is often told through the lens of massive fiber-optic cables and high-speed satellite arrays, but the fundamental logic that allows our devices to communicate was born from a much simpler challenge: how to allow multiple radio stations across the Hawaiian Islands to share a single frequency without causing a cacophony of data interference. In 1970, researchers at the University of Hawaii developed the ALOHAnet, introducing two protocols—Pure ALOHA and Slotted ALOHA—that would provide the mathematical bedrock for everything from the earliest versions of Ethernet to the modern Wi-Fi networks we rely on today.
At the heart of these protocols is the problem of the "shared medium." In any network where multiple autonomous stations compete for access to a single communication channel without a central scheduler, chaos is the default state. Without a set of rules, if two stations transmit at the same time, their signals overlap, resulting in a "collision" that renders the data unreadable. The mathematical framework established by the ALOHA protocols was the first to successfully quantify this chaos, offering a blueprint for managing channel efficiency.
The Mechanism of Pure ALOHA: Simplicity and Its Costs
Pure ALOHA was the original iteration of the protocol, characterized by its radical simplicity. In this system, there is no coordination between stations. When a station has data to send, it simply transmits the frame. This "transmit-at-will" philosophy is highly effective in low-traffic environments where the likelihood of two stations sending data simultaneously is slim. However, as the number of stations increases, the inherent flaws of the system become mathematically apparent.
The defining characteristic of Pure ALOHA is that a frame is considered destroyed if it collides with another transmission—even by a single bit. This leads to what engineers call the "Vulnerability Period." To understand the efficiency of the network, one must look at the window of time during which a transmission is at risk of being interrupted by another user.
If we let $T_f$ represent the time required to transmit a single frame, the vulnerability window in Pure ALOHA is surprisingly large: exactly $2 cdot T_f$. This is because a collision can occur from two directions. If Station A begins transmitting at time $t_0$, its frame will be destroyed if Station B started a transmission at any point after $t_0 – T_f$, as Station B’s tail end would overlap with Station A’s beginning. Conversely, if Station C starts a transmission at any point before $t_0 + T_f$, its beginning will overlap with the end of Station A’s frame. Consequently, for Station A to succeed, the channel must remain silent for a duration of two full frame times.
To calculate the efficiency, or throughput ($S$), of this system, mathematicians use the Poisson distribution. This statistical model assumes that the generation of new frames and the retransmission of previously collided frames follow a random pattern with an average attempt rate of $G$ frames per frame time. The probability that $k$ frames are generated during the vulnerability period ($2 cdot T_f$) is expressed through the Poisson formula. For a transmission to be successful, the number of other frames generated ($k$) must be zero.
