Scribd
Upload
8 views12 pages

Net 25

The document discusses Wireless LANs, focusing on IEEE 802.11 standards and the challenges of mediating access to shared mediums. It covers transmission methods, including spread spectrum techniques and collision avoidance mechanisms, as well as issues related to hidden and exposed nodes. Additionally, it outlines the process of scanning for access points and the frame format used in wireless communication.

Uploaded by

joke1588r
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
8 views12 pages

Net 25

The document discusses Wireless LANs, focusing on IEEE 802.11 standards and the challenges of mediating access to shared mediums. It covers transmission methods, including spread spectrum techniques and collision avoidance mechanisms, as well as issues related to hidden and exposed nodes. Additionally, it outlines the process of scanning for access points and the frame format used in wireless communication.

Uploaded by

joke1588r
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 12

mputer Networks Prof.

Hema A Murthy

Wireless LANs
• Infrared, radio
– Within room Æ Satellite communication
• IEEE 802.11
– Limited geography
– Primary challenge
• Mediate access to a shared medium

dian Institute of Technology Madras


mputer Networks Prof. Hema A Murthy

Physical Properties
• Three different mechanisms
• Two based on spread spectrum
– Up to 2 Mbps
• One – on diffused infrared
– ½ Mbps

dian Institute of Technology Madras


mputer Networks Prof. Hema A Murthy

Transmission in Wireless Media


• Spread spectrum:
– frequency hopping (randomly choose
frequencies)
– direct sequence
• Direct sequence:
– represent each bit by multiple bits in the
transmitted signal

dian Institute of Technology Madras


mputer Networks Prof. Hema A Murthy

n-Bit Chipping sequence based


transmission
1 0 1 0

random sequence

101100100011
XOR of sequence
dian Institute of Technology Madras
mputer Networks Prof. Hema A Murthy

n-Bit Chipping Sequence


• n – bit chipping code spreads the signal across
frequency band
• that is n time 3 bit chipping sequence.
• 802.11: 79 MHz wide frequency bandwidths
– 2.4 GHz frequency range
– 11 bit chipping sequence
• Collision Avoidance in 802.11
– similar to Ethernet problem

dian Institute of Technology Madras


mputer Networks Prof. Hema A Murthy

Hidden Nodes

A B C D

• Each node has a finite range


• A can reach B, C can also reach B
• A and C want to communicate with B
• A and B are unaware of each other
• Collision can happen at B
• A and C are hidden nodes

dian Institute of Technology Madras


mputer Networks Prof. Hema A Murthy

Exposed Nodes
• Transmission from B to A
– C is aware of this
• Since C in the range of B
– But C can transmit to D

dian Institute of Technology Madras


mputer Networks Prof. Hema A Murthy

Multiple Access Collision


Avoidance
• Sender and receiver exchange control frames:
• Request to Send (RTS) – Sender Æ Receiver
– (includes the time for which it wants to hold the
medium)
• Clear to Send (CTS) – Receiver Æ Sender
– (echoes length field back)
• Any node sees CTS
– close to Receiver therefore cannot access medium for
time = length of frame

dian Institute of Technology Madras


mputer Networks Prof. Hema A Murthy

Multiple Access Collision


Avoidance
• Node sees RTS but not CTS
– It is not close to receiver
– It can transmit to some other node
• Two or more nodes send RTS, donot hear CTS
– Collision, therefore backoff
• Include Ack (MACAW)
– Receiver to sender after frame successfully received
• Issues: Nodes mobile – require a distributed
system

dian Institute of Technology Madras


mputer Networks Prof. Hema A Murthy

Distributed System
• Problem of mobility
– Some nodes are mobile, some are connected to
a wired infrastructure
• Access points (AP)
• Each AP connected to a distribution system
• Each node selects its own AP
DS

AP-1 B AP-2 AP-3 F


A C C H G
D E
dian Institute of Technology Madras
mputer Networks Prof. Hema A Murthy

Scanning for AP
• Node sends a Probe frame
• All APs nodes within reach reply with a probe
response frame
• Node selects one and sends that AP an associate
request
• AP responds with association response
• Node uses this when it moves / changes
• New AP notifies old AP
• Nodes scan APs and APs also send Beacon frames

dian Institute of Technology Madras


mputer Networks Prof. Hema A Murthy

Frame Format

Ctrl Duration Addr 1 Addr 2 Addr 3 Seq ctrl Addr 4 Payload CRC

16 16 48 48 48 16 48 0-18, 32
496

•Addr1 – destination AP •Ctrl


•Addr 2 – destination address •Type - 6 bit (CTS, RTS,
•Addr 3 – source AP Scanning)
•Addr 4 – source address •ToDS - 1 bit
•From DS – 1bit

dian Institute of Technology Madras

You might also like