This document discusses Wi-Fi (IEEE 802.11) standards. It describes the six physical layer standards used in Wi-Fi networking and their key characteristics. It also discusses Wi-Fi frame formats and how Wi-Fi networks use carrier sense multiple access with collision avoidance (CSMA/CA) to prevent collisions between transmitting nodes.

1. Wi fi 802.11

2. Wi-fi
• IEEE 802.11 – Wi-Fi
Wi-Fi
– Owned by a group called Wi-Fi alliances.
– Signals are propagating through space.
Physical Properties:
– Runs over six physical layer standards.
802.11 physical standards
Spread Spectrum based Diffused Infrared based
Original 802.11 with frequency hopping
Original 802.11 with Direct sequence
802.11b
802.11a
802.11g

3. • Original 802.11 with frequency hopping
 Over 79, 1 MHz wide frequency bandwidths.
 Provide up to 2Mbps.
 Runs at 2.4GHz frequency band of electromagnetic spectrum.
• Original 802.11 with Direct Sequence
 11 – bit chipping sequence is used.
 Provide up to 2Mbps.
 Runs at 2.4 GHz frequency band of electromagnetic spectrum
• 802.11b
 Variant of direct sequence spread spectrum provides up to 11Mbps.
 Runs at 2.4 GHz frequency band of electromagnetic spectrum.
• 802.11a
 Orthogonal frequency division multiplexing (OFDM) is used.
 Delivers up to 54Mbps.
 Runs in 5GHz band.
 In 5GHZ band, interference is less, but absorption is more and it is limited to line of sight communication.
• 802.11g
 Backward compatible with 802.11b.
 Uses OFDM and delivers up to 54Mbps.
 Runs in 2.4GHz band.

4. Collision Avoidance
Hidden node Problem
 Here A and C are both with in the range of B but not each other.
 Suppose both A and C want to communicate with B and so they each send it a
frame.
• A and C are unaware of each other since their signals do not carry that far
• These two frames collide with each other at B
– But unlike an Ethernet, neither A nor C is aware of this collision
• A and C are said to hidden nodes with respect to each other.

5. Exposed Node Problem
 Here B can exchange frames with A & C, but it cannot reach D and C can reach B &
D but not A.
 Suppose B is sending to A. Node C is aware of this communication because it hears
B’s transmission. It would be a mistake for C to conclude that it cannot transmit to
anyone just because it can hear B’s transmission.
 Suppose C wants to transmit to node D. This is not a problem since C’s transmission
to D will not interfere with A’s ability to receive from B.
 This problem is called exposed node problem.

6. Multiple Access with Collision Avoidance (MACA)
 To address the hidden node and exposed node problem 802.11 uses MACA.
 Here sender and receiver exchange control information before transmission of data.
 This exchange informs all nearby nodes that a transmission is about to begin
 Sender transmits a Request to Send (RTS) frame to the receiver.
• The RTS frame includes a field that indicates how long the sender wants to hold the medium
• Length of the data frame to be transmitted.
 Receiver replies with a Clear to Send (CTS) frame
• This frame echoes this length field back to the sender.
 Any node that sees the CTS frame knows that, it is close to the receiver, therefore it
cannot transmit for the period of time it takes to send a frame of the specified length.
 Any node that sees the RTS frame but not the CTS frame is not close enough to the
receiver to interfere with it, and so is free to transmit.
 Receiver sends an ACK to the sender after successfully receiving a frame
 All nodes must wait for this ACK before trying to transmit
 If two or more nodes detect an idle link and try to transmit an RTS frame at the same
time, their RTS frame will collide with each other.
 But 802.11 does not support collision detection
• So the senders realize the collision has happened when they do not receive the CTS frame after a period of
time
• In this case, they each wait a random amount of time before trying again.
• The amount of time a given node delays is defined by the same exponential backoff algorithm used on the
Ethernet.

7. Distribution System
 Base station based topology.
 Here some nodes are allowed to roam and some nodes are connected to wired
infrastructure called base stations or Access points (AP) and they are connected to each
other. This network is called as distribution system.
 Distribution network could be a Ethernet or token ring and distribution network runs at
layer 2of ISO architecture.
 Two nodes can communicate each other, if they are in the within reach of each other.
 Each node is associated with one access point.

8. Communication from A to E
 Node A sends frame to its Access point (AP - 1)
 AP-1 forwards the frame across the distribution system to AP-3, which finally transmits the
frame to E.
Scanning
– Technique for selecting AP is called scanning.
Steps,
 The node sends a Probe frame.
 All APs with in the reach reply with a Probe Response frame.
 The node selects one of the access points, and sends that AP an Association Request frame.
 The AP replies with an Association Response frame.
– A node engages this step whenever it joins the network as well as when it need a new
AP.
– Whenever the node acquires a new AP, the new AP notifies the old AP of the change
through distribution system.
Types,
 Active scanning
 Passive scanning

9. Active scanning
• Whenever a node moves from the cell serviced by one AP (AP-1) to the cell serviced by the
another AP (AP-2),
 It sends Probe frames;
 AP-2 give a response by Probe response frames and the node associates with that
access point.
figure. Node Mobility
Passive scanning
• APs periodically send a Beacon frame – that advertises the capability of the AP (transmission
rate supported by the AP)
• A node can change to the AP based on the Beacon frame simply by sending an Association
Request frame back to the AP.

10. Frame Format
 Control
- Contains three sub fields.
Type (6 bit) – indicates whether the frame carries data , is an RTS frame or CTS frame, or is used by scanning
algorithm
ToDS (1 bit), FromDS (1 bit)
– Both bits are 0, one node is sending directly to another.
– Both bits are 1, message went from the wireless node onto the distribution system and
then from the distribution system to another wireless node.
 Addr1, Addr2, Addr3, Addr4
– If both DS bits are 0,
Addr1 – target node
Addr2 – Source node
– If both DS bits are 1,
Addr1 – Ultimate destination
Addr2 – Immediate sender
Addr3 – Intermediate destination
Addr4 – Original Source