802.11 – Wireless PHY and MAC Stallings 502-507. Types of 802.11 802.11 Infrared 802.11 FHSS (frequency hopping spread spectrum) 802.11 DSSS (direct sequence.

Slides:



Advertisements
Similar presentations
Nick Feamster CS 4251 Computer Networking II Spring 2008
Advertisements

IEEE CSMA/CA DCF CSE 6590 Fall /7/20141.
Medium Access Issues David Holmer
Networks: Wireless LANs1 Wireless Local Area Networks.
Contents IEEE MAC layer operation Basic CSMA/CA operation
The ALOHA Protocol “Free for all”: whenever station has a frame to send, it does so. –Station listens for maximum RTT for an ACK. –If no ACK after a specified.
Lecture 5: IEEE Wireless LANs (Cont.). Mobile Communication Technology according to IEEE (examples) Local wireless networks WLAN a.
© Kemal AkkayaWireless & Network Security 1 Department of Computer Science Southern Illinois University Carbondale CS591 – Wireless & Network Security.
Comp 361, Spring 20056:Basic Wireless 1 Chapter 6: Basic Wireless (last updated 02/05/05) r A quick intro to CDMA r Basic
Network Technology CSE Network Technology CSE3020 Week 9.
P. Bhagwat Specification overview. P. Bhagwat Specifications PLCP Sublayer PHY layer Management PMD Sublayer MAC sublayer MAC Layer Management.
Wireless Networking So we talked about wired networks. What about wireless?
Networks: Wireless LANs1 Wireless Local Area Networks.
Introduction to Wireless LANs: Supports both Asynchronous data transfer and time bound services Asynchronous: traffic insensitive to time.
Copyright © 2003, Dr. Dharma P. Agrawal and Dr. Qing-An Zeng. All rights reserved. 1 Chapter 6 Multiple Radio Access.
Wireless Local Area Networks
20 – Collision Avoidance, : Wireless and Mobile Networks6-1.
HY539: Mobile Computing and Wireless Networks
Networks: Wireless LANs1 Wireless Local Area Networks.
specifications overview Specifications MAC  Specification of layers below LLC  Associated management/control interfaces MIB Control Applications.
6: Wireless and Mobile Networks6-1 Chapter 6: Wireless and Mobile Networks Background: r # wireless (mobile) phone subscribers now exceeds # wired phone.
110/15/2003CS211 IEEE Standard Why we study this standard: overall architecture physical layer spec. –direct sequence –frequency hopping MAC layer.
5-1 Data Link Layer r Wireless Networks m Wi-Fi (Wireless LAN) Example Problems m RTS/CTS.
Advanced Computer Networks: Wireless Primer 1 Wireless Local Area Networks (WLANs) and Wireless Sensor Networks (WSNs) Primer.
5-1 Data Link Layer r What is Data Link Layer? r Wireless Networks m Wi-Fi (Wireless LAN) r Comparison with Ethernet.
WLAN b a Johan Montelius
8/7/20151 Mobile Computing COE 446 Wireless Multiple Access Tarek Sheltami KFUPM CCSE COE hthttp://faculty.kfupm.edu.sa/coe/tarek/coe446.htm Principles.
6: Wireless and Mobile Networks6-1 Elements of a wireless network network infrastructure wireless hosts r laptop, PDA, IP phone r run applications r may.
Chapter 5 outline 5.1 Introduction and services
Wi-Fi Wireless LANs Dr. Adil Yousif. What is a Wireless LAN  A wireless local area network(LAN) is a flexible data communications system implemented.
protocol continued. DCF The basic idea is non-persistent. Can do an optimization: For a new packet (Q len = 0), the sender needs only wait for.
2/12/20021 IEEE Wireless Local Area Networks The future is wireless Presented by Tamer Khattab and George Wong Prepared for EECE571N - Advanced.
Lecture #2 Chapter 14 Wireless LANs.
Opersating Mode DCF: distributed coordination function
MAC layer Taekyoung Kwon. Media access in wireless - start with IEEE In wired link, –Carrier Sense Multiple Access with Collision Detection –send.
Wireless Medium Access. Multi-transmitter Interference Problem  Similar to multi-path or noise  Two transmitting stations will constructively/destructively.
Ethernet. Problem In an Ethernet, suppose there are three stations very close to each other, A, B and C. Suppose at time 0, all of them have a frame to.
14.1 Chapter 14 Wireless LANs Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
IEEE Wireless LAN Standard. Medium Access Control-CSMA/CA IEEE defines two MAC sublayers Distributed coordination function (DCF) Point coordination.
Wireless and Mobility The term wireless is normally used to refer to any type of electrical or electronic operation which is accomplished without the use.
CSC 581 Communication Networks II Chapter 6c: Local Area Network (Wireless LAN – ) Dr. Cheer-Sun Yang.
IEEE WLAN.
Chapter 6 Medium Access Control Protocols and Local Area Networks Wireless LAN.
5: DataLink Layer 5a-1 Multiple Access protocol. 5: DataLink Layer 5a-2 Multiple Access Links and Protocols Three types of “links”: r point-to-point (single.
Planning and Analyzing Wireless LAN
Wi-Fi. Basic structure: – Stations plus an access point – Stations talk to the access point, then to outside – Access point talks to stations – Stations.
Universität Karlsruhe Institut für Telematik ECE 591
WLAN. Networks: Wireless LANs2 Distribute Coordination Function (DCF) Distributed access protocol Contention-Based Uses CSMA/ CA – Uses both physical.
WLAN.
MAC Sublayer MAC layer tasks: – Control medium access – Roaming, authentication, power conservation Traffic services – DCF (Distributed Coordination.
Medium Access Control in Wireless networks
Wireless Protocols. 2 Outline MACA 3 ISM: Industry, Science, Medicine unlicensed frequency spectrum: 900Mhz, 2.4Ghz, 5.1Ghz, 5.7Ghz.
MAC Layer Protocols for Wireless Networks. What is MAC? MAC stands for Media Access Control. A MAC layer protocol is the protocol that controls access.
MAC for WLAN Doug Young Suh Last update : Aug 1, 2009 WLAN DCF PCF.
1 Chapter 4 MAC Layer – Wireless LAN Jonathan C.L. Liu, Ph.D. Department of Computer, Information Science and Engineering (CISE), University of Florida.
CSMA/CA Simulation  Course Name: Networking Level(UG/PG): UG  Author(s) : Amitendu Panja, Veedhi Desai  Mentor: Aruna Adil *The contents in this ppt.
DSSS PHY packet format Synchronization SFD (Start Frame Delimiter)
IEEE Wireless LAN. Wireless LANs: Characteristics Types –Infrastructure based –Ad-hoc Advantages –Flexible deployment –Minimal wiring difficulties.
CS440 Computer Networks 1 Wireless LAN (IEEE ) Neil Tang 10/01/2008.
EA C451 (Internetworking Technologies)
Lecture 27 WLAN Part II Dr. Ghalib A. Shah
Specification overview
Chapter 6 Medium Access Control Protocols and Local Area Networks
Specification overview
Specification overview
Specification overview
Specification overview
Specification overview
MITP 413: Wireless Technologies Week 8
Specification overview
Presentation transcript:

– Wireless PHY and MAC Stallings

Types of Infrared FHSS (frequency hopping spread spectrum) DSSS (direct sequence spread spectrum) b HR-DSSS (HR = high rate) a OFDM (orthogonal frequency division multiplexing)

Spread Spectrum Put the signal onto many frequencies, not just one. Two approach –Frequency hopping (Hedy Lamarr) Pseudorandom number generator dictates which frequency to use. Stay at a frequency for a short “dwell time.” –Direct sequence spread spectrum Each symbol is spread over many frequencies b uses Barker code +1 – – –1 –1 –1. If 1 is to be sent, then +1 – – –1 –1 –1 is sent to the modulator. If 0 is to be sent, then is sent to the modulator. (Like CDMA?)

Collision Avoidance in Two approaches –DCF (Distributed Coordination Function) No RTS/CTS CSMA/CA (Carrier sense multiple access with collision avoidance (not /CD = carrier detection which is very difficult in wireless). If a node wants to broadcast, it checks if the channel is idle for a little while (DIFS). If not, use binary exponential backoff in slot times (like Ethernet). If the channel is idle, it broadcasts. When the receiver gets the frame, it check the CRC and if all is ok, it transmits an ACK. If the source fails to get an ACK, it will resend the (after getting control of the channel again).

Collision Avoidance in DCF – problems(is DCF better than Aloha?) –It is possible that two nodes are listening at the same time. But this is not very likely if there is not too much traffic. Remember, propagation delay is very small. –The hidden node problem. Suppose that node A want to transmit to node B and while node C is transmitting to node B….. B A C

Collision Avoidance in DCF with RTS/CTS –Suppose that node C wants to transmit to node B. First, C broadcast a RTS (request to send). If B is not currently hearing another broadcast (i.e., B gets the RTS), then B broadcasts a CTS (clear to send) to C. When the packet has arrived, an ACK is sent. Now, if A then wants to broadcast, it would have heard the CTS. So, instead, node A waits….

Collision Avoidance in DCF with RTS/CTS –Suppose that node C wants to transmit to node B. First C broadcast a RTS (request to send) which includes information on how long the broadcast will last. If B is not currently hearing another broadcast (i.e., B gets the RTS), then B broadcasts a CTS (clear to send) to C along with C’s estimate of the time the broadcast will last. When the packet has arrived, an ACK is sent to Now, if A then wants to broadcast, it would have heard the CTS. So it waits for the amount of time specified in the CTS. Suppose you hear a RTS but no CTS, should you wait the length of time in the RTS?

Collision Avoidance in DCF with RTS/CTS 1.If a node wants to transmit, it checks that the channel is idle. And continues to check it for DIFS seconds. If it remains idle for this whole period it transmits. 2.Otherwise, it waits until it is idle and then wait a random amount of time Back off = Random(0,CW) * SlotTime Random(0,CW) is a random number between 0 and CW. 3.After waiting, goto 1. channel busy DIFS channel checked channel still idle Slot time backoff transmit if idle

DCF: CW calculation CW may be increased when the channel fails to be clear when checked. CW may be decreased when the channel is idle when checked. Channel found to be busy CW max CW Channel found to be idle CW min could be zero

DCF: When do you sense the channel? When you want to send a frame and –No CTS and RTS indicates that there might be an ongoing transmission. –There is no ongoing backoff. The network allocation vector (NAV) is an internal structure that records when the channel might be free. If the NAV indicates that the channel is busy, then we say that the virtual channel is busy. A transmission is only attempted when both the physical sense and the NAV agree that the channel might be idle.

Flowchart of CSMA/CA start NAV=0 ? sense channel yes Channel Idle ? transmit frame yes collision ? No - success random backoff no ?

Fragmenting in DCF The BER for wireless channels may be large. So frames are fragmented to increase throughput… But if a many fragments are used, then the overhead of gaining access to the channel is large. To alleviate this problem, two different time intervals are specified. –For a node broadcasts, it first checks if the channel is idle for DIFS. –Thus, after an ACK, the channel is guaranteed to be idle for at least DIFS. However, if another fragment needs to be sent or resent, or if an frame is to be resent (because the ACK did not arrive), it will be broadcast after waiting SIFS (short interfame spacing). With SIFS < DIFS.

Timing SIFS = 16  s, PIFS = 25  s, DIFS = 34  s, EIFS = 43  s, Slottime = 9  s begin to sense channel DIFS decide that the channel to be idle RTSCTS SIFS DATAACK How long does it take to send an RTA, CTA, Data or ACK? Later SIFS channel sense Sending a single data packet SIFS DIFS RTSCTS SIFS Frag 1ACK SIFS Frag 2ACK SIFS Sending a fragmented data packet

DIFS RTSCTS SIFS DataACK SIFS Sending back to back packets DIFS Wait an random backoff, i.e., random(0,CW)*slottime) But don’t increment/decrement CW. RTSCTS SIFS

Problems with RTS/CTS

Frame Layout for b Sync 128 bits SFD 16 bits PLCPMPDU physical layer convergence protocol MAC protocol data unit Physical layer convergence protocol always transmitted at 1Mbps Signal 8 bits Preamble Enable synchronization contains the bit rate of the MPDU 1Mbps, 2Mbps, 5.5Mbps, 11Mbps Service 8 bits Length 16 bits CRC 16 bits time in microseconds to transmit the MPDU total time to transmit PLCP = ?

Frame Layout for b PLCPMPDU physical layer convergence protocol MAC protocol data unit MPDU data frame

Frame Layout for b RTS frame control 2 bytes X…X duration 2 bytes receiver address 6 bytes transmitter address 6 bytes error detection 4 bytes CTS ACK frame control 2 bytes X…X duration 2 bytes receiver address 6 bytes error detection 4 bytes frame control 2 bytes X…X duration 2 bytes receiver address 6 bytes error detection 4 bytes

What is the overhead for a data packet and for a fragment?

PCF Definition AP access point – the central controller of the nodes. Often these are connected to the wired network. The access point polls each node to ask if it wants to send something. Hence, no collisions. When a node moves closer from one AP domain to another, it waits for a beacon. The beacon invites nodes to sign up for polling service.