Random Access Protocols

1. Multiple Access Control (MAC) Taxonomy

When multiple nodes share a single broadcast communication channel (such as a shared copper bus, optical star, or radio frequencies in the air), they must coordinate transmissions to prevent destructive signal interference.

Multiple Access protocols are categorized into three fundamental families:

                            MULTIPLE ACCESS PROTOCOLS
                                       |
       +-------------------------------+-------------------------------+
       |                               |                               |
  RANDOM ACCESS               CONTROLLED ACCESS                 CHANNELIZATION
(Contention-Based)           (Collision-Free)                 (Dedicated Bands)
  - Pure ALOHA                 - Reservation                    - FDMA
  - Slotted ALOHA              - Polling                        - TDMA
  - CSMA                       - Token Passing                  - CDMA
  - CSMA/CD (Ethernet)
  - CSMA/CA (Wi-Fi)

2. Philosophy of Random Access (Contention)

In Random Access protocols:

No Master Node: No centralized controller schedules or arbitrates station transmissions; all stations have equal priority.
No Scheduled Time: No station is assigned fixed time slots or frequencies.
Contention: Stations compete (contend) for access to the shared transmission medium.
Collisions: If two or more stations transmit concurrently, their electromagnetic waves collide, corrupting and destroying both frames.

The Five Questions of Random Access:

Every random access protocol is designed to address five essential operational questions:

+-----------------------------------------------------------------------------+
|                  THE FIVE QUESTIONS OF RANDOM ACCESS                        |
+------------------------------------+----------------------------------------+
| 1. When can a station access?      | Any time (ALOHA), or only on slot (S-A)|
| 2. Does it sense the channel?      | Blind (ALOHA), or Carrier Sense (CSMA) |
| 3. What if the channel is busy?    | 1-Persistent, Non-Persistent, p-Persist|
| 4. How is collision detected?      | Timeout (ALOHA/CA), or Voltage (CD)    |
| 5. What happens after collision?   | Binary Exponential Backoff retransmit  |
+------------------------------------+----------------------------------------+

3. Comparison of Multiple Access Families

Parameter	Random Access (Contention)	Controlled Access	Channelization (FDM/TDM/CDM)
Channel Sharing	Shared dynamically on demand	Token/Polling coordinated	Hard frequency/time division
Collisions	Possible (handled by protocol)	Zero collisions	Zero collisions
Overhead at Low Load	Minimal (instant transmission)	High (polling delay/token wait)	High (wasted empty channels)
Performance at High Load	Degrades rapidly due to collisions	Stable, deterministic throughput	Stable, non-interfering
Master Node Requirement	None (distributed)	Primary master often needed	Central base station / scheduler
Typical Standards	Ethernet (802.3), Wi-Fi (802.11)	Token Ring (802.5), Bluetooth	2G/3G Cellular, DOCSIS Cable

4. Evolution of Random Access Protocols

The history of random access is an evolutionary journey to minimize the vulnerable time interval and maximize channel throughput:

  1. Pure ALOHA (1970)      ===> Transmit anytime; V_t = 2 * Tfr; Max Throughput = 18.4%
            |
  2. Slotted ALOHA (1972)   ===> Transmit on slot boundary; V_t = Tfr; Max Throughput = 36.8%
            |
  3. CSMA (1975)            ===> Carrier sensing ("Listen before talk"); eliminates most collisions
            |
  4. CSMA/CD (1980)         ===> "Listen while talking"; abort on collision; Ethernet standard
            |
  5. CSMA/CA (1997)         ===> Avoidance via IFS, NAV & RTS/CTS handshake; Wi-Fi standard

5. Key Exam Questions & Takeaways

What is the fundamental difference between Random Access and Controlled Access?
- In Random Access, stations contend for the medium without central arbitration, making collisions possible. In Controlled Access (like polling or token passing), stations must wait for explicit authorization or possession of a token, eliminating collisions entirely.
Why does Random Access outperform Channelization under light, bursty traffic?
- Channelization statically allocates bandwidth (dedicated time or frequency slots). When a station has no traffic, its allocated capacity is wasted. Random access gives the entire channel capacity to any active station on demand with zero setup delay.
What causes collisions in Carrier Sense Multiple Access (CSMA)?
- Propagation Delay ( $T_p$ ): The time it takes for a signal to travel across the physical medium. If Station B senses the channel before Station A's wavefront arrives at Station B, Station B will incorrectly detect an idle channel and transmit, creating a collision.

Random Access