10.4 Wireless LANs: IEEE 802.11 Architecture, CSMA/CA & RTS/CTS Handshake

Back to Computer Networks Notes

📚Module 10: Physical Layer Devices & Wireless NetworksTopic 10.4⏱️16 min read

🎯High-Yield For:Semester Exams (All Universities) • Placement Technical Rounds • Engineering Foundations

💡 Core Intuition: The Hall with Concrete Partitions & The Floor Reservation

🍳 The Everyday Analogy: The Soundproof Wall

Imagine an examination room with an invigilator seated in the center:

1. The Wired Cable (Everyone Hears Everyone): In a small open room, if two students speak at once, both instantly hear each other talking over each other. They stop talking immediately, wait a random moment, and try again (CSMA/CD: Collision Detection).
2. The Concrete Partition (The Hidden Terminal): Now imagine a concrete wall running down the center of the room. Student Alice is on the west side, and Student Charlie is on the east side. Both can see and hear the invigilator in the middle, but Alice cannot hear Charlie, and Charlie cannot hear Alice.
3. The Collision Disaster: Alice listens to the room. She hears total silence, so she shouts her question to the invigilator. At the exact same second, Charlie listens, hears total silence on his side of the wall, and shouts his question. The two voices collide violently at the invigilator's desk, producing unintelligible garble. Neither Alice nor Charlie has any idea a collision occurred!
4. The Floor Reservation (RTS / CTS Handshake): To prevent this, Alice does not shout her full question. She waves a tiny yellow flag: "Requesting 10 seconds of floor time" (RTS). The invigilator raises a megaphone that echoes across both sides of the wall: "Alice has the floor for 10 seconds; everyone else be quiet!" (CTS). Charlie hears the invigilator's announcement, covers his mouth, and starts a 10-second timer (NAV), allowing Alice's question to arrive without interference.

---

📑Table of Contents

• 🏛️ IEEE 802.11 Wireless LAN Architecture
  • Core Structural Building Blocks
• 🛑 Why Wired CSMA/CD Fails in Wireless Networks
  • The Two Physical Roadblocks
• 👻 The Classical Wireless Dilemmas: Hidden & Exposed Terminals
  • 1. The Hidden Terminal Problem
  • 2. The Exposed Terminal Problem
• 🛡️ Carrier Sense Multiple Access with Collision Avoidance (CSMA/CA)
  • The Interframe Space (IFS) Hierarchy
  • The CSMA/CA Backoff Algorithm
• 🤝 Virtual Carrier Sensing: The 4-Way RTS/CTS Handshake
  • Step-by-Step Detailed Breakdown
• 🏭 Real-World Production Context: Wi-Fi 6 (802.11ax) OFDMA, BSS Coloring & Enterprise Campus Controllers
  • 1. High-Density Venues & Wi-Fi 6 OFDMA (Resource Units)
  • 2. Overcoming the Exposed Terminal Dilemma: BSS Coloring
  • 3. Enterprise Lightweight Access Points & CAPWAP Controllers
• 📐 Numerical Applications & Worked Examples
  • Example 1: NAV Duration Value in the 4-Way RTS/CTS Handshake
  • Example 2: Contention Window Growth Under Binary Exponential Backoff
  • Example 3: RTS/CTS Threshold Trade-Off Analysis
• 🎯 Exam & Interview Pitfall Check

---

🏛️ IEEE 802.11 Wireless LAN Architecture

Standardized by the IEEE 802.11 committee (popularly branded as Wi-Fi), wireless local area networks operate on shared radio spectrum (primarily $2.4\text{ GHz}$, $5\text{ GHz}$, and $6\text{ GHz}$).

Core Structural Building Blocks

1. Station (STA): Any computing device equipped with a wireless network interface controller (e.g. smartphone, laptop, IoT sensor).
2. Access Point (AP): A wireless base station that bridges radio traffic to a wired Ethernet backbone.
3. Basic Service Set (BSS): The fundamental building block of an 802.11 wireless network:
   • Infrastructure BSS: Consists of multiple wireless stations communicating exclusively through a central Access Point.
   • Independent BSS (IBSS / Ad-Hoc): Stations communicate peer-to-peer directly without an Access Point.
4. Extended Service Set (ESS): Multiple Infrastructure BSSs interconnected via a wired Distribution System (DS). Allows mobile stations to roam seamlessly between access points without dropping active TCP connections.
5. Identifiers:
   • SSID (Service Set Identifier): Human-readable alphanumeric network name (e.g. BinaryDose_Campus_5G).
   • BSSID (Basic Service Set Identifier): The unique 48-bit physical MAC address of the Access Point radio interface.

---

🛑 Why Wired CSMA/CD Fails in Wireless Networks

In wired Ethernet, transceivers use CSMA/CD (Carrier Sense Multiple Access with Collision Detection). When an Ethernet card transmits, it simultaneously monitors the copper wire for voltage fluctuations. If a collision occurs, it detects it within microseconds, aborts transmission, and sends a jam signal.

In wireless radio networks, Collision Detection is physically impossible:

Wired CSMA/CD vs Wireless CSMA/CA

Why physical radio wave dynamics force the transition from Collision Detection to Collision Avoidance

Wired Ethernet

CSMA/CD (IEEE 802.3)

🔌

Dominant Architecture / DomainTwisted-Pair Copper & Coaxial Cables

• •Transceiver can listen while transmitting (Full Duplex / Loopback).
• •Collision Detection: Detects voltage spike immediately on the wire.
• •Aborts frame immediately to avoid wasting link transmission time.
• •No link-layer ACKs needed: absence of collision implies frame delivery.

"Listen while talking; abort immediately upon collision."

Wireless Wi-Fi

CSMA/CA (IEEE 802.11)

📡

Dominant Architecture / DomainRadio Frequency Airwaves (2.4 GHz / 5 GHz / 6 GHz)

• •Cannot listen while transmitting: own transmitter is 100,000x stronger than incoming signals.
• •Suffers from Hidden and Exposed Terminal problems.
• •Collision Avoidance: Proactively defers transmission using random backoffs.
• •Mandatory Link-Layer ACKs: Sender cannot detect collisions without an explicit return ACK.

"Listen before talking; reserve the channel to prevent collisions before they happen."

The Two Physical Roadblocks

1. Extreme Dynamic Range & Self-Interference: A station's own radio transmitter emits power up to $100,000\text{ times}$ ($50\text{ dB}$) stronger than the faint incoming radio signals received from distant stations. If a station transmits, its local receiver is completely saturated and blinded. A station cannot listen while transmitting.
2. The Hidden Terminal Problem: Radio waves attenuate rapidly with distance and are blocked by physical obstacles (concrete walls, metal furniture). A station cannot assume that because its own radio hears silence, the receiving Access Point also experiences silence!

---

👻 The Classical Wireless Dilemmas: Hidden & Exposed Terminals

1. The Hidden Terminal Problem

Consider three nodes in a linear spatial arrangement where Node A and Node C both communicate with Access Point B:

• Node A is in radio transmission range of AP B.
• Node C is in radio transmission range of AP B.
• Node A and Node C are out of radio range of each other (or separated by a physical obstruction such as a concrete wall).

Station / Device	Radio Coverage & Connectivity	Local Channel Sensing	Action Executed	Outcome at Access Point B
Node A (Sender 1)	In range of AP B; out of range of C	Senses idle channel (cannot hear C)	Starts transmitting data to AP B	Radio signal arrives at AP B
Node C (Hidden Node)	In range of AP B; out of range of A	Senses idle channel (cannot hear A)	Simultaneously starts transmitting to B	Radio signal arrives at AP B
Access Point B (Receiver)	In range of both Node A and Node C	Receives overlapping RF signals	Attempted packet decoding fails	Collision & packet corruption

1. Node A wants to send data to B. A senses the airwaves, hears silence, and begins transmitting.
2. Node C simultaneously wants to send data to B. C senses the airwaves, hears silence (because C cannot hear A), and begins transmitting.
3. Collision at B: Both radio signals arrive simultaneously at Access Point B, colliding and garbling each other.
4. Neither A nor C realizes a collision occurred during transmission because wireless radios cannot listen while transmitting.

---

2. The Exposed Terminal Problem

Consider four nodes in a linear arrangement: Station A, Station B, Station C, and Station D.

• Node B is transmitting data frames to Node A.
• Node C wishes to transmit data frames to Node D (positioned away from B and A).
• Node C performs carrier sensing, hears Node B transmitting, and unnecessarily freezes its transmission.
• However, C transmitting to D would not have caused any interference at Node A! Node C was unnecessarily silenced, wasting valuable transmission bandwidth.

Station	Transmission Intent	Carrier Sensing Observation	Erroneous Behavior & Result
Node B	Transmitting to Node A	Channel clear for transmission	Active transmission in progress
Node C (Exposed Node)	Wants to transmit to Node D	Hears Node B's transmission	Unnecessarily defers: Freezes transmission even though sending to D would cause zero interference at A!

---

🛡️ Carrier Sense Multiple Access with Collision Avoidance (CSMA/CA)

Because collisions cannot be detected during transmission, 802.11 implements CSMA/CA: avoiding collisions proactively through Interframe Spaces (IFS) and Exponential Backoffs.

The Interframe Space (IFS) Hierarchy

In 802.11, the priority of a transmission is governed by the length of time a station must wait after the channel becomes idle:

Interframe Space	Acronym	Relative Duration	Operational Priority & Purpose
Short Interframe Space	SIFS	Shortest ($\approx 10\text{ - }16\text{ }\mu\text{s}$)	Highest Priority: Reserved for immediate responses: ACK frames, CTS frames, and fragment bursts.
PCF Interframe Space	PIFS	Medium ($\text{SIFS} + 1\text{ Slot}$)	Medium Priority: Used by Access Points in Point Coordination Function for centralized contention-free polling.
DCF Interframe Space	DIFS	Longest ($\text{SIFS} + 2\text{ Slots}$)	Standard Priority: Used by normal wireless stations competing for asynchronous data transmission.

Because SIFS is shorter than DIFS, an ongoing frame exchange (e.g. sending a CTS or ACK) always seizes the channel before any waiting station can start a new transmission, preventing collisions during multi-step handshakes!

---

The CSMA/CA Backoff Algorithm

When a station has a frame to transmit:

1. Sense Channel: The station monitors the airwaves.
2. DIFS Wait: If the channel is continuously idle for a duration equal to DIFS, the station does not transmit immediately (to avoid colliding with other stations that also sensed silence).
3. Random Backoff: The station chooses a random integer backoff counter uniformly from the Contention Window: $\text{Backoff Counter} \in [0, \; CW]$
4. Counter Decrement: The station decrements its backoff counter by 1 for every idle time slot.
   • If another station begins transmitting, the station pauses its backoff counter.
   • When the channel becomes idle again for DIFS, the station resumes counting down from where it paused.
5. Transmission: When the backoff counter reaches zero, the station transmits its frame.
6. Binary Exponential Backoff: If no ACK is received within the timeout window, the station assumes a collision occurred. It doubles the contention window: $CW_{\text{new}} = \min\big(2 \cdot CW_{\text{old}} + 1, \; CW_{\max}\big)$ (Typically $CW_{\min} = 15$ and $CW_{\max} = 1023$).

---

🤝 Virtual Carrier Sensing: The 4-Way RTS/CTS Handshake

To eliminate the Hidden Terminal problem for large data frames, IEEE 802.11 introduces Virtual Carrier Sensing via the RTS / CTS Handshake.

Space-Time Protocol Ladder

Step 1 of 5

The 4-Way RTS / CTS / DATA / ACK Handshake

Space-time protocol exchange reserving channel airtime and silencing hidden terminals via NAV

💡Click or hover any packet flight arrow, timer event, or step button to inspect protocol mechanics in real time

💻Transmitter

Sender (Station A)

Lifeline Rail (t ↓)

📡Receiver

Access Point (B)

Lifeline Rail (t ↓)

👻Neighbor Node

Hidden Terminal (C)

Lifeline Rail (t ↓)

11. RTS (Request to Send)(Duration = SIFS + CTS + SIFS + DATA + SIFS + ACK)

22. CTS (Clear to Send)(Broadcast to all nodes in B's range)

32b. Hidden Terminal Hears CTS(Sets NAV timer = Duration in CTS)

43. DATA Frame(Full 1500-byte Payload)

54. Link-Layer ACK(Immediate Confirmation)

Step 1 of 5sender ➔ ap✅ Delivered Successfully1. RTS (Request to Send)

Station A waits DIFS + Backoff, then transmits tiny 20-byte RTS frame declaring the total airtime needed.

Step-by-Step Detailed Breakdown

1. RTS (Request to Send)

• Station A transmits a tiny 20-byte control frame called RTS.
• Crucially, the RTS contains a Duration Field specifying the total microseconds required to complete the rest of the transaction: $\text{Duration}_{\text{RTS}} = \text{SIFS} + T_{\text{CTS}} + \text{SIFS} + T_{\text{DATA}} + \text{SIFS} + T_{\text{ACK}}$

2. CTS (Clear to Send)

• Access Point B receives the RTS, waits for a short SIFS interval, and broadcasts a CTS frame.
• The CTS echoes the remaining duration of the transaction.
• Why This Solves the Hidden Terminal: Even though Hidden Terminal C could not hear Station A's RTS, C is within range of Access Point B and hears the CTS loud and clear!

3. Network Allocation Vector (NAV)

• Any station hearing either an RTS or a CTS extracts the duration field and updates an internal countdown timer called the Network Allocation Vector (NAV).
• As long as $\text{NAV} > 0$, the station treats the channel as virtually busy and refuses to transmit, even if its physical antenna senses complete radio silence!

4. DATA and Positive ACK

• Station A transmits its large data frame without interference.
• Access Point B verifies the frame check sequence (FCS) and returns an immediate ACK frame within SIFS time.
• Once the transaction completes, all NAV timers hit zero, and contention reopens.

Why RTS/CTS is Not Used for Every Packet (RTS Threshold)

An RTS frame ($20\text{ bytes}$) and CTS frame ($14\text{ bytes}$) introduce protocol overhead. If a station is sending a tiny 50-byte DNS query, sending RTS and CTS first would triple the bandwidth consumed. Therefore, Wi-Fi drivers implement an RTS Threshold (typically $2,347\text{ bytes}$). Frames smaller than the threshold are sent directly via standard CSMA/CA; frames larger than the threshold use RTS/CTS!

---

🏭 Real-World Production Context: Wi-Fi 6 (802.11ax) OFDMA, BSS Coloring & Enterprise Campus Controllers

1. High-Density Venues & Wi-Fi 6 OFDMA (Resource Units)

In massive public venues like airports, sports stadiums, and university auditoriums, thousands of smartphones contend for the same 2.4 GHz and 5 GHz spectrum. Traditional CSMA/CA collapsed under collision backoffs.

• IEEE 802.11ax (Wi-Fi 6) solved this by replacing contention-based CSMA/CA with OFDMA (Orthogonal Frequency Division Multiple Access).
• Instead of letting only one station seize an entire $20\text{ MHz}$ or $80\text{ MHz}$ channel, the Access Point subdivides the channel into dozens of orthogonal Resource Units (RUs) (each as small as $2\text{ MHz}$ / 26 tones).
• The Access Point schedules multiple simultaneous uplink and downlink transmissions from up to 37 independent devices in a single transmission window, eliminating RTS/CTS overhead in dense environments.

2. Overcoming the Exposed Terminal Dilemma: BSS Coloring

In apartment complexes where dozens of home Wi-Fi routers operate on overlapping channels, stations constantly defer transmissions because they hear neighboring routers (the classic Exposed Terminal dilemma):

• Wi-Fi 6 introduced Spatial Frequency Reuse via BSS Coloring.
• Every wireless network attaches a 6-bit numerical color (from 0 to 63) to its physical radio preamble.
• When a station senses radio energy, it inspects the BSS Color. If the color differs from its own network, the station classifies it as an Intra-BSS overlap and dynamically raises its Clear Channel Assessment (CCA) detection threshold.
• The station transmits simultaneously on the shared channel, trusting that spatial attenuation will prevent interference!

3. Enterprise Lightweight Access Points & CAPWAP Controllers

Enterprise office networks (Cisco, Aruba, Meraki) do not deploy autonomous home routers:

• They deploy Lightweight Access Points (LWAPs) connected over Gigabit Ethernet to a centralized Wireless LAN Controller (WLC) using the CAPWAP protocol (RFC 5415).
• Radio resource management, channel assignments, transmit power adjustments, and rogue AP detection are executed centrally by software algorithms.
• When an engineer walks across a campus building carrying a laptop, the WLC executes Fast BSS Transition (802.11r): pre-caching cryptographic keys on neighboring APs so handoff occurs in under $30\text{ milliseconds}$ without dropping an active VoIP call.

---

📐 Numerical Applications & Worked Examples

Example 1: NAV Duration Value in the 4-Way RTS/CTS Handshake

Problem Statement: A wireless station (STA A) wishes to transmit a data frame of length $L = 1500\text{ bytes}$ at a data rate of $54\text{ Mbps}$ to an Access Point (AP B). The transmission occurs under the following standardized IEEE 802.11a/g physical layer timing:

• $\text{SIFS} = 16\text{ }\mu\text{s}$
• $\text{CTS Frame Duration} = 44\text{ }\mu\text{s}$
• $\text{ACK Frame Duration} = 44\text{ }\mu\text{s}$

1. Calculate the transmission time $T_{\text{DATA}}$ of the 1500-byte data frame.
2. Determine the exact value (in microseconds) that STA A must encode into the Duration field of its RTS frame.
3. Determine the duration value encoded by AP B in the return CTS frame.

Step-by-Step Solution:

1. Calculate Data Frame Airtime: $L = 1500\text{ bytes} \times 8 = 12,000\text{ bits}$ $T_{\text{DATA}} = \frac{12,000\text{ bits}}{54 \times 10^6\text{ bps}} \approx 222.22\text{ }\mu\text{s}$ Rounding to the nearest microsecond: $T_{\text{DATA}} = 222\text{ }\mu\text{s}$.
2. Calculate RTS Duration Field (Airtime to Reserve):
   • The RTS must reserve the airwaves for the remainder of the handshake: $\text{Duration}_{\text{RTS}} = \text{SIFS} + T_{\text{CTS}} + \text{SIFS} + T_{\text{DATA}} + \text{SIFS} + T_{\text{ACK}}$
   • Substituting the known values: $\text{Duration}_{\text{RTS}} = 16 + 44 + 16 + 222 + 16 + 44 = \mathbf{358\text{ }\mu\text{s}}$
   • All stations overhearing STA A's RTS frame will set their NAV timer to $358\text{ }\mu\text{s}$ and freeze transmission.
3. Calculate CTS Duration Field:
   • When AP B responds with CTS after SIFS, the RTS and first SIFS have completed: $\text{Duration}_{\text{CTS}} = \text{Duration}_{\text{RTS}} - (\text{SIFS} + T_{\text{CTS}}) = 358 - (16 + 44) = \mathbf{298\text{ }\mu\text{s}}$
   • Alternatively: $\text{Duration}_{\text{CTS}} = \text{SIFS} + T_{\text{DATA}} + \text{SIFS} + T_{\text{ACK}} = 16 + 222 + 16 + 44 = \mathbf{298\text{ }\mu\text{s}}$
   • Hidden terminals (such as STA C) overhearing this CTS set their NAV to $298\text{ }\mu\text{s}$, protecting the incoming DATA and outgoing ACK.

---

Example 2: Contention Window Growth Under Binary Exponential Backoff

Problem Statement: An IEEE 802.11b station uses DCF contention where the slot time is $\sigma = 20\text{ }\mu\text{s}$, $CW_{\min} = 31$, and $CW_{\max} = 1023$.

1. If the station experiences 3 consecutive transmission collisions, calculate the contention window ($CW$) for the 4th transmission attempt.
2. Determine the minimum, maximum, and average backoff delay (in microseconds) that the station will wait before attempting the 4th transmission.

Step-by-Step Solution:

1. Calculate Contention Window Size:
   • Initial attempt ($k = 0$): $CW_0 = 31$
   • After 1st collision ($k = 1$): $CW_1 = 2 \cdot CW_0 + 1 = 2(31) + 1 = 63$
   • After 2nd collision ($k = 2$): $CW_2 = 2 \cdot CW_1 + 1 = 2(63) + 1 = 127$
   • After 3rd collision ($k = 3$): $CW_3 = \min\big(2 \cdot CW_2 + 1, \; CW_{\max}\big) = \min(2(127) + 1, 1023) = \mathbf{255}$
   • For the 4th attempt, the station chooses a random backoff integer uniformly from: $\text{Backoff Counter} \in [0, \; 255]$
2. Calculate Backoff Delays:
   • Minimum backoff: $\text{Counter} = 0 \implies \text{Delay}_{\min} = 0 \times 20\text{ }\mu\text{s} = \mathbf{0\text{ }\mu\text{s}}$
   • Maximum backoff: $\text{Counter} = 255 \implies \text{Delay}_{\max} = 255 \times 20\text{ }\mu\text{s} = \mathbf{5,100\text{ }\mu\text{s}} \ (5.1\text{ ms})$
   • Average backoff: $\text{Average Counter} = \frac{CW_3}{2} = \frac{255}{2} = 127.5$ $\text{Delay}_{\text{avg}} = 127.5 \times 20\text{ }\mu\text{s} = \mathbf{2,550\text{ }\mu\text{s}} \ (2.55\text{ ms})$

---

Example 3: RTS/CTS Threshold Trade-Off Analysis

Problem Statement: A wireless station has an RTS threshold of $2000\text{ bytes}$.

• Control frame overhead: $T_{\text{RTS}} = 20\text{ }\mu\text{s}$, $T_{\text{CTS}} = 20\text{ }\mu\text{s}$, $\text{SIFS} = 10\text{ }\mu\text{s}$.
• Frame 1 payload is $100\text{ bytes}$ ($T_{\text{DATA}} = 15\text{ }\mu\text{s}$).
• Frame 2 payload is $2300\text{ bytes}$ ($T_{\text{DATA}} = 345\text{ }\mu\text{s}$). Calculate the percentage protocol airtime overhead incurred by adding the RTS/CTS handshake for Frame 1 and Frame 2, explaining why small packets should bypass RTS/CTS.

Step-by-Step Solution:

1. Handshake Overhead: $\text{Handshake Overhead} = T_{\text{RTS}} + \text{SIFS} + T_{\text{CTS}} + \text{SIFS} = 20 + 10 + 20 + 10 = \mathbf{60\text{ }\mu\text{s}}$
2. Overhead for Frame 1 (100-byte packet):
   • Total channel time without RTS/CTS: $T_{\text{DATA}} = 15\text{ }\mu\text{s}$.
   • Percentage overhead if RTS/CTS were enforced: $\text{Overhead \%} = \frac{60\text{ }\mu\text{s}}{15\text{ }\mu\text{s}} \times 100\% = \mathbf{400\%}$
   • The reservation handshake consumes 400% more time than the actual data, wasting network throughput.
3. Overhead for Frame 2 (2300-byte packet):
   • Total channel time without RTS/CTS: $T_{\text{DATA}} = 345\text{ }\mu\text{s}$.
   • Percentage overhead with RTS/CTS: $\text{Overhead \%} = \frac{60\text{ }\mu\text{s}}{345\text{ }\mu\text{s}} \times 100\% \approx \mathbf{17.4\%}$
   • Spending $17.4\%$ overhead to guarantee that a $345\text{ }\mu\text{s}$ transmission does not collide with hidden terminals provides a massive net gain in channel throughput.

---

🎯 Exam & Interview Pitfall Check

Core Conceptual Questions

• What is the difference between SIFS and DIFS?: SIFS (Short Interframe Space) is shorter than DIFS (DCF Interframe Space). High-priority control frames (ACKs, CTS) only have to wait for SIFS after an ongoing transmission, allowing them to seize the channel before waiting data stations (which must wait for the longer DIFS duration) can start transmitting.
• What is an Exposed Terminal?: An exposed terminal occurs when Station C hears Station B transmitting to Station A, and unnecessarily defers its own transmission to Station D (where D is out of range of B). Virtual carrier sensing (RTS/CTS) mitigates this because C hears B's RTS but does not hear A's CTS, allowing C to deduce that transmitting to D will not cause a collision at A!

Common Interview Traps

• Trap: Believing Wi-Fi Frames Carry Only Two MAC Addresses: An Ethernet frame carries 2 MAC addresses (Source and Destination). An IEEE 802.11 frame header carries up to 4 MAC addresses: Address 1 (Receiver), Address 2 (Transmitter), Address 3 (Destination / BSSID), and Address 4 (Source, used when bridging across wireless distribution systems).
• Trap: Confusing Physical Carrier Sensing with Virtual Carrier Sensing: Physical Carrier Sensing checks the actual electromagnetic radio power received at the antenna (Clear Channel Assessment - CCA). Virtual Carrier Sensing is logical: inspecting the duration field in overheard RTS/CTS frames and counting down the NAV timer.

---

🗺️View Complete Computer Networks Roadmap & Syllabus

← Previous Topic10.3 Physical Layer Hardware: Repeaters, Active Hubs & ModemsNext Topic →Computer Networks Master Curriculum