Media Access Control Chapter 6

1. Media Access ControlChapter 6 TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: AAAAAAAA

2. Home Automation • Light • Temperature • Sun-Blinds • Fans • Energy Monitoring • Audio/Video • Security • Intrusion Detection • Fire Alarm

3. Rating • Area maturity • Practical importance • Theory appeal First steps Text book No apps Mission critical Boooooooring Exciting

4. Overview • Motivation • Classification • MAC layer techniques • Case study: 802.11

5. Motivation • Can we apply media access methods from fixed networks? • Example CSMA/CD • Carrier Sense Multiple Access with Collision Detection • send as soon as the medium is free, listen into the medium if a collision occurs (original method in IEEE 802.3) • Problems in wireless networks • signal strength decreases quickly with distance • senders apply CS and CD, but the collisions happen at receivers • Energy efficiency: having the radio turned on costs almost as much energy as transmitting, so to seriously save energy one needs to turn the radio off!

6. Motivation – Hidden Terminal Problem • A sends to B, C cannot receive A • C wants to send to B, C senses a “free” medium (CS fails) • collision at B, A cannot receive the collision (CD fails) • A is “hidden” for C A B C

7. Motivation – Exposed Terminal Problem • B sends to A, C wants to send to D • C has to wait, CS signals a medium in use • since A is outside the radio range of C waiting is not necessary • C is “exposed” to B D A B C

8. Motivation - Near and Far Terminals • Terminals A and B send, C receives • the signal of terminal B hides A’s signal • C cannot receive A • This is also a severe problem for CDMA networks • precise power control required A B C

9. Access Methods • SDMA (Space Division Multiple Access) • segment space into sectors, use directed antennas • Use cells to reuse frequencies • FDMA (Frequency Division Multiple Access) • assign a certain frequency to a transmission channel • permanent (radio broadcast), slow hopping (GSM), fast hopping (FHSS, Frequency Hopping Spread Spectrum) • TDMA (Time Division Multiple Access) • assign a fixed sending frequency for a certain amount of time • CDMA (Code Division Multiple Access) • Combinations!

10. Multiplexing: Space Multiplexing channels ki • Multiplex channels (k) in four dimensions • space (s) • time (t) • frequency (f) • code (c) • Goal: multiple use of a shared medium • Important: guard spaces needed! • Example: radio broadcast k1 k2 k3 k4 k5 k6 c t c s1 t s2 f f c t s3 f

11. Example: Cellular network • Simplified hexagonal model • Signal propagation ranges: Frequency reuse only with a certain distance between the base stations • Can you reuse frequencies in distance 2 or 3 (or more)? • Graph coloring problem • Interference from neighbor cells (other color) can be controlled with transmit and receive filters Example: fixed frequency assignment for reuse with distance 2

12. Signal-to-Noise • Digital techniques can withstand asignal to noise ratio (S/N) of approximately 9 dB, depending on the techniques… • Assume the path loss exponent  = 3. Then,which gives D/R = 3. Reuse distance of 2 might just work… • Remark: Signal-to-noise is also known as, e.g. carrier-to-interference ratio C/I. D R

13. Frequency Division Multiplex (FDM) • Separation of the whole spectrum into smaller frequency bands • A channel gets a certain band of the spectrum for the whole time + no dynamic coordination necessary + works also for analog signals – waste of bandwidth if traffic is distributed unevenly – inflexible • Example:broadcast radio k1 k2 k3 k4 k5 k6 c f t

14. FDD/FDMA - general scheme, example GSM @ 900Mhz f 960 MHz 124 200 kHz 935.2 MHz 1 20 MHz 915 MHz 124 890.2 MHz 1 t

15. Time Division Multiplex (TDM) • A channel gets the whole spectrum for a certain amount of time + only one carrier in the medium at any time + throughput high even for many users – precise synchronization necessary • Example: Ethernet k1 k2 k3 k4 k5 k6 c f t

16. TDD/TDMA - general scheme, example DECT 417 µs 1 2 3 11 12 1 2 3 11 12 t downlink uplink

17. Time and Frequency Division Multiplex • Combination of both methods • A channel gets a certain frequency band for some time + protection against frequency selective interference + protection against tapping + adaptive – precise coordination required • Example: GSM k1 k2 k3 k4 k5 k6 c f t

18. Code Division Multiplex (CDM) • Each channel has a unique code • All channels use the same spectrum at the same time + bandwidth efficient + no coordination or synchronization + hard to tap + almost impossible to jam – lower user data rates – more complex signal regeneration • Example: UMTS • Spread spectrum • U. S. Patent 2‘292‘387,Hedy K. Markey (a.k.a. Lamarr or Kiesler) and George Antheil (1942) k1 k2 k3 k4 k5 k6 c f t

19. Code Division Multiple Access (CDMA) • Example: Direct Sequence Spread Spectrum (DSSS) • Each station is assigned an m-bit code (or chip sequence) • Typically m = 64, 128, ... (in our examples m = 4, 8, …) • To send 1 bit, station sends chip sequence • To send 0 bit, station sends complement of chip sequence • Example: 1 MHz band with 100 stations • FDMA • each station a 10 kHz band • assume that you can send 1 bit/Hz: 10 kbps • CDMA • each station uses the whole 1 MHz band • less than 100 chips per channel: more than 10 kbps

20. CDMA Basics

21. CDMA Example • Assume that all stations are perfectly synchronous • Assume that all codes are pair wise orthogonal • Assume that if two or more stations transmit simultaneously, the bipolar signals add up linearly • Example • S = (+ – + – + – + –) • T = (+ + – – – + + –) • U = (+ – – + – – + +) • Check that codes are pair wise orthogonal • E.g., if S,T,U transmit simultaneously, a receiver receives R = S+T+U = (+3, –1, –1, –1, –1, –1, +3, –1)

22. CDMA Example (2) • To decode a received signal R for sender s, one needs to calculate the normalized inner product R∙S. • R∙S = (+3, –1, –1, –1, –1, –1, +3, –1)∙(+ – + – + – + –)/8 = (+3+1–1+1–1+1+3+1)/8 = 8/8 = 1 … by accident? • R∙S = (S+T+U)∙S = S∙S +T∙S +U∙S = 1 + 0 + 0 = 1 • With orthogonal codes we can safely decode the original signals

23. CDMA: Construction of orthogonal codes with m chips • Note that we cannot have more than m orthogonal codes with m chips because each code can be represented by a vector in the m-dimensional space, and there are not more than m orthogonal vectors in the m-dimensional space. • Walsh-Hadamard codes can be constructed recursively(for m = 2k): • Code tree:

24. CDMA: How much noise can we tolerate? • We now add random noise to before we receive the signal: • R’ = R + N,where N is an m-digit noise vector. • Assume that chipping codes are balanced (as many “+” as “–”) • If N = (α, α, …, α) for any (positive or negative) α, then the noise N will not matter when we decode the received signal. • R’∙S = (R+N)∙S = S∙S +(orthogonal codes)∙S +N∙S = 1 + 0 + 0 = 1 • How much random (white) noise can we tolerate?(See exercises)

25. Cocktail party as analogy for multiplexing • Space multiplex: Communicate in different rooms • Frequency multiplex: Use soprano, alto, tenor, or bass voices to define the communication channels • Time multiplex: Let other speaker finish • Code multiplex: Use different languages and hone in on your language. The “farther apart” the languages the better you can filter the “noise”: German/Japanese better than German/Dutch.Can we have orthogonal languages?

26. Comparison SDMA/TDMA/FDMA/CDMA [J.Schiller]

27. MAC Alphabet Soup [TU Delft] μ-MAC Aloha AI-LMAC B-MAC BitMAC BMA CMAC Crankshaft CSMA-MPS CSMA/ARC DMAC E2-MAC EMACs PicoRadio PMAC PMAC‘ Preamble sampling Q-MAC Q-MAC’ QMAC RATE EST RL-MAC RMAC RMAC’ S-MAC S-MAC/AL f-MAC FLAMA Funneling-MAC G-MAC HMAC LMAC LPL MMAC nanoMAC O-MAC PACT PCM PEDAMACS SMACS SCP-MAC SEESAW Sift SS-TDMA STEM T-MAC TA-MAC TRAMA U-MAC WiseMAC X-MAC Z-MAC

28. Traditional MAC Protocol Classification • Centralized/Single-Hop Protocols • A base station coordinates all traffic • Contention Protocols (CSMA) • Transmit when you feel like transmitting • Retry if collision, try to minimize collisions, additional reservation modes • Problem: Receiver must be awake as well • Scheduling Protocols (TDMA) • Use a “pre-computed” schedule to transmit messages • Distributed, adaptive solutions are difficult • Hybrid protocols • E.g. contention with reservation  scheduling • Specific (“cross-layer”) solutions, e.g. Dozer for data gathering

29. Polling mechanisms • If one terminal can be heard by all others, this “central” terminal (a.k.a. base station) can poll all other terminals according to a certain scheme • Use a scheme known from fixed networks • The base station chooses one address for polling from the list of all stations • The base station acknowledges correct packets and continues polling the next terminal • The cycle starts again after polling all terminals of the list

30. Example: Inhibit Sense Multiple Access (ISMA) • Current state of the medium is signaled via a “busy tone” • the base station signals on the downlink (base station to terminals) whether the medium is free • terminals must not send if the medium is busy • terminals can access the medium as soon as the busy tone stops • the base station signals collisions and successful transmissions via the busy tone and acknowledgements, respectively (media access is not coordinated within this approach) • Example: for CDPD (USA, integrated into AMPS)

31. TDMA – Motivation • System with n stations (0,1,2,…,n–1) and one shared channel • The channel is a perfect broadcast channel • Single transmissions are received by everyother station. • No hidden or exposed terminal problem. • Interference if more than one station transmits. • Round robin algorithm: station k sends after station k–1 (mod n) • If a station does not need to transmit data, then it sends “ε” • There is a maximum message size m that can be transmitted • How efficient is round robin? What if a station breaks or leaves? All deterministic TDMA protocols have these (or worse) problems

32. TDMA – Slotted Aloha • We assume that the stations are perfectly synchronous • In each time slot each station transmits with probability p. • In Slotted Aloha, a station can transmit successfully with probability at least 1/e, or about 36% of the time.

33. Backoff Protocols • Backoff protocols rely on acknowledgements only. • Binary exponential backoff • If a packet has collided k times, we set p = 2-k • Or alternatively: wait from random number of slots in [1..2k] • It has been shown that binary exponential backoff is not stable for any arrival rate λ > 0 (if there are infinitely many potential stations) [Proof sketch: with very small but positive probability you go to a bad situation with many waiting stations, and from there you get even worse with a potential function argument – sadly the proof is too intricate to be shown in this course ] • Interestingly when there are only finite stations, binary exponential backoff becomes unstable with λ > 0.568; Polynomial backoff however, remains stable for any λ < 1.

34. Demand Assigned Multiple Access (DAMA) • Channel efficiency is only 36% for Slotted Aloha, and even worse for backoff protocols. • Practical systems therefore use reservation whenever possible. • But: Every scalable system needs an Aloha style component. • Reservation: • a sender reserves a future time-slot • sending within this reserved time-slot is possible without collision • reservation also causes higher delays • Examples for reservation algorithms on the following slides • typical scheme for satellite systems

35. collisions t Aloha Aloha Aloha Aloha reserved reserved reserved reserved DAMA: Explicit Reservation • Aloha mode for reservation: competition for small reservation slots, collisions possible. • Reserved mode for data transmission within successful reserved slots (no collisions possible). • It is important for all stations to keep the reservation list consistent at any point in time and, therefore, all stations have to synchronize from time to time.

36. DAMA: Implicit Reservation • A certain number of slots form a frame, frames are repeated. • Stations compete for empty slots according to the slotted aloha principle. • Once a station reserves a slot successfully, this slot is automatically assigned to this station in all following frames. • Competition for this slots starts again as soon as the slot was empty in the last frame . reservation 1 2 3 4 5 6 7 8 time-slot ACDABA-F frame1 A C D A B A F ACDABA-F frame2 A C A B A AC-ABAF- frame3 A B A F collision at reservation attempts A---BAFD frame4 A B A F D ACEEBAFD frame5 A C E E B A F D t

37. DAMA: Reservation TDMA • Every frame consists of n mini-slots and x data-slots • Every station has its own mini-slot and can reserve up to k data-slots using this mini-slot (i.e. x = nk). • Other stations can send data in unused data-slots according to a round-robin sending scheme (best-effort traffic) Nk data-slots n=6, k=2 N mini-slots reservationsfor data-slots other stations can use free data-slots based on a round-robin scheme

38. Multiple Access with Collision Avoidance (MACA) • Use short signaling packets for collision avoidance • Request (or ready) to send RTS: a sender requests the right to send from a receiver with a short RTS packet before it sends a data packet • Clear to send CTS: the receiver grants the right to send as soon as it is ready to receive • Signaling packets contain • sender address • receiver address • packet size • Example: Wireless LAN (802.11) as DFWMAC

39. A A C C MACA examples • MACA avoids the problem of hidden terminals • A and C want to send to B • A sends RTS first • C waits after receiving CTS from B • MACA avoids the problem of exposed terminals • B wants to send to A,and C to D • now C does not have to wait as C cannot receive CTS from A RTS CTS CTS B RTS RTS CTS D B

40. Energy Efficient MAC Protocols • In sensor networks energy is often more critical than throughput. • The radio component should be turned off as much as possible. • Energy management considerations have a big impact on MAC protocols. • Idle listening costs about as much energy as transmitting • In the following we present a few ideas, stolen from some known protocols that try to balance throughput and energy consumption. • S-MAC, T-MAC, B-MAC, or WiseMAC • Many of the hundreds of MAC protocols that were proposed have similar ideas…

41. Sensor MAC (S-MAC) • Coarse-grained TDMA-like sleep/awake cycles. • All nodes choose and announce awake schedules. • synchronize to awake schedules of neighboring nodes. • Uses RTS/CTS to resolve contention during listen intervals. • And allows interfering nodes to go to sleep during data exchange. increased latency frame sleep sleep listen listen time

42. Sensor MAC (S-MAC) • Problem: Nodes may have to follow multiple schedules to avoid network partition. Schedule 1+2 Schedule 2 Schedule 1 • A fixed sleep/awake ratio is not always optimal. • Variable load in the network. • Idea: Adapt listen interval dependent on the current network load. • T-MAC

43. Low Power Listening (B-MAC) • Nodes wake up for a short period and check for channel activity. • Return to sleep if no activity detected. • If a sender wants to transmit a message, it sends a long preamble to make sure that the receiver is listening for the packet. • preamble has the size of a sleep interval • Very robust • No synchronization required • Instant recovery after channel disruption preamble data listen channel sniff

44. Low Power Listening (B-MAC) • overhearing problem • Problem: All nodes in the vicinity of a sender wake-up and wait for the packet. • Solution 1: Send wake-up packets instead of preamble, wake-up packets tell when data is starting so that receiver can go back to sleep as soon as it received one wake-up packet. • Solution 2: Just send data several times such that receiver can tune in at any time and get tail of data first, then head. • Communication costs are mostly paid by the sender. • The preamble length can be much longer than the actual data length. • Idea: Learn wake-up schedules from neighboring nodes. • Start sending preamble just before intended receiver wakes up. • WiseMAC • encode wake-up pattern in ACK message

45. Hybrid Protocols • Protocols may use information from upper layers to further improve their performance. • Information about neighborhood • Routing policies • Minimize costly overhearing of neighboring nodes • Inform them to change their channel sniff patterns • Use randomization to resolve schedule collisions optimization for WiseMAC schedule collision like in Dozer

46. Standards • IEEE 802.15.4 • physical & MAC layer • star, clique (peer-to-peer), and cluster tree topology • Full function (with coordinator) and reduced function nodes • Unslotted mode (nonbeacon) • CSMA/CA: Send when medium is free • Slotted mode (beacon) • Similar to beacons in Dozer: Coordinator sends beacon to indicate period when nodes can send • Protocols on higher layers using 802.15.4 • ZigBee • Goals: low cost, low power (not really), plug-in and short range • TSMP (Time Synchronized Mesh Protocol) • Goals: reliability and low power

47. Case Study: 802.11 – Design Goals • Global, seamless operation • Low power consumption for battery use • No special permissions or licenses required • Robust transmission technology • Simplified spontaneous cooperation at meetings • Easy to use for everyone, simple management • Interoperable with wired networks • Security (no one should be able to read my data), privacy (no one should be able to collect user profiles), safety (low radiation) • Transparency concerning applications and higher layer protocols, but also location awareness if necessary

48. 802.11 Characteristics + Very flexible (economical to scale) + Ad-hoc networks without planning possible + (Almost) no wiring difficulties (e.g. historic buildings, firewalls) + More robust against disasters or users pulling a plug – Low bandwidth compared to wired networks (20 vs. 1000 Mbit/s) – Many proprietary solutions, especially for higher bit-rates, standards take their time – Products have to follow many national restrictions if working wireless, it takes a long time to establish global solutions (IMT-2000) – Security – Economy

49. 802.11 Infrastructure vs. ad hoc mode Infrastructure network AP: Access Point AP AP wired network AP Ad-hoc network

50. 802.11 – Protocol architecture server fixed terminal mobile terminal infrastructure network application application access point TCP TCP IP IP LLC LLC LLC 802.11 MAC 802.11 MAC 802.3 MAC 802.3 MAC 802.11 PHY 802.11 PHY 802.3 PHY 802.3 PHY