Radio and Medium Access Control 1 Radio Properties

  • Slides: 48
Download presentation
Radio and Medium Access Control 1

Radio and Medium Access Control 1

Radio Properties 2

Radio Properties 2

Some Basic Concepts • • • RSSI dbm Noise floor: see wikipedia CCA thresholding

Some Basic Concepts • • • RSSI dbm Noise floor: see wikipedia CCA thresholding algorithms Duty cycle LPL 3

Signal Transmission 4 Ref: Fig. 2. 9 of “Wireless Communications and Networks” by William

Signal Transmission 4 Ref: Fig. 2. 9 of “Wireless Communications and Networks” by William Stallings

Packet Reception and Transmission • Ref: [Hardware_1] Figure 5 5

Packet Reception and Transmission • Ref: [Hardware_1] Figure 5 5

Signal • An electromagnetic signal – A function of time – Also a function

Signal • An electromagnetic signal – A function of time – Also a function of frequency • The signal consists of components of different frequencies 6

802. 15. 4 Physical Layer 7

802. 15. 4 Physical Layer 7

d. B • d. B (Decibel) – Express relative differences in signal strength –

d. B • d. B (Decibel) – Express relative differences in signal strength – d. B = 10 log 10 (p 1/p 2) – d. B = 0: no attenuation. p 1 = p 2 – 1 d. B attenuation: 0. 79 of the input power survives: 10 * log 10(1/0. 79) – 3 d. B attenuation: 0. 5 of the input power survives: 10 * log 10(1/0. 5) – 10 d. B attenuation: 0. 1 of the input power survives: 10 * log 10(1/0. 1) • http: //en. wikipedia. org/wiki/Decibel • http: //www. sss-mag. com/db. html 8

d. Bm • • The referenced quantity is one milliwatt(m. W) d. Bm =

d. Bm • • The referenced quantity is one milliwatt(m. W) d. Bm = 10 log 10 (p 1/1 m. W) 0 d. Bm: p 1 is 1 m. W -80 d. Bm: p 1 is 10 -11 W = 10 p. W • http: //en. wikipedia. org/wiki/DBm 9

Received Signal Strength Indicator (RSSI) • The strength of a received RF signal •

Received Signal Strength Indicator (RSSI) • The strength of a received RF signal • Many current platforms provide hardware indicator – CC 2420, the radio chip of Mica. Z and Telos. B, provides RSSI indicator and LQI (Link Quality Indicator) 10

LQI (Link Quality Indicator) • A measure of chip error rate • Error rate

LQI (Link Quality Indicator) • A measure of chip error rate • Error rate – The rate at which errors occur – Error • 0 is transmitted while 1 is received • 1 is transmitted while 0 is received 11

Noise Floor • The measure of the signal created from the sum of all

Noise Floor • The measure of the signal created from the sum of all the noise sources and unwanted signals 12

Signal Noise Ratio (SNR) • The ratio of the power in a signal to

Signal Noise Ratio (SNR) • The ratio of the power in a signal to the power contained in the noise that is present • Typically measured at the receiver • Take CC 2420 as the example: – Noise Floor: the RSSI register from the CC 2420 chip when not receiving a packet • For example -98 d. Bm – The strength field from the received packet: RSSI of the received packet 13

Radio Spectrum Frequency Allocation • http: //www. ntia. doc. gov/osmhome/allochrt. pdf 14

Radio Spectrum Frequency Allocation • http: //www. ntia. doc. gov/osmhome/allochrt. pdf 14

Radio Irregularity • Spherical radio range is not valid • When an electromagnetic signal

Radio Irregularity • Spherical radio range is not valid • When an electromagnetic signal propagate, the signal may be – Diffracted – Reflected – Scattered • Radio irregularity and variations in packet loss in different directions ref: [radio_1]

Radio Signal Property • Anisotropic Signal Strength: Different path losses in different directions Figure

Radio Signal Property • Anisotropic Signal Strength: Different path losses in different directions Figure 1: Signal Strength over Time in Four Directions [Radio_1] Figure 1 16

Radio Signal Property • Anisotropic Packet Loss Ratio: Packet Reception Ratio (PRR) varies in

Radio Signal Property • Anisotropic Packet Loss Ratio: Packet Reception Ratio (PRR) varies in different directions [Radio_1]: Figure 3 17

Radio Signal Property • Anisotropic Radio Range: The communication range of a mote is

Radio Signal Property • Anisotropic Radio Range: The communication range of a mote is not uniform [Radio_1]: Figure 4 18

Medium Access Control (MAC) 19

Medium Access Control (MAC) 19

Introduction • A radio channel cannot be accessed simultaneously by two or more nodes

Introduction • A radio channel cannot be accessed simultaneously by two or more nodes that are in a radio interference range – Nodes may transmit at the same time on the same channel • Medium Access Control – On top of Physical layer – Control access to the radio channel 20

MAC Protocol Requirements • Energy Efficiency – Sources of energy waste • Collision, Idle

MAC Protocol Requirements • Energy Efficiency – Sources of energy waste • Collision, Idle Listening, Overhearing, and Control Packet Overhead • Effective collision avoidance – When and how the node can access the medium and send its data • Efficient channel utilization at low and high data rates – Reflects how well the entire bandwidth of the channel is utilized in communications • Tolerant to changing RF/Networking conditions • Scalable to large number of nodes Ref: [MAC_2] Section I, II 21

Two Basic Classes of MAC Protocol – Slotted and Sampling • Slotted Protocols –

Two Basic Classes of MAC Protocol – Slotted and Sampling • Slotted Protocols – Nodes divides time into slots – Radio can be in receive mode, transmit mode, or powered off mode – Communication is synchronized – Data transfers occur in “slots” – TDMA, IEEE 802. 15. 4, S-MAC, T-MAC, etc. • Also Ref: J. Polastre Dissertation – Section 2. 4: http: //www. polastre. com/papers/polastre-thesisfinal. pdf [MAC_3]: Section 4 22

Two Basic Classes of MAC Protocol – Slotted and Sampling • Sampling Protocols –

Two Basic Classes of MAC Protocol – Slotted and Sampling • Sampling Protocols – Nodes periodically wake up, and only start receiving data if they detect channel activity – Communication is unsynchronized – Data transfer wakes up receiver – Must send long, expensive messages to wake up neighbors – B-MAC, Preamble sampling, LPL, etc. 23

Slotted Protocol Example: 802. 15. 4 • Each node beacons on its own schedule

Slotted Protocol Example: 802. 15. 4 • Each node beacons on its own schedule • Other nodes synchronize with the received Beacons sleep Beacon Data Ack Beacon CSMA Contention Period Superframe Duration Beacon Frame Duration 24

IEEE 802. 15. 4 Superframe 25

IEEE 802. 15. 4 Superframe 25

Using 802. 15. 4 send done stop radio superframe complete beacon RX Ack Data

Using 802. 15. 4 send done stop radio superframe complete beacon RX Ack Data TX first packet Update schedule packet RX RF Channel Ack received TX done 15. 4 send done reliability set 15. 4 Stop radio Neighbors are messages pending? Data Beacon start radio send beacon If yes, wake up SP packet received Coordinator wake for beacon TX beacon period SP 26

Main MAC Protocols Wireless medium access Centralized Distributed Schedulebased Fixed assignment Demand assignment Contentionbased

Main MAC Protocols Wireless medium access Centralized Distributed Schedulebased Fixed assignment Demand assignment Contentionbased Schedulebased Fixed assignment Contentionbased Demand assignment 27

Scheduled Protocols • TDMA divides the channel into N time slots [MAC_2]: Figure 1

Scheduled Protocols • TDMA divides the channel into N time slots [MAC_2]: Figure 1 28

Contention-based Protocols • A common channel is shared by all nodes and it is

Contention-based Protocols • A common channel is shared by all nodes and it is allocated on-demand • A contention mechanism is employed • Advantages over scheduled protocols – – Scale more easily More flexible as topologies change No requirement to form communication clusters Do not require fine-grained time synchronization • Disadvantage – Inefficient usage of energy • Node listen at all times • Collisions and contention for the media [MAC_2]: Section IV 29

CSMA • Listening before transmitting • Listening (Carrier Sense) – To detect if the

CSMA • Listening before transmitting • Listening (Carrier Sense) – To detect if the medium is busy • Hidden Terminal Problem [MAC_2]: Section IV 30

Hidden Terminal Problem • Node A and C cannot hear each other • Transmission

Hidden Terminal Problem • Node A and C cannot hear each other • Transmission by node A and C can collide at node B • On collision, both transmissions are lost • Node A and C are hidden from each other [MAC_2]: Section IV 31

CSMA-CA • CA – Collision Avoidance: to address the hidden terminal problem • Basic

CSMA-CA • CA – Collision Avoidance: to address the hidden terminal problem • Basic mechanism – Establish a brief handshake between a sender and a receiver before transmission – The transmission between a sender and a receiver follows RTS-CTS-DATA-ACK [MAC_2]: Section IV 32

Centralized Medium Access • Idea: Have a central station control when a node may

Centralized Medium Access • Idea: Have a central station control when a node may access the medium – Example: Polling, centralized computation of TDMA schedules – Advantage: Simple, quite efficient (e. g. , no collisions), burdens the central station • Not directly feasible for non-trivial wireless network sizes • But: Can be quite useful when network is somehow divided into smaller groups – Clusters, in each cluster medium access can be controlled centrally – compare Bluetooth piconets, for example ! Usually, distributed medium access is considered 33

Schedule- vs. Contention-based MACs • Schedule-based MAC – A schedule exists, regulating which participant

Schedule- vs. Contention-based MACs • Schedule-based MAC – A schedule exists, regulating which participant may use which resource at which time (TDMA component) – Typical resource: frequency band in a given physical space (with a given code, CDMA) – Schedule can be fixed or computed on demand • Usually: mixed – difference fixed/on demand is one of time scales – Usually, collisions, overhearing, idle listening no issues – Needed: time synchronization! 34

Schedule- vs. Contention-based MACs • Contention-based protocols – Risk of colliding packets is deliberately

Schedule- vs. Contention-based MACs • Contention-based protocols – Risk of colliding packets is deliberately taken – Hope: coordination overhead can be saved, resulting in overall improved efficiency – Mechanisms to handle/reduce probability/impact of collisions required – Usually, randomization used somehow 35

Possible Solutions • CSMA (Carrier Sense Multiple Access) – Advantage: • No clock synchronization

Possible Solutions • CSMA (Carrier Sense Multiple Access) – Advantage: • No clock synchronization required • No global topology information required – Disadvantage • Hidden terminal problem: serious throughput degradation • RTS/CTS can alleviate hidden terminal problem, but incur high overhead 36

Possible Solutions • TDMA (Time-division multiple access) – Advantage • Solve the hidden terminal

Possible Solutions • TDMA (Time-division multiple access) – Advantage • Solve the hidden terminal problem without extra message overhead – Disadvantage • It is challenging to find an efficient time schedule • Need clock synchronization – High energy overhead • Handling dynamic topology change is expensive • Given low contention, TDMA gives much lower channel utilization and higher delay 37

Effective Throughput CSMA vs. TDMA IDEAL CSMA Channel Utilization Do not use any topology

Effective Throughput CSMA vs. TDMA IDEAL CSMA Channel Utilization Do not use any topology or time synch. Info. Thus, more robust to time synch. errors and changes. # of Contenders TDMA Sensitive to Time synch. errors, Topology changes, Slot assignment errors. 38

MAC Energy Usage Four important sources of wasted energy in WSN: – – Idle

MAC Energy Usage Four important sources of wasted energy in WSN: – – Idle Listening (required for all CSMA protocols) Overhearing (since RF is a broadcast medium) Collisions (Hidden Terminal Problem) Control Overhead (e. g. RTS/CTS or DATA/ACK) [MAC_2]: Section II. B 39

B-MAC • A set of primitives that other protocols may use as building block

B-MAC • A set of primitives that other protocols may use as building block • Provide basic CSMA access • Optional link level ACK, no link level RTS/CTS • CSMA backoffs configurable by higher layers • Carrier Sensing using Clear Channel Assess (CCA) • Sleep/Wake scheduling using Low Power Listening (LPL) • Ref: Section 1, 3 of ref. [MAC_1] • LPL: See Section 2. 1 of ref. [Energy_1] 40

B-MAC • Does not solve hidden terminal problem • Duty cycles the radio through

B-MAC • Does not solve hidden terminal problem • Duty cycles the radio through periodic channel sampling – Low Power Listening (LPL) 41

B-MAC Clear Channel Assessment A packet arrives between 22 and 54 ms. The middle

B-MAC Clear Channel Assessment A packet arrives between 22 and 54 ms. The middle graph shows the output of a thresholding CCA algorithm. ( 1: channel clear, 0: channel busy) • Ref: Section 1, 3 of ref. [MAC_1] - Before transmission – take a sample of the channel - If the sample is below the current noise floor, channel is clear, send immediately. - If five samples are taken, and no outlier found => channel busy, take a random backoff - Noise floor updated when channel is known to be clear e. g. just after packet transmission 42

A Trace of Power Consumption [MAC_1]: Figure 3 43

A Trace of Power Consumption [MAC_1]: Figure 3 43

B-MAC Low Power Listening Check Interval Carrier sense Receiver Sender Receive data Long Preamble

B-MAC Low Power Listening Check Interval Carrier sense Receiver Sender Receive data Long Preamble Data Tx Similar to ALOHA preamble sampling Wake up every Check-Interval Sample Channel using CCA If no activity, go back to sleep for Check. Interval Else start receiving packet Preamble > Check-Interval Goal: minimize idle listening 44

Low Power Listening • Purpose – Energy cost = RX + TX + Listen

Low Power Listening • Purpose – Energy cost = RX + TX + Listen – Save energy • How – Duty cycle the radio while ensuring reliable message delivery – Periodically wake up, sample channel, and sleep • The duty cycling receiver node performs short and periodic receive checks • If the channel is checked every 100 ms – The preamble must be at least 100 ms long for a node to wake up, detect activity on the channel, receive the preamble, and then receive the message. 45

802. 15. 4 Frame Format • Page 36 of CC 2420 Data Sheet 46

802. 15. 4 Frame Format • Page 36 of CC 2420 Data Sheet 46

Tiny. OS Implementation of CSMA o CC 2420 - CCA • Hardware – CC

Tiny. OS Implementation of CSMA o CC 2420 - CCA • Hardware – CC 2420 has CCA as a pin that can be sampled to determine if another node is transmitting – See CC 2420 Data Sheet – Figure 1 CC 2420 Pinout • Software – CC 2420 Transmit has the option to send the message with or without CCA • See CC 2420 Transmit. P. send(); http: //www. mailarchive. com/tinyos-

Tiny. OS Implementation of CSMA of CC 2420 - Ack • Hardware Ack –

Tiny. OS Implementation of CSMA of CC 2420 - Ack • Hardware Ack – If MDMCTRL 0. AUTOACK of CC 2420 is enabled • Software Ack – SACK strobe in CC 2420 Receive. P can be used to set software ack https: //www. millennium. berkeley. e du/pipermail/tinyos-help/2008 -