CS计算机代考程序代写 algorithm flex EECE 5155 Wireless Sensor Networks

EECE 5155 Wireless Sensor Networks
(and The Internet of Things)
Prof. Francesco Restuccia Email: f.restuccia@northeastern.edu Office: 318 Dana
February 17, 2021
1
Dr. Francesco Restuccia, EECE 5155 Wireless Sensor Networks and the Internet of Things
1

Contention-Based Mac Protocols: S-MAC
2
Dr. Francesco Restuccia, EECE 5155 Wireless Sensor Networks and the Internet of Things
2

S-MAC: Sleep MAC
W. Ye, J. Heidemann, D. Estrin, , “Medium Access Control with Coordinated Adaptive Sleeping for Wireless Sensor Networks,’‘ IEEE/ACM Trans. on Networking, June 2004.
➢ Problem: “Idle Listening” consumes significant energy
➢ Solution: Periodic listen and sleep
sleep sleep
time
➢ During sleeping, radio is turned off
➢ Reduce duty cycle to ~ 10% (Listen for 200ms and sleep
listen
listen
for 2s)
Latency
Energy
3
Dr. Francesco Restuccia, EECE 5155 Wireless Sensor Networks and the Internet of Things
3

S-MAC
➢ Each node goes into periodic sleep mode during which it switches the radio off and sets a timer to awake later
➢ When the timer expires it wakes up and listens to the channel, to see if any other node wants to talk to it
➢ The duration of the sleep and listen cycles are application dependent and they are set the same for all nodes
➢ Requires a periodic synchronization among nodes to take care of any type of clock drift
4
Dr. Francesco Restuccia, EECE 5155 Wireless Sensor Networks and the Internet of Things
4

Periodic Sleep and Listen
➢ All nodes are free to choose their own listen/sleep schedules
➢ To reduce control overhead, only neighboring nodes are synchronized together
➢ Preferably, they listen at the same time and go to sleep at the same time
5
Dr. Francesco Restuccia, EECE 5155 Wireless Sensor Networks and the Internet of Things
5

Synchronization
➢ SYNC packets are exchanged periodically to maintain schedule synchronization
SYNC PACKET
Sender Node ID
Next Sleep Time
➢ SYNCHRONIZATION PERIOD: Period for a node to send a SYNC packet
➢ Receivers will adjust their timer counters immediately after they receive the SYNC packet
6
Dr. Francesco Restuccia, EECE 5155 Wireless Sensor Networks and the Internet of Things
6

Periodic Listen and Sleep
7
Dr. Francesco Restuccia, EECE 5155 Wireless Sensor Networks and the Internet of Things
7

Maintaining Synchronization
8
Dr. Francesco Restuccia, EECE 5155 Wireless Sensor Networks and the Internet of Things
8

Choosing and Maintaining Schedules
➢ Each node maintains a schedule table that stores schedules of all its known neighbors
➢ For initial schedule, do:
1. A node first listens to the medium for a certain amount of time
(at least the synchronization period)
2. If it does not hear a schedule from another node, it randomly chooses a schedule and broadcasts its schedule with a SYNC packet immediately
3. This node is called a Synchronizer
4. If a node receives a schedule from a neighbor before choosing its own schedule, it just follows this neighbor’s schedule, i.e. becomes a Follower, waits for a random delay and broadcasts its schedule
9
Dr. Francesco Restuccia, EECE 5155 Wireless Sensor Networks and the Internet of Things
9

Coordinated Sleeping

➢ ➢
In a large network, we cannot guarantee that all nodes follow the same schedule
The node on the border will follow both schedules
When it broadcasts a packet, it needs to do it twice, first
for nodes on schedule 1 and then for those on schedule 2 Schedule
Schedule 1
2
10
Dr. Francesco Restuccia, EECE 5155 Wireless Sensor Networks and the Internet of Things
10

Collision Avoidance
➢ S-MAC is based on contention, i.e., if multiple neighbors want to talk to a node at the same time, they will try to send when the node starts listening
➢ Similar to IEEE 802.11, i.e. use RTS/CTS mechanism to address the hidden terminal problem
➢ Perform carrier sense before initiating a transmission
11
Dr. Francesco Restuccia, EECE 5155 Wireless Sensor Networks and the Internet of Things
11

Collision Avoidance
➢ If a node fails to get the medium, it goes to sleep and wakes up when the receiver is free and listening again
➢ Broadcast packets are sent without using RTS/CTS
➢ Unicast data packets follow the sequence of RTS/CTS/DATA/ACK
between the sender and receiver
➢ Duration field in each transmitted packet indicates how long the remaining transmission will be so if a node receives a packet destined to another node, it knows how long it has to keep silent
➢ The node records this value in network allocation vector (NAV) and sets a timer for it
12
Dr. Francesco Restuccia, EECE 5155 Wireless Sensor Networks and the Internet of Things
12

Collision Avoidance
➢ When a node has data to send, it first looks at NAV
➢ If this value is not zero, then medium is busy (virtual
carrier sense)
➢ The medium is determined as free if both virtual and physical carrier sense indicate the medium is free
➢ All immediate neighbors of both the sender and receiver should sleep after they hear RTS or CTS packet until the current transmission is over
13
Dr. Francesco Restuccia, EECE 5155 Wireless Sensor Networks and the Internet of Things
13

Message Passing Feature
➢ Long messages are broken down into smaller packets and sent continuously once the channel is acquired by RTS/CTS handshake
➢ Increases the sleep time, but leads to fairness problems
14
Dr. Francesco Restuccia, EECE 5155 Wireless Sensor Networks and the Internet of Things
14

Msg Passing
➢ S-MAC message passing


RTS
21
Data
19
Data
17
Data
CTS 20
ACK 18
ACK 16
ACK
0
15
Dr. Francesco Restuccia, EECE 5155 Wireless Sensor Networks and the Internet of Things
15
1

S-MAC – Performance Evaluation
➢ Topology: Two-hop network with two sources and two sinks
➢ Sources periodically generate a sensing message which is divided
into fragments
➢ Traffic load is changed by varying the inter-arrival period of the messages: (for inter-arrival period of 5s, message is generated every 5s by each source. Here it varies between 1-10s)
16
Dr. Francesco Restuccia, EECE 5155 Wireless Sensor Networks and the Internet of Things
16

S-MAC – Example
➢ In each test, there are 10 messages generated on each source node
➢ Each message has 10 fragments, and each fragment has 40 bytes (200 data packets to be passed from sources to sinks)
➢ The total energy consumption of each node is measured for sending this fixed amount of data
17
Dr. Francesco Restuccia, EECE 5155 Wireless Sensor Networks and the Internet of Things
17

Experiments
Average energy consumption in the source nodes A&B
1800
1600
1400
1200
1000
800
600
400
200
S-MAC without
periodic sleep
S-MAC with Periodic Sleep
0 2 4 6 8 10
Message inter-arrival period (traffic load) (second) (small value → heavy traffic load)
18
Dr. Francesco Restuccia, EECE 5155 Wireless Sensor Networks and the Internet of Things
18
802.11-like protocol without sleep
Energy consumption (mJ)

Experiments
➢ S-MAC consumes much less energy than 802.11-like protocol without sleeping
➢ At heavy load, idle listening rarely happens, energy savings from sleeping is very limited.
➢ At light load, periodic sleeping plays a key role
19
Dr. Francesco Restuccia, EECE 5155 Wireless Sensor Networks and the Internet of Things
19

Let’s think…
What are the pros and cons of S-MAC? How would you improve it?
Think-Pair-Share!
20
Dr. Francesco Restuccia, EECE 5155 Wireless Sensor Networks and the Internet of Things
20

S-MAC – Conclusions
➢ A mainly static network is assumed
➢ Trades off latency for reduced energy
consumption
➢ Redundant data is still sent with increased latency
➢ Increased collision rate due to sleep schedules
21
Dr. Francesco Restuccia, EECE 5155 Wireless Sensor Networks and the Internet of Things
21

EECE 5155 Wireless Sensor Networks
(and The Internet of Things)
Prof. Francesco Restuccia Email: f.restuccia@northeastern.edu Office: 318 Dana
February 18, 2021
22
Dr. Francesco Restuccia, EECE 5155 Wireless Sensor Networks and the Internet of Things
22

Contention-Based Mac Protocols: B-MAC
23
Dr. Francesco Restuccia, EECE 5698 Wireless Sensor Networks
23

B-MAC
J. Polastre, J. Hill, D. Culler, “Versatile Low Power Media Access for WSNs”, Proc. of ACM SenSys, Nov. 2004.
➢ What is B-MAC?
– A configurable MAC protocol for WSNs
– Small core and factoring out higher-level functionality
– An adaptive bidirectional interface for WSN applications
➢ It’s a traditional MAC protocol for WSNs
– Work reasonably well for a large set of traffic workloads
(applications)
– Create a flexible set of functionalities able to provide solutions to a set of goals
24
Dr. Francesco Restuccia, EECE 5698 Wireless Sensor Networks
24

B-MAC Goals
➢ Goals
– Low Power Operation
– Effective Collision Avoidance
– Simple Implementation, Small Code and RAM Size
– Efficient Channel Utilization
– Reconfigurable by Network Protocols
– Tolerant to Changing RF/Networking Conditions
– Scalable to Large Numbers of Nodes
25
Dr. Francesco Restuccia, EECE 5698 Wireless Sensor Networks
25

Classical vs. Minimalistic
➢ S-MAC
– A classical approach
– User pre-configures duty cycle
– Applications rely on S-MAC to adjust its operation as the environment evolves
➢ B-MAC
– A minimalistic approach
– Small core of medium access functionalities
– RTS/CTS, ACKs, etc. are considered higher layer functionalities (services)
– Uses Clear Channel Assessment (CCA) and packet backoffs for channel arbitration, link layer acknowledgments for reliability
– Uses Low Power Listening (LPL)
– More flexible and more tunable
26
Dr. Francesco Restuccia, EECE 5698 Wireless Sensor Networks
26

B-MAC: Principles
➢ Reconfigurable parameters:
– Backoff/Timeouts
– Duty Cycle
– OptionalACKs
➢ Flexible control
➢ Feedback to higher protocols
– Model of operation
– Upward costs (e.g., link quality)
➢ Minimal implementation
➢ Minimal state
Link/Network Protocols
Data Control
B-MAC
PHY
27
Dr. Francesco Restuccia, EECE 5698 Wireless Sensor Networks
27

B-MAC Tiny OS Interface
➢ Interfaces for flexible control of B-MAC by higher layer services
➢ Allow services to toggle CCA and ACKs, set backoffs on a per
message basis, and change the LPL mode for transmit and receive
28
Dr. Francesco Restuccia, EECE 5698 Wireless Sensor Networks
28

B-MAC Important Design Aspects
➢ Clear Channel Assessment (CCA)
➢ Low Power Listening (LPL)
➢ Packet backoffs
➢ Link layer acknowledgments
29
Dr. Francesco Restuccia, EECE 5698 Wireless Sensor Networks
29

Clear Channel Assessment (CCA)
➢ Effective collision avoidance
➢ Find out whether the channel is idle
– If too pessimistic: waste bandwidth
– If too optimistic: more collisions
➢ Key points:
– Ambient noise may change significantly depending on the environment
– Packet reception has fairly constant channel energy
– What is noise? What is signal?
➢ Automatic gain control in software to estimate the noise floor
30
Dr. Francesco Restuccia, EECE 5698 Wireless Sensor Networks
30

Noise Floor Estimation
➢ Take a number of received signal strength indicator (RSSI) samples when the channel is assumed to be free/idle
➢ RSSI samples are entered into a FIFO queue
➢ Median of the queue is added to an exponentially weighted moving
average with decay a
➢ Median is used as a simple low pass filter to add robustness to the
noise floor estimate
At = a * St + (1 – a) * St-1
where a is assumed to be 0.06 and FIFO queue size of 10
➢ Once a good estimate of the noise floor is established, a request to transmit a packet starts the process of monitoring the received signal from the radio
31
Dr. Francesco Restuccia, EECE 5698 Wireless Sensor Networks
31

Single-Sample Thresholding vs Outlier Detection
➢ Common approach: take single sample, compare to noise floor
– Large number of false negatives → lower effective channel BW
➢ B-MAC: search for outliers
– If a sample has significantly lower energy than the noise floor during the sampling period, then the channel is clear
If 5 samples are taken and no outlier is found, the channel is busy
32
Dr. Francesco Restuccia, EECE 5698 Wireless Sensor Networks
32

CCA vs. Threshold Techniques
Idle
Signal Strength Indicator (RSSI) from transceiver
● A packet arrives between 22 and 54ms. The middle graph shows the output of a thresholding CCA algorithm (1: channel clear, 0: channel busy)
● Bottom shows the output of an outlier detection algorithm
● Threshold: waste channel utilization
● CCA: Fully utilize the channel since a valid packet could have no outlier
significantly below the noise floor
33
Dr. Francesco Restuccia, EECE 5698 Wireless Sensor Networks
33

Clear Channel Assessment – Recap
➢ ➢

Before transmission – take samples of the channel
If five samples are taken, and no outlier found => channel busy, take a random backoff
Noise floor updated when the channel is known to be clear, i.e., just after packet transmission
34
Dr. Francesco Restuccia, EECE 5698 Wireless Sensor Networks
34

Low Power Listening (LPL)
➢ Periodic Channel Sampling
– Energy Cost = RX + TX + Listen
– Goal: minimize idle listening
➢ Periodically
– Wake up, sample channel, sleep
➢ Properties
– Wake-up time fixed
– “Check Time” between wakeups variable
– Preamble length matches wakeup interval
➢ Overhear all data packets
Mica 2 motes
– Duty cycle depends on number of neighbors and traffic
Node 1 Node 2
sleep
sleep
sleep
time
35
sleep
sleep
sleep time
TX [preamble]
RX
35
Dr. Francesco Restuccia, EECE 5698 Wireless Sensor Networks
wakeup
wakeup
packet packet wakeup
wakeup
wakeup
wakeup
wakeup

Low Power Listening (LPL) – 2
➢ Goal: Minimize “Listen Cost”
➢ Principles
Low Power Listening
– Node periodically wakes up, turns radio on and checks activity on the channel
– If energy/activity on the channel is detected, node powers up and stays awake for the time required to receive the incoming packet
➢ Node goes back to sleep
– If the complete packet is received
– After a timeout (if no packet received (a false positive))
➢ Preamble length matches channel checking period
– No explicit synchronization required
➢ Noise floor estimation used to detect channel activity during LPL
36
Dr. Francesco Restuccia, EECE 5698 Wireless Sensor Networks
36

Check Interval for Channel Activity
➢ To reliably receive data, the preamble length is matched to the interval that the channel is checked for activity
➢ If the channel is checked for 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
➢ Interval between LPL samples is maximized so that the time spent sampling the channel is minimized
– Transmit mode ~~ Preamble length
– Listening mode ~~ Check interval
37
Dr. Francesco Restuccia, EECE 5698 Wireless Sensor Networks
37

LPL Check Interval
➢ Sampling rate (traffic pattern) defines optimal check interval
➢ Check interval
– Too small: energy wasted on idle listening
– Too large: energy wasted on transmissions (long preambles)
➢ In general, it is better to have larger preambles than to check more often!
38
Dr. Francesco Restuccia, EECE 5698 Wireless Sensor Networks
38

S-MAC and B-MAC: Comparison
➢ Experimental Setup:
– n nodes send as quickly as possible to saturate the channel
– Shown: throughput as a function of the number of nodes
➢ B-MAC has about 4.5 time higher throughput than S-MAC-unicast
– Not as much when ACK or RTS/CTS is used
– Differences less pronounced as # of nodes increases
– B-MAC has CCA, thus it backs off less frequently
topology
39
Dr. Francesco Restuccia, EECE 5698 Wireless Sensor Networks
39

Throughput vs Power Consumption
ALWAYS ON
S-MAC B-MAC
Throughput (bits/s)
40
Dr. Francesco Restuccia, EECE 5698 Wireless Sensor Networks
40
Power Consumed (mJ/sec)

Tradeoffs: Latency vs Reliability
➢ Reliability
– 98.5% of all packets delivered
– Some nodes 100% delivery
➢ …but communication links are volatile
– Retransmissions required
– After 5 retries, give up and pick a new parent
➢ Actual latency
– Retransmission delay
– Contention delay (infrequent)
41
Dr. Francesco Restuccia, EECE 5698 Wireless Sensor Networks
41

Tradeoffs: Latency for Energy
S-MAC Default Configuration
➢ 10-hop network
➢ Source sends a 100-byte
packet every 10 seconds
➢ SMAC: 10% Duty Cycle BMAC: choose optimal check interval
➢ Poor SMAC again performs worse…
– Reason: sync packets, probability of multiple schedules—less time to sleep
B-MAC Default Configuration
42
Dr. Francesco Restuccia, EECE 5698 Wireless Sensor Networks
42

Latency
43
Dr. Francesco Restuccia, EECE 5698 Wireless Sensor Networks
43

Let’s think…
Can you compare S-MAC vs B-MAC?
Think-Pair-Share!
44
Dr. Francesco Restuccia, EECE 5155 Wireless Sensor Networks and the Internet of Things
44

ACK
Comparison of S-MAC and B-MAC
Collision avoidance
Message passing
Listen period
Listen interval
Schedule synchronization
Packet transmission
Code size
S-MAC
CSMA/CA
Yes
Yes
Pre-defined
Long
Required
Short preamble
6.3KB
B-MAC
CSMA
Optional
No
Pre-defined
Very short
Not required
Long preamble
4.4KB (LPL & ACK)
45
Dr. Francesco Restuccia, EECE 5698 Wireless Sensor Networks
45

EECE 5155 Wireless Sensor Networks
(and The Internet of Things)
Prof. Francesco Restuccia Email: f.restuccia@northeastern.edu Office: 318 Dana
February 22, 2021
46
Dr. Francesco Restuccia, EECE 5155 Wireless Sensor Networks and the Internet of Things
46

IEEE 802.15.4 MAC LEVEL
47
Dr. Francesco Restuccia, EECE 5698 Wireless Sensor Networks
47

05 2004
Content
➢ Overview
➢ Topologies
➢ Superframe structure ➢ Frame formatting
➢ Data service
➢ Management service ➢ Interframe spacing ➢ CSMA procedure
48
Dr. Francesco Restuccia, EECE 5698 Wireless Sensor Networks
48

802.15.4 Architecture
Upper Layers
IEEE 802.15.4 SSCS (Service Specific Convergence Sublayer)
IEEE
802.2
LLC, Type
I
IEEE 802.15.4 MAC
IEEE 802.15.4 PHY
IEEE 802.15.4 PHY
868/915 MHz
2400 MHz
49
Dr. Francesco Restuccia, EECE 5698 Wireless Sensor Networks
49

What IEEE 802.15.4 Aims at
➢ Extremely low cost
➢ Ease of installation
➢ Reliable data transfer ➢ Short range operation ➢ Reasonable battery life
50
Dr. Francesco Restuccia, EECE 5698 Wireless Sensor Networks
50

MAC Overview
➢ Star and peer-to-peer topologies
➢ Association
➢ CSMA-CA channel access mechanism ➢ Packet validation and message rejection ➢ Optional guaranteed time slots (GTS)
➢ Guaranteed packet delivery
➢ Facilitates low-power operation
➢ Security
51
Dr. Francesco Restuccia, EECE 5698 Wireless Sensor Networks
51

IEEE 802.15.4 Device Classes
➢ Full function device (FFD) – Any topology
– Capable to be a PAN coordinator – Talks to any other device
– Implements complete protocol set
➢ Reduced function device (RFD)
– Limited to star topology or end-device in a
peer-to-peer network.
– Cannot become a PAN coordinator
– Very simple implementation
– Reduced protocol set
52
Dr. Francesco Restuccia, EECE 5698 Wireless Sensor Networks
52

IEEE 802.15.4 Definitions
➢ Network Device: An RFD or FFD implementation containing an IEEE 802.15.4 medium access control and physical interface to the wireless medium.
➢ Coordinator: An FFD with network device functionality that provides coordination and other services to the network.
➢ PAN Coordinator: A coordinator that is the principal controller of the PAN. A network has exactly one PAN coordinator.
53
Dr. Francesco Restuccia, EECE 5698 Wireless Sensor Networks
53

Low-Power Operation
➢ Duty-cycle control using superframe structure
– Beacon order and superframe order
– Coordinator battery life extension
➢ Indirect data transmission
➢ Devices may sleep for extended period over multiple beacons
➢ Allows control of receiver state by higher layers
54
Dr. Francesco Restuccia, EECE 5698 Wireless Sensor Networks
54

Star Topology
PAN coordinator
Master/slave
FFD
RFD
Communications flow
55
Dr. Francesco Restuccia, EECE 5698 Wireless Sensor Networks
55

05 2004
Peer-Peer Topology
PAN coordinators
Point to point FFD
RFD
Cluster tree Communications flow
56
Dr. Francesco Restuccia, EECE 5698 Wireless Sensor Networks
56

Combined Topology
Clustered stars – for example, cluster nodes exist between rooms of a hotel and each room has a star network for control.
FFD
RFD
Communications flow
57
Dr. Francesco Restuccia, EECE 5698 Wireless Sensor Networks
57

Optional Frame Structure
Battery life extension
Con
tention Access Period
Contentio
n Fr
ee Period
Slot
15ms * 2n
Network beacon
Beacon extension period
Contention period
Guaranteed Time Slot
where 0 ≥ n ≥ 14 Max 24.576s!
Transmitted by PAN coordinator. Contains network information, frame structure and notification of pending node messages.
Space reserved for beacon growth due to pending node messages
Access by any node using CSMA-CA
Reserved for nodes requiring guaranteed bandwidth [n = 0].
58
Dr. Francesco Restuccia, EECE 5698 Wireless Sensor Networks
58

Optional Frame Structure
15ms * 2SO
Inactive Period
where 0 ≥ SO ≥ 14
15ms * 2BO
where SO ≥ BO ≥ 14
➢ Superframe may have optional inactive period (duty cycle)
SO = Superframe order BO = Beacon order
59
Dr. Francesco Restuccia, EECE 5698 Wireless Sensor Networks
59

General MAC Frame Format
Frame control field
60
Dr. Francesco Restuccia, EECE 5698 Wireless Sensor Networks
60

Beacon Frame Format
61
Dr. Francesco Restuccia, EECE 5698 Wireless Sensor Networks
61

MAC Command Frame
➢ Command Frame Types – Association request
– Association response
– Disassociation notification – Data request
– PAN ID conflict notification
● Orphan Notification
● Beacon request
● Coordinator realignment ● GTS request
62
Dr. Francesco Restuccia, EECE 5698 Wireless Sensor Networks
62

Data Frame Format
Acknowledgement Frame Format
63
Dr. Francesco Restuccia, EECE 5698 Wireless Sensor Networks
63

Data Service
➢ Data transfer to neighboring devices
– Acknowledged or unacknowledged
– Direct or indirect
– Using GTS service
➢ Maximum data length (MSDU) aMaxMACFrameSize (102 bytes)
64
Dr. Francesco Restuccia, EECE 5698 Wireless Sensor Networks
64

MAC Data Primitives
65
Dr. Francesco Restuccia, EECE 5698 Wireless Sensor Networks
65

Data Transfer
Message Sequence Diagram
66
Dr. Francesco Restuccia, EECE 5698 Wireless Sensor Networks
66

Indirect Data Transfer Message Sequence Diagram
67
Dr. Francesco Restuccia, EECE 5698 Wireless Sensor Networks
67

Management Service
➢ Association / disassociation ➢ GTS allocation
➢ Message pending
➢ Node notification
➢ Network scanning/start
➢ Network synchronization/search
68
Dr. Francesco Restuccia, EECE 5698 Wireless Sensor Networks
68

MAC Management Primitives
69
Dr. Francesco Restuccia, EECE 5698 Wireless Sensor Networks
69

Association Message Sequence Diagram
70
Dr. Francesco Restuccia, EECE 5698 Wireless Sensor Networks
70

Disassociation Message Sequence Diagram
71
Dr. Francesco Restuccia, EECE 5698 Wireless Sensor Networks
71

Data Polling Message Sequence Chart
No data pending at the coordinator
72
Dr. Francesco Restuccia, EECE 5698 Wireless Sensor Networks
72

Data Polling Message Sequence Chart
Data pending at the coordinator
73
Dr. Francesco Restuccia, EECE 5698 Wireless Sensor Networks
73

Passive Scan
74
Dr. Francesco Restuccia, EECE 5698 Wireless Sensor Networks
74

Active Scan
75
Dr. Francesco Restuccia, EECE 5698 Wireless Sensor Networks
75

Orphaning Message Sequence Diagram
76
Dr. Francesco Restuccia, EECE 5698 Wireless Sensor Networks
76

Slotted CSMA Procedure
Used in beacon enabled networks.
1
77
Dr. Francesco Restuccia, EECE 5698 Wireless Sensor Networks
77

Un-slotted CSMA Procedure
TO BE EVALUATED IN HOMEWORK 1 !!!!
Used in non-beacon networks.
78
Dr. Francesco Restuccia, EECE 5698 Wireless Sensor Networks
78