WiFi 802.11

Wi fi 802.11
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
• 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.
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.
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.
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.
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.
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
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.
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
1 de 10

Recomendados

Application layer protocols por
Application layer protocolsApplication layer protocols
Application layer protocolsJUW Jinnah University for Women
14.7K vistas30 diapositivas
IEEE 802.11 wifi por
IEEE 802.11 wifiIEEE 802.11 wifi
IEEE 802.11 wifiParnal Vast
1.8K vistas33 diapositivas
wireless network IEEE 802.11 por
 wireless network IEEE 802.11 wireless network IEEE 802.11
wireless network IEEE 802.11Shreejan Acharya
25.9K vistas22 diapositivas
SPINS: Security Protocols for Sensor Networks por
SPINS: Security Protocols for Sensor NetworksSPINS: Security Protocols for Sensor Networks
SPINS: Security Protocols for Sensor NetworksAbhijeet Awade
4.2K vistas17 diapositivas
IEEE 802.11 Architecture and Services por
IEEE 802.11 Architecture and ServicesIEEE 802.11 Architecture and Services
IEEE 802.11 Architecture and ServicesSayed Chhattan Shah
63K vistas51 diapositivas
Paging and Location Update por
Paging and Location UpdatePaging and Location Update
Paging and Location UpdateAbidullah Zarghoon
45.1K vistas21 diapositivas

Más contenido relacionado

La actualidad más candente

Cdma2000 por
Cdma2000Cdma2000
Cdma2000vivek kumar
15.7K vistas8 diapositivas
Ieee 802.11 wireless lan por
Ieee 802.11 wireless lanIeee 802.11 wireless lan
Ieee 802.11 wireless lanParthipan Parthi
2.7K vistas30 diapositivas
IEEE 802.11 por
IEEE 802.11IEEE 802.11
IEEE 802.11Abhishek Pachisia
31.2K vistas20 diapositivas
Mobile Station por
Mobile StationMobile Station
Mobile StationSokunth Che
3.5K vistas12 diapositivas
cell splitting and sectoring por
cell splitting and sectoringcell splitting and sectoring
cell splitting and sectoringShwetanshu Gupta
104.8K vistas16 diapositivas
Switching por
SwitchingSwitching
SwitchingShankar Gangaju
6.3K vistas44 diapositivas

La actualidad más candente(20)

Mobile Station por Sokunth Che
Mobile StationMobile Station
Mobile Station
Sokunth Che3.5K vistas
cell splitting and sectoring por Shwetanshu Gupta
cell splitting and sectoringcell splitting and sectoring
cell splitting and sectoring
Shwetanshu Gupta104.8K vistas
Ethernet Computer network por miteshppt
Ethernet Computer networkEthernet Computer network
Ethernet Computer network
miteshppt2.9K vistas
Connection( less & oriented) por ymghorpade
Connection( less & oriented)Connection( less & oriented)
Connection( less & oriented)
ymghorpade5.8K vistas
GO BACK N PROTOCOL por shayan singla
GO BACK N PROTOCOLGO BACK N PROTOCOL
GO BACK N PROTOCOL
shayan singla37.5K vistas
TCP & UDP ( Transmission Control Protocol and User Datagram Protocol) por Kruti Niranjan
TCP & UDP ( Transmission Control Protocol and User Datagram Protocol)TCP & UDP ( Transmission Control Protocol and User Datagram Protocol)
TCP & UDP ( Transmission Control Protocol and User Datagram Protocol)
Kruti Niranjan11.5K vistas

Similar a WiFi 802.11

wireless lan presentation.ppt por
wireless lan presentation.pptwireless lan presentation.ppt
wireless lan presentation.pptHODElex
82 vistas93 diapositivas
ieee 802.4 por
ieee 802.4ieee 802.4
ieee 802.4LautaroRondan
8 vistas60 diapositivas
Wireless LANs(IEEE802.11) Architecture por
Wireless LANs(IEEE802.11) Architecture Wireless LANs(IEEE802.11) Architecture
Wireless LANs(IEEE802.11) Architecture Raj vardhan
1.6K vistas46 diapositivas
Wireless presentation-1 por
Wireless presentation-1Wireless presentation-1
Wireless presentation-1Mayur Garg
1.7K vistas64 diapositivas
ieeeeeee802.ppt por
ieeeeeee802.pptieeeeeee802.ppt
ieeeeeee802.pptLautaroRondan
1 vista42 diapositivas
Computer networks wireless lan,ieee-802.11,bluetooth por
Computer networks  wireless lan,ieee-802.11,bluetoothComputer networks  wireless lan,ieee-802.11,bluetooth
Computer networks wireless lan,ieee-802.11,bluetoothDeepak John
4.5K vistas62 diapositivas

Similar a WiFi 802.11(20)

wireless lan presentation.ppt por HODElex
wireless lan presentation.pptwireless lan presentation.ppt
wireless lan presentation.ppt
HODElex82 vistas
Wireless LANs(IEEE802.11) Architecture por Raj vardhan
Wireless LANs(IEEE802.11) Architecture Wireless LANs(IEEE802.11) Architecture
Wireless LANs(IEEE802.11) Architecture
Raj vardhan1.6K vistas
Wireless presentation-1 por Mayur Garg
Wireless presentation-1Wireless presentation-1
Wireless presentation-1
Mayur Garg1.7K vistas
Computer networks wireless lan,ieee-802.11,bluetooth por Deepak John
Computer networks  wireless lan,ieee-802.11,bluetoothComputer networks  wireless lan,ieee-802.11,bluetooth
Computer networks wireless lan,ieee-802.11,bluetooth
Deepak John4.5K vistas
lecture666.ppt por rajucs
lecture666.pptlecture666.ppt
lecture666.ppt
rajucs1 vista
813 Ieeestds 090330072026 Phpapp01 por techbed
813 Ieeestds 090330072026 Phpapp01813 Ieeestds 090330072026 Phpapp01
813 Ieeestds 090330072026 Phpapp01
techbed692 vistas
Pmit lecture 03_wlan_wireless_network_2016 por Chyon Ju
Pmit lecture 03_wlan_wireless_network_2016Pmit lecture 03_wlan_wireless_network_2016
Pmit lecture 03_wlan_wireless_network_2016
Chyon Ju256 vistas
Lecture6(Wireless La Ns) por Ashish Khare
Lecture6(Wireless La Ns)Lecture6(Wireless La Ns)
Lecture6(Wireless La Ns)
Ashish Khare252 vistas
Unit IV_Flow.pptx por TejasRao8
Unit IV_Flow.pptxUnit IV_Flow.pptx
Unit IV_Flow.pptx
TejasRao83 vistas
Research Inventy : International Journal of Engineering and Science por inventy
Research Inventy : International Journal of Engineering and ScienceResearch Inventy : International Journal of Engineering and Science
Research Inventy : International Journal of Engineering and Science
inventy333 vistas
Different protocols for data communication networks por Nt Arvind
Different protocols for data communication networks Different protocols for data communication networks
Different protocols for data communication networks
Nt Arvind413 vistas
UnIT VIII manet por sangusajjan
UnIT VIII manetUnIT VIII manet
UnIT VIII manet
sangusajjan1.5K vistas

Más de selvakumar_b1985

Triggering transmission por
Triggering transmissionTriggering transmission
Triggering transmissionselvakumar_b1985
2.7K vistas5 diapositivas
Subnetting por
SubnettingSubnetting
Subnettingselvakumar_b1985
4.3K vistas12 diapositivas
Email Security por
Email SecurityEmail Security
Email Securityselvakumar_b1985
1.3K vistas6 diapositivas
RIP - Routing Information Protocol por
RIP - Routing Information ProtocolRIP - Routing Information Protocol
RIP - Routing Information Protocolselvakumar_b1985
5.8K vistas13 diapositivas
Physical Mediums por
Physical MediumsPhysical Mediums
Physical Mediumsselvakumar_b1985
1.5K vistas17 diapositivas
OSPF - Routing Protocol por
OSPF - Routing ProtocolOSPF - Routing Protocol
OSPF - Routing Protocolselvakumar_b1985
3.4K vistas16 diapositivas

Más de selvakumar_b1985(20)

RIP - Routing Information Protocol por selvakumar_b1985
RIP - Routing Information ProtocolRIP - Routing Information Protocol
RIP - Routing Information Protocol
selvakumar_b19855.8K vistas

Último

REACTJS.pdf por
REACTJS.pdfREACTJS.pdf
REACTJS.pdfArthyR3
39 vistas16 diapositivas
Field Programmable Gate Arrays : Architecture por
Field Programmable Gate Arrays : ArchitectureField Programmable Gate Arrays : Architecture
Field Programmable Gate Arrays : ArchitectureUsha Mehta
33 vistas74 diapositivas
Solution Challenge Introduction.pptx por
Solution Challenge Introduction.pptxSolution Challenge Introduction.pptx
Solution Challenge Introduction.pptxGDSCCEC
13 vistas16 diapositivas
Module-1, Chapter-2 Data Types, Variables, and Arrays por
Module-1, Chapter-2 Data Types, Variables, and ArraysModule-1, Chapter-2 Data Types, Variables, and Arrays
Module-1, Chapter-2 Data Types, Variables, and ArraysDemian Antony D'Mello
19 vistas44 diapositivas
02. COLEGIO - KIT SANITARIO .pdf por
02. COLEGIO - KIT SANITARIO .pdf02. COLEGIO - KIT SANITARIO .pdf
02. COLEGIO - KIT SANITARIO .pdfRAULALEJANDROMALDONA
5 vistas7 diapositivas
GPS Survery Presentation/ Slides por
GPS Survery Presentation/ SlidesGPS Survery Presentation/ Slides
GPS Survery Presentation/ SlidesOmarFarukEmon1
9 vistas13 diapositivas

Último(20)

REACTJS.pdf por ArthyR3
REACTJS.pdfREACTJS.pdf
REACTJS.pdf
ArthyR339 vistas
Field Programmable Gate Arrays : Architecture por Usha Mehta
Field Programmable Gate Arrays : ArchitectureField Programmable Gate Arrays : Architecture
Field Programmable Gate Arrays : Architecture
Usha Mehta33 vistas
Solution Challenge Introduction.pptx por GDSCCEC
Solution Challenge Introduction.pptxSolution Challenge Introduction.pptx
Solution Challenge Introduction.pptx
GDSCCEC13 vistas
Different type of computer networks .pptx por nazmul1514788
Different  type of computer networks .pptxDifferent  type of computer networks .pptx
Different type of computer networks .pptx
nazmul151478820 vistas
IRJET-Productivity Enhancement Using Method Study.pdf por SahilBavdhankar
IRJET-Productivity Enhancement Using Method Study.pdfIRJET-Productivity Enhancement Using Method Study.pdf
IRJET-Productivity Enhancement Using Method Study.pdf
SahilBavdhankar11 vistas
GDSC Mikroskil Members Onboarding 2023.pdf por gdscmikroskil
GDSC Mikroskil Members Onboarding 2023.pdfGDSC Mikroskil Members Onboarding 2023.pdf
GDSC Mikroskil Members Onboarding 2023.pdf
gdscmikroskil75 vistas
Building source code level profiler for C++.pdf por ssuser28de9e
Building source code level profiler for C++.pdfBuilding source code level profiler for C++.pdf
Building source code level profiler for C++.pdf
ssuser28de9e12 vistas
Ansari: Practical experiences with an LLM-based Islamic Assistant por M Waleed Kadous
Ansari: Practical experiences with an LLM-based Islamic AssistantAnsari: Practical experiences with an LLM-based Islamic Assistant
Ansari: Practical experiences with an LLM-based Islamic Assistant
M Waleed Kadous13 vistas
taylor-2005-classical-mechanics.pdf por ArturoArreola10
taylor-2005-classical-mechanics.pdftaylor-2005-classical-mechanics.pdf
taylor-2005-classical-mechanics.pdf
ArturoArreola1040 vistas
Details of Acoustic Liner for selection of material por rafiqalisyed
Details of Acoustic Liner for selection of materialDetails of Acoustic Liner for selection of material
Details of Acoustic Liner for selection of material
rafiqalisyed5 vistas
MongoDB.pdf por ArthyR3
MongoDB.pdfMongoDB.pdf
MongoDB.pdf
ArthyR353 vistas
Basic Design Flow for Field Programmable Gate Arrays por Usha Mehta
Basic Design Flow for Field Programmable Gate ArraysBasic Design Flow for Field Programmable Gate Arrays
Basic Design Flow for Field Programmable Gate Arrays
Usha Mehta24 vistas
MODULE-1 CHAPTER 3- Operators - Object Oriented Programming with JAVA por Demian Antony D'Mello
MODULE-1 CHAPTER 3- Operators - Object Oriented Programming with JAVAMODULE-1 CHAPTER 3- Operators - Object Oriented Programming with JAVA
MODULE-1 CHAPTER 3- Operators - Object Oriented Programming with JAVA
Web Dev Session 1.pptx por VedVekhande
Web Dev Session 1.pptxWeb Dev Session 1.pptx
Web Dev Session 1.pptx
VedVekhande23 vistas

WiFi 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