a multiple access protocol
When a single channel is shared by many devices — picture one room of people sharing one speaking floor — you need a rule for taking turns, or everyone talks over everyone and nothing gets understood. A multiple access protocol is that rule. It is the algorithm that decides which of several nodes sharing one broadcast channel gets to transmit, so that, ideally, when one node sends it has the channel to itself and its frame arrives intact.
There are three classic families of solutions, each a different philosophy of sharing. Channel partitioning carves the channel into fixed pieces and gives each node its own: time-division multiple access (TDMA) assigns each node a repeating time slot, frequency-division multiple access (FDMA) assigns each node its own frequency band. Random access lets nodes transmit whenever they have data and deals with the inevitable collisions afterward: ALOHA, slotted ALOHA, and the carrier-sense family (CSMA, CSMA/CD, CSMA/CA). Taking turns passes permission around in an orderly way: polling (a controller invites each node in turn) and token passing (a token circulates and only its holder may send).
Each family wins in different conditions, which is the honest heart of the topic. Partitioning is efficient and collision-free when traffic is heavy and steady, but wastes a node's slot when it has nothing to send. Random access is efficient and low-latency when traffic is light and bursty — most nodes are usually silent — but collapses under heavy load as collisions pile up. Taking turns avoids both collisions and wasted slots but adds the overhead of passing permission and a single point of failure (the controller or the token). No single scheme is best everywhere, which is why real networks pick the family that matches their traffic.
A cellular tower juggling thousands of phones leans toward partitioning and scheduling (steady, heavy demand), while a quiet office Wi-Fi uses random access (mostly idle, occasional bursts). Same problem — share one channel — but different traffic, so different best answer.
Three families — partitioning, random access, taking turns — each suited to a different traffic pattern.
There is no universally best multiple access protocol: partitioning wins under heavy steady load, random access under light bursty load, taking turns trades a little overhead to get both collision-free and slot-free. The right choice follows the traffic.