A shared radio channel needed a traffic rule
A radio link could connect computers on different Hawaiian islands without running cables between them, but it created a problem: all the computers had to use the same channel. If two sent messages at once, their signals could interfere, leaving neither message intact.
ALOHAnet treated that shared channel as a place to compete for access rather than assigning each computer a permanent turn. A computer sent a packet—a small piece of a message—when it had one ready. If the receiver did not confirm it arrived, the sender waited for a randomly chosen interval and tried again. Random waiting made it less likely that computers whose first attempts collided would immediately collide again.
The idea traveled beyond the islands
This approach, called random access, offered a practical way to share a communications channel when traffic was unpredictable. It also exposed the central tradeoff: sending without first reserving a turn keeps the system simple and responsive, but collisions waste airtime, especially when many devices are active.
Later network designers adapted the underlying idea rather than simply copying ALOHAnet. Ethernet developed methods for detecting collisions on its shared wired medium. Wi-Fi instead tries to reduce collisions by listening before transmitting and waiting when the channel is busy; because a wireless device may not be able to detect a collision while it is transmitting, it uses acknowledgments and retries to recover from lost packets.
The lasting contribution was a workable answer to a basic networking question: how can many independent devices share one medium without a central scheduler assigning every transmission? ALOHAnet made that question—and the logic of contention, waiting, and retrying—part of the design vocabulary behind modern networks.
