Professional Documents
Culture Documents
Overhearing (since RF is a broadcast medium) Collisions (Hidden Terminal Problem) Control Overhead (e.g. RTS/CTS or DATA/ACK)
Power Measurements
Motivation
Duty cycle: ratio between listen time to total listen sleep cycle Central idea: reduce the duty cycle by turning off the radio for part of the time Approaches:
TDMA Schedule contention periods
Random-backoff and carrier-sensing Simple, no time synch, and robust to network changes High control overhead (for two-hop collision avoidance) High idle listening and overhearing overheads
Solve this by duty cycling
TDMA Based
Nodes within interference range transmit during different times, so collision free Requires time synch and not robust to changes. Low throughput and high latency even during low contention. Low idle listening and overhearing overheads
Wake up and listen only during its neighbor transmission
S-MAC
Main goal reduce power consumption Three major components:
Periodic sleep-listen Collision and overhearing avoidance Message passing
S-MAC Design
listen
Listen Period Sleep/Wake schedule synchronization with neighbours Receive packets from neighbours Sleep Period
sleep
listen
sleep
S-MAC Design
Schedules can differ, prefer neighbouring nodes to have same schedule
Node 1 Node 2
listen sleep listen listen sleep sleep listen sleep
Schedule 1
Schedule 2
S-MAC Design
Maintaining Schedule
To update schedule by sending a SYNC packet periodically
S-MAC Design
Collision Avoidance Problem : Multiple senders want to talk Options: Contention vs TDMA Solution :Similar to IEEE 802.11 ad hoc mode (DCF)
Physical and virtual carrier sense Randomozed backoff time RTS/CTS for hidden terminal problem RTS/CTS/DATA/ACK sequence
S-MAC Design
Overhearing Avoidance Problem: Receive packets destined to others Solution : Sleep while neighbours talk Who should sleep
All immediate neighbors of sender and receiver
S-MAC Design
Message Passing
Only one RTS packet and one CTS packet are used To avoid large control overhead and long delay ACK would be sent after each data fragment To avoid fragment loss or error To Prevent hidden terminal problem After the neighbor node hears the RTS and CTS, it will go to sleep for the time that is needed to transmit all the fragments (using the duration field)
Advantages/Disadvantages
Energy waste caused by idle listening is reduced by sleep schedules. Sleep and listen periods are predefined and constant which decreases the efficiency of the algorithm under
Timeout-MAC (T-MAC)
Proposed to enhance the poor results of S-MAC protocol under variable traffic load. Listen period ends when no activation event has occurred for a time threshold TA. Reduce idle listening by transmitting all messages in bursts of variable length, and sleeping between bursts. times out on hearing nothing.
S-MAC Vs T-MAC
The SMAC duty cycle ;The arrows indicate transmitted and received messages; note that the messages come closer.
Advantages/Disadvantages
Gives better result under variable load. Suffers from early sleeping problem node goes to sleep when a neighbor still has messages for it.
WiseMAC
All nodes defined to have two communication channels. Data channel uses TDMA
WiseMAC
Advantages/Disadvantages
Dynamic preamble length adjustment results in better performance. Conflict when one node starts to send the preamble to a node that is already receiving another nodes transmission where the preamble sender is not within range. Hidden terminal problem
D MAC
Type
CSMA, Contention -based
Adaptivity to Changes
Good
Advantages
Energy waste caused by idle listening is reduced by sleep schedules. Simplicity.
Disadvantages
Sleep and listen periods are predefined and constant, which decreases the efficiency of the algorithm under variable traffic load. Early sleeping problem.
T-MAC
Good
WiseMAC
Good
Dynamic preamble length adjustment results in better performance under variable traffic conditions.
Decentralized sleep-listen scheduling results in different sleep and wake-up times for each neighbor of a node. Hidden terminal problem Without considering the transmissions and receptions, the duty cycle is at least 12.5 %, which is a considerably high value.
TRAMA
TDMA/CSMA
Good
Higher percentage of sleep time and less collision probability is achieved compared to CSMA based protocols.
SIFT
Good
Increased idle listening caused by listening to all slots before sending. System-wide time synchronization is needed for slotted contention windows.
Maximum available power (PA) route: Route 2 Minimum energy (ME) route: Route 1 Minimum hop (MH) route: Route 3 Minimum PA node route: Route 3
Solve implosion and overlap Problem Aggregation based on same attribute of phenomenon Specifics (the locations of reporting sensor nodes) should not be left out
Protocol Classification
(1)
Proactive First Compute all Routes; Then Route Reactive Compute Routes On-Demand Hybrid First Compute all Routes; Then Improve While Routing
Protocol Classification
Direct
(Fast Drainage; Small Scale)
(2)
Flat (Equal)
Random Indirect Route
(Fast Drainage Around Sink; Medium Scale)
Clustering (Hierarchical)
Route Through Distinguished Nodes
Protocol Classification
(3)
Unicast One-to-One Message Passing Multicast (actually Local Broadcast) Node-to-Neighbors Message Passing Broadcast Full-Mesh Source to Everyone
Protocol Classification
(4)
Low Energy Adaptive Clustering Hierarchy - LEACH (2) Main Drawbacks Hot Spot Problem
(Nodes on a path from an eventcongested area to the sink may drain) Inadequate for Time-Critical Applications Stationary Sink Maybe Unpractical Basic Algorithm assumes any node can communicate with sink limited scale
2 - PEGASIS
(1)
Protocol Highlights Token-Passing Chain-Based Nodes die in random Stationary Nodes and Sink Every node have a global network map Data Fusion Greedy chain construction
2 - PEGASIS
(2)
Main Drawbacks Stationary Nodes Global Information Limited Scale: Information travels many nodes Assumes any node can communicate with sink
2 - PEGASIS
(3)
Main Procedures: Greedy Algorithm Construct Chain Start at a node far from sink and gather everyone neighbor by neighbor Node i (mod N) is the leader in round i
Nodes passes token thru the chain to leader from both sides Each node fuse its data with the rest Leader transmit to sink
2 - PEGASIS
Illustrations
(4)
2 - PEGASIS
Illustrations
(5)
3 - SPIN
(1)
Protocol Highlights
Network-wide Broadcast Limited by Negotiation and using Local Communication Flooding problems solved:
Implosion same data from many neighbors Detection of overlapping regions Excessive resources consumption (Blindness)
3 - SPIN
(2)
Main Procedures Broadcast - Limited Scale every node handles O(n) messages Data is updated throughout network unnecessary in many cases Network lifetime - not clear High degree nodes = High power needs
3 - SPIN
(3)
Main Procedures
SPIN-PP (Point-to-Point Communication) Data is described by meta-data ADV msg. Node has data sends ADV to neighbors If neighbor do not have data sends REQ Node responds by sending the DATA This process continues around the network Nodes may aggregate their data to ADV In a Lossy Network ADV may be repeated periodically and REQ if not answered
3 - SPIN
(4)
Main Procedures
SPIN-BC (Local Broadcast Communication)
ADV and DATA sending like PP (but in B.C.) Since only one REQ answer is needed, any node waits a random interval and B.C. REQ only if none was received yet. The rest like SPIN-PP
3 - SPIN
Illustration s
(5)
ADV Node with data
3 - SPIN
Illustration s
(5)
REQ Node with data
3 - SPIN
Illustrations
(5)
DATA Node with data
3 - SPIN
Illustrations
(5)
ADV Node with data
3 - SPIN
Illustrations
Already has data (or dead)
(5)
Node with data
REQ
3 - SPIN
Illustrations
(5)
Node with data
DATA
Thank you